BufferCache.releaseBuffer(buffer);
                        successCount.incrementAndGet();
                    }
                } catch (Exception e) {
                    synchronized (exceptions) {
                        exceptions.add(e);
                    }
                } finally {
                    endLatch.countDown();
                }
            });
        }

 *   // do other things since the monitor was not available
 * }
 * }
 *
 * <h2>Comparison with {@code synchronized} and {@code ReentrantLock}</h2>
 *
 * <p>The following examples show a simple threadsafe holder expressed using {@code synchronized},
 * {@link ReentrantLock}, and {@code Monitor}.
 *
 * <h3>{@code synchronized}</h3>
 *
 * <p>This version is the fewest lines of code, largely because the synchronization mechanism used

    private static class IOExceptionOccurProperties extends Properties {

        /**
         *
         */
        private static final long serialVersionUID = 1L;

        @Override
        public synchronized void load(final InputStream inStream) throws IOException {
            throw new IOException("load");
        }

    }

    /**
     * {@link org.codelibs.core.io.PropertiesUtil#load(Properties, String)}

        // When - Release session to trigger cleanup
        session.release();

        // Then - Trees should be cleared (we can't directly verify as it's internal,
        // but the cleanup code with synchronized block ensures it happens atomically)
        // The important part is that no exception occurs and the operation is atomic
    }

    /**
     * Test concurrent acquire and release operations.
     */

 * strategies.
 *
 * <ul>
 *   <li>SafeAtomicHelper: uses Atomic FieldsUpdaters to implement synchronization
 *   <li>SynchronizedHelper: uses {@code synchronized} blocks for synchronization
 * </ul>
 *
 * To force selection of our fallback strategies we load {@link AggregateFutureState} (and all of

         *
         * @param newState new lease state
         */
        public synchronized void updateState(int newState) {
            this.leaseState = newState;
            this.lastAccessTime = System.currentTimeMillis();
        }

        /**
         * Increment the epoch value
         */
        public synchronized void incrementEpoch() {
            this.epoch++;
        }

        /**

                synchronized (result) {
                    result.addMissingArtifact(artifact);
                }
            } catch (ArtifactResolutionException e) {
                // This is really a wagon TransferFailedException so something went wrong after we successfully
                // retrieved the metadata.

                synchronized (result) {

        final int[] callCount = { 0 };

        SearchLogHelper mockSearchLogHelper = new SearchLogHelper() {
            @Override
            public void storeSearchLog() {
                synchronized (lock) {
                    callCount[0]++;
                    if (callCount[0] % 2 == 0) {
                        throw new RuntimeException("Even call error");
                    }

 * strategies.
 *
 * <ul>
 *   <li>SafeAtomicHelper: uses Atomic FieldsUpdaters to implement synchronization
 *   <li>SynchronizedHelper: uses {@code synchronized} blocks for synchronization
 * </ul>
 *
 * To force selection of our fallback strategies we load {@link AggregateFutureState} (and all of

                            List<Map<String, Object>> results =
                                    processor.search("*", new TestSearchRequestParams(0, 10, 0), OptionalThing.empty());
                            synchronized (allResults) {
                                allResults.add(results);
                            }
                        } catch (InterruptedException e) {