- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 277 for table_1 (0.1 sec)
-
src/strings/replace.go
next: t.next, } t.prefix = t.prefix[:n] t.next = next next.add(key[n:], val, priority, r) } } else if t.table != nil { // Insert into existing table. m := r.mapping[key[0]] if t.table[m] == nil { t.table[m] = new(trieNode) } t.table[m].add(key[1:], val, priority, r) } else { t.prefix = key t.next = new(trieNode) t.next.add("", val, priority, r) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Oct 13 17:10:31 UTC 2023 - 14.5K bytes - Viewed (0) -
src/cmd/link/internal/wasm/asm.go
} writeSecSize(ctxt, sizeOffset) } // writeElementSec writes the section that initializes the tables declared by the "table" section. // The table for CallIndirect gets initialized in a very simple way so that each table index (PC_F value) // maps linearly to the function index (numImports + PC_F). func writeElementSec(ctxt *ld.Link, numImports, numFns uint64) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 22 16:17:48 UTC 2024 - 21.9K bytes - Viewed (0) -
src/cmd/internal/obj/pcln.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 31 20:45:15 UTC 2022 - 11.8K bytes - Viewed (0) -
tensorflow/c/experimental/filesystem/modular_filesystem_registration.cc
return OkStatus(); } // Validates the operations supplied by the plugin. // // Uses the 4 simpler `ValidateHelper(const TF_...*)` to validate each // individual function table and then checks that the function table for a // specific file type exists if the plugin offers support for creating that // type of files. static Status ValidateOperations(const TF_FilesystemPluginOps* ops) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 07 22:08:43 UTC 2023 - 12.8K bytes - Viewed (0) -
src/image/jpeg/writer.go
// - the marker length "\x00\x0c", // - the number of components "\x03", // - component 1 uses DC table 0 and AC table 0 "\x01\x00", // - component 2 uses DC table 1 and AC table 1 "\x02\x11", // - component 3 uses DC table 1 and AC table 1 "\x03\x11", // - the bytes "\x00\x3f\x00". Section B.2.3 of the spec says that for
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:45 UTC 2023 - 17.1K bytes - Viewed (0) -
pkg/util/iptables/testing/parse_test.go
-A KUBE-SERVICES -m comment --comment "kubernetes service nodeports; NOTE: this must be the last rule in this chain" -m addrtype --dst-type LOCAL -j KUBE-NODEPORTS COMMIT `), output: &IPTablesDump{ Tables: []Table{{ Name: iptables.TableFilter, Chains: []Chain{{ Name: iptables.Chain("KUBE-SERVICES"), }, { Name: iptables.Chain("KUBE-EXTERNAL-SERVICES"), }, {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Dec 19 01:20:51 UTC 2023 - 26K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashBiMap.java
} } /** * Returns the bucket (in either the K-to-V or V-to-K tables) where elements with the specified * hash could be found, if present, or could be inserted. */ private int bucket(int hash) { return hash & (hashTableKToV.length - 1); } /** Given a key, returns the index of the entry in the tables, or ABSENT if not found. */ int findEntryByKey(@CheckForNull Object key) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Mar 06 16:06:58 UTC 2023 - 36.4K bytes - Viewed (0) -
platforms/ide/ide-plugins/src/integTest/groovy/org/gradle/plugins/ide/idea/IdeaIntegrationTest.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Mar 22 01:27:55 UTC 2024 - 19.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/MapMaker.java
} /** * Sets the minimum total size for the internal hash tables. For example, if the initial capacity * is {@code 60}, and the concurrency level is {@code 8}, then eight segments are created, each * having a hash table of size eight. Providing a large enough estimate at construction time
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Mar 13 14:30:51 UTC 2023 - 12.8K bytes - Viewed (0) -
src/unicode/letter.go
func (special SpecialCase) ToLower(r rune) rune { r1, hadMapping := to(LowerCase, r, []CaseRange(special)) if r1 == r && !hadMapping { r1 = ToLower(r) } return r1 } // caseOrbit is defined in tables.go as []foldPair. Right now all the // entries fit in uint16, so use uint16. If that changes, compilation // will fail (the constants in the composite literal will not fit in uint16) // and the types here can change to uint32.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 06 20:02:46 UTC 2023 - 10K bytes - Viewed (0)