- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 23 for bitIsSet (0.2 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/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) -
pkg/kubelet/cm/topologymanager/bitmask/bitmask_test.go
func TestRemove(t *testing.T) { tcases := []struct { name string bitsSet []int bitsRemove []int expectedMask string }{ { name: "Set bit 0. Remove bit 0", bitsSet: []int{0}, bitsRemove: []int{0}, expectedMask: "00", }, { name: "Set bits 0 and 1. Remove bit 1", bitsSet: []int{0, 1}, bitsRemove: []int{1}, expectedMask: "01", },
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Nov 03 09:45:09 UTC 2022 - 16.2K 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) -
guava-testlib/test/com/google/common/testing/ArbitraryInstancesTest.java
assertTrue(ArbitraryInstances.get(BitSet.class).isEmpty()); assertTrue(ArbitraryInstances.get(TreeSet.class).isEmpty()); assertTrue(ArbitraryInstances.get(TreeMap.class).isEmpty()); assertFreshInstanceReturned( LinkedList.class, Deque.class, Queue.class, PriorityQueue.class, BitSet.class, TreeSet.class, TreeMap.class); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 22.1K bytes - Viewed (0) -
android/guava-testlib/test/com/google/common/testing/ArbitraryInstancesTest.java
assertTrue(ArbitraryInstances.get(BitSet.class).isEmpty()); assertTrue(ArbitraryInstances.get(TreeSet.class).isEmpty()); assertTrue(ArbitraryInstances.get(TreeMap.class).isEmpty()); assertFreshInstanceReturned( LinkedList.class, Deque.class, Queue.class, PriorityQueue.class, BitSet.class, TreeSet.class, TreeMap.class); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 21.7K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilterStrategies.java
bytes[15], bytes[14], bytes[13], bytes[12], bytes[11], bytes[10], bytes[9], bytes[8]); } }; /** * Models a lock-free array of bits. * * <p>We use this instead of java.util.BitSet because we need access to the array of longs and we * need compare-and-swap. */ static final class LockFreeBitArray { private static final int LONG_ADDRESSABLE_BITS = 6; final AtomicLongArray data;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Oct 10 19:45:10 UTC 2022 - 10.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/HashTestUtils.java
int keyBits = 32; int hashBits = function.bits(); // output loop tests input bit for (int i = 0; i < keyBits; i++) { int same = 0x0; // bitset for output bits with same values int diff = 0x0; // bitset for output bits with different values int count = 0; // originally was 2 * Math.log(...), making it try more times to avoid flakiness issues
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Oct 10 19:45:10 UTC 2022 - 25.3K bytes - Viewed (0)