- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 1,853 for runUse (0.12 sec)
-
src/regexp/backtrack.go
pc = inst.Arg goto CheckAndLoop } else { b.push(re, pc, pos, true) pc = inst.Out goto CheckAndLoop } case syntax.InstAltMatch: // One opcode consumes runes; the other leads to match. switch re.prog.Inst[inst.Out].Op { case syntax.InstRune, syntax.InstRune1, syntax.InstRuneAny, syntax.InstRuneAnyNotNL: // inst.Arg is the match. b.push(re, inst.Arg, pos, false)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Sep 14 17:25:39 UTC 2023 - 8.8K 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/regexp/exec.go
// It records the pair of relevant runes and does not // determine the implied flags until absolutely necessary // (most of the time, that means never). type lazyFlag uint64 func newLazyFlag(r1, r2 rune) lazyFlag { return lazyFlag(uint64(r1)<<32 | uint64(uint32(r2))) } func (f lazyFlag) match(op syntax.EmptyOp) bool { if op == 0 { return true } r1 := rune(f >> 32) if op&syntax.EmptyBeginLine != 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Jun 04 20:10:54 UTC 2022 - 12.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/SequentialExecutorTest.java
final AtomicInteger numCalls = new AtomicInteger(); Runnable runMe = new Runnable() { @Override public void run() { numCalls.incrementAndGet(); throw new RuntimeException("FAKE EXCEPTION!"); } }; e.execute(runMe); e.execute(runMe); fakePool.runAll(); assertEquals(2, numCalls.get()); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 11.4K bytes - Viewed (0) -
src/cmd/compile/internal/types/universe.go
} // We create separate byte and rune types for better error messages // rather than just creating type alias *Sym's for the uint8 and // 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.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jan 26 21:56:49 UTC 2023 - 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/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) -
src/fmt/scan.go
// Scanners may do rune-at-a-time scanning or ask the ScanState // to discover the next space-delimited token. type ScanState interface { // ReadRune reads the next rune (Unicode code point) from the input. // If invoked during Scanln, Fscanln, or Sscanln, ReadRune() will // return EOF after returning the first '\n' or when reading beyond // the specified width. ReadRune() (r rune, size int, err error)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 21:56:20 UTC 2024 - 31.9K bytes - Viewed (0)