| /dports/lang/racket-minimal/racket-8.3/src/regexp/match/ |
| H A D | lazy-bytes.rkt | 24 max-lookbehind ; bytes before current counter to preserve, if `out`
27 max-peek)) ; maximum number of bytes to peek or #f
31 out max-lookbehind
36 out max-lookbehind
38 max-peek))
53 (bytes-ref (lazy-bytes-bstr s) (- pos (lazy-bytes-discarded-count s))))
59 ;; `pos` minus the `max-lookbehind`
68 (lazy-bytes-max-lookbehind s)))
128 (define max-peek (lazy-bytes-max-peek s))
129 (define prefix-len (and max-peek (lazy-bytes-prefix-len s)))
[all …]
|
| H A D | compile.rkt | 31 [(bytes? rx)
32 (define len (bytes-length rx))
34 #:tail (bytes-tail-matcher rx len)
80 ;; As a special case, handle in non-lazy `repeat` a group around
104 (lazy-repeat-simple-matcher r-m min max next-m)
105 (lazy-repeat-matcher r-m min max next-m))]
146 [(rx:lookbehind? rx)
147 (lookbehind-matcher (rx:lookbehind-match? rx)
149 (rx:lookbehind-lb-max rx)
166 [(bytes? rx)
[all …]
|
| H A D | match.rkt | 3 "lazy-bytes.rkt"
57 lookbehind-matcher
93 ;; lazy bytes if `size` is greater than 1.
157 (= b (lazy-bytes-ref s pos))))
164 #:ls-test (= b (lazy-bytes-ref s pos))))
297 (lazy-bytes-ref s pos))))))
397 (define (lazy-repeat-matcher r-m min max next-m)
413 (define (lazy-repeat-simple-matcher r-m min max next-m)
483 ;; Lookahead, lookbehind, conditionals, and cut
499 (define (lookbehind-matcher match? lb-min lb-max sub-m n-start num-n next-m)
[all …]
|
| H A D | main.rkt | 3 "lazy-bytes.rkt"
254 ;; The lazy-bytes record will include the prefix,
284 out (max (rx:regexp-max-lookbehind rx)
311 (lazy-bytes-advance! lb-in ms-pos #t))
322 (lazy-bytes-advance! lb-in end-pos #t))
331 (not (lazy-bytes-failed? lb-in))
339 (define bstr (lazy-bytes-bstr lb-in))
354 (define delta (lazy-bytes-discarded-count lb-in))
359 … (add-end-bytes positions end-bytes-count bstr (- me-pos (lazy-bytes-discarded-count lb-in)))]
363 (define bstr (lazy-bytes-bstr lb-in))
[all …]
|
| /dports/lang/racket/racket-8.3/src/regexp/match/ |
| H A D | lazy-bytes.rkt | 24 max-lookbehind ; bytes before current counter to preserve, if `out`
27 max-peek)) ; maximum number of bytes to peek or #f
31 out max-lookbehind
36 out max-lookbehind
38 max-peek))
53 (bytes-ref (lazy-bytes-bstr s) (- pos (lazy-bytes-discarded-count s))))
59 ;; `pos` minus the `max-lookbehind`
68 (lazy-bytes-max-lookbehind s)))
128 (define max-peek (lazy-bytes-max-peek s))
129 (define prefix-len (and max-peek (lazy-bytes-prefix-len s)))
[all …]
|
| H A D | compile.rkt | 31 [(bytes? rx)
32 (define len (bytes-length rx))
34 #:tail (bytes-tail-matcher rx len)
80 ;; As a special case, handle in non-lazy `repeat` a group around
104 (lazy-repeat-simple-matcher r-m min max next-m)
105 (lazy-repeat-matcher r-m min max next-m))]
146 [(rx:lookbehind? rx)
147 (lookbehind-matcher (rx:lookbehind-match? rx)
149 (rx:lookbehind-lb-max rx)
166 [(bytes? rx)
[all …]
|
| H A D | match.rkt | 3 "lazy-bytes.rkt"
57 lookbehind-matcher
93 ;; lazy bytes if `size` is greater than 1.
157 (= b (lazy-bytes-ref s pos))))
164 #:ls-test (= b (lazy-bytes-ref s pos))))
297 (lazy-bytes-ref s pos))))))
397 (define (lazy-repeat-matcher r-m min max next-m)
413 (define (lazy-repeat-simple-matcher r-m min max next-m)
483 ;; Lookahead, lookbehind, conditionals, and cut
499 (define (lookbehind-matcher match? lb-min lb-max sub-m n-start num-n next-m)
[all …]
|
| H A D | main.rkt | 3 "lazy-bytes.rkt"
254 ;; The lazy-bytes record will include the prefix,
284 out (max (rx:regexp-max-lookbehind rx)
311 (lazy-bytes-advance! lb-in ms-pos #t))
322 (lazy-bytes-advance! lb-in end-pos #t))
331 (not (lazy-bytes-failed? lb-in))
339 (define bstr (lazy-bytes-bstr lb-in))
354 (define delta (lazy-bytes-discarded-count lb-in))
359 … (add-end-bytes positions end-bytes-count bstr (- me-pos (lazy-bytes-discarded-count lb-in)))]
363 (define bstr (lazy-bytes-bstr lb-in))
[all …]
|
| /dports/misc/cheat/cheat-4.2.2/vendor/github.com/alecthomas/chroma/lexers/r/ |
| H A D | racket.go | 66 …*`, `invariant-assertion`, `invoke-unit`, `invoke-unit/infer`, `lambda`, `lazy`, `let`, `let*`, `l…
67 …bytes`, `bytes->immutable-bytes`, `bytes->list`, `bytes->path`, `bytes->path-element`, `bytes->str…
|
| /dports/misc/cheat/cheat-4.2.2/vendor/github.com/alecthomas/chroma/chroma-0.9.1/lexers/r/ |
| H A D | racket.go | 66 …*`, `invariant-assertion`, `invoke-unit`, `invoke-unit/infer`, `lambda`, `lazy`, `let`, `let*`, `l…
67 …bytes`, `bytes->immutable-bytes`, `bytes->list`, `bytes->path`, `bytes->path-element`, `bytes->str…
|
| /dports/www/gitlab-workhorse/gitlab-foss-0a901d60f8ae4a60c04ae82e6e9c3a03e9321417/workhorse/vendor/github.com/alecthomas/chroma/lexers/r/ |
| H A D | racket.go | 62 …*`, `invariant-assertion`, `invoke-unit`, `invoke-unit/infer`, `lambda`, `lazy`, `let`, `let*`, `l…
63 …bytes`, `bytes->immutable-bytes`, `bytes->list`, `bytes->path`, `bytes->path-element`, `bytes->str…
|
| /dports/devel/gh/cli-2.4.0/vendor/github.com/alecthomas/chroma/lexers/r/ |
| H A D | racket.go | 62 …*`, `invariant-assertion`, `invoke-unit`, `invoke-unit/infer`, `lambda`, `lazy`, `let`, `let*`, `l…
63 …bytes`, `bytes->immutable-bytes`, `bytes->list`, `bytes->path`, `bytes->path-element`, `bytes->str…
|
| /dports/www/gitea/gitea-1.16.5/vendor/github.com/alecthomas/chroma/lexers/r/ |
| H A D | racket.go | 66 …*`, `invariant-assertion`, `invoke-unit`, `invoke-unit/infer`, `lambda`, `lazy`, `let`, `let*`, `l…
67 …bytes`, `bytes->immutable-bytes`, `bytes->list`, `bytes->path`, `bytes->path-element`, `bytes->str…
|
| /dports/sysutils/chezmoi/chezmoi-2.9.3/vendor/github.com/alecthomas/chroma/lexers/r/ |
| H A D | racket.go | 66 …*`, `invariant-assertion`, `invoke-unit`, `invoke-unit/infer`, `lambda`, `lazy`, `let`, `let*`, `l…
67 …bytes`, `bytes->immutable-bytes`, `bytes->list`, `bytes->path`, `bytes->path-element`, `bytes->str…
|
| /dports/www/gohugo/hugo-0.91.2/vendor/github.com/alecthomas/chroma/lexers/r/ |
| H A D | racket.go | 66 …*`, `invariant-assertion`, `invoke-unit`, `invoke-unit/infer`, `lambda`, `lazy`, `let`, `let*`, `l…
67 …bytes`, `bytes->immutable-bytes`, `bytes->list`, `bytes->path`, `bytes->path-element`, `bytes->str…
|
| /dports/devel/chroma/chroma-0.9.2/lexers/r/ |
| H A D | racket.go | 66 …*`, `invariant-assertion`, `invoke-unit`, `invoke-unit/infer`, `lambda`, `lazy`, `let`, `let*`, `l…
67 …bytes`, `bytes->immutable-bytes`, `bytes->list`, `bytes->path`, `bytes->path-element`, `bytes->str…
|
| /dports/sysutils/glow/glow-0.2.0/vendor/github.com/alecthomas/chroma/lexers/r/ |
| H A D | racket.go | 62 …*`, `invariant-assertion`, `invoke-unit`, `invoke-unit/infer`, `lambda`, `lazy`, `let`, `let*`, `l…
63 …bytes`, `bytes->immutable-bytes`, `bytes->list`, `bytes->path`, `bytes->path-element`, `bytes->str…
|
| /dports/sysutils/go-wtf/wtf-0.21.0/vendor/github.com/alecthomas/chroma/lexers/r/ |
| H A D | racket.go | 62 …*`, `invariant-assertion`, `invoke-unit`, `invoke-unit/infer`, `lambda`, `lazy`, `let`, `let*`, `l…
63 …bytes`, `bytes->immutable-bytes`, `bytes->list`, `bytes->path`, `bytes->path-element`, `bytes->str…
|
| /dports/sysutils/go-wtf/wtf-0.21.0/vendor/github.com/alecthomas/chroma/chroma-0.6.3/lexers/r/ |
| H A D | racket.go | 62 …*`, `invariant-assertion`, `invoke-unit`, `invoke-unit/infer`, `lambda`, `lazy`, `let`, `let*`, `l…
63 …bytes`, `bytes->immutable-bytes`, `bytes->list`, `bytes->path`, `bytes->path-element`, `bytes->str…
|
| /dports/devel/monotone/monotone-1.1/doc/ |
| H A D | pcrepattern.texi | 103 start min/max quantifier
752 @samp{bar}. This feature is similar to a lookbehind assertion
884 order to match individual bytes in UTF-8 mode. Because it breaks up
885 UTF-8 characters into individual bytes, what remains in the string may
891 to calculate the length of the lookbehind.
918 in a class as a literal string of bytes, or by using the @samp{\x@{}
1348 individual bytes. Thus, for example, @samp{\x@{100@}@{2@}} matches two
1351 sequences, each of which may be several bytes long (and they may be of
1487 @dfn{lazy}) repetition, failure of what follows normally causes the
1830 strings are permitted only at the top level of a lookbehind
[all …]
|
| /dports/lang/racket/racket-8.3/doc/reference/ |
| H A D | blueboxes.rktd | 1966 #:max-width max-width
1991 #:max-width max-width
2016 #:max-width max-width
2041 #:max-width max-width
2091 #:max-width max-width
2553 (regexp-max-lookbehind pattern) -> exact-nonnegative-integer?
4279 (stream-lazy stream-expr)
4768 #:lazy? lazy?
6430 maybe-lazy =
6431 | #:lazy
[all …]
|
| /dports/lang/perl5.34/perl-5.34.0/pod/ |
| H A D | perlre.pod | 829 or C<L<use bytes|bytes>>.
946 X{min,max}?+ X{min}
1618 use this for lookbehind.
1623 match. Use lookbehind instead (see below).
1655 variable-length lookbehind of any length.
1907 $_ = "The brown fox jumps over the lazy dog";
2317 PAT{min,max}+ (?>PAT{min,max})
3112 =item C<S{min,max}>
3114 Matches as C<S{max}|S{max-1}|...|S{min+1}|S{min}>.
3116 =item C<S{min,max}?>
[all …]
|
| /dports/lang/perl5-devel/perl5-5.35.4-102-ge43d289c7c/pod/ |
| H A D | perlre.pod | 841 or C<L<use bytes|bytes>>.
958 X{min,max}?+ X{min}
1630 use this for lookbehind.
1635 match. Use lookbehind instead (see below).
1667 variable-length lookbehind of any length.
1919 $_ = "The brown fox jumps over the lazy dog";
2329 PAT{min,max}+ (?>PAT{min,max})
3124 =item C<S{min,max}>
3126 Matches as C<S{max}|S{max-1}|...|S{min+1}|S{min}>.
3128 =item C<S{min,max}?>
[all …]
|
| /dports/lang/perl5.30/perl-5.30.3/pod/ |
| H A D | perlre.pod | 829 or C<L<use bytes|bytes>>.
943 X{min,max}?+ X{min}
1612 use this for lookbehind.
1617 match. Use lookbehind instead (see below).
1652 variable-length lookbehind of any length.
1906 $_ = "The brown fox jumps over the lazy dog";
2316 PAT{min,max}+ (?>PAT{min,max})
3118 =item C<S{min,max}>
3120 Matches as C<S{max}|S{max-1}|...|S{min+1}|S{min}>.
3122 =item C<S{min,max}?>
[all …]
|
| /dports/lang/perl5.32/perl-5.32.1/pod/ |
| H A D | perlre.pod | 829 or C<L<use bytes|bytes>>.
943 X{min,max}?+ X{min}
1609 use this for lookbehind.
1614 match. Use lookbehind instead (see below).
1646 variable-length lookbehind of any length.
1894 $_ = "The brown fox jumps over the lazy dog";
2304 PAT{min,max}+ (?>PAT{min,max})
3099 =item C<S{min,max}>
3101 Matches as C<S{max}|S{max-1}|...|S{min+1}|S{min}>.
3103 =item C<S{min,max}?>
[all …]
|