- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 13 for symstrings (0.24 sec)
-
cni/pkg/nodeagent/podcgroupns.go
for scanner.Scan() { token := scanner.Text() substrings := strings.SplitN(token, ":", 3) if len(substrings) < 3 { return nil, fmt.Errorf("cgroup entry contains %v colons, but expected at least 2 colons: %q", len(substrings), token) } cgroups = append(cgroups, Cgroup{ HierarchyID: substrings[0], ControllerList: substrings[1], GroupPath: substrings[2], }) }
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Fri Apr 12 21:47:31 UTC 2024 - 11K bytes - Viewed (0) -
src/strings/strings.go
a[i] = s return a[:i+1] } // SplitN slices s into substrings separated by sep and returns a slice of // the substrings between those separators. // // The count determines the number of substrings to return: // // n > 0: at most n substrings; the last substring will be the unsplit remainder. // n == 0: the result is nil (zero substrings) // n < 0: all substrings //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 16:48:16 UTC 2024 - 31.2K bytes - Viewed (0) -
src/index/suffixarray/sais.go
// In that case, we don't remove the final entry. if numLMS > 1 { sa[lastB] = 0 } return numLMS } // induceSubL_8_32 inserts the L-type text indexes of LMS-substrings // into sa, assuming that the final characters of the LMS-substrings // are already inserted into sa, sorted by final character, and at the // right (not left) end of the corresponding character bucket. // Each LMS-substring has the form (as a regexp) /S+L+S/:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 18 23:57:18 UTC 2024 - 32.4K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Splitter.java
import java.util.Iterator; import java.util.LinkedHashMap; import java.util.List; import java.util.Map; import java.util.regex.Pattern; import javax.annotation.CheckForNull; /** * Extracts non-overlapping substrings from an input string, typically by recognizing appearances of * a <i>separator</i> sequence. This separator can be specified as a single {@linkplain #on(char)
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Feb 09 15:49:48 UTC 2024 - 23.7K bytes - Viewed (0) -
guava/src/com/google/common/base/Splitter.java
import java.util.List; import java.util.Map; import java.util.regex.Pattern; import java.util.stream.Stream; import java.util.stream.StreamSupport; import javax.annotation.CheckForNull; /** * Extracts non-overlapping substrings from an input string, typically by recognizing appearances of * a <i>separator</i> sequence. This separator can be specified as a single {@linkplain #on(char)
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 24.4K bytes - Viewed (0) -
src/regexp/regexp.go
// // s: ["", "b", "b", "c", "cadaaae"] // // The count determines the number of substrings to return: // // n > 0: at most n substrings; the last substring will be the unsplit remainder. // n == 0: the result is nil (zero substrings) // n < 0: all substrings func (re *Regexp) Split(s string, n int) []string { if n == 0 { return nil }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 20:50:01 UTC 2024 - 38.5K bytes - Viewed (0) -
src/index/suffixarray/suffixarray_test.go
// The input must have more than N/3 LMS-substrings, // which we arrange by repeating an SLSLSLSLSLSL pattern // like ababab... above, but then we must also arrange // for a large number of distinct LMS-substrings. // We use this pattern: // 1 255 1 254 1 253 1 ... 1 2 1 255 2 254 2 253 2 252 2 ... // This gives approximately 2¹⁵ distinct LMS-substrings. // We need to repeat at least one substring, though,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 14.1K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/cel/library/cost.go
// If the replacement does not make the result longer, use the original string length. replaceCount.Max = 0 retainedSz.Max = sz.Max } else { // Replace the smallest possible substrings with the largest possible replacement // as many times as possible. replaceCount.Max = uint64(math.Ceil(float64(sz.Max) / float64(toReplaceSz.Min))) } // find the shortest replacement:
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Apr 23 17:22:44 UTC 2024 - 20.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractGraphTest.java
static final Integer N4 = 4; static final Integer N5 = 5; static final Integer NODE_NOT_IN_GRAPH = 1000; // TODO(user): Consider separating Strings that we've defined here to capture // identifiable substrings of expected error messages, from Strings that we've defined // here to provide error messages. // TODO(user): Some Strings used in the subclasses can be added as static Strings // here too.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 16.6K bytes - Viewed (0) -
src/debug/gosym/pclntab.go
nfunctab uint32 filetab []byte pctab []byte // points to the pctables. nfiletab uint32 funcNames map[uint32]string // cache the function names strings map[uint32]string // interned substrings of Data, keyed by offset // fileMap varies depending on the version of the object file. // For ver12, it maps the name to the index in the file table. // For ver116, it maps the name to the offset in filetab.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jan 25 19:43:24 UTC 2024 - 18.8K bytes - Viewed (0)