- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 63 for myrunes (0.23 sec)
-
src/reflect/all_test.go
{V(MyBytes("bytes2")), V(MyString("bytes2"))}, // named []rune {V(string("runes♝")), V(MyRunes("runes♝"))}, {V(MyRunes("runes♕")), V(string("runes♕"))}, {V(MyRunes("runes🙈🙉🙊")), V(MyRunes("runes🙈🙉🙊"))}, {V(MyString("runes♝")), V(MyRunes("runes♝"))}, {V(MyRunes("runes♕")), V(MyString("runes♕"))}, // slice to array {V([]byte(nil)), V([0]byte{})}, {V([]byte{}), V([0]byte{})},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 218.8K bytes - Viewed (0) -
doc/go1.17_spec.html
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 11 20:22:45 UTC 2024 - 211.6K bytes - Viewed (0) -
staging/src/k8s.io/apimachinery/pkg/apis/meta/fuzzer/fuzzer.go
partLen = c.Rand.Intn(63) + 1 // len is [1, 63] } runes := make([]rune, partLen) if partLen == 0 { return string(runes) } runes[0] = validStartEnd[c.Rand.Intn(len(validStartEnd))].choose(c.Rand) for i := range runes[1:] { runes[i+1] = validMiddle[c.Rand.Intn(len(validMiddle))].choose(c.Rand) } runes[len(runes)-1] = validStartEnd[c.Rand.Intn(len(validStartEnd))].choose(c.Rand)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri May 03 15:12:26 UTC 2024 - 9.9K bytes - Viewed (0) -
src/regexp/onepass.go
} instQueue.insert(inst.Out) runes := []rune{} // expand case-folded runes if syntax.Flags(inst.Arg)&syntax.FoldCase != 0 { r0 := inst.Rune[0] runes = append(runes, r0, r0) for r1 := unicode.SimpleFold(r0); r1 != r0; r1 = unicode.SimpleFold(r1) { runes = append(runes, r1, r1) } slices.Sort(runes) } else { runes = append(runes, inst.Rune[0], inst.Rune[0]) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:36:03 UTC 2024 - 13.7K bytes - Viewed (0) -
src/regexp/syntax/parse.go
instSize = 5 * 8 // byte, 2 uint32, slice is 5 64-bit words ) // maxRunes is the maximum number of runes allowed in a regexp tree // counting the runes in all the nodes. // Ignoring character classes p.numRunes is always less than the length of the regexp. // Character classes can make it much larger: each \pL adds 1292 runes. // 128 MB is enough for 32M runes, which is over 26k \pL instances.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 13:59:01 UTC 2024 - 52.1K bytes - Viewed (0) -
pilot/pkg/status/distribution/reporter_test.go
r.RegisterDisconnect(connections[2], sets.New[xds.EventType]("")) // build a report, which should have only two dataplanes, with 50% acking v2 of config rpt, prunes := r.buildReport() r.removeCompletedResource(prunes) Expect(rpt.DataPlaneCount).To(Equal(2)) Expect(rpt.InProgressResources).To(Equal(map[string]int{ myResources[0].String(): 2, myResources[1].String(): 1, myResources[2].String(): 2,
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue Jan 30 17:25:17 UTC 2024 - 4.4K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/cases/trieval.go
// cases, a rune can be both cased and case-ignorable. This is encoded by // cIgnorableCased. A rune of this type is always lower case. Some runes are // cased while not having a mapping. // // A common pattern for scripts in the Unicode standard is for upper and lower // case runes to alternate for increasing rune values (e.g. the accented Latin // ranges starting from U+0100 and U+1E00 among others and some Cyrillic
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 6.3K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/cases/info.go
// Note that we can extend the current algorithm to be much more accurate. This // only makes sense, though, if the performance and/or space penalty of using // the generic breaker is big. Extra data will only be needed for non-cased // runes, which means there are sufficient bits left in the caseType. // ICU prohibits breaking in such cases as well. // For the purpose of title casing we use an approximation of the Unicode Word
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 2.9K bytes - Viewed (0) -
src/regexp/onepass_test.go
}{ { // empty rhs []rune{69, 69}, []rune{}, []rune{69, 69}, []uint32{1}, 1, 2, }, { // identical runes, identical targets []rune{69, 69}, []rune{69, 69}, []rune{}, []uint32{mergeFailed}, 1, 1, }, { // identical runes, different targets []rune{69, 69}, []rune{69, 69}, []rune{}, []uint32{mergeFailed}, 1, 2, }, { // append right-first
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:36:03 UTC 2024 - 4.6K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/unicode/norm/composition.go
return ssOverflow } // The Stream-Safe Text Processing prescribes that the counting can stop // as soon as a starter is encountered. However, there are some starters, // like Jamo V and T, that can combine with other runes, leaving their // successive non-starters appended to the previous, possibly causing an // overflow. We will therefore consider any rune with a non-zero nLead to // be a non-starter. Note that it always hold that if nLead > 0 then
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 14.1K bytes - Viewed (0)