- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 57 for linear_1 (0.31 sec)
-
guava/src/com/google/common/collect/ImmutableSet.java
private static final int CUTOFF = (int) (MAX_TABLE_SIZE * DESIRED_LOAD_FACTOR); /** * Returns an array size suitable for the backing array of a hash table that uses open addressing * with linear probing in its implementation. The returned size is the smallest power of two that * can hold setSize elements with the desired load factor. Always returns at least setSize + 2. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed May 08 03:01:02 UTC 2024 - 35.3K bytes - Viewed (0) -
guava/src/com/google/common/hash/Hashing.java
} return false; } @Override public int hashCode() { return Arrays.hashCode(functions); } } /** * Linear CongruentialGenerator to use for consistent hashing. See * http://en.wikipedia.org/wiki/Linear_congruential_generator */ private static final class LinearCongruentialGenerator { private long state;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Apr 09 00:37:15 UTC 2024 - 32.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/MinMaxPriorityQueue.java
* {@link #poll} and {@link #remove()}) run in {@code O(log n) time}. * <li>The {@link #remove(Object)} and {@link #contains} operations require linear ({@code O(n)}) * time. * <li>If you only access one end of the queue, and don't use a maximum size, this class is * functionally equivalent to {@link PriorityQueue}, but significantly slower. * </ul> *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 34K bytes - Viewed (1) -
src/crypto/internal/mlkem768/mlkem768.go
// // Variable and function names, as well as code layout, are selected to // facilitate reviewing the implementation against the NIST FIPS 203 ipd // document. // // Reviewers unfamiliar with polynomials or linear algebra might find the // background at https://words.filippo.io/kyber-math/ useful. import ( "crypto/rand" "crypto/subtle" "errors" "internal/byteorder" "golang.org/x/crypto/sha3" )
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 28.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
* {@link #poll} and {@link #remove()}) run in {@code O(log n) time}. * <li>The {@link #remove(Object)} and {@link #contains} operations require linear ({@code O(n)}) * time. * <li>If you only access one end of the queue, and don't use a maximum size, this class is * functionally equivalent to {@link PriorityQueue}, but significantly slower. * </ul> *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 34K bytes - Viewed (0) -
src/crypto/internal/bigmod/nat.go
// doublings, and switch to square-and-double once the exponent is large // enough to justify the cost of the multiplications. // The threshold is selected experimentally as a linear function of n. threshold := n / 4 // We calculate how many of the most-significant bits of the exponent we can // compute before crossing the threshold, and we do it with doublings. i := bits.UintSize
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 24K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/schema/schema.fbs
union QuantizationDetails { CustomQuantization, } // Parameters for converting a quantized tensor back to float. table QuantizationParameters { // These four parameters are the asymmetric linear quantization parameters. // Given a quantized value q, the corresponding float value f should be: // f = scale * (q - zero_point) // For other quantization types, the QuantizationDetails below is used.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri May 03 18:01:23 UTC 2024 - 41.7K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/analysis/passes/printf/printf.go
// there's little it can do for that. func okPrintfArg(pass *analysis.Pass, call *ast.CallExpr, state *formatState) (ok bool) { var v printVerb found := false // Linear scan is fast enough for a small list. for _, v = range printVerbs { if v.verb == state.verb { found = true break } } // Could current arg implement fmt.Formatter?
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 02:20:05 UTC 2024 - 32.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multisets.java
return entry2.getCount() - entry1.getCount(); // subtracting two nonnegative integers } } /** * An {@link AbstractMultiset} with additional default implementations, some of them linear-time * implementations in terms of {@code elementSet} and {@code entrySet}. */ private abstract static class ViewMultiset<E extends @Nullable Object> extends AbstractMultiset<E> { @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 41.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/Multisets.java
return entry2.getCount() - entry1.getCount(); // subtracting two nonnegative integers } } /** * An {@link AbstractMultiset} with additional default implementations, some of them linear-time * implementations in terms of {@code elementSet} and {@code entrySet}. */ private abstract static class ViewMultiset<E extends @Nullable Object> extends AbstractMultiset<E> { @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 41.4K bytes - Viewed (0)