| /openbsd-src/gnu/usr.bin/perl/t/op/ |
| H A D | each_array.t | 16 (@r) = each @array;
17 is (scalar @r, 2, "'each' on array returns index and value of next element");
20 ($k, $v) = each @array;
23 ($k, $v) = each @array;
26 (@r) = each @array;
30 (@r) = each @array;
34 ($k) = each @array;
39 (@r) = each @lex_array;
40 is (scalar @r, 2, "'each' on array returns index and value of next element");
43 ($k, $v) = each @lex_array;
[all …]
|
| H A D | smartkve.t | 89 # Each -- errors
90 set_errpat 'each';
92 eval "each undef";
94 'Errors: each undef throws error'
98 eval q"each $empty";
100 'Errors: each $undef throws error'
103 is($empty, undef, 'each $undef does not vivify $undef');
105 eval "each 3";
106 like($@, qr/Type of arg 1 to each must be hash/,
107 'Errors: each CONSTANT throws error'
[all …]
|
| H A D | each.t | 53 while (my ($key,$value) = each(%h)) {
61 is ($i, 30, "each count");
87 # test scalar each
91 $total += $key while $key = each %hash;
92 is ($total, 100, "test scalar each");
94 for (1..3) { my @foo = each %hash }
97 $total += $key while $key = each %hash;
100 for (1..3) { my @foo = each %hash }
102 $total += $key while $key = each %hash;
103 isnt ($total, 100, "test iterator of each is being maintained");
[all …]
|
| H A D | tiehash.t | 70 is(each %h, 'beer', "first iterator");
71 is(each %h, 'perl', "second iterator");
72 is(each %h, undef, "third iterator is undef");
87 my $k = each %h;
100 my $k1 = each %h;
107 my $k = each %h;
134 my $k1 = each %h;
142 my $k = each %h;
207 push @got, scalar each %Camelus;
208 push @got, scalar each %Camelus;
[all …]
|
| H A D | defins.t | 179 while (my $name = each %hash)
185 cmp_ok($seen,'==',1,'seen in each');
189 while (($seen ? $dummy : $name) = each %hash)
193 cmp_ok($seen,'==',$neg_sum < 0 ? 1 : 2,'seen in each ternary');
196 while ($where{$seen} = each %hash)
200 cmp_ok($seen,'==',1,'seen in each hash');
204 while (each %hash)
208 cmp_ok($seen,'==',1,'0 seen in $_ in while(each %hash)');
212 while (each @array)
216 cmp_ok($seen,'==',1,'0 seen in $_ in while(each @array)');
[all …]
|
| H A D | hashassign.t | 22 # Some of these tests are (effectively) duplicated in each.t
38 @temp = each %comma;
39 ok (eq_array (\@comma, \@temp), 'first each from comma hash');
40 @temp = each %comma;
41 ok (eq_array ([], \@temp), 'last each from comma hash');
56 @temp = each %temp;
57 ok (eq_array (\@temp, \@temp), 'first each from copy of comma hash');
58 @temp = each %temp;
59 ok (eq_array ([], \@temp), 'last each from copy of comma hash');
78 @temp = each %arrow;
[all …]
|
| /openbsd-src/share/man/man5/ |
| H A D | mandoc.db.5 | 28 Each manual page tree contains its own
60 Each file consists of:
79 The pages table contains one entry for each physical manual page
88 For each page:
103 For each page, the list of names.
104 Each name is preceded by a single byte indicating the sources of the name.
120 For each page, the list of sections.
121 Each section is given as a string, not as a number.
123 For each architecture-dependent page, the list of architectures.
125 For each page, the one-line description string taken from the .Nd macro.
[all …]
|
| /openbsd-src/gnu/usr.bin/perl/ext/Hash-Util-FieldHash/t/ |
| H A D | 11_hashassign.t | 17 # Some of these tests are (effectively) duplicated in each.t
34 @temp = each %comma;
35 is_deeply (\@comma, \@temp, 'first each from comma hash');
36 @temp = each %comma;
37 is_deeply ([], \@temp, 'last each from comma hash');
52 @temp = each %temp;
53 is_deeply (\@temp, \@temp, 'first each from copy of comma hash');
54 @temp = each %temp;
55 is_deeply ([], \@temp, 'last each from copy of comma hash');
75 @temp = each %arrow;
[all …]
|
| H A D | 05_perlhook.t | 21 # could be established. $counter will be incremented each time the
92 $x = each %h;
93 is( $counter, 1, "scalar each doesn't trigger");
96 $x = each %h;
97 is( $counter, 1, "scalar each doesn't trigger");
100 (@x) = each %h;
101 is( $counter, 1, "list each doesn't trigger");
174 $x = each %i;
175 () = each %i;
200 $x = each %j;
[all …]
|
| /openbsd-src/regress/usr.bin/mandoc/man/HP/ |
| H A D | spacing.in | 8 Each hanged paragraph gets a sufficient amount of text
17 Each hanged paragraph gets a sufficient amount of text
22 Each hanged paragraph gets a sufficient amount of text
27 Each hanged paragraph gets a sufficient amount of text
32 Each hanged paragraph gets a sufficient amount of text
37 Each hanged paragraph gets a sufficient amount of text
42 Each hanged paragraph gets a sufficient amount of text
47 Each hanged paragraph gets a sufficient amount of text
52 Each hanged paragraph gets a sufficient amount of text
57 Each hanged paragraph gets a sufficient amount of text
|
| H A D | spacing.out_ascii | 9 Each hanged paragraph gets a sufficient amount of text to wrap to the
16 Each hanged paragraph gets a sufficient amount of text to wrap to the
20 Each hanged paragraph gets a sufficient amount of text to wrap to the
24 Each hanged paragraph gets a sufficient amount of text to wrap to the
28 Each hanged paragraph gets a sufficient amount of text to wrap to the
32 Each hanged paragraph gets a sufficient amount of text to wrap to the
36 Each hanged paragraph gets a sufficient amount of text to wrap to the
40 Each hanged paragraph gets a sufficient amount of text to wrap to the
44 Each hanged paragraph gets a sufficient amount of text to wrap to the
48 Each hanged paragraph gets a sufficient amount of text to wrap to the
|
| /openbsd-src/games/cribbage/ |
| H A D | cribbage.n | 8 was played with hands of five cards; the modern game gives each player
18 The pack of 52. The cards in each suit rank: K (high), Q, J, 10,
19 9, 8, 7, 6, 5, 4, 3, 2, A. The counting values are: K, Q, J, 10, each 10
20 (wherefore these are called tenth cards); ace, 1; each other card, its
27 and narrow, in which are four rows of 30 holes each. At one end, or in the
29 placed between the two players, and each keeps his own score on the two
30 rows of holes nearest himself. Each is supplied with two pegs. Before the
35 each subsequent score, the rear peg is jumped ahead of the other, the
46 Nondealer cuts, and must leave at least four cards in each packet.
50 Each player receives six cards, dealt one at a time face down,
[all …]
|
| /openbsd-src/gnu/llvm/lldb/bindings/interface/ |
| H A D | SBSymbolContextList.i | 128 …y, None, doc='''Returns a list() of lldb.SBModule objects, one for each module in each SBSymbolCon…
129 … doc='''Returns a list() of lldb.SBCompileUnit objects, one for each compile unit in each SBSymbol…
130 …None, doc='''Returns a list() of lldb.SBFunction objects, one for each function in each SBSymbolCo…
131 …ay, None, doc='''Returns a list() of lldb.SBBlock objects, one for each block in each SBSymbolCont…
132 …ne, doc='''Returns a list() of lldb.SBLineEntry objects, one for each line entry in each SBSymbolC…
133 …y, None, doc='''Returns a list() of lldb.SBSymbol objects, one for each symbol in each SBSymbolCon…
|
| /openbsd-src/gnu/llvm/lldb/third_party/Python/module/unittest2/unittest2/test/ |
| H A D | test_functiontestcase.py | 16 # prior to each test. Likewise, if a tearDown() method is defined, the
17 # test runner will invoke that method after each test. In the example,
18 # setUp() was used to create a fresh sequence for each test."
41 # prior to each test. Likewise, if a tearDown() method is defined, the
42 # test runner will invoke that method after each test. In the example,
43 # setUp() was used to create a fresh sequence for each test."
67 # prior to each test. Likewise, if a tearDown() method is defined, the
68 # test runner will invoke that method after each test. In the example,
69 # setUp() was used to create a fresh sequence for each test."
93 # prior to each test. Likewise, if a tearDown() method is defined, the
[all …]
|
| /openbsd-src/usr.sbin/pkg_add/ |
| H A D | pkg_info.1 | 64 will report a summary line for each package, so that it is possible to
89 Show the one-line comment field for each package.
122 Show the long-description field for each package.
161 Show the packing-list instructions for each package.
170 for each package.
177 Show the files within each package.
182 Prefix each information category header (see
190 This lets you add a special token to the start of each field.
192 Show the install-message file (if any) for each package.
202 for each package.
[all …]
|
| /openbsd-src/usr.bin/join/ |
| H A D | join.1 | 62 is the field in each file by which the files are compared.
63 The first field in each line is used by default.
64 There is one line in the output for each pair of lines in
69 Each output line consists of the join field, the remaining fields from
120 In addition to the default output, produce a line for each unpairable
127 Specifies the fields that will be output from each file for
128 each line with matching join fields.
129 Each element of
157 Do not display the default output, but display a line for each unpairable
196 In addition to the default output, produce a line for each unpairable line
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/RISCV/ |
| H A D | RISCVInstrFormatsC.td | 48 // The immediate value encoding differs for each instruction, so each subclass
50 // The bits Inst{6-2} must be set for each instruction.
64 // The immediate value encoding differs for each instruction, so each subclass
66 // The bits Inst{12-7} must be set for each instruction.
90 // The immediate value encoding differs for each instruction, so each subclass
92 // The bits Inst{12-10} and Inst{6-5} must be set for each instruction.
105 // The immediate value encoding differs for each instruction, so each subclass
107 // The bits Inst{12-10} and Inst{6-5} must be set for each instruction.
|
| /openbsd-src/bin/ls/ |
| H A D | ls.1 | 47 For each operand that names a
53 For each named directory,
109 immediately after each pathname that is a directory,
112 after each that is executable,
115 after each symbolic link,
118 after each socket,
121 after each that is a FIFO.
143 For each file, print its inode number.
192 immediately after each pathname that is a directory.
206 Display the number of file system blocks actually used by each file,
[all …]
|
| /openbsd-src/lib/libc/time/ |
| H A D | tzfile.5 | 52 Each is used as a transition time
59 each one tells which of the different types of
78 Each structure is written as a four-byte value for
88 In each structure,
106 the first value of each pair gives the time
116 standard/wall indicators, each stored as a one-byte value;
124 UTC/local indicators, each stored as a one-byte value;
145 eight bytes are used for each transition time or leap second time.
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/testsuite/ |
| H A D | README.compat | 8 Each test in these suites splits up functionality into two source files
23 the site.exp file used by DejaGNU. The default is to build each test
24 with the compiler under test using the first of each pair of compiler
25 options from COMPAT_OPTIONS. When ALT_CXX_UNDER_TEST is "same", each
53 LD_LIBRARY_PATH for the alternate compiler in the support for each
58 knowledge about how to build a shared library for each target
61 knowledge about how to build a static library for each target
|
| /openbsd-src/sys/dev/pci/drm/ |
| H A D | drm_format_helper.c | 159 * within @dst; can be NULL if scanlines are stored next to each other.
166 * @dst_pitch and @src refer to arrays. Each array must have at least as many entries
167 * as there are planes in @fb's format. Each entry stores the value for the format's
233 * within @dst; can be NULL if scanlines are stored next to each other.
241 * parameters @dst, @dst_pitch and @src refer to arrays. Each array must have at
242 * least as many entries as there are planes in @fb's format. Each entry stores the
294 * within @dst; can be NULL if scanlines are stored next to each other.
301 * parameters @dst, @dst_pitch and @src refer to arrays. Each array must have at
302 * least as many entries as there are planes in @fb's format. Each entry stores the
363 * within @dst; can be NULL if scanlines are stored next to each other.
[all …]
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/doc/ |
| H A D | gcov.texi | 66 how often each line of code executes
72 how much computing time each section of code uses
76 can look at each module to see which modules should be optimized.
93 places only one statement on each line. If you use complicated macros
100 indicates how many times each line of a source file @file{@var{sourcefile}.c}
152 each branch in your program was taken.
182 Output summaries for each function in addition to the file level summary.
202 One @file{.gcov} file is produced for each source file containing code,
211 Additional block information may succeed each line, when requested by
230 Running the program will cause profile output to be generated. For each
[all …]
|
| /openbsd-src/share/man/man9/ |
| H A D | cpumem_get.9 | 71 allocates memory for each CPU from the
77 returns each CPUs memory allocation referenced by
88 memory for each CPU using
93 returns each CPU's memory allocation referenced by
180 macro iterates over each CPU's memory allocation referenced by
186 to each CPU's allocation in turn.
205 of access to each CPU's memory allocation.
214 will return an opaque cpumem pointer that references each CPU's
|
| /openbsd-src/regress/include/bitstring/good/ |
| H A D | 8 | 53 first 1 bit should move right 1 position each line
63 first 0 bit should move right 1 position each line
73 first 0 bit should move left 1 position each line
83 first 1 bit should move left 1 position each line
93 0 bit should move right 1 position each line
103 1 bit should move right 1 position each line
|
| /openbsd-src/usr.bin/rcs/ |
| H A D | rcsfile.5 | 25 It consists of four sections, each separated by two empty lines.
32 Each entry in this section consists of either one or multiple values.
55 Each entry consists of a symbolic name followed by a colon and
59 Each entry consists of a username followed by a colon and
81 Each entry begins with the revision number, followed by a newline.
88 each separated by dots.
90 The other values are specified in two digits each.
127 Each entry begins with the revision number, followed by a newline.
|