- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 85 for tablet (0.17 sec)
-
guava-tests/test/com/google/common/collect/TableCollectionTest.java
} abstract Table<String, Integer, Character> makeTable(); @Override protected Map<String, Map<Integer, Character>> makePopulatedMap() { Table<String, Integer, Character> table = makeTable(); populateTable(table); return table.rowMap(); } void populateTable(Table<String, Integer, Character> table) { table.put("foo", 1, 'a');
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Feb 19 20:34:55 GMT 2024 - 35.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashBiMap.java
} } /** * Returns the bucket (in either the K-to-V or V-to-K tables) where elements with the specified * hash could be found, if present, or could be inserted. */ private int bucket(int hash) { return hash & (hashTableKToV.length - 1); } /** Given a key, returns the index of the entry in the tables, or ABSENT if not found. */ int findEntryByKey(@CheckForNull Object key) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 06 16:06:58 GMT 2023 - 36.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/TreeBasedTableTest.java
table.put("cat", 1, 'b'); table.clear(); populate(table, data); return table; } public void testCreateExplicitComparators() { table = TreeBasedTable.create(Collections.reverseOrder(), Ordering.usingToString()); table.put("foo", 3, 'a'); table.put("foo", 12, 'b'); table.put("bar", 5, 'c'); table.put("cat", 8, 'd');
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 15K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/MapMakerInternalMapTest.java
int result = 0; for (Segment<K, V, ?, ?> segment : map.segments) { AtomicReferenceArray<? extends InternalEntry<K, V, ?>> table = segment.table; for (int i = 0; i < table.length(); i++) { for (InternalEntry<K, V, ?> e = table.get(i); e != null; e = e.getNext()) { if (map.isLiveForTesting(e)) { result++; } } } }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 35.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/MapMakerInternalMapTest.java
int result = 0; for (Segment<K, V, ?, ?> segment : map.segments) { AtomicReferenceArray<? extends InternalEntry<K, V, ?>> table = segment.table; for (int i = 0; i < table.length(); i++) { for (InternalEntry<K, V, ?> e = table.get(i); e != null; e = e.getNext()) { if (map.isLiveForTesting(e)) { result++; } } } }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 35.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/ImmutableSetTest.java
builder.add("a"); assertEquals(1, builder.size); builder.add("b", "c", "d"); assertEquals(4, builder.size); Object[] table = builder.hashTable; assertNotNull(table); assertSame(table, ((RegularImmutableSet<String>) builder.build()).table); } @GwtIncompatible("Builder impl") public void testPresizedBuilderForceCopy() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 13.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableMap.java
* The pointer to a key is stored in hashTable[Hashing.smear(key.hashCode()) % table.length], * save that if that location is already full, we try the next index, and the next, until we * find an empty table position. Since the table has a power-of-two size, we use * & (table.length - 1) instead of % table.length, though. */ @CheckForNull private final transient Object hashTable;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 15 22:32:14 GMT 2024 - 22.7K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/testing/FreshValueGenerator.java
} @Generates static <R, C, V> Table<R, C, V> generateTable(R row, C column, V value) { return generateHashBasedTable(row, column, value); } @Generates static <R, C, V> HashBasedTable<R, C, V> generateHashBasedTable(R row, C column, V value) { HashBasedTable<R, C, V> table = HashBasedTable.create(); table.put(row, column, value); return table; }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 28K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/RateLimiter.java
* * <p>It is possible to configure a {@code RateLimiter} to have a warmup period during which time * the permits issued each second steadily increases until it hits the stable rate. * * <p>As an example, imagine that we have a list of tasks to execute, but we don't want to submit * more than 2 per second: * * <pre>{@code
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 18.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/ValueGraphTest.java
assertThat(graph.incidentEdgeOrder()).isEqualTo(ElementOrder.unordered()); } @Test public void incidentEdgeOrder_stable() { graph = ValueGraphBuilder.directed().incidentEdgeOrder(ElementOrder.stable()).build(); assertThat(graph.incidentEdgeOrder()).isEqualTo(ElementOrder.stable()); } @Test public void hasEdgeConnecting_directed_correct() { graph = ValueGraphBuilder.directed().build();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 06 18:35:19 GMT 2024 - 20K bytes - Viewed (0)