- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 114 for index (0.05 sec)
-
android/guava/src/com/google/common/collect/LinkedListMultimap.java
int expectedModCount = modCount; NodeIterator(int index) { int size = size(); checkPositionIndex(index, size); if (index >= (size / 2)) { previous = tail; nextIndex = size; while (index++ < size) { previous(); } } else { next = head; while (index-- > 0) { next(); } }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Oct 13 14:11:58 UTC 2023 - 27.2K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Ints.java
return i - start; } } return -1; } @Override public Integer set(int index, Integer element) { checkElementIndex(index, size()); int oldValue = array[start + index]; // checkNotNull for GWT (do not optimize) array[start + index] = checkNotNull(element); return oldValue; } @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 29.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableMap.java
* and ABSENT for empty positions. We then look up the keys in alternatingKeysAndValues. * * (The index actually stored is the index of the key in alternatingKeysAndValues, which is * double the index of the entry in entrySet.asList.) * * The basic data structure is described in https://en.wikipedia.org/wiki/Open_addressing.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 15 22:32:14 UTC 2024 - 22.7K bytes - Viewed (0) -
android/guava/src/com/google/common/math/DoubleMath.java
long count = 1; double mean = checkFinite(values[0]); for (int index = 1; index < values.length; ++index) { checkFinite(values[index]); count++; // Art of Computer Programming vol. 2, Knuth, 4.2.2, (15) mean += (values[index] - mean) / count; } return mean; } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
guava/src/com/google/common/math/DoubleMath.java
long count = 1; double mean = checkFinite(values[0]); for (int index = 1; index < values.length; ++index) { checkFinite(values[index]); count++; // Art of Computer Programming vol. 2, Knuth, 4.2.2, (15) mean += (values[index] - mean) / count; } return mean; } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/QuantilesTest.java
} private static double expectedLargeDatasetPercentile(int index) { // We have q=100, k=index, and N=9951. Therefore k*(N-1)/q is 99.5*index. If index is even, that // is an integer 199*index/2. If index is odd, that is halfway between floor(199*index/2) and // ceil(199*index/2). if (index % 2 == 0) { int position = IntMath.divide(199 * index, 2, UNNECESSARY); return PSEUDORANDOM_DATASET_SORTED.get(position);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 29.7K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Stats.java
checkArgument(values.length > 0); double mean = values[0]; for (int index = 1; index < values.length; index++) { double value = values[index]; if (isFinite(value) && isFinite(mean)) { // Art of Computer Programming vol. 2, Knuth, 4.2.2, (15) mean += (value - mean) / (index + 1); } else { mean = calculateNewMeanNonFinite(mean, value); } }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 22K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/AbstractMapBasedMultimap.java
@ParametricNullness public V get(int index) { refreshIfEmpty(); return getListDelegate().get(index); } @Override @ParametricNullness public V set(int index, @ParametricNullness V element) { refreshIfEmpty(); return getListDelegate().set(index, element); } @Override public void add(int index, @ParametricNullness V element) { refreshIfEmpty();
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Oct 13 14:11:58 UTC 2023 - 46.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSet.java
int mask = hashTable.length - 1; for (int i = i0; i - i0 < maxRunBeforeFallback; i++) { int index = i & mask; Object tableEntry = hashTable[index]; if (tableEntry == null) { addDedupedElement(e); hashTable[index] = e; hashCode += eHash; ensureTableCapacity(distinct); // rebuilds table if necessary return this;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed May 08 03:01:02 UTC 2024 - 35.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableMultiset.java
} abstract Entry<E> getEntry(int index); @WeakOuter private final class EntrySet extends IndexedImmutableSet<Entry<E>> { @Override boolean isPartialView() { return ImmutableMultiset.this.isPartialView(); } @Override Entry<E> get(int index) { return getEntry(index); } @Override public int size() {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed May 08 03:01:02 UTC 2024 - 20.6K bytes - Viewed (0)