Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for speedups (0.04 sec)

  1. src/bytes/bytes.go

    	// is reached and keep reusing the same source string - that
    	// should therefore be always resident in the L1 cache - until we
    	// have completed the construction of the result.
    	// This yields significant speedups (up to +100%) in cases where
    	// the result length is large (roughly, over L2 cache size).
    	const chunkLimit = 8 * 1024
    	chunkMax := n
    	if chunkMax > chunkLimit {
    		chunkMax = chunkLimit / len(b) * len(b)
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Tue Sep 03 20:55:15 UTC 2024
    - 35.6K bytes
    - Viewed (0)
  2. configure.py

          write_to_bazelrc('build --define=%s=%s' % (varname, environ_cp[varname]))
    
    
    def set_windows_build_flags(environ_cp):
      """Set Windows specific build options."""
    
      # First available in VS 16.4. Speeds up Windows compile times by a lot. See
      # https://groups.google.com/a/tensorflow.org/d/topic/build/SsW98Eo7l3o/discussion
      # pylint: disable=line-too-long
      write_to_bazelrc(
    Registered: Tue Nov 05 12:39:12 UTC 2024
    - Last Modified: Wed Oct 02 22:16:02 UTC 2024
    - 48.2K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/collect/TreeMultiset.java

          totalCount += count;
          return this;
        }
    
        AvlNode<E> add(
            Comparator<? super E> comparator, @ParametricNullness E e, int count, int[] result) {
          /*
           * It speeds things up considerably to unconditionally add count to totalCount here,
           * but that destroys failure atomicity in the case of count overflow. =(
           */
          int cmp = comparator.compare(e, getElement());
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 20:24:49 UTC 2024
    - 34.1K bytes
    - Viewed (0)
  4. guava/src/com/google/common/collect/TreeMultiset.java

          totalCount += count;
          return this;
        }
    
        AvlNode<E> add(
            Comparator<? super E> comparator, @ParametricNullness E e, int count, int[] result) {
          /*
           * It speeds things up considerably to unconditionally add count to totalCount here,
           * but that destroys failure atomicity in the case of count overflow. =(
           */
          int cmp = comparator.compare(e, getElement());
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 20:24:49 UTC 2024
    - 34.5K bytes
    - Viewed (0)
Back to top