- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 11 for lookahead (0.28 sec)
-
src/compress/flate/deflate.go
// We only look at chainCount possibilities before giving up. func (d *compressor) findMatch(pos int, prevHead int, prevLength int, lookahead int) (length, offset int, ok bool) { minMatchLook := maxMatchLength if lookahead < minMatchLook { minMatchLook = lookahead } win := d.window[0 : pos+minMatchLook] // We quit when we get a match that's at least nice long nice := len(win) - pos
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 26 13:32:40 UTC 2024 - 20.3K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/cases/context.go
// whenever it is known to be safe to return the runes processed so far. // // It is recommended for implementations to not allow for more than 30 case // ignorables as lookahead (analogous to the limit in norm) and to use state if // 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.
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/text/cases/map.go
// to the next rune. It returns whether a checkpoint is possible. type spanFunc func(*context) bool // maxIgnorable defines the maximum number of ignorables to consider for // lookahead operations. const maxIgnorable = 30 // supported lists the language tags for which we have tailorings. const supported = "und af az el lt nl tr" func init() { tags := []language.Tag{}
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/html/template/js_test.go
// Identifiers can be divided and cannot validly be preceded by // a regular expressions. Semicolon insertion cannot happen // between an identifier and a regular expression on a new line // because the one token lookahead for semicolon insertion has // to conclude that it could be a div binary op and treat it as // such. {jsCtxDivOp, "x"}, {jsCtxDivOp, "x "}, {jsCtxDivOp, "x\t"}, {jsCtxDivOp, "x\n"},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Feb 27 02:20:11 UTC 2024 - 12.6K bytes - Viewed (0) -
android/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: Fri Feb 09 15:49:48 UTC 2024 - 23.7K bytes - Viewed (0) -
src/text/template/parse/parse.go
text string // text parsed to create the template (or its parent) // Parsing only; cleared after parse. funcs []map[string]any lex *lexer token [3]item // three-token lookahead for parser. peekCount int vars []string // variables defined at the moment. treeSet map[string]*Tree actionLine int // line of left delim starting action rangeDepth int }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 20:57:51 UTC 2024 - 21.3K bytes - Viewed (0) -
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) -
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)