- Sort Score
- Result 10 results
- Languages All
Results 111 - 120 of 620 for power9 (0.12 sec)
-
src/math/sqrt.go
// ----------------------------------------- // Method: // Bit by bit method using integer arithmetic. (Slow, but portable) // 1. Normalization // Scale x to y in [1,4) with even powers of 2: // find an integer k such that 1 <= (y=x*2**(2k)) < 4, then // sqrt(x) = 2**k * sqrt(y) // 2. Bit by bit computation // Let q = sqrt(y) truncated to i bit after binary point (q = 1),
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 15 17:07:57 UTC 2022 - 4.8K bytes - Viewed (0) -
src/runtime/sigtab_linux_mipsx.go
/* 17 */ {_SigNotify, "SIGUSR2: user-defined signal 2"}, /* 18 */ {_SigNotify + _SigUnblock + _SigIgn, "SIGCHLD: child status has changed"}, /* 19 */ {_SigNotify, "SIGPWR: power failure restart"}, /* 20 */ {_SigNotify + _SigIgn, "SIGWINCH: window size change"}, /* 21 */ {_SigNotify + _SigIgn, "SIGURG: urgent condition on socket"}, /* 22 */ {_SigNotify, "SIGIO: i/o now possible"},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 28 18:17:57 UTC 2021 - 6K bytes - Viewed (0) -
android/guava/src/com/google/common/math/DoubleUtils.java
static boolean isFinite(double d) { return getExponent(d) <= MAX_EXPONENT; } static boolean isNormal(double d) { return getExponent(d) >= MIN_EXPONENT; } /* * Returns x scaled by a power of 2 such that it is in the range [1, 2). Assumes x is positive, * normal, and finite. */ static double scaleNormalize(double x) { long significand = doubleToRawLongBits(x) & SIGNIFICAND_MASK;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 28 15:37:52 UTC 2021 - 5.1K bytes - Viewed (0) -
docs/en/docs/advanced/dataclasses.md
Keep in mind that dataclasses can't do everything Pydantic models can do. So, you might still need to use Pydantic models. But if you have a bunch of dataclasses laying around, this is a nice trick to use them to power a web API using FastAPI. 🤓 ## Dataclasses in `response_model` You can also use `dataclasses` in the `response_model` parameter: ```Python hl_lines="1 7-13 19" {!../../../docs_src/dataclasses/tutorial002.py!}
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Thu Apr 18 19:53:19 UTC 2024 - 4.1K bytes - Viewed (0) -
docs/pt/docs/features.md
Isso também significa que em muitos casos você poderá passar o mesmo objeto que você receber de uma requisição **diretamente para o banco de dados**, já que tudo é validado automaticamente. O mesmo se aplica no sentido inverso, em muitos casos você poderá simplesmente passar o objeto que você recebeu do banco de dados **diretamente para o cliente**.
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Thu Apr 18 19:53:19 UTC 2024 - 10.4K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/flowcontrol/fairqueuing/integrator.go
results.Min, results.Max = igr.min, igr.max results.Duration = igr.moments.ElapsedSeconds results.Average, results.Deviation = igr.moments.AvgAndStdDev() return } // Moments are the integrals of the 0, 1, and 2 powers of some // variable X over some range of time. type Moments struct { ElapsedSeconds float64 // integral of dt IntegralX float64 // integral of x dt IntegralXX float64 // integral of x*x dt }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Nov 03 17:37:20 UTC 2022 - 5K bytes - Viewed (0) -
src/sync/poolqueue.go
// that we can atomically add to it and the overflow is // harmless. headTail atomic.Uint64 // vals is a ring buffer of interface{} values stored in this // dequeue. The size of this must be a power of 2. // // vals[i].typ is nil if the slot is empty and non-nil // otherwise. A slot is still in use until *both* the tail // index has moved beyond it and typ has been set to nil. This
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 18:12:29 UTC 2024 - 8.3K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/lca.go
p2 := lca.blocks[b.ID].pos if p1 > p2 { p1, p2 = p2, p1 } // The lowest common ancestor is the minimum depth block // on the tour from p1 to p2. We've precomputed minimum // depth blocks for powers-of-two subsequences of the tour. // Combine the right two precomputed values to get the answer. logS := uint(log64(int64(p2 - p1))) bid1 := lca.rangeMin[logS][p1] bid2 := lca.rangeMin[logS][p2-1<<logS+1]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 30 21:52:15 UTC 2023 - 3.8K bytes - Viewed (0) -
platforms/documentation/docs/src/samples/build-organization/composite-builds/hierarchical-multirepo/README.adoc
+--- org.sample:number-utils:1.0 -> project :number-utils \--- org.sample:string-utils:1.0 \--- org.apache.commons:commons-lang3:3.12.0 ``` == Including an external library as a submodule The power of this configuration can be demonstrated by adding the external 'commons-lang' build directly to the composite. ```
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Nov 27 17:53:42 UTC 2023 - 3.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/stablehlo/transforms/passes.h
std::unique_ptr<OperationPass<ModuleOp>> CreateUnfoldSplatConstantPass(); // Create a pass that legalizes MHLO to TFLite dialect. std::unique_ptr<OperationPass<ModuleOp>> CreateLegalizeHloToTfLitePass(); // Creates a pass that lowers stablehlo composite ops to tflite ops. std::unique_ptr<OperationPass<ModuleOp>> CreateCompositeLoweringPass(); // Adds the HLO to TF rewrite patterns to the specified pattern list.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 21:59:06 UTC 2024 - 3.2K bytes - Viewed (0)