- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 118 for necessarily (0.19 sec)
-
src/index/suffixarray/sais2.go
// happen at sa[i´] for some i´ > i, that is, in the portion of sa we have // yet to scan. A single pass therefore sees indexes j, j-1, j-2, j-3, // and so on, in sorted but not necessarily adjacent order, until it finds // one preceded by an index of type S, at which point it must stop. // // As we scan through the array, we clear the worked entries (sa[i] > 0) to zero,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 18 23:57:18 UTC 2024 - 52.3K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/rewrite.go
func truncate64Fto32F(f float64) float32 { if !isExactFloat32(f) { panic("truncate64Fto32F: truncation is not exact") } if !math.IsNaN(f) { return float32(f) } // NaN bit patterns aren't necessarily preserved across conversion // instructions so we need to do the conversion manually. b := math.Float64bits(f) m := b & ((1 << 52) - 1) // mantissa (a.k.a. significand)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 19:02:52 UTC 2024 - 64.2K bytes - Viewed (0) -
src/cmd/go/internal/modload/load.go
// over test dependencies, then when we load the test of a package that is in // "all" but outside the main module, the dependencies of that test will not // necessarily themselves be in "all". (That configuration does not arise in Go // 1.11–1.15, but it will be possible in Go 1.16+.) // // Loading proceeds from the roots, using a parallel work-queue with a limit on
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 14:56:56 UTC 2024 - 84K bytes - Viewed (0) -
guava/src/com/google/common/reflect/TypeToken.java
* types are parameterized with proper type arguments. * * <p>Subtypes are always listed before supertypes. But the reverse is not true. A type isn't * necessarily a subtype of all the types following. Order between types without subtype * relationship is arbitrary and not guaranteed. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jun 26 21:02:13 UTC 2023 - 53.6K bytes - Viewed (0) -
guava/src/com/google/common/cache/CacheBuilder.java
* table is internally partitioned to try to permit the indicated number of concurrent updates * without contention. Because assignment of entries to these partitions is not necessarily * uniform, the actual concurrency observed may vary. Ideally, you should choose a value to * accommodate as many threads as will ever concurrently modify the table. Using a significantly
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 51.3K bytes - Viewed (0) -
android/guava/src/com/google/common/reflect/TypeToken.java
* types are parameterized with proper type arguments. * * <p>Subtypes are always listed before supertypes. But the reverse is not true. A type isn't * necessarily a subtype of all the types following. Order between types without subtype * relationship is arbitrary and not guaranteed. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jun 26 21:02:13 UTC 2023 - 53.6K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/flatbuffer_import.cc
return_operands.push_back(vals_map[index]); } op_builder.create<mlir::func::ReturnOp>(base_loc, return_operands); return PostProcessFuncOp(func); } // TFLite subgraphs do not necessarily have names, though MLIR functions must // have them, so we generate a name for subgraphs that are missing one here. // Note: in TFLite, the first subgraph is the entry point, and in MLIR that
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 21 18:21:50 UTC 2024 - 66.8K bytes - Viewed (0) -
src/cmd/compile/internal/types/type.go
CMPgt = Cmp(1) ) // Compare compares types for purposes of the SSA back // end, returning a Cmp (one of CMPlt, CMPeq, CMPgt). // The answers are correct for an optimizer // or code generator, but not necessarily typechecking. // The order chosen is arbitrary, only consistency and division // into equivalence classes (Types that compare CMPeq) matters. func (t *Type) Compare(x *Type) Cmp { if x == t { return CMPeq
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 04 14:29:45 UTC 2024 - 49.5K bytes - Viewed (0) -
src/runtime/mgcmark.go
obj := &x.obj[i] if obj.r == nil { // reachable continue } println(" dead stkobj at", hex(gp.stack.lo+uintptr(obj.off)), "of size", obj.r.size) // Note: not necessarily really dead - only reachable-from-ptr dead. } } x.nobj = 0 putempty((*workbuf)(unsafe.Pointer(x))) } if state.buf != nil || state.cbuf != nil || state.freeBuf != nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 18 21:25:11 UTC 2024 - 52.5K bytes - Viewed (0) -
src/runtime/mgcpacer.go
// because these stats are updated independently, we may observe a partial update // including only some values. Thus, we appear to break the invariant. However, // this condition is necessarily transient, so just try again. In the case of a // persistent accounting error, we'll deadlock here. } // Below we compute a goal from memoryLimit. There are a few things to be aware of.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 55.4K bytes - Viewed (0)