- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 94 for hash_table (0.22 sec)
-
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
* elements, including {@code null}, are permitted. * * <p>{@code contains(x)}, {@code add(x)} and {@code remove(x)}, are all (expected and amortized) * constant time operations. Expected in the hashtable sense (depends on the hash function doing a * good job of distributing the elements to the buckets to a distribution not far from uniform), and * amortized since some operations can trigger a hash table resize. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Feb 05 21:38:59 UTC 2024 - 9.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/quantization/tensorflow/passes/passes.h
// pass is a part of the ConvertTpuModelToCpu pass to support BF16 optimized TPU // model quantization. std::unique_ptr<OperationPass<ModuleOp>> CreateCastBf16OpsToF32Pass(); // Creates a pass that lifts HashTable ops as function arguments. In the graph // execution mode, resource ops with the same `shared_name` attribute point to // the same underlying resource. This is not true in the eager execution mode.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri May 10 04:07:09 UTC 2024 - 12.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashMap.java
* remove) are supported. Null keys and values are supported. * * <p>{@code containsKey(k)}, {@code put(k, v)} and {@code remove(k)} are all (expected and * amortized) constant time operations. Expected in the hashtable sense (depends on the hash * function doing a good job of distributing the elements to the buckets to a distribution not far * from uniform), and amortized since some operations can trigger a hash table resize. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 10.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/LinkedHashMultimapTest.java
(LinkedHashMultimap.ValueSet) multimap.backingMap().get("a"); assertEquals(z, valueSet.size()); assertFalse( Hashing.needsResizing( valueSet.size(), valueSet.hashTable.length, LinkedHashMultimap.VALUE_SET_LOAD_FACTOR)); } } private Multimap<String, Integer> initializeMultimap5() { Multimap<String, Integer> multimap = LinkedHashMultimap.create();
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 21 10:16:44 UTC 2024 - 18.6K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/canonicalize.td
(TF_VariableV2Op:$dest $shape, $container, $shard_name), [], [(CopyAttrs $src, $dest)]>; //===----------------------------------------------------------------------===// // Canonicalize tf.HashTable and its user ops to V2 versions. //===----------------------------------------------------------------------===// def HashTableAndInitializeTableToV2 : Pat< (TF_InitializeTableFromTextFileOp:$src (TF_HashTableOp $container,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Dec 06 18:42:28 UTC 2023 - 17K bytes - Viewed (0) -
migrator/migrator.go
return tx.Exec("DROP TABLE IF EXISTS ?", m.CurrentTable(stmt)).Error }); err != nil { return err } } return nil } // HasTable returns table exists or not for value, value could be a struct or string func (m Migrator) HasTable(value interface{}) bool { var count int64 m.RunWithValue(value, func(stmt *gorm.Statement) error { currentDatabase := m.DB.Migrator().CurrentDatabase()
Registered: Wed Jun 12 16:27:09 UTC 2024 - Last Modified: Fri Apr 26 07:15:49 UTC 2024 - 29K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashBiMap.java
return findEntry(value, valueHash, hashTableVToK, nextInBucketVToK, values); } int findEntry( @CheckForNull Object o, int oHash, int[] hashTable, int[] nextInBucket, @Nullable Object[] array) { for (int entry = hashTable[bucket(oHash)]; entry != ABSENT; entry = nextInBucket[entry]) { if (Objects.equal(array[entry], o)) { return entry; } } return ABSENT;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Mar 06 16:06:58 UTC 2023 - 36.4K bytes - Viewed (0) -
src/runtime/map_test.go
// behave differently. m[nan] = 1 m[nan] = 2 m[nan] += 4 cnt := 0 s := 0 growflag := true for k, v := range m { if growflag { // force a hashtable resize for i := 0; i < 50; i++ { m[float64(i)] = i } for i := 50; i < 100; i++ { m[float64(i)] += i } growflag = false } if k != k { cnt++ s |= v }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 33.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/transforms/passes.td
let constructor = "CreateInsertCallOnceOpFromSessionInitializerPass()"; let dependentDialects = ["TFL::TensorFlowLiteDialect"]; } def LegalizeHashTablesPass : Pass<"tfl-legalize-hashtables-tf", "mlir::ModuleOp"> { let summary = "Legalize TensorFlow hash tables to TensorFlow Lite dialect."; let constructor = "CreateLegalizeHashTablesPass()"; let dependentDialects = ["TFL::TensorFlowLiteDialect"]; }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Apr 24 20:30:06 UTC 2024 - 22.6K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/schema/schema_v3b.fbs
PLACEHOLDER_FOR_GREATER_OP_CODES = 127, CUMSUM = 128, CALL_ONCE = 129, BROADCAST_TO = 130, RFFT2D = 131, CONV_3D = 132, IMAG=133, REAL=134, COMPLEX_ABS=135, HASHTABLE = 136, HASHTABLE_FIND = 137, HASHTABLE_IMPORT = 138, HASHTABLE_SIZE = 139, REDUCE_ALL = 140, CONV_3D_TRANSPOSE = 141, VAR_HANDLE = 142, READ_VARIABLE = 143, ASSIGN_VARIABLE = 144, }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 28 14:28:27 UTC 2024 - 30K bytes - Viewed (0)