⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 reentrantreadwritelock.java

📁 java1.6众多例子参考
💻 JAVA
📖 第 1 页 / 共 4 页
字号:
         * has also acquired read locks, since other threads that         * could unblock it will not be able to acquire the write         * lock.)         *         * <li>When the condition {@linkplain Condition#await() waiting}         * methods are called the write lock is released and, before         * they return, the write lock is reacquired and the lock hold         * count restored to what it was when the method was called.         *         * <li>If a thread is {@linkplain Thread#interrupt interrupted} while         * waiting then the wait will terminate, an {@link         * InterruptedException} will be thrown, and the thread's         * interrupted status will be cleared.         *         * <li> Waiting threads are signalled in FIFO order.         *         * <li>The ordering of lock reacquisition for threads returning         * from waiting methods is the same as for threads initially         * acquiring the lock, which is in the default case not specified,         * but for <em>fair</em> locks favors those threads that have been         * waiting the longest.         *         * </ul>         *         * @return the Condition object         */        public Condition newCondition() {            return sync.newCondition();        }        /**         * Returns a string identifying this lock, as well as its lock         * state.  The state, in brackets includes either the String         * {@code "Unlocked"} or the String {@code "Locked by"}         * followed by the {@linkplain Thread#getName name} of the owning thread.         *         * @return a string identifying this lock, as well as its lock state         */        public String toString() {            Thread o = sync.getOwner();            return super.toString() + ((o == null) ?                                       "[Unlocked]" :                                       "[Locked by thread " + o.getName() + "]");        }	/**	 * Queries if this write lock is held by the current thread.	 * Identical in effect to {@link	 * ReentrantReadWriteLock#isWriteLockedByCurrentThread}.	 *	 * @return {@code true} if the current thread holds this lock and	 *	   {@code false} otherwise	 * @since 1.6	 */	public boolean isHeldByCurrentThread() {	    return sync.isHeldExclusively();	}	/**	 * Queries the number of holds on this write lock by the current	 * thread.  A thread has a hold on a lock for each lock action	 * that is not matched by an unlock action.  Identical in effect	 * to {@link ReentrantReadWriteLock#getWriteHoldCount}.	 *	 * @return the number of holds on this lock by the current thread,	 *	   or zero if this lock is not held by the current thread	 * @since 1.6	 */	public int getHoldCount() {	    return sync.getWriteHoldCount();	}    }    // Instrumentation and status    /**     * Returns {@code true} if this lock has fairness set true.     *     * @return {@code true} if this lock has fairness set true     */    public final boolean isFair() {        return sync instanceof FairSync;    }    /**     * Returns the thread that currently owns the write lock, or     * {@code null} if not owned. When this method is called by a     * thread that is not the owner, the return value reflects a     * best-effort approximation of current lock status. For example,     * the owner may be momentarily {@code null} even if there are     * threads trying to acquire the lock but have not yet done so.     * This method is designed to facilitate construction of     * subclasses that provide more extensive lock monitoring     * facilities.     *     * @return the owner, or {@code null} if not owned     */    protected Thread getOwner() {        return sync.getOwner();    }    /**     * Queries the number of read locks held for this lock. This     * method is designed for use in monitoring system state, not for     * synchronization control.     * @return the number of read locks held.     */    public int getReadLockCount() {        return sync.getReadLockCount();    }    /**     * Queries if the write lock is held by any thread. This method is     * designed for use in monitoring system state, not for     * synchronization control.     *     * @return {@code true} if any thread holds the write lock and     *         {@code false} otherwise     */    public boolean isWriteLocked() {        return sync.isWriteLocked();    }    /**     * Queries if the write lock is held by the current thread.     *     * @return {@code true} if the current thread holds the write lock and     *         {@code false} otherwise     */    public boolean isWriteLockedByCurrentThread() {        return sync.isHeldExclusively();    }    /**     * Queries the number of reentrant write holds on this lock by the     * current thread.  A writer thread has a hold on a lock for     * each lock action that is not matched by an unlock action.     *     * @return the number of holds on the write lock by the current thread,     *         or zero if the write lock is not held by the current thread     */    public int getWriteHoldCount() {        return sync.getWriteHoldCount();    }    /**     * Queries the number of reentrant read holds on this lock by the     * current thread.  A reader thread has a hold on a lock for     * each lock action that is not matched by an unlock action.     *     * @return the number of holds on the read lock by the current thread,     *         or zero if the read lock is not held by the current thread     * @since 1.6     */    public int getReadHoldCount() {        return sync.getReadHoldCount();    }    /**     * Returns a collection containing threads that may be waiting to     * acquire the write lock.  Because the actual set of threads may     * change dynamically while constructing this result, the returned     * collection is only a best-effort estimate.  The elements of the     * returned collection are in no particular order.  This method is     * designed to facilitate construction of subclasses that provide     * more extensive lock monitoring facilities.     *     * @return the collection of threads     */    protected Collection<Thread> getQueuedWriterThreads() {        return sync.getExclusiveQueuedThreads();    }    /**     * Returns a collection containing threads that may be waiting to     * acquire the read lock.  Because the actual set of threads may     * change dynamically while constructing this result, the returned     * collection is only a best-effort estimate.  The elements of the     * returned collection are in no particular order.  This method is     * designed to facilitate construction of subclasses that provide     * more extensive lock monitoring facilities.     *     * @return the collection of threads     */    protected Collection<Thread> getQueuedReaderThreads() {        return sync.getSharedQueuedThreads();    }    /**     * Queries whether any threads are waiting to acquire the read or     * write lock. Note that because cancellations may occur at any     * time, a {@code true} return does not guarantee that any other     * thread will ever acquire a lock.  This method is designed     * primarily for use in monitoring of the system state.     *     * @return {@code true} if there may be other threads waiting to     *         acquire the lock     */    public final boolean hasQueuedThreads() {        return sync.hasQueuedThreads();    }    /**     * Queries whether the given thread is waiting to acquire either     * the read or write lock. Note that because cancellations may     * occur at any time, a {@code true} return does not guarantee     * that this thread will ever acquire a lock.  This method is     * designed primarily for use in monitoring of the system state.     *     * @param thread the thread     * @return {@code true} if the given thread is queued waiting for this lock     * @throws NullPointerException if the thread is null     */    public final boolean hasQueuedThread(Thread thread) {        return sync.isQueued(thread);    }    /**     * Returns an estimate of the number of threads waiting to acquire     * either the read or write lock.  The value is only an estimate     * because the number of threads may change dynamically while this     * method traverses internal data structures.  This method is     * designed for use in monitoring of the system state, not for     * synchronization control.     *     * @return the estimated number of threads waiting for this lock     */    public final int getQueueLength() {        return sync.getQueueLength();    }    /**     * Returns a collection containing threads that may be waiting to     * acquire either the read or write lock.  Because the actual set     * of threads may change dynamically while constructing this     * result, the returned collection is only a best-effort estimate.     * The elements of the returned collection are in no particular     * order.  This method is designed to facilitate construction of     * subclasses that provide more extensive monitoring facilities.     *     * @return the collection of threads     */    protected Collection<Thread> getQueuedThreads() {        return sync.getQueuedThreads();    }    /**     * Queries whether any threads are waiting on the given condition     * associated with the write lock. Note that because timeouts and     * interrupts may occur at any time, a {@code true} return does     * not guarantee that a future {@code signal} will awaken any     * threads.  This method is designed primarily for use in     * monitoring of the system state.     *     * @param condition the condition     * @return {@code true} if there are any waiting threads     * @throws IllegalMonitorStateException if this lock is not held     * @throws IllegalArgumentException if the given condition is     *         not associated with this lock     * @throws NullPointerException if the condition is null     */    public boolean hasWaiters(Condition condition) {        if (condition == null)            throw new NullPointerException();        if (!(condition instanceof AbstractQueuedSynchronizer.ConditionObject))            throw new IllegalArgumentException("not owner");        return sync.hasWaiters((AbstractQueuedSynchronizer.ConditionObject)condition);    }    /**     * Returns an estimate of the number of threads waiting on the     * given condition associated with the write lock. Note that because     * timeouts and interrupts may occur at any time, the estimate     * serves only as an upper bound on the actual number of waiters.     * This method is designed for use in monitoring of the system     * state, not for synchronization control.     *     * @param condition the condition     * @return the estimated number of waiting threads     * @throws IllegalMonitorStateException if this lock is not held     * @throws IllegalArgumentException if the given condition is     *         not associated with this lock     * @throws NullPointerException if the condition is null     */    public int getWaitQueueLength(Condition condition) {        if (condition == null)            throw new NullPointerException();        if (!(condition instanceof AbstractQueuedSynchronizer.ConditionObject))            throw new IllegalArgumentException("not owner");        return sync.getWaitQueueLength((AbstractQueuedSynchronizer.ConditionObject)condition);    }    /**     * Returns a collection containing those threads that may be     * waiting on the given condition associated with the write lock.     * Because the actual set of threads may change dynamically while     * constructing this result, the returned collection is only a     * best-effort estimate. The elements of the returned collection     * are in no particular order.  This method is designed to     * facilitate construction of subclasses that provide more     * extensive condition monitoring facilities.     *     * @param condition the condition     * @return the collection of threads     * @throws IllegalMonitorStateException if this lock is not held     * @throws IllegalArgumentException if the given condition is     *         not associated with this lock     * @throws NullPointerException if the condition is null     */    protected Collection<Thread> getWaitingThreads(Condition condition) {        if (condition == null)            throw new NullPointerException();        if (!(condition instanceof AbstractQueuedSynchronizer.ConditionObject))            throw new IllegalArgumentException("not owner");        return sync.getWaitingThreads((AbstractQueuedSynchronizer.ConditionObject)condition);    }    /**     * Returns a string identifying this lock, as well as its lock state.     * The state, in brackets, includes the String {@code "Write locks ="}     * followed by the number of reentrantly held write locks, and the     * String {@code "Read locks ="} followed by the number of held     * read locks.     *     * @return a string identifying this lock, as well as its lock state     */    public String toString() {        int c = sync.getCount();        int w = Sync.exclusiveCount(c);        int r = Sync.sharedCount(c);        return super.toString() +            "[Write locks = " + w + ", Read locks = " + r + "]";    }}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -