- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 239 for rune1 (0.14 sec)
-
src/strconv/makeisprint.go
fmt.Fprintf(&buf, "\t%#04x,\n", r-0x10000) } fmt.Fprintf(&buf, "}\n\n") // The list of graphic but not "printable" runes is short. Just make one easy table. fmt.Fprintf(&buf, "// isGraphic lists the graphic runes not matched by IsPrint.\n") fmt.Fprintf(&buf, "var isGraphic = []uint16{\n") for r := rune(0); r <= unicode.MaxRune; r++ { if unicode.IsPrint(r) != unicode.IsGraphic(r) { // Sanity check.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 11 18:56:17 UTC 2024 - 4.3K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/unicode/norm/forminfo.go
func (p Properties) CCC() uint8 { if p.index >= firstCCCZeroExcept { return 0 } return ccc[p.ccc] } // LeadCCC returns the CCC of the first rune in the decomposition. // If there is no decomposition, LeadCCC equals CCC. func (p Properties) LeadCCC() uint8 { return ccc[p.ccc] } // TrailCCC returns the CCC of the last rune in the decomposition.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 8.7K bytes - Viewed (0) -
src/unicode/utf16/utf16.go
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 // by the UTF-16 encoding s and return the extended buffer. func decode(s []uint16, buf []rune) []rune { for i := 0; i < len(s); i++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 07 19:08:48 UTC 2024 - 3.9K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/cases/info.go
// is undesirable for our purposes. ICU prevents breaks in such cases as well. // isBreak returns whether this rune should introduce a break. func (c info) isBreak() bool { return c.cccVal() == cccBreak } // isLetter returns whether the rune is of break type ALetter, Hebrew_Letter, // Numeric, ExtendNumLet, or Extend. func (c info) isLetter() bool { ccc := c.cccVal() if ccc == cccZero {
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/strconv/doc.go
// // q := strconv.Quote("Hello, 世界") // q := strconv.QuoteToASCII("Hello, 世界") // // [QuoteRune] and [QuoteRuneToASCII] are similar but accept runes and // return quoted Go rune literals. // // [Unquote] and [UnquoteChar] unquote Go string and rune literals.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 04 14:21:28 UTC 2024 - 1.9K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/cases/context.go
// unbounded lookahead is needed for cased runes. type context struct { dst, src []byte atEOF bool pDst int // pDst points past the last written rune in dst. pSrc int // pSrc points to the start of the currently scanned rune. // checkpoints safe to return in Transform, where nDst <= pDst and nSrc <= pSrc. nDst, nSrc int err error sz int // size of current rune
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 9.5K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/build/relnote/links.go
} // The open bracket must be preceeded by a link-adjacent rune (or by nothing). if t := plainText(i - 1); t != "" { r, _ := utf8.DecodeLastRuneInString(t) if !isLinkAdjacentRune(r) { return "" } } // The element after the next must be a ']'. if plainText(i+2) != "]" { return "" } // The ']' must be followed by a link-adjacent rune (or by nothing). if t := plainText(i + 3); t != "" {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 16:19:04 UTC 2024 - 8.2K bytes - Viewed (0) -
src/bytes/bytes_test.go
t.Errorf("%s(%q) = %q; want %q", funcName, tc.in, actual, tc.out) } } } func tenRunes(r rune) string { runes := make([]rune, 10) for i := range runes { runes[i] = r } return string(runes) } // User-defined self-inverse mapping function func rot13(r rune) rune { const step = 13 if r >= 'a' && r <= 'z' { return ((r - 'a' + step) % 26) + 'a' }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 12:58:37 UTC 2024 - 56.5K bytes - Viewed (0) -
src/cmd/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: Wed Jan 24 13:01:26 UTC 2024 - 14.9K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/cases/map.go
// A mapFunc takes a context set to the current rune and writes the mapped // version to the same context. It may advance the context to the next rune. It // returns whether a checkpoint is possible: whether the pDst bytes written to // dst so far won't need changing as we see more source bytes. type mapFunc func(*context) bool // A spanFunc takes a context set to the current rune and returns whether this
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 22.7K bytes - Viewed (0)