- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 29 for bitIsSet (0.13 sec)
-
pkg/ledger/smt.go
} // splitKeys divides the array of keys into 2 so they can update left and right branches in parallel func (s *smt) splitKeys(keys [][]byte, height int) ([][]byte, [][]byte) { for i, key := range keys { if bitIsSet(key, height) { return keys[:i], keys[i:] } } return keys, nil } // maybeAddShortcutToKV adds a shortcut key to the keys array to be updated.
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue Aug 08 16:43:05 UTC 2023 - 14K 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) -
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) -
src/cmd/compile/internal/ssa/poset.go
const uintSize = 32 << (^uint(0) >> 63) // 32 or 64 // bitset is a bit array for dense indexes. type bitset []uint func newBitset(n int) bitset { return make(bitset, (n+uintSize-1)/uintSize) } func (bs bitset) Reset() { for i := range bs { bs[i] = 0 } } func (bs bitset) Set(idx uint32) { bs[idx/uintSize] |= 1 << (idx % uintSize) } func (bs bitset) Clear(idx uint32) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Sep 04 17:23:05 UTC 2023 - 37.2K bytes - Viewed (0)