Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 53 for capacity (0.09 sec)

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

       * @since 12.0
       */
      @J2ktIncompatible
      @GwtIncompatible // LinkedBlockingDeque
      public static <E> LinkedBlockingDeque<E> newLinkedBlockingDeque(int capacity) {
        return new LinkedBlockingDeque<>(capacity);
      }
    
      /**
       * Creates a {@code LinkedBlockingDeque} with a capacity of {@link Integer#MAX_VALUE}, containing
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 26 14:11:14 UTC 2024
    - 18.4K bytes
    - Viewed (0)
  2. guava/src/com/google/common/collect/Queues.java

       * @since 12.0
       */
      @J2ktIncompatible
      @GwtIncompatible // LinkedBlockingDeque
      public static <E> LinkedBlockingDeque<E> newLinkedBlockingDeque(int capacity) {
        return new LinkedBlockingDeque<>(capacity);
      }
    
      /**
       * Creates a {@code LinkedBlockingDeque} with a capacity of {@link Integer#MAX_VALUE}, containing
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 26 14:11:14 UTC 2024
    - 18.2K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/io/ReaderInputStream.java

              return 0; // Not called.
            }
          }
        }
      }
    
      /** Returns a new CharBuffer identical to buf, except twice the capacity. */
      private static CharBuffer grow(CharBuffer buf) {
        char[] copy = Arrays.copyOf(buf.array(), buf.capacity() * 2);
        CharBuffer bigger = CharBuffer.wrap(copy);
        Java8Compatibility.position(bigger, buf.position());
        Java8Compatibility.limit(bigger, buf.limit());
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:26:48 UTC 2024
    - 9.3K bytes
    - Viewed (0)
  4. guava/src/com/google/common/io/ReaderInputStream.java

              return 0; // Not called.
            }
          }
        }
      }
    
      /** Returns a new CharBuffer identical to buf, except twice the capacity. */
      private static CharBuffer grow(CharBuffer buf) {
        char[] copy = Arrays.copyOf(buf.array(), buf.capacity() * 2);
        CharBuffer bigger = CharBuffer.wrap(copy);
        Java8Compatibility.position(bigger, buf.position());
        Java8Compatibility.limit(bigger, buf.limit());
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:26:48 UTC 2024
    - 9.3K bytes
    - Viewed (0)
  5. android/guava-testlib/test/com/google/common/testing/ArbitraryInstancesTest.java

        assertEquals(0, ArbitraryInstances.get(Buffer.class).capacity());
        assertEquals(0, ArbitraryInstances.get(CharBuffer.class).capacity());
        assertEquals(0, ArbitraryInstances.get(ByteBuffer.class).capacity());
        assertEquals(0, ArbitraryInstances.get(ShortBuffer.class).capacity());
        assertEquals(0, ArbitraryInstances.get(IntBuffer.class).capacity());
        assertEquals(0, ArbitraryInstances.get(LongBuffer.class).capacity());
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Sat Oct 19 00:26:48 UTC 2024
    - 21.8K bytes
    - Viewed (0)
  6. android/guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java

        MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue.create();
        assertEquals(11, queue.capacity());
        checkUnbounded(queue);
        checkNatural(queue);
      }
    
      public void testCreation_comparator() {
        MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue.orderedBy(SOME_COMPARATOR).create();
        assertEquals(11, queue.capacity());
        checkUnbounded(queue);
        assertSame(SOME_COMPARATOR, queue.comparator());
      }
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 35.9K bytes
    - Viewed (0)
  7. guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java

        MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue.create();
        assertEquals(11, queue.capacity());
        checkUnbounded(queue);
        checkNatural(queue);
      }
    
      public void testCreation_comparator() {
        MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue.orderedBy(SOME_COMPARATOR).create();
        assertEquals(11, queue.capacity());
        checkUnbounded(queue);
        assertSame(SOME_COMPARATOR, queue.comparator());
      }
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 35.9K bytes
    - Viewed (0)
  8. src/bytes/buffer.go

    // license that can be found in the LICENSE file.
    
    package bytes
    
    // Simple byte buffer for marshaling data.
    
    import (
    	"errors"
    	"io"
    	"unicode/utf8"
    )
    
    // smallBufferSize is an initial allocation minimal capacity.
    const smallBufferSize = 64
    
    // A Buffer is a variable-sized buffer of bytes with [Buffer.Read] and [Buffer.Write] methods.
    // The zero value for Buffer is an empty buffer ready to use.
    type Buffer struct {
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Tue Oct 29 16:47:05 UTC 2024
    - 15.7K bytes
    - Viewed (0)
  9. guava/src/com/google/common/collect/CompactHashSet.java

      }
    
      /**
       * Creates a {@code CompactHashSet} instance, with a high enough "initial capacity" that it
       * <i>should</i> hold {@code expectedSize} elements without growth.
       *
       * @param expectedSize the number of elements you expect to add to the returned set
       * @return a new, empty {@code CompactHashSet} with enough capacity to hold {@code expectedSize}
       *     elements without resizing
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 20:24:49 UTC 2024
    - 24.9K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/collect/CompactHashSet.java

      }
    
      /**
       * Creates a {@code CompactHashSet} instance, with a high enough "initial capacity" that it
       * <i>should</i> hold {@code expectedSize} elements without growth.
       *
       * @param expectedSize the number of elements you expect to add to the returned set
       * @return a new, empty {@code CompactHashSet} with enough capacity to hold {@code expectedSize}
       *     elements without resizing
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 18 20:24:49 UTC 2024
    - 24K bytes
    - Viewed (0)
Back to top