Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 27 for factories (0.1 sec)

  1. tensorflow/c/eager/c_api_unified_experimental.cc

    namespace tensorflow {
    namespace tracing {
    typedef absl::flat_hash_map<std::string, tracing::FactoryFunction> FactoriesMap;
    
    static FactoriesMap& GetFactories() {
      static FactoriesMap* factories = new FactoriesMap;
      return *factories;
    }
    
    static tracing::FactoryFunction default_factory;
    
    void RegisterTracingEngineFactory(const string& name, FactoryFunction factory) {
      assert((!GetFactories().count(name)) ||
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Sat Oct 12 05:11:17 UTC 2024
    - 9K bytes
    - Viewed (0)
  2. guava/src/com/google/common/collect/TreeBasedTable.java

       * is returned.
       *
       * @deprecated Use {@code table.rowKeySet().comparator()} instead.
       */
      @Deprecated
      public Comparator<? super R> rowComparator() {
        /*
         * requireNonNull is safe because the factories require non-null Comparators, which they pass on
         * to the backing collections.
         */
        return requireNonNull(rowKeySet().comparator());
      }
    
      /**
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 11.5K bytes
    - Viewed (0)
  3. android/guava-testlib/src/com/google/common/testing/AbstractPackageSanityTests.java

       *
       * <ul>
       *   <li>The visible constructor or visible static factory method with the most parameters is used
       *       to construct the sample instances. In case of tie, the candidate constructors or
       *       factories are tried one after another until one can be used to construct sample
       *       instances.
       *   <li>For the constructor or static factory method used to construct instances, it's checked
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Oct 17 19:43:49 UTC 2024
    - 17.9K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/collect/Ordering.java

      // plus https://github.com/google/guava/issues/989
      public static <C extends Comparable> Ordering<C> natural() {
        return (Ordering<C>) NaturalOrdering.INSTANCE;
      }
    
      // Static factories
    
      /**
       * Returns an ordering based on an <i>existing</i> comparator instance. Note that it is
       * unnecessary to create a <i>new</i> anonymous inner class implementing {@code Comparator} just
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 39.4K bytes
    - Viewed (0)
  5. guava/src/com/google/common/collect/Ordering.java

      // plus https://github.com/google/guava/issues/989
      public static <C extends Comparable> Ordering<C> natural() {
        return (Ordering<C>) NaturalOrdering.INSTANCE;
      }
    
      // Static factories
    
      /**
       * Returns an ordering based on an <i>existing</i> comparator instance. Note that it is
       * unnecessary to create a <i>new</i> anonymous inner class implementing {@code Comparator} just
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 39.4K bytes
    - Viewed (0)
  6. guava/src/com/google/common/base/CharMatcher.java

       * @since 19.0 (since 1.0 as constant {@code SINGLE_WIDTH})
       */
      @Deprecated
      public static CharMatcher singleWidth() {
        return SingleWidth.INSTANCE;
      }
    
      // Static factories
    
      /** Returns a {@code char} matcher that matches only one specified BMP character. */
      public static CharMatcher is(final char match) {
        return new Is(match);
      }
    
      /**
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Oct 17 13:00:28 UTC 2024
    - 53.9K bytes
    - Viewed (0)
  7. guava-testlib/src/com/google/common/testing/AbstractPackageSanityTests.java

       *
       * <ul>
       *   <li>The visible constructor or visible static factory method with the most parameters is used
       *       to construct the sample instances. In case of tie, the candidate constructors or
       *       factories are tried one after another until one can be used to construct sample
       *       instances.
       *   <li>For the constructor or static factory method used to construct instances, it's checked
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Oct 17 19:43:49 UTC 2024
    - 17.9K bytes
    - Viewed (0)
  8. guava/src/com/google/common/cache/LocalCache.java

        static final int ACCESS_MASK = 1;
        static final int WRITE_MASK = 2;
        static final int WEAK_MASK = 4;
    
        /** Look-up table for factories. */
        static final EntryFactory[] factories = {
          STRONG,
          STRONG_ACCESS,
          STRONG_WRITE,
          STRONG_ACCESS_WRITE,
          WEAK,
          WEAK_ACCESS,
          WEAK_WRITE,
          WEAK_ACCESS_WRITE,
        };
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 19:07:49 UTC 2024
    - 149.2K bytes
    - Viewed (0)
  9. android/guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java

          binomials[i] = RANDOM_SOURCE.nextInt(factorials[i] + 1);
        }
      }
    
      /** Previous version of BigIntegerMath.factorial, kept for timing purposes. */
      private static BigInteger oldSlowFactorial(int n) {
        if (n <= 20) {
          return BigInteger.valueOf(LongMath.factorial(n));
        } else {
          int k = 20;
          return BigInteger.valueOf(LongMath.factorial(k)).multiply(oldSlowFactorial(k, n));
        }
      }
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Aug 19 16:21:24 UTC 2024
    - 3.4K bytes
    - Viewed (0)
  10. guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java

          binomials[i] = RANDOM_SOURCE.nextInt(factorials[i] + 1);
        }
      }
    
      /** Previous version of BigIntegerMath.factorial, kept for timing purposes. */
      private static BigInteger oldSlowFactorial(int n) {
        if (n <= 20) {
          return BigInteger.valueOf(LongMath.factorial(n));
        } else {
          int k = 20;
          return BigInteger.valueOf(LongMath.factorial(k)).multiply(oldSlowFactorial(k, n));
        }
      }
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Mon Aug 19 16:21:24 UTC 2024
    - 3.4K bytes
    - Viewed (0)
Back to top