- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 90 for bitrot (0.11 sec)
-
guava-tests/benchmark/com/google/common/base/WhitespaceMatcherBenchmark.java
@BeforeExperiment protected void setUp() { BitSet bitSet = new BitSet(); for (int i = 0; i < OLD_WHITESPACE_TABLE.length(); i++) { bitSet.set(OLD_WHITESPACE_TABLE.charAt(i)); } bitSet.clear(0); bitSet.clear(1); matcher = useNew ? CharMatcher.whitespace() : OLD_WHITESPACE; teststring = newTestString(new Random(1), bitSet, percentMatching); } @Benchmark
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed May 16 22:49:59 UTC 2018 - 3.9K bytes - Viewed (0) -
platforms/core-runtime/base-services/src/main/java/org/gradle/internal/collections/ImmutableFilteredList.java
* to keep track of which items are filtered out of the source list. */ public class ImmutableFilteredList<T> extends AbstractList<T> { private final List<T> source; private final BitSet filter; private ImmutableFilteredList(List<T> source, BitSet filter) { this.source = source; this.filter = filter; } /** * Creates an {@code ImmutableFilteredList} which contains all the elements of {@code source}.
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 08:48:02 UTC 2023 - 3.5K bytes - Viewed (0) -
test/fixedbugs/issue4448.go
package main const b26 uint64 = 0x022fdd63cc95386d var bitPos [64]int func init() { for p := uint(0); p < 64; p++ { bitPos[b26<<p>>58] = int(p) } } func MinPos(w uint64) int { if w == 0 { panic("bit: MinPos(0) undefined") } return bitPos[((w&-w)*b26)>>58] } func main() { const one = uint64(1) for i := 0; i < 64; i++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 02 13:43:18 UTC 2016 - 718 bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/internal/component/model/MultipleCandidateMatcher.java
// Because they are EXTRA attributes, we consider that a // candidate which does NOT provide this value is a better match int candidateCount = candidateAttributeSets.length; BitSet any = new BitSet(candidateCount); for (int c = 0; c < candidateCount; c++) { ImmutableAttributes candidateAttributeSet = candidateAttributeSets[c];
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Oct 10 21:10:11 UTC 2023 - 19.4K bytes - Viewed (0) -
guava/src/com/google/common/base/CharMatcher.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Feb 09 15:49:48 UTC 2024 - 53.8K bytes - Viewed (0) -
android/guava/src/com/google/common/base/SmallCharMatcher.java
package com.google.common.base; import com.google.common.annotations.GwtIncompatible; import com.google.common.annotations.VisibleForTesting; import com.google.common.base.CharMatcher.NamedFastMatcher; import java.util.BitSet; /** * An immutable version of CharMatcher for smallish sets of characters that uses a hash table with * linear probing to check for matches. * * @author Christopher Swenson */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Feb 09 15:49:48 UTC 2024 - 4.5K bytes - Viewed (0) -
android/guava/src/com/google/common/base/CharMatcher.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Feb 09 15:49:48 UTC 2024 - 53.7K bytes - Viewed (0) -
guava/src/com/google/common/base/SmallCharMatcher.java
package com.google.common.base; import com.google.common.annotations.GwtIncompatible; import com.google.common.annotations.VisibleForTesting; import com.google.common.base.CharMatcher.NamedFastMatcher; import java.util.BitSet; /** * An immutable version of CharMatcher for smallish sets of characters that uses a hash table with * linear probing to check for matches. * * @author Christopher Swenson */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Feb 09 15:49:48 UTC 2024 - 4.5K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Booleans.java
* * <p><b>Note:</b> consider representing the array as a {@link java.util.BitSet} instead, * replacing {@code Booleans.contains(array, true)} with {@code !bitSet.isEmpty()} and {@code * Booleans.contains(array, false)} with {@code bitSet.nextClearBit(0) == sizeOfBitSet}. * * @param array an array of {@code boolean} values, possibly empty
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 19.9K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Booleans.java
* * <p><b>Note:</b> consider representing the array as a {@link java.util.BitSet} instead, * replacing {@code Booleans.contains(array, true)} with {@code !bitSet.isEmpty()} and {@code * Booleans.contains(array, false)} with {@code bitSet.nextClearBit(0) == sizeOfBitSet}. * * @param array an array of {@code boolean} values, possibly empty
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 19.9K bytes - Viewed (0)