- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 826 for Kint (0.14 sec)
-
guava-tests/test/com/google/common/primitives/UnsignedIntsTest.java
new int[] {LEAST, LEAST}, new int[] {LEAST, (int) 1L}, new int[] {(int) 1L}, new int[] {(int) 1L, LEAST}, new int[] {GREATEST, (GREATEST - (int) 1L)}, new int[] {GREATEST, GREATEST}, new int[] {GREATEST, GREATEST, GREATEST}); Comparator<int[]> comparator = UnsignedInts.lexicographicalComparator();
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 06 16:10:08 GMT 2024 - 12.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
* link(), which is defined at the end of this file. */ private int getPredecessor(int entry) { return ((int) (link(entry) >>> 32)) - 1; } @Override int getSuccessor(int entry) { return ((int) link(entry)) - 1; } private void setSuccessor(int entry, int succ) { long succMask = (~0L) >>> 32;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableMap.java
} else { /* * Use 32 bits per entry. */ int[] hashTable = new int[tableSize]; Arrays.fill(hashTable, ABSENT); int outI = 0; entries: for (int i = 0; i < n; i++) { int keyIndex = 2 * i + keyOffset; int outKeyIndex = 2 * outI + keyOffset; // requireNonNull is safe because the first `2*n` elements have been filled in.
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/src/com/google/common/collect/DenseImmutableTable.java
this.rowKeyToIndex = Maps.indexMap(rowSpace); this.columnKeyToIndex = Maps.indexMap(columnSpace); rowCounts = new int[rowKeyToIndex.size()]; columnCounts = new int[columnKeyToIndex.size()]; int[] cellRowIndices = new int[cellList.size()]; int[] cellColumnIndices = new int[cellList.size()]; for (int i = 0; i < cellList.size(); i++) { Cell<R, C, V> cell = cellList.get(i); R rowKey = cell.getRowKey();
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Nov 30 21:54:06 GMT 2023 - 10K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
*/ private int getPredecessor(int entry) { return requirePredecessors()[entry] - 1; } @Override int getSuccessor(int entry) { return requireSuccessors()[entry] - 1; } private void setSuccessor(int entry, int succ) { requireSuccessors()[entry] = succ + 1; } private void setPredecessor(int entry, int pred) { requirePredecessors()[entry] = pred + 1;
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/BloomFilterTest.java
for (int i = 1; i < 900; i += 2) { if (!falsePositives.contains(i)) { assertFalse("BF should not contain " + i, bf.mightContain(Integer.toString(i))); } } // Check that there are exactly 29824 false positives for this BF. int knownNumberOfFalsePositives = 29824; int numFpp = 0; for (int i = 1; i < numInsertions * 2; i += 2) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Nov 09 22:49:56 GMT 2023 - 21.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/AtomicDoubleArrayTest.java
} /** get and set for out of bound indices throw IndexOutOfBoundsException */ public void testIndexing() { AtomicDoubleArray aa = new AtomicDoubleArray(SIZE); for (int index : new int[] {-1, SIZE}) { assertThrows(IndexOutOfBoundsException.class, () -> aa.get(index)); assertThrows(IndexOutOfBoundsException.class, () -> aa.set(index, 1.0));
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 13 14:28:25 GMT 2024 - 14.5K bytes - Viewed (0) -
android/guava-testlib/test/com/google/common/testing/anotherpackage/ForwardingWrapperTesterTest.java
} } private interface Adder { int add(int a, int b); } private static class ForwardingArithmetic implements Arithmetic { private final Arithmetic arithmetic; public ForwardingArithmetic(Arithmetic arithmetic) { this.arithmetic = arithmetic; } @Override public int add(int a, int b) { return arithmetic.add(a, b); } @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 15.7K bytes - Viewed (0) -
guava/src/com/google/common/base/SmallCharMatcher.java
// Compute the filter. long filter = 0; int size = chars.cardinality(); boolean containsZero = chars.get(0); // Compute the hash table. char[] table = new char[chooseTableSize(size)]; int mask = table.length - 1; for (int c = chars.nextSetBit(0); c != -1; c = chars.nextSetBit(c + 1)) { // Compute the filter at the same time. filter |= 1L << c; int index = smear(c) & mask; while (true) {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 4.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/AtomicDoubleArrayTest.java
} /** get and set for out of bound indices throw IndexOutOfBoundsException */ public void testIndexing() { AtomicDoubleArray aa = new AtomicDoubleArray(SIZE); for (int index : new int[] {-1, SIZE}) { assertThrows(IndexOutOfBoundsException.class, () -> aa.get(index)); assertThrows(IndexOutOfBoundsException.class, () -> aa.set(index, 1.0));
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 10K bytes - Viewed (0)