Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 6 of 6 for reentrant (0.17 sec)

  1. android/guava/src/com/google/common/util/concurrent/ExecutionSequencer.java

            if (submittingTaskQueue.thread == submitting) {
              sequencer = null;
              // Submit from inside a reentrant submit. We don't know if this one will be reentrant (and
              // can't know without submitting something to the executor) so queue to run iteratively.
              // Task must be null, since each execution on this executor can only produce one more
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Thu Feb 01 21:46:34 GMT 2024
    - 22.1K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/util/concurrent/Monitor.java

                      (startTime == 0L) ? timeoutNanos : remainingNanos(startTime, timeoutNanos),
                      reentrant);
          threw = false;
          return satisfied;
        } finally {
          if (!satisfied) {
            try {
              // Don't need to signal if timed out, but do if interrupted
              if (threw && !reentrant) {
                signalNextWaiter();
              }
            } finally {
              lock.unlock();
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Mon Dec 04 18:22:01 GMT 2023
    - 38.6K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java

       *
       * lockA.lock();
       *
       * lockB.lock();  // will throw an IllegalStateException
       * lockC.lock();  // will throw an IllegalStateException
       *
       * lockA.lock();  // reentrant acquisition is okay
       * }</pre>
       *
       * <p>It is the responsibility of the application to ensure that multiple lock instances with the
       * same rank are never acquired in the same thread.
       *
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Fri Dec 15 19:31:54 GMT 2023
    - 35.9K bytes
    - Viewed (0)
  4. guava-tests/test/com/google/common/util/concurrent/ExecutionSequencerTest.java

                },
                directExecutor()));
        thingToCancel[0] = serializer.submit(Callables.returning(null), directExecutor());
        results.add(thingToCancel[0]);
        // Enqueue more than enough tasks to force reentrancy.
        for (int i = 0; i < 5; i++) {
          results.add(serializer.submit(Callables.returning(null), directExecutor()));
        }
    
        manualExecutorTask[0].run();
    
        for (Future<?> result : results) {
    Java
    - Registered: Fri Apr 12 12:43:09 GMT 2024
    - Last Modified: Tue Feb 13 14:28:25 GMT 2024
    - 16.8K bytes
    - Viewed (0)
  5. android/guava-tests/test/com/google/common/util/concurrent/ExecutionSequencerTest.java

                },
                directExecutor()));
        thingToCancel[0] = serializer.submit(Callables.returning(null), directExecutor());
        results.add(thingToCancel[0]);
        // Enqueue more than enough tasks to force reentrancy.
        for (int i = 0; i < 5; i++) {
          results.add(serializer.submit(Callables.returning(null), directExecutor()));
        }
    
        manualExecutorTask[0].run();
    
        for (Future<?> result : results) {
    Java
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Tue Feb 13 14:28:25 GMT 2024
    - 16.8K bytes
    - Viewed (0)
  6. okhttp/src/main/kotlin/okhttp3/EventListener.kt

     *
     * Events and sequences of events may be repeated for retries and follow-ups.
     *
     * All event methods must execute fast, without external locking, cannot throw exceptions, attempt
     * to mutate the event parameters, or be re-entrant back into the client. Any IO - writing to files
     * or network should be done asynchronously.
     */
    abstract class EventListener {
      /**
    Plain Text
    - Registered: Fri May 03 11:42:14 GMT 2024
    - Last Modified: Mon Jan 08 01:13:22 GMT 2024
    - 15.2K bytes
    - Viewed (0)
Back to top