- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 48 for bitIsSet (0.14 sec)
-
internal/pubsub/mask.go
package pubsub import ( "math" "math/bits" ) // Mask allows filtering by a bitset mask. type Mask uint64 const ( // MaskAll is the mask for all entries. MaskAll Mask = math.MaxUint64 ) // MaskFromMaskable extracts mask from an interface. func MaskFromMaskable(m Maskable) Mask { return Mask(m.Mask()) } // Contains returns whether *all* flags in other is present in t. func (t Mask) Contains(other Mask) bool {
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Tue Jul 05 21:45:49 UTC 2022 - 1.3K 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) -
pkg/ledger/smt_test.go
t.Fatal("leaf shortcut didn't move up to root") } key1 := make([]byte, 8) // set the last bit bitSet(key1, 63) keys := [][]byte{key0, key1} values = [][]byte{defaultLeaf, getFreshData(1)[0]} _, err := smt.Update(keys, values) assert.NoError(t, err) } func bitSet(bits []byte, i int) { bits[i/8] |= 1 << uint(7-i%8) } func TestSmtRaisesError(t *testing.T) {
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue Aug 08 16:43:05 UTC 2023 - 7.9K 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) -
src/math/big/int_test.go
old1 := altBit(z1, i) if old != old1 { t.Errorf("bitset: inconsistent value for Bit(%s, %d), got %v want %v", z1, i, old, old1) } z := new(Int).SetBit(z, i, 1) z1 := altSetBit(new(Int), z1, i, 1) if z.Bit(i) == 0 { t.Errorf("bitset: bit %d of %s got 0 want 1", i, x) } if z.Cmp(z1) != 0 { t.Errorf("bitset: inconsistent value after SetBit 1, got %s want %s", z, z1) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 18:42:28 UTC 2024 - 58.5K 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) -
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) -
android/guava/src/com/google/common/hash/BloomFilter.java
// Serial form: // 1 signed byte for the strategy // 1 unsigned byte for the number of hash functions // 1 big endian int, the number of longs in our bitset // N big endian longs of our bitset DataOutputStream dout = new DataOutputStream(out); dout.writeByte(SignedBytes.checkedCast(strategy.ordinal()));
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 23.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Sets.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 77.3K bytes - Viewed (0)