Package java.util.concurrent.locks

Examples of java.util.concurrent.locks.ReadWriteLock.writeLock()

180
181
182
183
184
185
186
187
188
189
190
      return;
    }

    ReadWriteLock lock = getLock( oldDelegate );

    lock.writeLock().lock();
    try {
      //Notify the listeners about removal of all elements
      for ( ElementsListener<? super T> listener : listeners ) {
        listener.elementsDeleted( new ElementsChangedEvent<T>( oldDelegate, oldDelegate.getElements(), 0, oldDelegate.getElements().size() - 1 ) );
      }
View Full Code Here
188
189
190
191
192
193
194
195
196
197
198
      for ( ElementsListener<? super T> listener : listeners ) {
        listener.elementsDeleted( new ElementsChangedEvent<T>( oldDelegate, oldDelegate.getElements(), 0, oldDelegate.getElements().size() - 1 ) );
      }
      oldDelegate.removeElementListener( delegatingListener );
    } finally {
      lock.writeLock().unlock();
    }
  }

  /**
   * {@inheritDoc}
 
View Full Code Here
484
485
486
487
488
489
490
491
492
493
494
    reportedStatus = new TaskAttemptStatus();
    initTaskAttemptStatus(reportedStatus);

    ReadWriteLock readWriteLock = new ReentrantReadWriteLock();
    readLock = readWriteLock.readLock();
    writeLock = readWriteLock.writeLock();

    this.credentials = credentials;
    this.jobToken = jobToken;
    this.eventHandler = eventHandler;
    this.committer = committer;
View Full Code Here
72
73
74
75
76
77
78
79
80
81
82
  private final SearchFactoryImplementor searchFactoryImplementor;

  public StatisticsImpl(SearchFactoryImplementor searchFactoryImplementor) {
    ReadWriteLock lock = new ReentrantReadWriteLock();
    readLock = lock.readLock();
    writeLock = lock.writeLock();

    this.searchFactoryImplementor = searchFactoryImplementor;
  }

  public void clear() {
View Full Code Here
163
164
165
166
167
168
169
170
171
172
173
     */
    pset = new TreeMap<String,Integer>();

    ReadWriteLock rwl = new ReentrantReadWriteLock();
    iwAccess = rwl.readLock();
    iwCommit = rwl.writeLock();

    tracker = new CommitTracker();
  }

  // must only be called when iwCommit lock held
View Full Code Here
103
104
105
106
107
108
109
110
111
112
113
   * @param key The key to lock
   * @param timeout in milliseconds; -1 means wait indefinitely, 0 means no wait.
   */
  public void writeLock(EntityKey key, int timeout) {
    ReadWriteLock lock = getLock( key );
    Lock writeLock = lock.writeLock();
    acquireLock( key, timeout, writeLock );
  }

  /**
   * Acquires a read lock on a specific key.
View Full Code Here
38
39
40
41
42
43
44
45
46
47
48
  LockMessageDispatcher(ConcurrentMessageHandler concurrentMessageHandler){
    super(concurrentMessageHandler);

    ReadWriteLock waitingReadWriteLock = new ReentrantReadWriteLock();
    waitingReadLock = waitingReadWriteLock.readLock();
    waitingWriteLock = waitingReadWriteLock.writeLock();
  }

  /**
   * A RejectedExecutionException could be thrown in case there too many requests.
   */
 
View Full Code Here
72
73
74
75
76
77
78
79
80
81
82
   * @param key The key to lock
   * @param timeout in milliseconds; -1 means wait indefinitely, 0 means no wait.
   */
  public void writeLock(EntityKey key, int timeout) {
    ReadWriteLock lock = getLock( key );
    Lock writeLock = lock.writeLock();
    acquireLock( key, timeout, writeLock );
  }

  /**
   * Acquires a read lock on a specific key.
View Full Code Here
38
39
40
41
42
43
44
45
46
47
48
  public LockMessageDispatcher(ConcurrentMessageHandler concurrentMessageHandler){
    super(concurrentMessageHandler);

    ReadWriteLock waitingReadWriteLock = new ReentrantReadWriteLock();
    waitingReadLock = waitingReadWriteLock.readLock();
    waitingWriteLock = waitingReadWriteLock.writeLock();
  }

  /**
   * A RejectedExecutionException could be thrown in case there too many requests.
   */
 
View Full Code Here
66
67
68
69
70
71
72
73
74
75
76
    sfg = new DirectedMultigraph<>(Eventable.class);
    stateById = Maps.newConcurrentMap();
    LOG.debug("Initialized the stateflowgraph");
    ReadWriteLock lock = new ReentrantReadWriteLock();
    readLock = lock.readLock();
    writeLock = lock.writeLock();
  }

  /**
   * Adds a state (as a vertix) to the State-Flow Graph if not already present. More formally,
   * adds the specified vertex, v, to this graph if this graph contains no vertex u such that
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
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.