- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 84 for linear_1 (0.2 sec)
-
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/runtime/malloc.go
// iOS versions. // TODO(mknyszek): Once iOS <14 is deprecated, promote ios/arm64 // to a 48-bit address space like every other arm64 platform. // // WebAssembly currently has a limit of 4GB linear memory. heapAddrBits = (_64bit*(1-goarch.IsWasm)*(1-goos.IsIos*goarch.IsArm64))*48 + (1-_64bit+goarch.IsWasm)*(32-(goarch.IsMips+goarch.IsMipsle)) + 40*goos.IsIos*goarch.IsArm64
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 59.6K bytes - Viewed (0) -
src/runtime/mgc.go
// (100 by default). If GOGC=100 and we're using 4M, we'll GC again when we get to 8M // (this mark is computed by the gcController.heapGoal method). This keeps the GC cost in // linear proportion to the allocation cost. Adjusting GOGC just changes the linear constant // (and also the amount of extra memory used). // Oblets // // In order to prevent long pauses while scanning large objects and to
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 62K 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) -
RELEASE.md
It significantly reduces the peak memory required and latency incurred during restore. * Added a new library for library of matrix-free (iterative) solvers for linear equations, linear least-squares, eigenvalues and singular values in tensorflow/contrib/solvers. Initial version has lanczos bidiagonalization, conjugate gradients and CGLS.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 11 23:24:08 UTC 2024 - 730.3K bytes - Viewed (0) -
testing/performance/src/templates/native-dependents-resources/googleTest/libs/googleTest/1.7.0/include/gtest/internal/gtest-internal.h
// the else branch. struct GTEST_API_ ConstCharPtr { ConstCharPtr(const char* str) : value(str) {} operator bool() const { return true; } const char* value; }; // A simple Linear Congruential Generator for generating random // numbers with a uniform distribution. Unlike rand() and srand(), it // doesn't use global state (and therefore can't interfere with user
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Apr 04 07:21:38 UTC 2024 - 43.1K bytes - Viewed (0) -
src/runtime/symtab.go
res = sect.baseaddr + off - sect.vaddr break } } if res > md.etext && GOARCH != "wasm" { // on wasm, functions do not live in the same address space as the linear memory println("runtime: textAddr", hex(res), "out of range", hex(md.text), "-", hex(md.etext)) throw("runtime: text offset out of range") } } return res }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 40K bytes - Viewed (0)