- Sort Score
- Result 10 results
- Languages All
Results 1 - 2 of 2 for num_uses (0.24 sec)
-
src/strings/strings_test.go
// Make a string of all the runes. numRunes := int(unicode.MaxRune + 1) if testing.Short() { numRunes = 1000 } a := make([]rune, numRunes) for i := range a { a[i] = rune(i) } s := string(a) // convert the cases. upper := ToUpper(s) lower := ToLower(s) // Consistency checks if n := utf8.RuneCountInString(upper); n != numRunes { t.Error("rune count wrong in upper:", n)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 12:58:37 UTC 2024 - 53K 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)