- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 139 for myrunes (0.13 sec)
-
staging/src/k8s.io/apiserver/pkg/endpoints/filters/warning.go
recorded map[string]bool // ordered tracks warnings added so they can be replayed and truncated if needed ordered []recordedWarning // written tracks how many runes of text have been added as warning headers written int // truncating tracks if we have already exceeded truncateAtTotalRunes and are now truncating warning messages as we add them truncating bool
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jul 01 16:14:06 UTC 2020 - 3.6K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/endpoints/filters/warning_test.go
t.Errorf("expected\n%#v\ngot\n%#v", e, a) } // add an item that exceeds the length and triggers truncation, reducing existing items to 15 runes warningRecorder.AddWarning("", "e") // triggering item, 16 total warningRecorder.AddWarning("", "ffffffffff") // long item to get truncated, 21 total warningRecorder.AddWarning("", "ffffffffff") // duplicate item
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jul 01 16:14:06 UTC 2020 - 4K bytes - Viewed (0) -
test/string_lit.go
`\000\123\x00\312\xFE\u0123\ubabe\U0000babe`, "backslashes 2 (backquote)") assert("\\x\\u\\U\\", `\x\u\U\`, "backslash 3 (backquote)") // test large and surrogate-half runes. perhaps not the most logical place for these tests. var r int32 r = 0x10ffff // largest rune value s = string(r) assert(s, "\xf4\x8f\xbf\xbf", "largest rune") r = 0x10ffff + 1 s = string(r)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Dec 13 01:17:02 UTC 2013 - 3.6K bytes - Viewed (0) -
src/cmd/compile/internal/types/universe.go
// int32 Hence, (bytetype|runtype).Sym.isAlias() is false. // TODO(gri) Should we get rid of this special case (at the cost // of less informative error messages involving bytes and runes)? // NOTE(rsc): No, the error message quality is important. // (Alternatively, we could introduce an OTALIAS node representing // type aliases, albeit at the cost of having to deal with it everywhere).
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jan 26 21:56:49 UTC 2023 - 4K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/profile/prune.go
sample.Location = sample.Location[i+1:] break } if pruneBeneath[id] { sample.Location = sample.Location[i:] break } } } } // RemoveUninteresting prunes and elides profiles using built-in // tables of uninteresting function names. func (p *Profile) RemoveUninteresting() error { var keep, drop *regexp.Regexp var err error if p.DropFrames != "" {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 22 18:58:12 UTC 2022 - 5.5K bytes - Viewed (0) -
src/runtime/utf8.go
rune1Max = 1<<7 - 1 rune2Max = 1<<11 - 1 rune3Max = 1<<16 - 1 // The default lowest and highest continuation byte. locb = 0x80 // 1000 0000 hicb = 0xBF // 1011 1111 ) // countrunes returns the number of runes in s. func countrunes(s string) int { n := 0 for range s { n++ } return n } // decoderune returns the non-ASCII rune at the start of // s[k:] and the index after the rune in s. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 06 02:46:02 UTC 2020 - 3.4K bytes - Viewed (0) -
src/go/doc/comment/text.go
case Italic: out.WriteString(string(t)) case *Link: p.oneLongLine(out, t.Text) case *DocLink: p.oneLongLine(out, t.Text) } } } // wrap wraps words into lines of at most max runes, // minimizing the sum of the squares of the leftover lengths // at the end of each line (except the last, of course), // with a preference for ending lines at punctuation (.,:;). //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:03 UTC 2023 - 8.8K bytes - Viewed (0) -
src/sort/sort_slices_benchmark_test.go
for i := 0; i < b.N; i++ { b.StopTimer() ints := makeSortedInts(N) b.StartTimer() slices.IsSorted(ints) } } // makeRandomStrings generates n random strings with alphabetic runes of // varying lengths. func makeRandomStrings(n int) []string { r := rand.New(rand.NewPCG(42, 0)) var letters = []rune("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ") ss := make([]string, n)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 08 22:59:40 UTC 2024 - 4K bytes - Viewed (0) -
src/vendor/golang.org/x/text/unicode/norm/normalize.go
ss = 0 continue } info := f.info(src, i) if info.size == 0 { if atEOF { // include incomplete runes return n, true } return lastSegStart, true } // This block needs to be before the next, because it is possible to // have an overflow for runes that are starters (e.g. with U+FF9E). switch ss.next(info) { case ssStarter: lastSegStart = i case ssOverflow:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 16 22:26:23 UTC 2022 - 14.9K bytes - Viewed (0) -
src/unicode/utf16/utf16.go
} return append(a, replacementChar) } // Decode returns the Unicode code point sequence represented // by the UTF-16 encoding s. func Decode(s []uint16) []rune { // Preallocate capacity to hold up to 64 runes. // Decode inlines, so the allocation can live on the stack. buf := make([]rune, 0, 64) return decode(s, buf) } // decode appends to buf the Unicode code point sequence represented
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 07 19:08:48 UTC 2024 - 3.9K bytes - Viewed (0)