Searched refs:capacity (Results 1 - 25 of 314) sorted by relevance

1234567891011>>

/openjdk9/hotspot/test/gc/g1/plab/lib/
H A DMemoryConsumer.java27 * Class will store not more than 'capacity' number of objects with 'chunk' size.
28 * If we exceed capacity, object will be stored at existing entries,
30 * If capacity=1, only last object will be saved.
34 private int capacity; field in class:MemoryConsumer
41 * Create MemoryConsumer object with defined capacity
43 * @param capacity
46 public MemoryConsumer(int capacity, int chunk) { argument
47 if (capacity <= 0) {
53 this.capacity = capacity;
[all...]
/openjdk9/jdk/test/java/util/Vector/
H A DArrayManagement.java49 public PublicVector(int capacity) { super(capacity); } argument
50 public PublicVector(int capacity, int capacityIncrement) { argument
51 super(capacity, capacityIncrement);
56 public int capacity() { return elementData.length; } method in class:ArrayManagement.PublicVector
59 int oldCapacity = capacity();
62 assertTrue(capacity() >= minCapacity);
64 assertEquals(capacity(), oldCapacity);
98 assertEquals(new PublicVector<Object>().capacity(), DEFAULT_CAPACITY);
101 assertEquals(list.capacity(), DEFAULT_CAPACIT
[all...]
/openjdk9/jdk/src/java.management/share/classes/com/sun/jmx/remote/internal/
H A DArrayQueue.java32 public ArrayQueue(int capacity) { argument
33 this.capacity = capacity + 1;
34 this.queue = newArray(capacity + 1);
44 if (newcapacity == this.capacity)
49 this.capacity = newcapacity;
62 int newtail = (tail + 1) % capacity;
76 head = (head + 1) % capacity;
86 int index = (head + i) % capacity;
94 diff += capacity;
98 private int capacity; field in class:ArrayQueue
[all...]
/openjdk9/jdk/test/java/net/httpclient/http2/jdk.incubator.httpclient/jdk/incubator/http/internal/hpack/
H A DCircularBufferTest.java47 for (int capacity = 1; capacity <= 2048; capacity++) {
48 queueOnce(capacity, 32);
54 for (int capacity = 1; capacity <= 4096; capacity++) {
55 resizeOnce(capacity);
65 private void resizeOnce(int capacity) { argument
69 Queue<Integer> referenceQueue = new ArrayBlockingQueue<>(capacity);
94 queueOnce(int capacity, int numWraps) argument
[all...]
/openjdk9/jdk/test/java/util/ArrayList/
H A DArrayManagement.java75 static int capacity(ArrayList<?> list) { method in class:ArrayManagement
83 static void ensureCapacity(ArrayList<Object> list, int capacity) { argument
84 int oldCapacity = capacity(list);
86 list.ensureCapacity(capacity);
87 assertTrue(capacity(list) >= capacity || capacity(list) == 0);
89 (capacity(list) == oldCapacity)
115 assertEquals(capacity(new ArrayList<Object>()), 0);
118 assertEquals(capacity(lis
[all...]
H A DEnsureCapacity.java42 throw new RuntimeException("capacity is expected to be unchanged: " +
52 // there is no method to query the capacity of ArrayList
53 // so before and after capacity are not checked
60 int cap = vector.capacity();
62 checkCapacity(cap, vector.capacity());
/openjdk9/jdk/test/java/lang/StringBuffer/
H A DCapacity.java27 * @summary Test StringBuffer/StringBuilder capacity handling.
38 equal(16, new StringBuffer().capacity());
39 equal(16, new StringBuilder().capacity());
42 equal(size, buff.capacity());
43 equal(size, bild.capacity());
46 equal(size, buff.capacity());
47 equal(size, bild.capacity());
50 equal(size*2+2, buff.capacity());
51 equal(size*2+2, bild.capacity());
52 size = buff.capacity();
[all...]
/openjdk9/hotspot/src/share/vm/memory/
H A DmetaspaceCounters.hpp35 static size_t capacity();
46 static size_t capacity();
H A DmetaspaceCounters.cpp54 _capacity = create_variable(ns, "capacity", curr_capacity, THREAD);
59 void update(size_t capacity, size_t max_capacity, size_t used) { argument
60 _capacity->set_value(capacity);
72 size_t MetaspaceCounters::capacity() { function in class:MetaspaceCounters
86 capacity(), max_capacity(), used());
94 _perf_counters->update(capacity(), max_capacity(), used());
104 size_t CompressedClassSpaceCounters::capacity() { function in class:CompressedClassSpaceCounters
116 _perf_counters->update(capacity(), max_capacity(), used());
127 _perf_counters = new MetaspacePerfCounters(ns, min_capacity, capacity(),
/openjdk9/hotspot/src/share/vm/gc/shared/
H A DcardGeneration.inline.hpp31 inline size_t CardGeneration::capacity() const { function in class:CardGeneration
32 return space()->capacity();
/openjdk9/jdk/test/java/lang/StringBuilder/
H A DCapacity.java27 * @summary Basic set of tests of capacity management
58 assertEquals(sb.capacity(), DEFAULT_CAPACITY);
61 assertEquals(sb.capacity(), DEFAULT_CAPACITY);
64 assertEquals(sb.capacity(), nextNewCapacity(DEFAULT_CAPACITY));
70 assertEquals(sb.capacity(), initCapacity);
73 assertEquals(sb.capacity(), initCapacity);
76 assertEquals(sb.capacity(), nextNewCapacity(initCapacity));
84 assertEquals(sb.capacity(), expectedCapacity);
87 assertEquals(sb.capacity(), expectedCapacity);
90 assertEquals(sb.capacity(), nextNewCapacit
[all...]
H A DEnsureCapacity.java43 throw new RuntimeException("capacity is expected to be unchanged: " +
50 int cap = sb.capacity();
54 checkCapacity(cap, sb.capacity());
67 int cap = sb.capacity();
71 checkCapacity(cap, sb.capacity());
/openjdk9/hotspot/test/compiler/c2/
H A DTest7048332.java36 static int capacity = 2; field in class:Test7048332
45 result = last - first + capacity;
H A DTest6852078.java46 int capacity = 128;
47 ByteBuffer bb = ByteBuffer.allocateDirect(capacity);
52 for (int i = 0; i < capacity; i++)
/openjdk9/jdk/test/java/util/concurrent/ArrayBlockingQueue/
H A DWhiteBox.java195 int capacity = q.remainingCapacity();
196 int n = rnd.nextInt(capacity + 1);
233 int capacity = rnd.nextInt(2, 10);
234 ArrayBlockingQueue q = new ArrayBlockingQueue(capacity, fair);
237 for (int i = 0; i < capacity; i++)
240 for (int i = 0; i < capacity; i++) {
244 q.add(capacity + i);
262 int capacity = rnd.nextInt(2, 10);
263 ArrayBlockingQueue q = new ArrayBlockingQueue(capacity, fair);
266 for (int i = 0; i < capacity;
[all...]
/openjdk9/jdk/src/java.base/share/classes/java/io/
H A DInputStream.java235 int capacity = buf.length;
240 while ((n = read(buf, nread, capacity - nread)) > 0)
248 if (capacity <= MAX_BUFFER_SIZE - capacity) {
249 capacity = capacity << 1;
251 if (capacity == MAX_BUFFER_SIZE)
253 capacity = MAX_BUFFER_SIZE;
255 buf = Arrays.copyOf(buf, capacity);
257 return (capacity
[all...]
/openjdk9/jdk/src/java.base/share/classes/jdk/internal/jimage/
H A DImageBufferCache.java67 // buffers are ordered by decreasing capacity
75 if (buffer != null && size <= buffer.capacity()) {
95 if (buffer.capacity() > LARGE_BUFFER) {
120 return Integer.compare(br2 == null ? 0 : br2.capacity,
121 br1 == null ? 0 : br1.capacity);
126 // saved capacity so that DECREASING_CAPACITY_NULLS_LAST comparator
128 final int capacity; field in class:ImageBufferCache.BufferReference
132 capacity = buffer.capacity();
/openjdk9/jdk/src/java.base/share/classes/java/nio/
H A DBuffer.java37 * buffer are its capacity, limit, and position: </p>
41 * <p> A buffer's <i>capacity</i> is the number of elements it contains. The
42 * capacity of a buffer is never negative and never changes. </p>
46 * greater than its capacity. </p>
97 * capacity values:
104 * <i>capacity</i>
116 * <p> In addition to methods for accessing the position, limit, and capacity
124 * capacity and the position to zero. </p></li>
192 // Invariants: mark <= position <= limit <= capacity
196 private int capacity; field in class:Buffer
249 createCapacityException(int capacity) argument
260 public final int capacity() { method in class:Buffer
[all...]
/openjdk9/hotspot/src/share/vm/gc/g1/
H A DhSpaceCounters.hpp74 jlong capacity() { function in class:HSpaceCounters
79 inline void update_all(size_t capacity, size_t used) { argument
80 update_capacity(capacity);
/openjdk9/jdk/src/java.base/share/native/libjli/
H A Djli_util.c124 JLI_List_new(size_t capacity) argument
127 l->capacity = capacity;
128 l->elements = (char **) JLI_MemAlloc(capacity * sizeof(l->elements[0]));
148 JLI_List_ensureCapacity(JLI_List sl, size_t capacity) argument
150 if (sl->capacity < capacity) {
151 while (sl->capacity < capacity)
152 sl->capacity *
[all...]
/openjdk9/jdk/src/java.base/share/classes/java/util/
H A DHashSet.java42 * "capacity" of the backing {@code HashMap} instance (the number of
43 * buckets). Thus, it's very important not to set the initial capacity too
102 * default initial capacity (16) and load factor (0.75).
111 * (0.75) and an initial capacity sufficient to contain the elements in
124 * the specified initial capacity and the specified load factor.
126 * @param initialCapacity the initial capacity of the hash map
128 * @throws IllegalArgumentException if the initial capacity is less
137 * the specified initial capacity and default load factor (0.75).
139 * @param initialCapacity the initial capacity of the hash table
140 * @throws IllegalArgumentException if the initial capacity i
[all...]
/openjdk9/jdk/test/javax/sound/midi/Gervill/ModelByteBuffer/RandomFileInputStream/
H A DAvailable.java86 long capacity = buff.capacity();
91 if(ret != capacity)
98 if(buff.capacity() != capacity)
/openjdk9/langtools/src/jdk.compiler/share/classes/com/sun/tools/javac/util/
H A DIntHashTable.java58 * @param capacity The number of default mappings in this hash table.
60 public IntHashTable(int capacity) { argument
62 while (capacity > (1 << log2Size)) {
65 capacity = 1 << log2Size;
66 objs = new Object[capacity];
67 ints = new int[capacity];
68 mask = capacity - 1;
/openjdk9/jdk/src/jdk.incubator.httpclient/share/classes/jdk/incubator/http/internal/hpack/
H A DHeaderTable.java390 Table(int capacity) { argument
391 buffer = new CircularBuffer<>(capacity);
392 map = new HashMap<>(capacity);
435 public void setCapacity(int capacity) { argument
436 buffer.resize(capacity);
447 // |<------ capacity ------->| (9)
451 int tail, head, size, capacity; field in class:HeaderTable.CircularBuffer
454 CircularBuffer(int capacity) { argument
455 this.capacity = capacity;
[all...]
/openjdk9/hotspot/src/share/vm/gc/cms/
H A DgSpaceCounters.hpp60 _capacity->set_value(_gen->capacity());
87 jlong capacity() { function in class:GSpaceCounters

Completed in 147 milliseconds

1234567891011>>