- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 1,430 for Kint (0.17 sec)
-
android/guava/src/com/google/common/collect/ForwardingList.java
* #remove(int)}. If you override any of these methods, you may wish to override {@link * #listIterator(int)} to forward to this implementation. * * @since 7.0 */ protected ListIterator<E> standardListIterator(int start) { return Lists.listIteratorImpl(this, start); } /**
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri May 12 15:26:39 GMT 2023 - 7.9K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/DoubleMathBenchmark.java
} @Benchmark int isMathematicalInteger(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; if (DoubleMath.isMathematicalInteger(doubles[j])) { tmp++; } } return tmp; } @Benchmark int isPowerOfTwo(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 2.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-tests/test/com/google/common/hash/Crc32cHashFunctionTest.java
private static final int CRC32C_GENERATOR = 0x1EDC6F41; // 0x11EDC6F41 private static final int CRC32C_GENERATOR_FLIPPED = Integer.reverse(CRC32C_GENERATOR); public void testCrc32cByteTable() { // See Hacker's Delight 2nd Edition, Figure 14-7. int[] expected = new int[256]; for (int i = 0; i < expected.length; i++) { int crc = i; for (int j = 7; j >= 0; j--) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Dec 23 18:30:33 GMT 2020 - 6.5K 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/benchmark/com/google/common/collect/BinaryTreeTraverserBenchmark.java
@Param({"1", "100", "10000", "1000000"}) int size; @Param Traversal traversal; @Param({"1234"}) SpecialRandom rng; @BeforeExperiment void setUp() { this.view = traversal.view(topology.createTree(size, rng).get(), VIEWER); } @Benchmark int traversal(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { for (BinaryNode node : view) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 26 19:18:53 GMT 2019 - 4.9K 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-testlib/src/com/google/common/testing/RelationshipTester.java
} } private Item<T> getItem(int groupNumber, int itemNumber) { return new Item<>(groups.get(groupNumber).get(itemNumber), groupNumber, itemNumber); } static final class Item<T> { final T value; final int groupNumber; final int itemNumber; Item(T value, int groupNumber, int itemNumber) { this.value = value; this.groupNumber = groupNumber;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Apr 25 11:57:12 GMT 2023 - 5.9K bytes - Viewed (0)