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.AtomicBoolean.compareAndSet()

  boolean wasOpenedHandlerCalled(HRegionInfo hri) {
    AtomicBoolean b = openedRegionHandlerCalled.get(hri);
    //compareAndSet to be sure that unit tests don't see stale values. Means,
    //we will return true exactly once unless the handler code resets to true
    //this value.
    return b == null ? false : b.compareAndSet(true, false);
  }


  //For unit tests only
  void initializeHandlerTrackers() {
    closedRegionHandlerCalled = new HashMap<HRegionInfo, AtomicBoolean>();

View Full Code Here

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

            ConnectionStateListener listener = new ConnectionStateListener()
            {
                @Override
                public void stateChanged(CuratorFramework client, ConnectionState newState)
                {
                    if ( firstListenerAction.compareAndSet(true, false) )
                    {
                        firstListenerState.set(newState);
                        System.out.println("First listener state is " + newState);
                    }
                    if ( newState == ConnectionState.CONNECTED )

View Full Code Here

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

                        LeaderLatch latch = new LeaderLatch(client, PATH_NAME);
                        try
                        {
                            latch.start();
                            Assert.assertTrue(latch.await(timing.forWaiting().seconds(), TimeUnit.SECONDS));
                            Assert.assertTrue(thereIsALeader.compareAndSet(false, true));
                            Thread.sleep((int)(10 * Math.random()));
                            thereIsALeader.set(false);
                        }
                        finally
                        {

View Full Code Here

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

        if(!added && !win.hasMessagesToRemove()) { // no ack if we didn't add the msg (e.g. duplicate)
            return true; // ack the message, because this will stop retransmissions (which are unreliable) !
        }


        final AtomicBoolean processing=win.getProcessing();
        if(!processing.compareAndSet(false, true)) {
            return true;
        }


        // Try to remove (from the AckReceiverWindow) as many messages as possible as pass them up
        Message  m;

View Full Code Here

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

        // Efficient way of checking whether another thread is already processing messages from 'sender'.
        // If that's the case, we return immediately and let the exiting thread process our message
        // (https://jira.jboss.org/jira/browse/JGRP-829). Benefit: fewer threads blocked on the same lock, these threads
        // can be returned to the thread pool
        final AtomicBoolean processing=win.getProcessing();
        if(!processing.compareAndSet(false, true)) {
            return;
        }


        // Prevents concurrent passing up of messages by different threads (http://jira.jboss.com/jira/browse/JGRP-198);
        // this is all the more important once we have a threadless stack (http://jira.jboss.com/jira/browse/JGRP-181),

View Full Code Here

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

        final AtomicBoolean ok = new AtomicBoolean(true);
        final Callback<Object> callback = new Callback<Object>() {
            @Override
            public void notify(Object object) {
                if (Boolean.FALSE.equals(object)) {
                    ok.compareAndSet(true, false);
                } else if (object instanceof Throwable) {
                    ok.compareAndSet(true, false);
                }
                s.release();
            }

View Full Code Here

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

            @Override
            public void notify(Object object) {
                if (Boolean.FALSE.equals(object)) {
                    ok.compareAndSet(true, false);
                } else if (object instanceof Throwable) {
                    ok.compareAndSet(true, false);
                }
                s.release();
            }
        };
        int notOwnedCount = 0;

View Full Code Here

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

      if (listeners.get() != null)
      {
         for (RegistrationDestructionListener listener : listeners.get())
         {
            RegistrationDestructionListener.Vote vote = listener.destructionScheduledFor(registration);
            if (canRemove.compareAndSet(false, vote.result))
            {
               throw new RegistrationException("Could not remove Registration '" + registration.getRegistrationHandle()
                  + "' because listener '" + listener + "' vetoed removal. Cause: " + vote.reason);
            }
         }

View Full Code Here

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


                completion.submit(new Callable<Exchange>() {
                    public Exchange call() throws Exception {
                        // only start the aggregation task when the task is being executed to avoid staring
                        // the aggregation task to early and pile up too many threads
                        if (aggregationTaskSubmitted.compareAndSet(false, true)) {
                            // but only submit the task once
                            aggregateExecutorService.submit(aggregateOnTheFlyTask);
                        }


                        if (!running.get()) {

View Full Code Here

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

                                                       .setConnectionWatcher(new Watcher() {
            @Override
            public void process(WatchedEvent event) {
              if (event.getState() == Event.KeeperState.Expired) {
                expired.set(true);
              } else if (event.getState() == Event.KeeperState.SyncConnected && expired.compareAndSet(true, true)) {
                expireReconnectLatch.countDown();
              }
            }
          }).build()));
      client.startAndWait();

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.