- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 23 for startCond (0.22 sec)
-
src/regexp/backtrack.go
// backtrack runs a backtracking search of prog on the input starting at pos. func (re *Regexp) backtrack(ib []byte, is string, pos int, ncap int, dstCap []int) []int { startCond := re.cond if startCond == ^syntax.EmptyOp(0) { // impossible return nil } if startCond&syntax.EmptyBeginText != 0 && pos != 0 { // Anchored match, past beginning of text. return nil } b := newBitState()
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/regexp/syntax/prog.go
buf.WriteRune(i.Rune[0]) i = p.skipNop(i.Out) } return buf.String(), i.Op == InstMatch } // StartCond returns the leading empty-width conditions that must // be true in any match. It returns ^EmptyOp(0) if no matches are possible. func (p *Prog) StartCond() EmptyOp { var flag EmptyOp pc := uint32(p.Start) i := &p.Inst[pc] Loop: for { switch i.Op { case InstEmptyWidth:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 20:50:01 UTC 2024 - 7.7K bytes - Viewed (0) -
src/regexp/regexp.go
matchcap = 2 } regexp := &Regexp{ expr: expr, prog: prog, onepass: compileOnePass(prog), numSubexp: maxCap, subexpNames: capNames, cond: prog.StartCond(), longest: longest, matchcap: matchcap, minInputLen: minInputLen(re), } if regexp.onepass == nil { regexp.prefix, regexp.prefixComplete = prog.Prefix()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 20:50:01 UTC 2024 - 38.5K bytes - Viewed (0) -
src/path/filepath/symlink.go
// The next path component is in path[start:end]. if end == start { // No more path components. break } else if path[start:end] == "." && !isWindowsDot { // Ignore path component ".". continue } else if path[start:end] == ".." { // Back up to previous component if possible. // Note that volLen includes any leading slash.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 26 23:07:50 UTC 2024 - 3.3K bytes - Viewed (0) -
cmd/metacache-marker.go
s := o.Marker if !strings.Contains(s, "[minio_cache:"+markerTagVersion) { return } start := strings.LastIndex(s, "[") o.Marker = s[:start] end := strings.LastIndex(s, "]") tag := strings.Trim(s[start:end], "[]") tags := strings.Split(tag, ",") for _, tag := range tags { kv := strings.Split(tag, ":") if len(kv) < 2 { continue } switch kv[0] { case "minio_cache": if kv[1] != markerTagVersion {
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu Apr 04 12:04:40 UTC 2024 - 2.5K bytes - Viewed (0) -
src/runtime/os_wasip1.go
} for i := range argslice { start := argv[i] - uintptr32(uintptr(unsafe.Pointer(&argvBuf[0]))) end := start for argvBuf[end] != 0 { end++ } argslice[i] = string(argvBuf[start:end]) } } // environment var environCount size var environBufLen size if environ_sizes_get(unsafe.Pointer(&environCount), unsafe.Pointer(&environBufLen)) != 0 { throw("environ_sizes_get failed")
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Dec 05 20:34:30 UTC 2023 - 7K bytes - Viewed (0) -
src/go/printer/gobuild.go
var after []byte start := insert for _, end := range toDelete { if end < start { continue } after = appendLines(after, p.output[start:end]) start = end + len(p.lineAt(end)) } after = appendLines(after, p.output[start:]) if n := len(after); n >= 2 && isNL(after[n-1]) && isNL(after[n-2]) { after = after[:n-1] }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 4.6K bytes - Viewed (0) -
src/internal/trace/summary_test.go
t.Error("missing GC mark assist time") } } func TestSummarizeGoroutinesRegionsTrace(t *testing.T) { summaries := summarizeTraceTest(t, "testdata/tests/go122-annotations.test").Goroutines type region struct { startKind trace.EventKind endKind trace.EventKind } wantRegions := map[string]region{ // N.B. "pre-existing region" never even makes it into the trace. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 13.4K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/unicode/norm/composition.go
end := start + rb.rune[i].size rb.out = append(rb.out, rb.byte[start:end]...) } return true } // flush appends the normalized segment to out and resets rb. func (rb *reorderBuffer) flush(out []byte) []byte { for i := 0; i < rb.nrune; i++ { start := rb.rune[i].pos end := start + rb.rune[i].size out = append(out, rb.byte[start:end]...) } rb.reset() return out }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 14.1K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/mod/sumdb/tlog/tile.go
} t, _, _ := tileForIndex(h, index) return t } // tileForIndex returns the tile of height h ≥ 1 // storing the given hash index, which can be // reconstructed using tileHash(data[start:end]). func tileForIndex(h int, index int64) (t Tile, start, end int) { level, n := SplitStoredHashIndex(index) t.H = h t.L = level / h level -= t.L * h // now level within tile t.N = n << uint(level) >> uint(t.H)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 02:38:00 UTC 2024 - 13K bytes - Viewed (0)