Home
last modified time | relevance | path

Searched full:repeated (Results 1 – 25 of 640) sorted by relevance

12345678910>>...26

/freebsd/usr.bin/uniq/tests/
H A Duniq_test.sh38 atf_test_case repeated
40 atf_set descr "print repeated lines only"
46 atf_check_uniq --repeated
51 atf_set descr "count and print repeated lines only"
60 atf_check_uniq --count --repeated
61 atf_check_uniq --repeated --count
66 atf_set descr "print every instance of repeated lines"
73 atf_check_uniq --all-repeated
74 atf_check_uniq --all-repeated=none
77 atf_check_uniq --all-repeated
[all...]
/freebsd/usr.bin/uniq/
H A Duniq.136 .Nd report or filter out repeated lines in a file
65 Repeated lines in the input will not be detected if they are not adjacent,
73 .It Fl d , Fl -repeated
74 Output a single copy of each line that is repeated in the input.
78 .It Fl D , Fl -all-repeated Op Ar septype
79 Output all lines that are repeated (like
81 but each copy of the repeated line is written).
84 argument controls how to separate groups of repeated lines in the output;
117 Only output lines that are not repeated in the input.
181 Show repeated line
[all...]
/freebsd/contrib/bmake/unit-tests/
H A Dsh-dots.exp6 repeated repeated
19 repeated delayed repeated
20 repeated delayed twice repeated
H A Dsh-dots.mk9 all: first hidden repeated commented indirect indirect-space
49 repeated: .IGNORE
50 @echo repeated ${.TARGET}
52 @echo repeated delayed ${.TARGET}
54 @echo repeated delayed twice ${.TARGET}
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DSuffixTree.h18 // us to quickly find repeated substrings of the input string.
48 /// A repeated substring in the tree.
158 /// Iterator for finding all repeated substrings in the suffix tree.
164 /// The repeated substring associated with this node.
170 /// The minimum length of a repeated substring to find.
182 /// Move the iterator to the next repeated substring.
186 /// Return the current repeated substring.
/freebsd/share/man/man4/
H A Dled.4109 digit a two second pause after which the sequence is repeated.
133 the sequence is immediately repeated.
153 The sequence is repeated after a one second pause.
/freebsd/share/doc/usd/21.troff/
H A Dm346 a string of repeated characters.
53 offer the choice of repeated character or motion.
71 type repeated characters \fInext-string\fR
78 that of a repeated character string cannot be.
79 Repeated character strings contain an integer number of characters, and
408 The function \fB\e\|l\|\'\fINc\fB\|\'\fR will draw a string of repeated \fIc\fR\|'s towards the rig…
/freebsd/contrib/llvm-project/clang/lib/CodeGen/
H A DPatternInit.cpp18 // repeated byte-pattern which makes it easier to synthesize. We use it for in initializationPatternFor()
20 // initialized with this repeated value. in initializationPatternFor()
29 // a repeated byte pattern means that it will be easier to initialize in initializationPatternFor()
/freebsd/contrib/expat/fuzz/
H A Dxml_lpm_fuzzer.proto56 repeated Action actions = 2;
57 repeated int32 fail_allocations = 3;
/freebsd/contrib/xz/src/liblzma/lzma/
H A Dlzma_decoder.c32 // This is used to decode the match length (how many bytes must be repeated
117 /// If 1, it's a repeated match. The distance is one of rep0 .. rep3.
120 /// If 0, distance of a repeated match is rep0.
124 /// If 0, distance of a repeated match is rep1.
128 /// If 0, distance of a repeated match is rep2. Otherwise it is rep3.
131 /// If 1, the repeated match has length of one byte. Otherwise
151 /// Length of a repeated match
401 // Not a repeated match. In this case, in lzma_decode()
415 // memory in case there are repeated matches. in lzma_decode()
539 // Repeated match. // in lzma_decode()
[all …]
/freebsd/contrib/llvm-project/llvm/include/
H A Dmodule.modulemap11 // This is intended for (repeated) textual inclusion.
49 // These are intended for (repeated) textual inclusion.
179 // These are intended for (repeated) textual inclusion.
261 // These are intended for (repeated) textual inclusion.
/freebsd/contrib/jemalloc/include/jemalloc/internal/
H A Dprng.h117 /* Generate a result in [0..range) via repeated trial. */ in prng_lg_range_zu()
138 /* Generate a result in [0..range) via repeated trial. */ in prng_range_u32()
159 /* Generate a result in [0..range) via repeated trial. */ in prng_range_u64()
/freebsd/crypto/krb5/src/kdc/
H A Ddispatch.c126 "DISPATCH: repeated (retransmitted?) request " in dispatch()
130 "DISPATCH: repeated (retransmitted?) request " in dispatch()
132 "repeated request", name); in dispatch()
/freebsd/contrib/llvm-project/llvm/tools/llvm-objcopy/
H A DObjcopyOpts.td72 "whitespace is stripped from each line. May be repeated to read "
194 "be repeated to read symbols from many files">,
221 "be repeated to read symbols from many files">,
235 "be repeated to read symbols from many files">,
/freebsd/contrib/wpa/src/crypto/
H A Dmd5.c56 * ipad is the byte 0x36 repeated 64 times in hmac_md5_vector()
57 * opad is the byte 0x5c repeated 64 times in hmac_md5_vector()
H A Dsha1.c56 * ipad is the byte 0x36 repeated 64 times in hmac_sha1_vector()
57 * opad is the byte 0x5c repeated 64 times in hmac_sha1_vector()
H A Dsha512.c55 * ipad is the byte 0x36 repeated 128 times in hmac_sha512_vector()
56 * opad is the byte 0x5c repeated 128 times in hmac_sha512_vector()
H A Dsha384.c55 * ipad is the byte 0x36 repeated 128 times in hmac_sha384_vector()
56 * opad is the byte 0x5c repeated 128 times in hmac_sha384_vector()
H A Dsha256.c56 * ipad is the byte 0x36 repeated 64 times in hmac_sha256_vector()
57 * opad is the byte 0x5c repeated 64 times in hmac_sha256_vector()
/freebsd/crypto/krb5/src/lib/crypto/builtin/
H A Dhmac.c47 * ipad is the byte 0x36 repeated blocksize times
48 * opad is the byte 0x5c repeated blocksize times
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineOutliner.cpp10 /// Replaces repeated sequences of instructions with function calls.
13 /// suffix tree, and repeatedly querying that tree for repeated sequences of
304 // repeated calls to getOutliningType? in convertToUnsignedVec()
376 // repeated substring. in convertToUnsignedVec()
395 /// An interprocedural pass which finds repeated sequences of
400 /// is then repeatedly queried for repeated sequences of instructions. Each
401 /// non-overlapping repeated sequence is then placed in its own
443 /// Find all repeated substrings that satisfy the outlining cost model by
476 /// Construct a suffix tree on the instructions in \p M and outline repeated
588 // First, find all of the repeated substrings in the tree of minimum length in findCandidates()
[all …]
/freebsd/contrib/nvi/man/
H A Dvi.1903 argument of the repeated command and that of the associated
1033 argument is given, the characters input are repeated
1112 the characters input are repeated
1146 the characters input are repeated
1176 the characters input are repeated
1285 the characters input are repeated
1356 the characters input are repeated
1377 the characters input are repeated
1428 If repeated, the
/freebsd/sys/contrib/edk2/Include/Library/
H A DBaseMemoryLib.h67 Value, and returns Buffer. Value is repeated every 16-bits in for Length
94 Value, and returns Buffer. Value is repeated every 32-bits in for Length
121 Value, and returns Buffer. Value is repeated every 64-bits in for Length
148 Value, and returns Buffer. Value is repeated every sizeof(UINTN) bytes for Length
/freebsd/sys/contrib/xz-embedded/linux/lib/xz/
H A Dxz_lzma2.h40 * either short or long repeated match, and NONLIT means any non-literal.
80 /* Indicate that the latest state was a long repeated match. */
/freebsd/contrib/tcpdump/
H A Dsignature.c77 * ipad is the byte 0x36 repeated 64 times in signature_compute_hmac_md5()
78 * opad is the byte 0x5c repeated 64 times in signature_compute_hmac_md5()

12345678910>>...26