- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 60 for variants (0.2 sec)
-
src/runtime/mbitmap.go
// with the following instructions: // // 00000000: stop // 0nnnnnnn: emit n bits copied from the next (n+7)/8 bytes // 10000000 n c: repeat the previous n bits c times; n, c are varints // 1nnnnnnn c: repeat the previous n bits c times; c is a varint // runGCProg returns the number of 1-bit entries written to memory. func runGCProg(prog, dst *byte) uintptr { dstStart := dst // Bits waiting to be written to memory.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 00:18:55 UTC 2024 - 60K bytes - Viewed (0) -
src/runtime/mgcmark.go
unlock(&sched.gFree.lock) } // markrootSpans marks roots for one shard of markArenas. // //go:nowritebarrier func markrootSpans(gcw *gcWork, shard int) { // Objects with finalizers have two GC-related invariants: // // 1) Everything reachable from the object must be marked. // This ensures that when we pass the object to its finalizer, // everything the finalizer can reach will be retained. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 18 21:25:11 UTC 2024 - 52.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/MapMakerInternalMap.java
* bits. * * @param h hash code */ static int rehash(int h) { // Spread bits to regularize both segment and index locations, // using variant of single-word Wang/Jenkins hash. // TODO(kevinb): use Hashing/move this to Hashing? h += (h << 15) ^ 0xffffcd7d; h ^= (h >>> 10); h += (h << 3); h ^= (h >>> 6);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat May 18 03:24:34 UTC 2024 - 90.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/ir/tf_ops.td
Creates a dataset that invokes its 'next' region to generate elements. Conceptually, within MLIR, we treat this op as if it fills a buffer with all the results right away, and those results are then passed (through the variant tensor result) to MakeIterator / IteratorGetNext. Note that the actual TF implementation differs: It generates the next element just in time, during IteratorGetNext. init_extra_args: Additional arguments to pass to 'init'.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Apr 24 04:08:35 UTC 2024 - 90.5K bytes - Viewed (0) -
src/cmd/go/internal/modget/get.go
// example.com/foo might be found in module example.com and also in module // example.com/foo, and those modules may have independent v0.1.0 tags — so the // input 'example.com/foo@v0.1.0' could syntactically refer to the variant of // the package loaded from either module! (See mod_get_ambiguous_pkg.txt.) // If the argument is ambiguous, the user can often disambiguate by specifying // explicit versions for *all* of the potential module paths involved.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 18:26:32 UTC 2024 - 66.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
* bits. * * @param h hash code */ static int rehash(int h) { // Spread bits to regularize both segment and index locations, // using variant of single-word Wang/Jenkins hash. // TODO(kevinb): use Hashing/move this to Hashing? h += (h << 15) ^ 0xffffcd7d; h ^= (h >>> 10); h += (h << 3); h ^= (h >>> 6);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat May 18 03:24:34 UTC 2024 - 90.8K bytes - Viewed (0) -
src/runtime/map.go
// // Do not remove or change the type signature. // See go.dev/issue/67401. // //go:linkname reflect_makemap reflect.makemap func reflect_makemap(t *maptype, cap int) *hmap { // Check invariants and reflects math. if t.Key.Equal == nil { throw("runtime.reflect_makemap: unsupported map key type") } if t.Key.Size_ > abi.MapMaxKeyBytes && (!t.IndirectKey() || t.KeySize != uint8(goarch.PtrSize)) ||
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 57.6K bytes - Viewed (0) -
src/runtime/mheap.go
// Non-preemptible because it is used by write barriers. // //go:nowritebarrier //go:nosplit func inheap(b uintptr) bool { return spanOfHeap(b) != nil } // inHeapOrStack is a variant of inheap that returns true for pointers // into any allocated heap span. // //go:nowritebarrier //go:nosplit func inHeapOrStack(b uintptr) bool { s := spanOf(b) if s == nil || b < s.base() {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:31:00 UTC 2024 - 78K bytes - Viewed (0) -
src/cmd/go/internal/modload/load.go
// // (We will filter out the extra tests explicitly in computePatternAll.) wantTest = true case ld.allPatternIsRoot && ld.allClosesOverTests && new.has(pkgInAll): // This variant of the "all" pattern includes imports of tests of every // package that is itself in "all", and pkg is in "all", so its test is // also in "all" (as above). wantTest = true
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 14:56:56 UTC 2024 - 84K bytes - Viewed (0) -
src/cmd/link/internal/ld/lib.go
int64) (relocatedOffset int64, nExtReloc int, ok bool) // Archrelocvariant is a second arch-specific hook used for // relocation processing; it handles relocations where r.Type is // insufficient to describe the relocation (r.Variant != // sym.RV_NONE). Here "rel" is the relocation being applied, "sym" // is the symbol containing the chunk of data to which the // relocation applies, and "off" is the contents of the
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 21 18:45:27 UTC 2024 - 88.6K bytes - Viewed (0)