Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 7 of 7 for FITS (0.02 sec)

  1. guava/src/com/google/common/collect/ObjectArrays.java

       * of the returned array is that of the specified array. If the collection fits in the specified
       * array, it is returned therein. Otherwise, a new array is allocated with the runtime type of the
       * specified array and the size of the specified collection.
       *
       * <p>If the collection fits in the specified array with room to spare (i.e., the array has more
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 9K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/collect/ObjectArrays.java

       * of the returned array is that of the specified array. If the collection fits in the specified
       * array, it is returned therein. Otherwise, a new array is allocated with the runtime type of the
       * specified array and the size of the specified collection.
       *
       * <p>If the collection fits in the specified array with room to spare (i.e., the array has more
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 9K bytes
    - Viewed (0)
  3. guava/src/com/google/common/math/LongMath.java

      public static boolean isPowerOfTwo(long x) {
        return x > 0 & (x & (x - 1)) == 0;
      }
    
      /**
       * Returns 1 if {@code x < y} as unsigned longs, and 0 otherwise. Assumes that x - y fits into a
       * signed long. The implementation is branch-free, and benchmarks suggest it is measurably faster
       * than the straightforward ternary expression.
       */
      @VisibleForTesting
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 09 16:39:37 UTC 2024
    - 45.2K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/math/LongMath.java

      public static boolean isPowerOfTwo(long x) {
        return x > 0 & (x & (x - 1)) == 0;
      }
    
      /**
       * Returns 1 if {@code x < y} as unsigned longs, and 0 otherwise. Assumes that x - y fits into a
       * signed long. The implementation is branch-free, and benchmarks suggest it is measurably faster
       * than the straightforward ternary expression.
       */
      @VisibleForTesting
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 09 16:39:37 UTC 2024
    - 45.2K bytes
    - Viewed (0)
  5. src/bytes/buffer.go

    	i := copy(b2, b)
    	return b2[:i]
    }
    
    // WriteTo writes data to w until the buffer is drained or an error occurs.
    // The return value n is the number of bytes written; it always fits into an
    // int, but it is int64 to match the [io.WriterTo] interface. Any error
    // encountered during the write is also returned.
    func (b *Buffer) WriteTo(w io.Writer) (n int64, err error) {
    	b.lastRead = opInvalid
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Tue Oct 29 16:47:05 UTC 2024
    - 15.7K bytes
    - Viewed (0)
  6. doc/go1.17_spec.html

    <p>
    The built-in functions <code>len</code> and <code>cap</code> take arguments
    of various types and return a result of type <code>int</code>.
    The implementation guarantees that the result always fits into an <code>int</code>.
    </p>
    
    <pre class="grammar">
    Call      Argument type    Result
    
    len(s)    string type      string length in bytes
              [n]T, *[n]T      array length (== n)
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Thu Oct 10 18:25:45 UTC 2024
    - 211.6K bytes
    - Viewed (0)
  7. doc/go_spec.html

    </pre>
    
    <p>
    If the capacity of <code>s</code> is not large enough to fit the additional
    values, <code>append</code> <a href="#Allocation">allocates</a> a new, sufficiently large underlying
    array that fits both the existing slice elements and the additional values.
    Otherwise, <code>append</code> re-uses the underlying array.
    </p>
    
    <pre>
    s0 := []int{0, 0}
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Wed Oct 02 00:58:01 UTC 2024
    - 282.5K bytes
    - Viewed (0)
Back to top