Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 34 for Fallocate (0.1 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. okhttp-testing-support/src/main/kotlin/okhttp3/FakeDns.kt

      }
    
      fun assertRequests(vararg expectedHosts: String?) {
        assertThat(requestedHosts).containsExactly(*expectedHosts)
        requestedHosts.clear()
      }
    
      /** Allocates and returns `count` fake IPv4 addresses like [255.0.0.100, 255.0.0.101].  */
      fun allocate(count: Int): List<InetAddress> {
        val from = nextAddress
        nextAddress += count
        return (from until nextAddress)
          .map {
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Wed Feb 04 20:20:29 GMT 2026
    - 2.6K bytes
    - Click Count (0)
  2. src/builtin/builtin.go

    //     length. For example, make([]int, 0, 10) allocates an underlying array
    //     of size 10 and returns a slice of length 0 and capacity 10 that is
    //     backed by this underlying array.
    //   - Map: An empty map is allocated with enough space to hold the
    //     specified number of elements. The size may be omitted, in which case
    //     a small starting size is allocated.
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Feb 26 17:14:40 GMT 2026
    - 13.2K bytes
    - Click Count (0)
  3. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/platform/Platform.kt

          logger.isLoggable(Level.FINE) -> Throwable(closer)
    
          // These are expensive to allocate.
          else -> null
        }
    
      open fun logCloseableLeak(
        message: String,
        stackTrace: Any?,
      ) {
        var logMessage = message
        if (stackTrace == null) {
          logMessage += " To see where this was allocated, set the OkHttpClient logger level to " +
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Feb 03 22:17:59 GMT 2026
    - 8.1K bytes
    - Click Count (0)
  4. guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java

       *
       * <p>The returned array will be "safe" in that no references to it are maintained by this queue.
       * (In other words, this method must allocate a new array). The caller is thus free to modify the
       * returned array.
       *
       * <p>This method acts as bridge between array-based and collection-based APIs.
       *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 23 21:06:42 GMT 2026
    - 22.4K bytes
    - Click Count (0)
  5. guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedPriorityBlockingQueue.java

       * in no particular order.
       *
       * <p>The returned array will be "safe" in that no references to it are maintained by this queue.
       * (In other words, this method must allocate a new array). The caller is thus free to modify the
       * returned array.
       *
       * <p>This method acts as bridge between array-based and collection-based APIs.
       *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 23 21:06:42 GMT 2026
    - 19K bytes
    - Click Count (0)
  6. android/guava-tests/test/com/google/common/io/CharSequenceReaderTest.java

        CharBuffer buf2 = CharBuffer.allocate(expected.length());
        assertEquals(expected.isEmpty() ? -1 : expected.length(), reader.read(buf2));
        Java8Compatibility.flip(buf2);
        assertThat(buf2.toString()).isEqualTo(expected);
        assertFullyRead(reader);
    
        // read in chunks to fixed CharBuffer
        reader = new CharSequenceReader(charSequence);
        buf2 = CharBuffer.allocate(5);
        builder = new StringBuilder();
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 17 19:26:39 GMT 2026
    - 6.7K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/io/ByteStreams.java

          throws IOException {
        // Roughly size to match what has been read already. Some file systems, such as procfs, return 0
        // as their length. These files are very small, so it's wasteful to allocate an 8KB buffer.
        int initialBufferSize = min(BUFFER_SIZE, max(128, Integer.highestOneBit(totalLen) * 2));
        // Starting with an 8k buffer, double the size of each successive buffer. Smaller buffers
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 23 21:06:42 GMT 2026
    - 31.1K bytes
    - Click Count (0)
  8. android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java

       *
       * <p>The returned array will be "safe" in that no references to it are maintained by this queue.
       * (In other words, this method must allocate a new array). The caller is thus free to modify the
       * returned array.
       *
       * <p>This method acts as bridge between array-based and collection-based APIs.
       *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 23 21:06:42 GMT 2026
    - 22.4K bytes
    - Click Count (0)
  9. android/guava-testlib/src/com/google/common/testing/FreshValueGenerator.java

        return CharBuffer.allocate(generateInt());
      }
    
      @Generates
      ByteBuffer generateByteBuffer() {
        return ByteBuffer.allocate(generateInt());
      }
    
      @Generates
      ShortBuffer generateShortBuffer() {
        return ShortBuffer.allocate(generateInt());
      }
    
      @Generates
      IntBuffer generateIntBuffer() {
        return IntBuffer.allocate(generateInt());
      }
    
      @Generates
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 17 16:45:58 GMT 2026
    - 28.1K bytes
    - Click Count (0)
  10. src/bufio/bufio.go

    // delim.
    // For simple uses, a Scanner may be more convenient.
    func (b *Reader) ReadBytes(delim byte) ([]byte, error) {
    	full, frag, n, err := b.collectFragments(delim)
    	// Allocate new buffer to hold the full pieces and the fragment.
    	buf := make([]byte, n)
    	n = 0
    	// Copy full pieces and fragment in.
    	for i := range full {
    		n += copy(buf[n:], full[i])
    	}
    	copy(buf[n:], frag)
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Fri Feb 06 17:28:40 GMT 2026
    - 22K bytes
    - Click Count (0)
Back to Top