- Sort Score
- Result 10 results
- Languages All
Results 11 - 17 of 17 for lookahead (0.14 sec)
-
guava/src/com/google/common/base/Splitter.java
} if (offset == nextStart) { /* * This occurs when some pattern has an empty match, even if it doesn't match the empty * string -- for example, if it requires lookahead or the like. The offset must be * increased to look for separators beyond this point, without changing the start position * of the next returned substring -- so nextStart stays the same. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 24.4K bytes - Viewed (0) -
src/internal/trace/traceviewer/static/trace_viewer_full.html
ask,a.prev[f&a.w_mask]=a.head[a.ins_h],a.head[a.ins_h]=f,f++,a.insert--,!(a.lookahead+a.insert<hb)););}while(a.lookahead<jb&&0!==a.strm.avail_in)}function n(a,b){var c=65535;for(c>a.pending_buf_size-5&&(c=a.pending_buf_size-5);;){if(a.lookahead<=1){if(m(a),0===a.lookahead&&b===H)return sb;if(0===a.lookahead)break}a.strstart+=a.lookahead,a.lookahead=0;var d=a.block_start+c;if((0===a.strstart||a.strstart>=d)&&(a.lookahead=a.strstart-d,a.strstart=d,h(a,!1),0===a.strm.avail_out))return sb;if(a.strst...
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 20:45:06 UTC 2023 - 2.5M bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/transform/transform.go
w.n = m err = nil } else if nDst > 0 || nSrc > 0 { // Not enough buffer to store the remainder. Keep processing as // long as there is progress. Without this case, transforms that // require a lookahead larger than the buffer may result in an // error. This is not something one may expect to be common in // practice, but it may occur when buffers are set to small // sizes during testing. continue }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 21.7K bytes - Viewed (0) -
staging/src/k8s.io/apimachinery/pkg/labels/selector_test.go
p := &Parser{l: &Lexer{s: v.s, pos: 0}, position: 0} p.scan() if len(p.scannedItems) != len(v.t) { t.Errorf("Expected %d items found %d", len(v.t), len(p.scannedItems)) } for { token, lit := p.lookahead(KeyAndOperator) token2, lit2 := p.consume(KeyAndOperator) if token == EndOfStringToken { break } if token != token2 || lit != lit2 { t.Errorf("Bad values") } } }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Nov 14 16:39:04 UTC 2022 - 29.9K bytes - Viewed (0) -
src/vendor/golang.org/x/text/transform/transform.go
w.n = m err = nil } else if nDst > 0 || nSrc > 0 { // Not enough buffer to store the remainder. Keep processing as // long as there is progress. Without this case, transforms that // require a lookahead larger than the buffer may result in an // error. This is not something one may expect to be common in // practice, but it may occur when buffers are set to small // sizes during testing. continue }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Sep 21 22:10:00 UTC 2020 - 21.7K bytes - Viewed (0) -
src/regexp/regexp.go
if name == s { return i } } } return -1 } const endOfText rune = -1 // input abstracts different representations of the input text. It provides // one-character lookahead. type input interface { step(pos int) (r rune, width int) // advance one rune canCheckPrefix() bool // can we look ahead without losing info? hasPrefix(re *Regexp) bool index(re *Regexp, pos int) int
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/cmd/compile/internal/ssagen/ssa.go
mask := s.newValue2(ssa.OpLoad, typs.Uintptr, cache, s.mem()) // Jump to loop head. b := s.endBlock() b.AddEdgeTo(loopHead) // At loop head, get pointer to the cache entry. // e := &cache.Entries[hash&mask] s.startBlock(loopHead) entries := s.newValue2(ssa.OpAddPtr, typs.UintptrPtr, cache, s.uintptrConstant(uint64(s.config.PtrSize)))
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 284.9K bytes - Viewed (0)