- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 512 for int (0.15 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/HashBiMap.java
} /** Returns an int array of the specified size, filled with ABSENT. */ private static int[] createFilledWithAbsent(int size) { int[] array = new int[size]; Arrays.fill(array, ABSENT); return array; } /** Equivalent to {@code Arrays.copyOf(array, newSize)}, save that the new elements are ABSENT. */ private static int[] expandAndFillWithAbsent(int[] array, int newSize) {
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/src/com/google/common/primitives/ImmutableIntArray.java
} /** Returns an immutable array containing the given values, in order. */ public static ImmutableIntArray of(int e0, int e1, int e2, int e3, int e4) { return new ImmutableIntArray(new int[] {e0, e1, e2, e3, e4}); } /** Returns an immutable array containing the given values, in order. */ public static ImmutableIntArray of(int e0, int e1, int e2, int e3, int e4, int e5) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 16:34:24 GMT 2023 - 18.9K 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) -
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) -
guava/src/com/google/common/collect/ForwardingMultiset.java
* A sensible definition of {@link #setCount(Object, int, int)} in terms of {@link #count(Object)} * and {@link #setCount(Object, int)}. If you override either of these methods, you may wish to * override {@link #setCount(Object, int, int)} to forward to this implementation. * * @since 7.0 */ protected boolean standardSetCount(@ParametricNullness E element, int oldCount, int newCount) {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri May 12 15:26:39 GMT 2023 - 10.4K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
int[] quotients = new int[indexes.length]; int[] remainders = new int[indexes.length]; // The indexes to select. In the worst case, we'll need one each side of each quantile. int[] requiredSelections = new int[indexes.length * 2]; int requiredSelectionsCount = 0; for (int i = 0; i < indexes.length; i++) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 29.9K 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)