Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 26 for design (0.2 sec)

  1. android/guava/src/com/google/common/collect/RegularImmutableMap.java

      /*
       * This is an implementation of ImmutableMap optimized especially for Android, which does not like
       * objects per entry.  Instead we use an open-addressed hash table.  This design is basically
       * equivalent to RegularImmutableSet, save that instead of having a hash table containing the
       * elements directly and null for empty positions, we store indices of the keys in the hash table,
    Java
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Mon Apr 15 22:32:14 GMT 2024
    - 22.7K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/graph/ValueGraph.java

     * interpretation of the edge value as its multiplicity.)
     *
     * <h3>Building a {@code ValueGraph}</h3>
     *
     * <p>The implementation classes that {@code common.graph} provides are not public, by design. To
     * create an instance of one of the built-in implementations of {@code ValueGraph}, use the {@link
     * ValueGraphBuilder} class:
     *
     * <pre>{@code
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Mon Jan 22 17:29:38 GMT 2024
    - 15K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/util/concurrent/Monitor.java

      //    Imagine:
      //    guard.lock();
      //    try { /* monitor locked and guard satisfied here */ }
      //    finally { guard.unlock(); }
      // Here are Justin's design notes about this:
      //
      // This idea has come up from time to time, and I think one of my
      // earlier versions of Monitor even did something like this. I ended
      // up strongly favoring the current interface.
      //
    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)
  4. android/guava/src/com/google/common/graph/Graph.java

     * extensions with parallel edges. If you need parallel edges, use {@link Network}.
     *
     * <h3>Building a {@code Graph}</h3>
     *
     * <p>The implementation classes that {@code common.graph} provides are not public, by design. To
     * create an instance of one of the built-in implementations of {@code Graph}, use the {@link
     * GraphBuilder} class:
     *
     * <pre>{@code
     * MutableGraph<Integer> graph = GraphBuilder.undirected().build();
     * }</pre>
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Mon Jan 22 17:29:38 GMT 2024
    - 13.6K bytes
    - Viewed (0)
  5. android/guava/src/com/google/common/graph/Network.java

     *   <li>graphs whose edges are unique objects
     * </ul>
     *
     * <h3>Building a {@code Network}</h3>
     *
     * <p>The implementation classes that {@code common.graph} provides are not public, by design. To
     * create an instance of one of the built-in implementations of {@code Network}, use the {@link
     * NetworkBuilder} class:
     *
     * <pre>{@code
     * MutableNetwork<Integer, MyEdge> network = NetworkBuilder.directed().build();
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Mon Jan 22 17:29:38 GMT 2024
    - 21.1K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/hash/Hashing.java

          this.hashFunction = new ChecksumHashFunction(this, 32, toString);
        }
      }
    
      /**
       * Returns a hash function implementing FarmHash's Fingerprint64, an open-source algorithm.
       *
       * <p>This is designed for generating persistent fingerprints of strings. It isn't
       * cryptographically secure, but it produces a high-quality hash with fewer collisions than some
       * alternatives we've used in the past.
       *
    Java
    - Registered: Fri Apr 26 12:43:10 GMT 2024
    - Last Modified: Tue Apr 09 00:37:15 GMT 2024
    - 29.2K bytes
    - Viewed (0)
  7. guava/src/com/google/common/base/Throwables.java

       * Returns the innermost cause of {@code throwable}. The first throwable in a chain provides
       * context from when the error or exception was initially detected. Example usage:
       *
       * <pre>
       * assertEquals("Unable to assign a customer id", Throwables.getRootCause(e).getMessage());
       * </pre>
       *
       * @throws IllegalArgumentException if there is a loop in the causal chain
       */
      public static Throwable getRootCause(Throwable throwable) {
    Java
    - Registered: Fri Apr 05 12:43:09 GMT 2024
    - Last Modified: Wed Mar 06 15:38:58 GMT 2024
    - 20.6K bytes
    - Viewed (0)
  8. android/guava/src/com/google/common/base/Throwables.java

       * Returns the innermost cause of {@code throwable}. The first throwable in a chain provides
       * context from when the error or exception was initially detected. Example usage:
       *
       * <pre>
       * assertEquals("Unable to assign a customer id", Throwables.getRootCause(e).getMessage());
       * </pre>
       *
       * @throws IllegalArgumentException if there is a loop in the causal chain
       */
      public static Throwable getRootCause(Throwable throwable) {
    Java
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Wed Mar 06 15:38:58 GMT 2024
    - 20.6K bytes
    - Viewed (0)
  9. android/guava-testlib/src/com/google/common/testing/GcFinalization.java

     * create the memory pressure required to cause soft references to be cleared.
     *
     * <p>This class only provides testing utilities. It is not designed for direct use in production or
     * for benchmarking.
     *
     * @author mike nonemacher
     * @author Martin Buchholz
     * @since 11.0
     */
    @GwtIncompatible
    @J2ktIncompatible
    @J2ObjCIncompatible // gc
    Java
    - Registered: Fri May 03 12:43:13 GMT 2024
    - Last Modified: Thu Feb 22 17:40:56 GMT 2024
    - 11.6K bytes
    - Viewed (0)
  10. guava/src/com/google/common/collect/ImmutableSet.java

         * <p>The online hash flooding detecting in RegularSetBuilderImpl.add can detect e.g. many
         * exactly matching hash codes, which would cause construction to take O(n^2), but can't detect
         * e.g. hash codes adversarially designed to go into ascending table locations, which keeps
         * construction O(n) (as desired) but then can have O(n) queries later.
         *
         * <p>If this returns false, then no query can take more than O(log n).
         *
    Java
    - Registered: Fri Apr 05 12:43:09 GMT 2024
    - Last Modified: Mon Apr 01 16:15:01 GMT 2024
    - 35.4K bytes
    - Viewed (0)
Back to top