- Sort Score
- Result 10 results
- Languages All
Results 1 - 6 of 6 for putData (0.15 sec)
-
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/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/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)