| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| ArrayTable.java | 38 * Fixed-size {@link Table} implementation backed by a two-dimensional array.
45 * <p>The table's size is constant: the product of the number of supplied row
159 = (V[][]) new Object[rowList.size()][columnList.size()];
167 for (int i = 0; i < list.size(); i++) {
184 V[][] copy = (V[][]) new Object[rowList.size()][columnList.size()];
188 for (int i = 0; i < rowList.size(); i++) {
216 public int size() { method in class:ArrayTable.ArrayMap
217 return keyIndex.size();
[all...] |
| ImmutableListMultimap.java | 252 int size = 0; local
259 size += list.size();
263 return new ImmutableListMultimap<K, V>(builder.build(), size);
266 ImmutableListMultimap(ImmutableMap<K, ImmutableList<V>> map, int size) {
267 super(map, size);
|
| Iterables.java | 105 public static int size(Iterable<?> iterable) { method in class:Iterables
107 ? ((Collection<?>) iterable).size()
108 : Iterators.size(iterable.iterator());
188 for (; from < list.size(); from++) {
204 list.subList(to, list.size()).clear();
220 for (int n = list.size() - 1; n > from; n--) {
260 if (collection1.size() != collection2.size()) {
501 * Divides an iterable into unmodifiable sublists of the given size (the final
503 * {@code [a, b, c, d, e]} with a partition size of 3 yields {@cod
[all...] |
| Lists.java | 164 * initial size; simply delegates to {@link ArrayList#ArrayList(int)}.
173 * @param initialArraySize the exact size of the initial backing array for
177 * itself unless its size reaches {@code initialArraySize + 1}
197 * @param estimatedSize an estimate of the eventual {@link List#size()} of
291 @Override public int size() { method in class:Lists.OnePlusArrayList
296 checkElementIndex(index, size());
336 @Override public int size() { method in class:Lists.TwoPlusArrayList
347 checkElementIndex(index, size());
392 * <p><i>Performance notes:</i> while the cartesian product of lists of size
393 * {@code m, n, p} is a list of size {@code m x n x p}, its actual memor
537 @Override public int size() { method in class:Lists.TransformingSequentialList
[all...] |
| Platform.java | 75 @Override public int size() { method in class:Platform.SetFromMap
76 return m.size();
|
| RegularContiguousSet.java | 94 @Override public int size() { method
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| AbstractMultimapTester.java | 49 * @return an array of the proper size with {@code null} as the key of the
61 * @return an array of the proper size with {@code null} as the value of the
73 * @return an array of the proper size with {@code null} as the key and value of the
159 assertThat(multimap().get(key).size()).isEqualTo((long) values.size());
161 assertEquals(values.size() > 0, multimap().containsKey(key));
162 assertEquals(values.size() > 0, multimap().keySet().contains(key));
163 assertEquals(values.size() > 0, multimap().keys().contains(key));
|
| MultimapPutIterableTester.java | 104 int size = getNumElements(); local
113 if (values.size() == 0) {
117 assertEquals(size, multimap().size());
120 assertEquals(size + 1, multimap().size());
126 int size = getNumElements(); local
142 assertEquals(size, multimap().size());
208 int getCollectionSize = getCollection.size();
[all...] |
| /external/guava/guava-tests/benchmark/com/google/common/base/ |
| AsciiBenchmark.java | 42 @Param({"20", "2000"}) int size; field in class:AsciiBenchmark
52 int nonAlpha = size / nonAlphaRatio;
53 int alpha = size - nonAlpha;
55 List<Character> chars = Lists.newArrayListWithCapacity(size);
|
| /external/guava/guava-tests/benchmark/com/google/common/collect/ |
| BinaryTreeTraverserBenchmark.java | 48 Optional<BinaryNode> createTree(int size, Random rng) {
49 if (size == 0) {
52 int leftChildSize = (size - 1) / 2;
53 int rightChildSize = size - 1 - leftChildSize;
61 Optional<BinaryNode> createTree(int size, Random rng) {
63 for (int i = 0; i < size; i++) {
71 Optional<BinaryNode> createTree(int size, Random rng) {
73 for (int i = 0; i < size; i++) {
82 * trees of the specified size.
85 Optional<BinaryNode> createTree(int size, Random rng)
163 int size; field in class:BinaryTreeTraverserBenchmark
[all...] |
| MinMaxPriorityQueueBenchmark.java | 43 @Param({"100", "10000"}) private int size; field in class:MinMaxPriorityQueueBenchmark
53 for (int i = 0; i < size; i++) {
68 for (int j = 0; j < size; j++) {
|
| SortedCopyBenchmark.java | 38 @Param({"1", "10", "1000", "1000000"}) int size; // logarithmic triangular field in class:SortedCopyBenchmark
53 if (list.size() > 1) {
54 int i = (list.size() - 1) / 2;
70 checkArgument(size > 0, "empty collection not supported");
71 Set<Integer> set = new LinkedHashSet<Integer>(size);
74 while (set.size() < size) {
|
| /external/guava/guava-tests/test/com/google/common/cache/ |
| CacheEvictionTest.java | 72 assertEquals(Math.min(i + 1, MAX_SIZE), cache.size());
75 assertEquals(MAX_SIZE, cache.size());
88 assertEquals(Math.min(i + 1, MAX_SIZE), cache.size());
91 assertEquals(MAX_SIZE, cache.size());
104 assertTrue(cache.size() <= MAX_SIZE);
108 assertEquals(MAX_SIZE, cache.size());
124 assertTrue(cache.size() <= MAX_SIZE);
128 assertEquals(MAX_SIZE, cache.size());
|
| ForwardingCacheTest.java | 94 expect(mock.size()).andReturn(0L);
96 forward.size();
|
| ForwardingLoadingCacheTest.java | 106 expect(mock.size()).andReturn(0L);
108 forward.size();
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| CollectionBenchmarkSampleData.java | 36 private final int size; field in class:CollectionBenchmarkSampleData
41 CollectionBenchmarkSampleData(int size) {
42 this(true, new SpecialRandom(), 1.0, size);
49 int size) {
53 this.size = size;
73 int size = elementsInSet.size(); local
74 if (size > 0) {
75 int minCopiesOfEachGoodQuery = numGoodQueries / size;
[all...] |
| ForwardingSortedMultisetTest.java | 165 public int size() { method
|
| SynchronizedQueueTest.java | 81 public int size() { method in class:SynchronizedQueueTest.TestQueue
83 return delegate.size();
173 create().size();
|
| /external/guice/core/src/com/google/inject/internal/ |
| InternalContext.java | 99 for (int i = 0; i < state.size(); i += 2) {
121 private int size = 0; field in class:InternalContext.DependencyStack
124 if (elements.length < size + 2) {
127 elements[size++] = dependencyOrKey;
128 elements[size++] = source;
132 elements[--size] = null;
133 elements[--size] = null;
140 public int size() { method in class:InternalContext.DependencyStack
141 return size;
|
| /external/guice/core/src/com/google/inject/spi/ |
| ModuleSource.java | 100 * Returns the size of partial call stack if stack trace collection is on otherwise zero.
141 * Returns the size of {@link ModuleSource ModuleSources} chain (all parents) that ends at this
144 int size() { method in class:ModuleSource
148 return parent.size() + 1;
152 * Returns the size of call stack that ends just before the module {@link Module#configure(Binder)
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| UCharacterNameReader.java | 69 int size = m_groupindex_ - m_tokenstringindex_; local
70 byte tokenstr[] = new byte[size];
80 size = m_algnamesindex_ - m_groupstringindex_;
81 byte groupstring[] = new byte[size];
125 * Size of the group information block in number of char
138 * Size of an algorithmic name information group
139 * start code point size + end code point size + type size + variant size +
168 int size = m_byteBuffer_.getChar(); local
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| CollationKey.java | 106 * Upper bound that will match strings of exact size
173 m_length_ = key.size - 1;
336 int size = m_key_.length >> 1; local
337 StringBuilder key = new StringBuilder(size);
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/util/ |
| SortedBag.java | 31 private int size; field in class:SortedBag
43 if (result) size++;
81 public int size() { method in class:SortedBag
82 return size;
85 return size == 0;
93 return toArray(new Object[size]);
109 if (set.size() == 0) m.remove(o);
110 size--;
|
| /external/icu/icu4c/source/common/ |
| dictionarydata.cpp | 168 int32_t i, offset, size; local
201 size = indexes[DictionaryData::IX_TOTAL_SIZE];
204 if (length < size) {
211 uprv_memcpy(outBytes, inBytes, size);
238 return headerSize + size;
|
| ucol_data.h | 8 * tab size: 8 (not used)
35 int32_t size; member in struct:__anon11806
51 uint32_t expansionCESize; /* array of maximum expansion size
55 int32_t endExpansionCECount; /* size of endExpansionCE */
|
