- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 10 for putData (0.5 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/crypto/cipher/fuzz_test.go
indata := make([]byte, datalen) outgeneric := make([]byte, datalen) outdata := make([]byte, datalen) fuzzencrypt: for { select { case <-timeout.C: break fuzzencrypt default: } rand.Read(indata[:]) cbcGeneric.CryptBlocks(indata, outgeneric) cbcAsm.CryptBlocks(indata, outdata) if !bytes.Equal(outdata, outgeneric) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 03 13:39:12 UTC 2022 - 2K bytes - Viewed (0) -
src/main/java/org/codelibs/core/misc/Base64Util.java
} return outData; } private static void encode(final byte[] inData, final int inIndex, final char[] outData, final int outIndex) { final int i = ((inData[inIndex] & 0xff) << 16) + ((inData[inIndex + 1] & 0xff) << 8) + (inData[inIndex + 2] & 0xff); outData[outIndex] = ENCODE_TABLE[i >> 18]; outData[outIndex + 1] = ENCODE_TABLE[i >> 12 & 0x3f];
Registered: Wed Jun 12 12:50:12 UTC 2024 - Last Modified: Thu Mar 07 01:59:08 UTC 2024 - 6.3K bytes - Viewed (0) -
platforms/core-configuration/model-core/src/main/java/org/gradle/api/internal/provider/MapPropertyExtensions.java
* * @param self the {@link MapProperty} * @param key the key * @param value the value or a {@link Provider} of the value */ @SuppressWarnings("unchecked") public static <K, V> void putAt(MapProperty<K, V> self, K key, Object value) { if (value instanceof Provider<?>) { self.put(key, (Provider) value); } else { self.put(key, (V) value); } }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Sep 28 09:51:04 UTC 2023 - 2.8K 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)