| /dports/lang/racket-minimal/racket-8.3/src/regexp/match/ |
| H A D | lazy-bytes.rkt | 12 lazy-bytes-discarded-count
53 (bytes-ref (lazy-bytes-bstr s) (- pos (lazy-bytes-discarded-count s))))
65 (define discarded-count (lazy-bytes-discarded-count s))
71 (- pos (lazy-bytes-discarded-count s))
86 (define copy-end (- (lazy-bytes-end s) discarded-count))
89 (set-lazy-bytes-discarded-count! s (+ amt discarded-count)))))
97 (define discarded-count (lazy-bytes-discarded-count s))
98 (define len (- (lazy-bytes-end s) discarded-count))
122 (set-lazy-bytes-failed?! s #t)
125 (set-lazy-bytes-end! s (+ n len discarded-count))
[all …]
|
| /dports/lang/racket/racket-8.3/src/regexp/match/ |
| H A D | lazy-bytes.rkt | 12 lazy-bytes-discarded-count
53 (bytes-ref (lazy-bytes-bstr s) (- pos (lazy-bytes-discarded-count s))))
65 (define discarded-count (lazy-bytes-discarded-count s))
71 (- pos (lazy-bytes-discarded-count s))
86 (define copy-end (- (lazy-bytes-end s) discarded-count))
89 (set-lazy-bytes-discarded-count! s (+ amt discarded-count)))))
97 (define discarded-count (lazy-bytes-discarded-count s))
98 (define len (- (lazy-bytes-end s) discarded-count))
122 (set-lazy-bytes-failed?! s #t)
125 (set-lazy-bytes-end! s (+ n len discarded-count))
[all …]
|
| /dports/lang/racket/racket-8.3/collects/file/ |
| H A D | gzip.rkt | 55 (bytes-set! (gzbytes-bytes v) (+ (gzbytes-offset v) o) x))
182 ;; /* Matches of length 3 are discarded if their distance exceeds TOO_FAR */
225 ;; /* good lazy nice chain */
444 ;; * are discarded. This is used in the lazy match evaluation.
697 ;; * return its length. Matches shorter or equal to prev_length are discarded,
1539 (set! count (add1 count))
1554 (set! count 0)
1586 (set! count (add1 count))
1592 (set! count (sub1 count))
1597 (set! count (sub1 count)))
[all …]
|
| /dports/lang/racket-minimal/racket-8.3/collects/file/ |
| H A D | gzip.rkt | 55 (bytes-set! (gzbytes-bytes v) (+ (gzbytes-offset v) o) x))
182 ;; /* Matches of length 3 are discarded if their distance exceeds TOO_FAR */
225 ;; /* good lazy nice chain */
444 ;; * are discarded. This is used in the lazy match evaluation.
697 ;; * return its length. Matches shorter or equal to prev_length are discarded,
1539 (set! count (add1 count))
1554 (set! count 0)
1586 (set! count (add1 count))
1592 (set! count (sub1 count))
1597 (set! count (sub1 count)))
[all …]
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/perfetto/protos/perfetto/config/ |
| H A D | perfetto_config.proto | 335 // Size of the circular buffer in bytes.
382 // Num. chunks discarded (i.e. loss of data). Can be > 0 only when a buffer
456 // Num. chunks that were discarded by the service before attempting to commit
460 // Num. patches that were discarded by the service before attempting to apply
825 optional bytes field_bytes = 14;
921 // This does *not* count the time the system is suspended, so we will run
1113 // this is also set.
1218 // everything up to the last slash is discarded. If it contains "@",
1318 // everything up to the last slash is discarded. If it contains "@",
1357 // kernel. If set, must be a power of two.
[all …]
|
| /dports/lang/guile/guile-3.0.7/test-suite/tests/ |
| H A D | ports.test | 617 (error "wrong revealed count" (port-revealed port)))
933 ;; skip over the bad bytes.
1034 ;; not continue with valid successor bytes (see Table 3-7), it
1035 ;; must not consume the successor bytes".
1127 (pass-if "line count is 5 at EOF"
1173 (pass-if "line count is 5 at end"
1342 ;; the lazy sweeping has not yet reached it to remove it from the port
1878 (pass-if-equal "BOM discarded within UTF-16 stream (BE) after set-port-encoding!"
1886 (pass-if-equal "BOM discarded within UTF-16 stream (LE,BE) after set-port-encoding!"
1894 (pass-if-equal "BOM discarded within UTF-32 stream (BE) after set-port-encoding!"
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/perfetto/protos/perfetto/config/ |
| H A D | perfetto_config.proto | 548 // everything up to the last slash is discarded. If it contains "@",
688 // everything up to the last slash is discarded. If it contains "@",
775 // samples are discarded. However, if the lookup still succeeds after the
1027 optional bytes field_bytes = 14;
1043 // The size of each message in bytes. Should be greater than or equal 5 to
1044 // account for the number of bytes needed to encode the random number and a
1152 // Instead they are treated as opaque strings containing raw proto bytes.
1184 [lazy = true];
1298 // This does *not* count the time the system is suspended, so we will run
1371 // Optional. When non zero the periodic write stops once at most X bytes
[all …]
|
| /dports/lang/voc/voc-63008f6/src/library/s3/ |
| H A D | ethZlibDeflate.Mod | 55 TooFar = 4096; (* matches of length MinMatch are discarded if their distance exceeds this *)
151 GoodLen: INTEGER; (* reduce lazy search above this match length *)
152 MaxLazy: INTEGER; (* do not perform lazy search above this match length *)
453 INC(count);
505 INC(count);
516 ASSERT((3 <= count) & (count <= 6), 110);
864 …Matches shorter or equal to stream.prevLen are discarded, in which case the result is equal to str…
1046 (* Compress without lazy matches.
1056 …We need MaxMatch bytes for the next match, plus MinMatch bytes to insert the string following the …
1120 (* Same as above, but achieves a better compression. We use lazy evaluation for matches:
[all …]
|
| /dports/lang/guile2/guile-2.2.7/test-suite/tests/ |
| H A D | ports.test | 608 (fdes (port->fdes port))) ;increments revealed count of PORT
903 ;; skip over the bad bytes.
1004 ;; not continue with valid successor bytes (see Table 3-7), it
1005 ;; must not consume the successor bytes".
1097 (pass-if "line count is 5 at EOF"
1143 (pass-if "line count is 5 at end"
1309 ;; the lazy sweeping has not yet reached it to remove it from the port
1845 (pass-if-equal "BOM discarded within UTF-16 stream (BE) after set-port-encoding!"
1853 (pass-if-equal "BOM discarded within UTF-16 stream (LE,BE) after set-port-encoding!"
1861 (pass-if-equal "BOM discarded within UTF-32 stream (BE) after set-port-encoding!"
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/boost/beast/zlib/detail/ |
| H A D | deflate_stream.ipp | 92 * The idea of lazy evaluation of matches is due to Jan-Mark Wams, and
594 // Do lazy initialization
599 // Caller must set these:
957 std::uint16_t count = 0; // repeat count of the current code
992 count = 0;
1025 int count = 0; // repeat count of the current code
1059 BOOST_ASSERT(count >= 3 && count <= 6);
1073 count = 0;
1701 return its length. Matches shorter or equal to prev_length are discarded,
1892 This function does not perform lazy evaluation of matches and inserts
[all …]
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/beast/zlib/detail/ |
| H A D | deflate_stream.ipp | 92 * The idea of lazy evaluation of matches is due to Jan-Mark Wams, and
594 // Do lazy initialization
599 // Caller must set these:
957 std::uint16_t count = 0; // repeat count of the current code
992 count = 0;
1025 int count = 0; // repeat count of the current code
1059 BOOST_ASSERT(count >= 3 && count <= 6);
1073 count = 0;
1701 return its length. Matches shorter or equal to prev_length are discarded,
1892 This function does not perform lazy evaluation of matches and inserts
[all …]
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/beast/zlib/detail/ |
| H A D | deflate_stream.ipp | 92 * The idea of lazy evaluation of matches is due to Jan-Mark Wams, and
594 // Do lazy initialization
599 // Caller must set these:
957 std::uint16_t count = 0; // repeat count of the current code
992 count = 0;
1025 int count = 0; // repeat count of the current code
1059 BOOST_ASSERT(count >= 3 && count <= 6);
1073 count = 0;
1701 return its length. Matches shorter or equal to prev_length are discarded,
1892 This function does not perform lazy evaluation of matches and inserts
[all …]
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/beast/zlib/detail/ |
| H A D | deflate_stream.ipp | 92 * The idea of lazy evaluation of matches is due to Jan-Mark Wams, and
594 // Do lazy initialization
599 // Caller must set these:
957 std::uint16_t count = 0; // repeat count of the current code
992 count = 0;
1025 int count = 0; // repeat count of the current code
1059 BOOST_ASSERT(count >= 3 && count <= 6);
1073 count = 0;
1701 return its length. Matches shorter or equal to prev_length are discarded,
1892 This function does not perform lazy evaluation of matches and inserts
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/boost/beast/zlib/detail/ |
| H A D | deflate_stream.ipp | 92 * The idea of lazy evaluation of matches is due to Jan-Mark Wams, and
594 // Do lazy initialization
599 // Caller must set these:
957 std::uint16_t count = 0; // repeat count of the current code
992 count = 0;
1025 int count = 0; // repeat count of the current code
1059 BOOST_ASSERT(count >= 3 && count <= 6);
1073 count = 0;
1701 return its length. Matches shorter or equal to prev_length are discarded,
1892 This function does not perform lazy evaluation of matches and inserts
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/beast/zlib/detail/ |
| H A D | deflate_stream.ipp | 92 * The idea of lazy evaluation of matches is due to Jan-Mark Wams, and
594 // Do lazy initialization
599 // Caller must set these:
957 std::uint16_t count = 0; // repeat count of the current code
992 count = 0;
1025 int count = 0; // repeat count of the current code
1059 BOOST_ASSERT(count >= 3 && count <= 6);
1073 count = 0;
1701 return its length. Matches shorter or equal to prev_length are discarded,
1892 This function does not perform lazy evaluation of matches and inserts
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/beast/zlib/detail/ |
| H A D | deflate_stream.ipp | 92 * The idea of lazy evaluation of matches is due to Jan-Mark Wams, and
594 // Do lazy initialization
599 // Caller must set these:
957 std::uint16_t count = 0; // repeat count of the current code
992 count = 0;
1025 int count = 0; // repeat count of the current code
1059 BOOST_ASSERT(count >= 3 && count <= 6);
1073 count = 0;
1701 return its length. Matches shorter or equal to prev_length are discarded,
1892 This function does not perform lazy evaluation of matches and inserts
[all …]
|
| /dports/lang/zig-devel/zig-0.9.0/lib/std/ |
| H A D | macho.zig | 182 /// string table size in bytes
292 // makes. For each module there is an offset and a count into the
399 // bytes.
416 // encoded in a few bytes.
517 /// of 4 bytes must be zero.
711 /// reserved (for count or sizeof)
746 /// reserved (for count or sizeof)
846 pub fn discarded(sym: nlist_64) bool {
1380 /// section with only lazy symbol pointers to lazy loaded dylibs
1801 count: u32,
[all …]
|
| /dports/lang/zig/zig-0.9.0/lib/std/ |
| H A D | macho.zig | 182 /// string table size in bytes
292 // makes. For each module there is an offset and a count into the
399 // bytes.
416 // encoded in a few bytes.
517 /// of 4 bytes must be zero.
711 /// reserved (for count or sizeof)
746 /// reserved (for count or sizeof)
846 pub fn discarded(sym: nlist_64) bool {
1380 /// section with only lazy symbol pointers to lazy loaded dylibs
1801 count: u32,
[all …]
|
| /dports/benchmarks/vegeta/vegeta-12.8.4/ |
| H A D | README.md | 87 -lazy
165 Specifies the file whose content will be set as the body of every
171 If `-key` isn't specified, it will be set to the value of this flag.
294 #### `-lazy`
303 Specifies the maximum number of bytes to capture from the body of each
304 response. Remaining unread bytes will be fully read but discarded.
332 Use together with `-max-workers` to model a fixed set of concurrent users sending
413 Status Codes [code:count] 0:535 200:665
698 vegeta attack -rate=50/s -lazy -format=json -duration=30s | \
744 jaggr @count=rps \
[all …]
|
| /dports/benchmarks/ali/ali-0.7.5/vendor/github.com/tsenart/vegeta/v12/ |
| H A D | README.md | 87 -lazy
165 Specifies the file whose content will be set as the body of every
171 If `-key` isn't specified, it will be set to the value of this flag.
294 #### `-lazy`
303 Specifies the maximum number of bytes to capture from the body of each
304 response. Remaining unread bytes will be fully read but discarded.
332 Use together with `-max-workers` to model a fixed set of concurrent users sending
413 Status Codes [code:count] 0:535 200:665
698 vegeta attack -rate=50/s -lazy -format=json -duration=30s | \
744 jaggr @count=rps \
[all …]
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/perfetto/protos/perfetto/trace/ |
| H A D | perfetto_trace.proto | 868 optional uint32 bytes = 4; field
951 optional uint32 bytes = 4; field
1144 optional uint64 count = 3; field
1370 optional uint64 count = 4; field
1500 optional uint32 count = 4; field
2683 optional uint32 count = 2; field
3168 optional bytes str = 2;
3325 optional uint64 count = 3; field
3618 optional uint64 count = 2; field
3751 bytes compressed_packets = 50;
[all …]
|
| /dports/emulators/qemu5/qemu-5.2.0/qapi/ |
| H A D | block-core.json | 101 '*lazy-refcounts': 'bool',
473 # @count: number of dirty bytes according to the dirty bitmap
919 # @discard-bytes-ok: The number of bytes discarded by the driver.
2924 # @label: set the volume label, limited to 11 bytes. FAT16 and
3106 # @lazy-refcounts: whether to enable the lazy refcounts
3156 'data': { '*lazy-refcounts': 'bool',
3750 # @readahead-size: set the readahead size in bytes (defaults
3753 # @page-cache-size: set the pagecache size in bytes (defaults
4362 '*lazy-refcounts': 'bool',
5233 # @sectors-count: failed read operation sector count
[all …]
|
| /dports/misc/broot/broot-1.7.0/cargo-crates/onig_sys-69.7.0/oniguruma/doc/ |
| H A D | SYNTAX.md | 150 This form also allows `r{count}` to specify a precise count of r's that must match.
366 Enables support for lazy (non-greedy) quantifiers: That is, if you append a `?` after
739 the former becomes two bytes, and the latter becomes three. Unfortunately, `.`
740 would naively match only one or two bytes, depending on the encoding, and would
827 they discarded, or are they taken as literals? If this flag is clear, they
829 determines if they are errors or if they are discarded.
838 operators are silently discarded.
853 silently discarded, as if `foo` had been written instead. If clear, an invalid
908 If this flag is set, then intervals of a fixed size will ignore a lazy (non-greedy)
911 then `r{n}?` will mean the same as `r{n}`, and the useless `?` will be discarded.
[all …]
|
| /dports/devel/git-delta/delta-0.9.2/cargo-crates/onig_sys-69.6.0/oniguruma/doc/ |
| H A D | SYNTAX.md | 150 This form also allows `r{count}` to specify a precise count of r's that must match.
366 Enables support for lazy (non-greedy) quantifiers: That is, if you append a `?` after
739 the former becomes two bytes, and the latter becomes three. Unfortunately, `.`
740 would naively match only one or two bytes, depending on the encoding, and would
827 they discarded, or are they taken as literals? If this flag is clear, they
829 determines if they are errors or if they are discarded.
838 operators are silently discarded.
853 silently discarded, as if `foo` had been written instead. If clear, an invalid
908 If this flag is set, then intervals of a fixed size will ignore a lazy (non-greedy)
911 then `r{n}?` will mean the same as `r{n}`, and the useless `?` will be discarded.
[all …]
|
| /dports/emulators/qemu/qemu-6.2.0/roms/edk2/MdeModulePkg/Universal/RegularExpressionDxe/oniguruma/doc/ |
| H A D | SYNTAX.md | 150 This form also allows `r{count}` to specify a precise count of r's that must match.
366 Enables support for lazy (non-greedy) quantifiers: That is, if you append a `?` after
739 the former becomes two bytes, and the latter becomes three. Unfortunately, `.`
740 would naively match only one or two bytes, depending on the encoding, and would
827 they discarded, or are they taken as literals? If this flag is clear, they
829 determines if they are errors or if they are discarded.
838 operators are silently discarded.
853 silently discarded, as if `foo` had been written instead. If clear, an invalid
908 If this flag is set, then intervals of a fixed size will ignore a lazy (non-greedy)
911 then `r{n}?` will mean the same as `r{n}`, and the useless `?` will be discarded.
[all …]
|