- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 1,253 for pairOf (0.25 sec)
-
android/guava/src/com/google/common/collect/TreeMultimap.java
* keys according to the above key ordering, and for each key they iterate across the values * according to the value ordering. * * <p>The multimap does not store duplicate key-value pairs. Adding a new key-value pair equal to an * existing key-value pair has no effect. * * <p>Null keys and values are permitted (provided, of course, that the respective comparators
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat Mar 09 00:21:17 UTC 2024 - 8.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/TreeMultimap.java
* keys according to the above key ordering, and for each key they iterate across the values * according to the value ordering. * * <p>The multimap does not store duplicate key-value pairs. Adding a new key-value pair equal to an * existing key-value pair has no effect. * * <p>Null keys and values are permitted (provided, of course, that the respective comparators
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat Mar 09 00:21:17 UTC 2024 - 8.7K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/quantization/import_quant_stats_pass.cc
// match. // The `int` in the following two containers are to specify the result index // of the given op. -1 indicates all the floating-point results. llvm::StringMap<std::pair<int, const QuantParamsEntry>> name_to_info_; llvm::StringMap<std::pair<int, const QuantParamsEntry>> regex_to_info_; }; } // namespace bool ImportQuantStatsPass::ParseQuantStats(const std::string &stats_str) { QuantizationInfo quant_stats;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Mar 08 10:41:08 UTC 2024 - 9.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/utils/fake_quant_utils.h
return success(); } bool use_fake_quant_num_bits_; }; // Removes the wrapper of the tf.FakeQuant* ops and creates the tfl.quantize // and tfl.dequantize pairs before tf.FakeQuant* being foled. LogicalResult ConvertFakeQuantOps(func::FuncOp func, MLIRContext *ctx, bool use_fake_quant_num_bits = false);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 6.6K bytes - Viewed (0) -
docs/fr/docs/advanced/additional-responses.md
```Python old_dict = { "old key": "old value", "second old key": "second old value", } new_dict = {**old_dict, "new key": "new value"} ``` Ici, `new_dict` contiendra toutes les paires clé-valeur de `old_dict` plus la nouvelle paire clé-valeur : ```Python { "old key": "old value", "second old key": "second old value", "new key": "new value", } ```
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Thu Apr 18 19:53:19 UTC 2024 - 9.6K bytes - Viewed (0) -
test/typeparam/metrics.go
return _Keys(m.m) } type key2[T1, T2 comparable] struct { f1 T1 f2 T2 } // _Metric2 tracks metrics of pairs of values. type _Metric2[T1, T2 comparable] struct { mu sync.Mutex m map[key2[T1, T2]]int } // Add adds another instance of some pair of values. func (m *_Metric2[T1, T2]) Add(v1 T1, v2 T2) { m.mu.Lock() defer m.mu.Unlock() if m.m == nil { m.m = make(map[key2[T1, T2]]int)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 01 19:45:34 UTC 2022 - 4.4K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/endpoints/discovery/aggregated/handler_test.go
// Give the groups deterministic names for i := range apis.Items { apis.Items[i].Name = fmt.Sprintf("%v.%v.com", i, name) } pairs = append(pairs, pair{manager, apis}) } expectedResult := []apidiscoveryv2.APIGroupDiscovery{} groupCounter := 0 for _, p := range pairs { for gi, g := range p.apis.Items { for vi, v := range g.Versions { p.manager.AddGroupVersion(g.Name, v)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat Mar 02 00:29:39 UTC 2024 - 28.6K bytes - Viewed (0) -
src/compress/bzip2/huffman.go
// First we sort the code length assignments by ascending code length, // using the symbol value to break ties. pairs := make([]huffmanSymbolLengthPair, len(lengths)) for i, length := range lengths { pairs[i].value = uint16(i) pairs[i].length = length } slices.SortFunc(pairs, func(a, b huffmanSymbolLengthPair) int { if c := cmp.Compare(a.length, b.length); c != 0 { return c }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 15 17:44:37 UTC 2024 - 6.7K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/http/HttpHeaders.kt
} } return commaFound } private fun Buffer.startsWith(prefix: Byte): Boolean = !exhausted() && this[0] == prefix /** * Reads a double-quoted string, unescaping quoted pairs like `\"` to the 2nd character in each * sequence. Returns the unescaped string, or null if the buffer isn't prefixed with a * double-quoted string. */ @Throws(EOFException::class)
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 7.2K bytes - Viewed (0) -
src/maps/iter.go
if !yield(v) { return } } } } // Insert adds the key-value pairs from seq to m. // If a key in seq already exists in m, its value will be overwritten. func Insert[Map ~map[K]V, K comparable, V any](m Map, seq iter.Seq2[K, V]) { for k, v := range seq { m[k] = v } } // Collect collects key-value pairs from seq into a new map // and returns it.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 13:41:45 UTC 2024 - 1.6K bytes - Viewed (0)