Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 809 for fair (0.11 sec)

  1. guava-tests/test/com/google/common/util/concurrent/GeneratedMonitorTest.java

      private static void addTests(TestSuite suite, Method method) {
        if (isGuarded(method)) {
          for (boolean fair1 : new boolean[] {true, false}) {
            for (boolean fair2 : new boolean[] {true, false}) {
              suite.addTest(generateGuardWithWrongMonitorTestCase(method, fair1, fair2));
            }
          }
        }
        if (isAnyEnter(method)) {
          addTests(
              suite,
              method,
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jul 23 14:18:12 UTC 2024
    - 27.1K bytes
    - Viewed (0)
  2. android/guava-tests/test/com/google/common/util/concurrent/GeneratedMonitorTest.java

      private static void addTests(TestSuite suite, Method method) {
        if (isGuarded(method)) {
          for (boolean fair1 : new boolean[] {true, false}) {
            for (boolean fair2 : new boolean[] {true, false}) {
              suite.addTest(generateGuardWithWrongMonitorTestCase(method, fair1, fair2));
            }
          }
        }
        if (isAnyEnter(method)) {
          addTests(
              suite,
              method,
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:51:36 UTC 2024
    - 27.1K bytes
    - Viewed (0)
  3. guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java

       */
      public ReentrantLock newReentrantLock(String lockName, boolean fair) {
        return policy == Policies.DISABLED
            ? new ReentrantLock(fair)
            : new CycleDetectingReentrantLock(new LockGraphNode(lockName), fair);
      }
    
      /** Equivalent to {@code newReentrantReadWriteLock(lockName, false)}. */
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Dec 15 19:31:54 UTC 2023
    - 35.9K bytes
    - Viewed (0)
  4. guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java

       *
       * @param capacity the capacity of this queue
       * @param fair if {@code true} then queue accesses for threads blocked on insertion or removal,
       *     are processed in FIFO order; if {@code false} the access order is unspecified.
       * @throws IllegalArgumentException if {@code capacity} is less than 1
       */
      public MonitorBasedArrayBlockingQueue(int capacity, boolean fair) {
        if (capacity <= 0) throw new IllegalArgumentException();
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Apr 19 19:24:36 UTC 2023
    - 22.5K bytes
    - Viewed (0)
  5. CODE_OF_CONDUCT.md

      professional setting
    
    ## Enforcement Responsibilities
    
    Community leaders are responsible for clarifying and enforcing our standards of
    acceptable behavior and will take appropriate and fair corrective action in
    response to any behavior that they deem inappropriate, threatening, offensive,
    or harmful.
    
    Community leaders have the right and responsibility to remove, edit, or reject
    Registered: Sun Nov 03 09:35:10 UTC 2024
    - Last Modified: Thu Oct 17 06:18:13 UTC 2024
    - 5K bytes
    - Viewed (0)
  6. code_of_conduct.md

      professional setting
    
    ## Our Responsibilities
    
    Project maintainers are responsible for clarifying the standards of acceptable
    behavior and are expected to take appropriate and fair corrective action in
    response to any instances of unacceptable behavior, in compliance with the
    licensing terms applying to the Project developments.
    
    Project maintainers have the right and responsibility to remove, edit, or
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon Jan 20 18:38:58 UTC 2020
    - 3.5K bytes
    - Viewed (0)
  7. docs/contribute/concurrency.md

    ## Connection Pool
    
    A primary responsibility for any HTTP client is to efficiently manage network connections. Creating and establishing new connections require a fair amount of overhead and added latency. OkHttp will make every effort to reuse existing connections to avoid this overhead and added latency.
    
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Sun Feb 06 16:35:36 UTC 2022
    - 7K bytes
    - Viewed (0)
  8. docs/LICENSE

         fulfilling obligations under Article 11 of the WIPO Copyright
         Treaty adopted on December 20, 1996, and/or similar international
         agreements.
    
      e. Exceptions and Limitations means fair use, fair dealing, and/or
         any other exception or limitation to Copyright and Similar Rights
         that applies to Your use of the Licensed Material.
    
      f. Licensed Material means the artistic or literary work, database,
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon May 10 16:50:06 UTC 2021
    - 18.2K bytes
    - Viewed (0)
  9. guava-tests/test/com/google/common/math/LongMathTest.java

          long unused = simpleBinomial(LongMath.biggestSimpleBinomials[k], k); // mustn't throw
          if (LongMath.biggestSimpleBinomials[k] < Integer.MAX_VALUE) {
            // unless all n are fair game with this k
            assertThrows(
                ArithmeticException.class,
                () -> simpleBinomial(LongMath.biggestSimpleBinomials[k] + 1, k));
          }
        }
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 15:00:32 UTC 2024
    - 30.6K bytes
    - Viewed (0)
  10. LICENSE

    permission to run the unmodified Program.  The output from running a
    covered work is covered by this License only if the output, given its
    content, constitutes a covered work.  This License acknowledges your
    rights of fair use or other equivalent, as provided by copyright law.
    
      You may make, run and propagate covered works that you do not
    convey, without conditions so long as your license otherwise remains
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Apr 23 18:58:53 UTC 2021
    - 33.7K bytes
    - Viewed (0)
Back to top