- Sort Score
- Result 10 results
- Languages All
Results 1 - 7 of 7 for putData (0.08 sec)
-
android/guava/src/com/google/common/hash/BloomFilterStrategies.java
other.data.length()); for (int i = 0; i < data.length(); i++) { putData(i, other.data.get(i)); } } /** * ORs the bits encoded in the {@code i}th {@code long} in the underlying {@link * AtomicLongArray} with the given value. */ void putData(int i, long longValue) { long ourLongOld; long ourLongNew; boolean changedAnyBits = true;
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/src/com/google/common/hash/BloomFilterStrategies.java
other.data.length()); for (int i = 0; i < data.length(); i++) { putData(i, other.data.get(i)); } } /** * ORs the bits encoded in the {@code i}th {@code long} in the underlying {@link * AtomicLongArray} with the given value. */ void putData(int i, long longValue) { long ourLongOld; long ourLongNew; boolean changedAnyBits = true;
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/src/com/google/common/hash/BloomFilter.java
LockFreeBitArray dataArray = new LockFreeBitArray(LongMath.checkedMultiply(dataLength, 64L)); for (int i = 0; i < dataLength; i++) { dataArray.putData(i, din.readLong()); } return new BloomFilter<>(dataArray, numHashFunctions, funnel, strategy); } catch (IOException e) { throw e; } catch (Exception e) { // sneaky checked exception
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 26.3K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilter.java
LockFreeBitArray dataArray = new LockFreeBitArray(LongMath.checkedMultiply(dataLength, 64L)); for (int i = 0; i < dataLength; i++) { dataArray.putData(i, din.readLong()); } return new BloomFilter<>(dataArray, numHashFunctions, funnel, strategy); } catch (IOException e) { throw e; } catch (Exception e) { // sneaky checked exception
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 23.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/rulegen.go
blockName, outdata := getBlockInfo(outop, arch) if len(t) < outdata.controls { log.Fatalf("incorrect number of output arguments in %s, got %v wanted at least %v", rule, len(s), outdata.controls) } // Check if newsuccs is the same set as succs. succs := s[data.controls:] newsuccs := t[outdata.controls:] m := map[string]bool{} for _, succ := range succs {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Sep 02 22:09:21 UTC 2023 - 48.7K bytes - Viewed (0) -
src/math/big/nat.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 21:31:58 UTC 2024 - 31.7K bytes - Viewed (0) -
src/math/big/natdiv.go
tmp := getNat(3 * len(v)) temps := make([]*nat, recDepth) clear(z) z.divRecursiveStep(u, v, 0, tmp, temps) // Free temporaries. for _, n := range temps { if n != nil { putNat(n) } } putNat(tmp) } // divRecursiveStep is the actual implementation of recursive division. // It adds ⌊u/v⌋ to z and overwrites u with the remainder r. // z must be large enough to hold ⌊u/v⌋.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 34.4K bytes - Viewed (0)