List of compareAndSet() Examples

Examples of compareAndSet()

com.hazelcast.concurrent.atomiclong.LongWrapper.compareAndSet()
com.hazelcast.concurrent.atomicreference.ReferenceWrapper.compareAndSet()
com.hazelcast.core.IAtomicLong.compareAndSet()
Atomically sets the value to the given updated value only if the current value {@code ==} the expected value. @param expect the expected value @param update the new value @return true if successful; or false if the actual valuewas not equal to the expected value.
io.vertx.core.shareddata.Counter.compareAndSet()
java.util.concurrent.atomic.AtomicBoolean.compareAndSet()
Atomically sets the value to the given updated value if the current value {@code ==} the expected value. @param expect the expected value @param update the new value @return {@code true} if successful. False return indicates thatthe actual value was not equal to the expected value.
java.util.concurrent.atomic.AtomicInteger.compareAndSet()
java.util.concurrent.atomic.AtomicLong.compareAndSet()
java.util.concurrent.atomic.AtomicLongArray.compareAndSet()
Atomically sets the element at position {@code i} to the givenupdated value if the current value {@code ==} the expected value. @param i the index @param expect the expected value @param update the new value @return {@code true} if successful. False return indicates thatthe actual value was not equal to the expected value.
java.util.concurrent.atomic.AtomicReference.compareAndSet()
Atomically sets the value to the given updated value if the current value {@code ==} the expected value. @param expect the expected value @param update the new value @return {@code true} if successful. False return indicates thatthe actual value was not equal to the expected value.
java.util.concurrent.atomic.AtomicReferenceArray.compareAndSet()
Atomically sets the element at position {@code i} to the givenupdated value if the current value {@code ==} the expected value. @param i the index @param expect the expected value @param update the new value @return {@code true} if successful. False return indicates thatthe actual value was not equal to the expected value.
org.hbase.async.HBaseClient.compareAndSet()
Atomic Compare-And-Set (CAS) on a single cell.
Note that edits sent through this method cannot be batched, and won't be subject to the {@link #setFlushInterval flush interval}. This entails that write throughput will be lower with this method as edits have to be sent out to the wire one by one.
This request enables you to atomically update the value of an existing cell in HBase using a CAS operation. It's like a {@link PutRequest}except that you also pass an expected value. If the last version of the cell identified by your {@code PutRequest} matches the expected value,HBase will atomically update it to the new value.
If the expected value is the empty byte array, HBase will atomically create the cell provided that it doesn't exist already. This can be used to ensure that your RPC doesn't overwrite an existing value. Note however that this trick cannot be used the other way around to delete an expected value atomically. @param edit The new value to write. @param expected The expected value of the cell to compare against.This byte array will NOT be copied. @return A deferred boolean, if {@code true} the CAS succeeded, otherwisethe CAS failed because the value in HBase didn't match the expected value of the CAS request. @since 1.3
org.jgroups.blocks.atomic.Counter.compareAndSet()
Atomically updates the counter using a CAS operation @param expect The expected value of the counter @param update The new value of the counter @return True if the counter could be updated, false otherwise
xbird.util.concurrent.counter.UnsafeIntCounter.compareAndSet()

Examples of java.util.concurrent.atomic.AtomicLong.compareAndSet()

            long oldseed, nextseed;
            AtomicLong seed = this.seed;
            do {
                oldseed = seed.get();
                nextseed = (oldseed * multiplier + addend) & mask;
            } while (!seed.compareAndSet(oldseed, nextseed));
            return (int) (nextseed >>> (48 - bits));
        }


        public boolean nextBoolean() {
            return next(1) != 0;

View Full Code Here

Examples of java.util.concurrent.atomic.AtomicLong.compareAndSet()

        long oldseed, nextseed;
        AtomicLong seed = this.seed;
        do {
            oldseed = seed.get();
            nextseed = (oldseed * multiplier + addend) & mask;
        } while (!seed.compareAndSet(oldseed, nextseed));
        return (int) (nextseed >>> (48 - bits));
    }


    public boolean nextBoolean() {
        return next(1) != 0;

View Full Code Here

Examples of java.util.concurrent.atomic.AtomicLongArray.compareAndSet()

            // determine what the new long value will be after we set the appropriate bit.
            long currentLongValue = segment.get(longPosition);
            long newLongValue = currentLongValue | mask;


            // if no other thread has modified the value since we read it, we won the race and we are done.
            if(segment.compareAndSet(longPosition, currentLongValue, newLongValue))
                break;
        }
    }


    public boolean get(int position) {

View Full Code Here

Examples of java.util.concurrent.atomic.AtomicReference.compareAndSet()

                    } catch (InterruptedException ex) {
                        error.set(ex);
                    }
                } catch (Exception ex) {
                    ex.printStackTrace();
                    error.compareAndSet(null, ex);
                } finally {
                    commitLatch.countDown();
                }
            }

View Full Code Here

Examples of java.util.concurrent.atomic.AtomicReferenceArray.compareAndSet()

        {
            Object candidate = e.getKey();
            if (candidate.equals(key))
            {
                Entry<K, V> replacement = this.createReplacementChainForRemoval((Entry<K, V>) o, e);
                if (currentArray.compareAndSet(index, o, replacement))
                {
                    this.addToSize(-1);
                    return e.getValue();
                }
                return this.slowRemove(key, hash, currentArray);

View Full Code Here

Examples of org.hbase.async.HBaseClient.compareAndSet()

    // Watch this! ______,^ I'm writing C++ in Java!


    when(client_b.atomicIncrement(incrementForRow(MAXID)))
      .thenReturn(Deferred.fromResult(5L));


    when(client_b.compareAndSet(anyPut(), emptyArray()))
      .thenReturn(Deferred.fromResult(true))
      .thenReturn(Deferred.fromResult(true));


    // Now that B is finished, A proceeds and allocates a UID that will be
    // wasted, and creates the reverse mapping, but fails at creating the

View Full Code Here

Examples of org.jgroups.blocks.atomic.Counter.compareAndSet()

                        System.out.println("counter: " + val);
                        break;
                    case '3':
                        long expect=Util.readLongFromStdin("expected value: ");
                        long update=Util.readLongFromStdin("update: ");
                        if(counter.compareAndSet(expect, update)) {
                            System.out.println("-- set counter \"" + counter.getName() + "\" to " + update + "\n");
                        }
                        else {
                            System.err.println("failed setting counter \"" + counter.getName() + "\" from " + expect +
                                                 " to " + update + ", current value is " + counter.get() + "\n");

View Full Code Here

Examples of xbird.util.concurrent.counter.UnsafeIntCounter.compareAndSet()

        do {
            capa = pinning.get();
            if(capa == -1) {// does not pin when the entry is evicted
                return false;
            }
        } while(!pinning.compareAndSet(capa, capa + 1));
        return true;
    }


    public final void unpin() {
        _pinning.decrementAndGet();

View Full Code Here

0 1 2 3 4 5

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.