Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 6 of 6 for average (0.12 seconds)

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

     *       <ul>
     *         <li>2 levels: average of 64ns per lock()/unlock()
     *         <li>3 levels: average of 77ns per lock()/unlock()
     *         <li>4 levels: average of 99ns per lock()/unlock()
     *         <li>5 levels: average of 103ns per lock()/unlock()
     *         <li>10 levels: average of 184ns per lock()/unlock()
     *         <li>20 levels: average of 393ns per lock()/unlock()
     *       </ul>
     * </ul>
     *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Apr 01 17:27:13 GMT 2026
    - 36K bytes
    - Click Count (0)
  2. android/guava/src/com/google/common/graph/StandardNetwork.java

      // We could make this a Map<E, EndpointPair<N>>. It would make incidentNodes(edge) slightly
      // faster, but also make Networks consume 5 to 20+% (increasing with average degree) more memory.
      final MapIteratorCache<E, N> edgeToReferenceNode; // referenceNode == source if directed
    
      /** Constructs a graph with the properties specified in {@code builder}. */
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Apr 02 14:49:41 GMT 2026
    - 6.9K bytes
    - Click Count (0)
  3. guava/src/com/google/common/collect/MapMakerInternalMap.java

         * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This
         * works well for hash tables since the bin lists tend to be short. (The average length is less
         * than two.)
         *
         * Read operations can thus proceed without locking, but rely on selected uses of volatiles to
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Apr 01 17:27:13 GMT 2026
    - 89.9K bytes
    - Click Count (0)
  4. android/guava/src/com/google/common/collect/MapMakerInternalMap.java

         * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This
         * works well for hash tables since the bin lists tend to be short. (The average length is less
         * than two.)
         *
         * Read operations can thus proceed without locking, but rely on selected uses of volatiles to
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Apr 01 17:27:13 GMT 2026
    - 89.9K bytes
    - Click Count (0)
  5. guava/src/com/google/common/cache/LocalCache.java

         * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This
         * works well for hash tables since the bin lists tend to be short. (The average length is less
         * than two.)
         *
         * Read operations can thus proceed without locking, but rely on selected uses of volatiles to
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Apr 01 17:27:13 GMT 2026
    - 148.9K bytes
    - Click Count (0)
  6. android/guava/src/com/google/common/cache/LocalCache.java

         * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This
         * works well for hash tables since the bin lists tend to be short. (The average length is less
         * than two.)
         *
         * Read operations can thus proceed without locking, but rely on selected uses of volatiles to
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Apr 01 17:27:13 GMT 2026
    - 143.5K bytes
    - Click Count (0)
Back to Top