- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 20 for Bucketize (0.17 sec)
-
guava/src/com/google/common/collect/RegularImmutableBiMap.java
throws BucketOverflowException { int bucketSize = 0; for (; valueBucketHead != null; valueBucketHead = valueBucketHead.getNextInValueBucket()) { checkNoConflict(!value.equals(valueBucketHead.getValue()), "value", entry, valueBucketHead); if (++bucketSize > MAX_HASH_BUCKET_LENGTH) { throw new BucketOverflowException(); } } }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 11.2K bytes - Viewed (0) -
src/cmd/compile/internal/walk/builtin.go
// var hv hmap // h = &hv h = stackTempAddr(init, hmapType) // Allocate one bucket pointed to by hmap.buckets on stack if hint // is not larger than BUCKETSIZE. In case hint is larger than // BUCKETSIZE runtime.makemap will allocate the buckets on the heap. // Maximum key and elem size is 128 bytes, larger objects // are stored with an indirection. So max bucket size is 2048+eps.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 08 22:35:22 UTC 2024 - 31.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/RegularImmutableMap.java
Object key, Object newValue, @CheckForNull ImmutableMapEntry<K, V> keyBucketHead, boolean throwIfDuplicateKeys) throws BucketOverflowException { int bucketSize = 0; for (; keyBucketHead != null; keyBucketHead = keyBucketHead.getNextInKeyBucket()) { if (keyBucketHead.getKey().equals(key)) { if (throwIfDuplicateKeys) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 28 18:11:09 UTC 2024 - 16.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/ir/tf_generated_ops.td
} def TF_BoostedTreesBucketizeOp : TF_Op<"BoostedTreesBucketize", [Pure, SameVariadicOperandSize]> { let summary = "Bucketize each feature based on bucket boundaries."; let description = [{ An op that returns a list of float tensors, where each tensor represents the bucketized values for a single feature. }]; let arguments = (ins
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 11 23:24:08 UTC 2024 - 793K bytes - Viewed (0) -
src/internal/abi/type.go
// function for hashing keys (ptr to key, seed) -> hash Hasher func(unsafe.Pointer, uintptr) uintptr KeySize uint8 // size of key slot ValueSize uint8 // size of elem slot BucketSize uint16 // size of bucket Flags uint32 } // Note: flag values must match those used in the TMAP case // in ../cmd/compile/internal/reflectdata/reflect.go:writeType.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 17 21:09:59 UTC 2024 - 21.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/schema/schema_generated.h
"HASHTABLE_SIZE", "REDUCE_ALL", "CONV_3D_TRANSPOSE", "VAR_HANDLE", "READ_VARIABLE", "ASSIGN_VARIABLE", "BROADCAST_ARGS", "RANDOM_STANDARD_NORMAL", "BUCKETIZE", "RANDOM_UNIFORM", "MULTINOMIAL", "GELU", "DYNAMIC_UPDATE_SLICE", "RELU_0_TO_1", "UNSORTED_SEGMENT_PROD", "UNSORTED_SEGMENT_MAX", "UNSORTED_SEGMENT_SUM",
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 21 18:21:50 UTC 2024 - 1M bytes - Viewed (0) -
src/cmd/link/internal/ld/dwarf.go
keysize = int64(d.arch.PtrSize) indirectKey = true } if valsize > abi.MapMaxElemBytes { valsize = int64(d.arch.PtrSize) indirectVal = true } // Construct type to represent an array of BucketSize keys keyname := d.nameFromDIESym(keytype) dwhks := d.mkinternaltype(ctxt, dwarf.DW_ABRV_ARRAYTYPE, "[]key", keyname, "", func(dwhk *dwarf.DWDie) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 16:25:18 UTC 2024 - 72.4K bytes - Viewed (0) -
RELEASE.md
# Release 2.8.0 ## Major Features and Improvements * `tf.lite`: * Added TFLite builtin op support for the following TF ops: * `tf.raw_ops.Bucketize` op on CPU. * `tf.where` op for data types `tf.int32`/`tf.uint32`/`tf.int8`/`tf.uint8`/`tf.int64`. * `tf.random.normal` op for output data type `tf.float32` on CPU.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 11 23:24:08 UTC 2024 - 730.3K bytes - Viewed (0) -
src/runtime/export_test.go
// a series of emptyRest cells. h := *(**hmap)(unsafe.Pointer(&m)) i := any(m) t := *(**maptype)(unsafe.Pointer(&i)) for x := 0; x < 1<<h.B; x++ { b0 := (*bmap)(add(h.buckets, uintptr(x)*uintptr(t.BucketSize))) n := 0 for b := b0; b != nil; b = b.overflow(t) { for i := 0; i < abi.MapBucketCount; i++ { if b.tophash[i] != emptyRest { n++ } } } k := 0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:50:53 UTC 2024 - 46.1K bytes - Viewed (0) -
src/reflect/type.go
} if etyp.Size_ > abi.MapMaxElemBytes { mt.ValueSize = uint8(goarch.PtrSize) mt.Flags |= 2 // indirect value } else { mt.MapType.ValueSize = uint8(etyp.Size_) } mt.MapType.BucketSize = uint16(mt.Bucket.Size_) if isReflexive(ktyp) { mt.Flags |= 4 } if needKeyUpdate(ktyp) { mt.Flags |= 8 } if hashMightPanic(ktyp) { mt.Flags |= 16 } mt.PtrToThis = 0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 85.5K bytes - Viewed (0)