| /openbsd-current/gnu/usr.bin/gcc/gcc/testsuite/g++.old-deja/g++.brendan/ |
| H A D | crash49.C | 5 const int keys = 10; variable
6 const int key[keys] = {6, key[1], 2, keys, 1, 7, 6, key[2], key[8]};
10 for(int i = 0; i < keys;) std::cout << key[i++] << " ";
|
| /openbsd-current/gnu/usr.bin/perl/ext/XS-APItest/t/ |
| H A D | savestack.t | 11 diag join ", ", map { $ix{$_} > 1 ? "$_ x $ix{$_}" : $_ } sort { $a <=> $b } keys %ix;
18 my $keys= 0+keys %ix;
19 cmp_ok($keys,">",0, "We expect at least one key in %ix for (??{ ... }) test");
20 cmp_ok($keys,"<=", 2, "We expect no more than two keys in %ix if (??{ ... }) does not leak")
25 $keys= 0+keys %ix;
26 cmp_ok($keys,">",0, "We expect at least one key in %ix for (?{ ... }) test");
27 cmp_ok($keys, "<
[all...] |
| /openbsd-current/gnu/usr.bin/perl/t/op/ |
| H A D | upgrade.t | 35 my @keys = keys %types;
36 plan tests => @keys * @keys;
38 foreach my $source_type (@keys) {
39 foreach my $dest_type (@keys) {
|
| H A D | hash.t | 27 keys(%h) = 1;
30 is($destroyed, 1, 'Timely hash destruction with lvalue keys');
33 # [perl #79178] Hash keys must not be stringified during compilation
45 'ref hash keys are not stringified during compilation';
50 'undef hash keys are not stringified during compilation, either';
131 # the same as 0+keys %hash;
133 my $count= 0+keys %$h;
135 is($scalar, $count, "$desc scalar() should be the same as 0+keys() as of perl 5.25");
161 # Remove half the keys each time round, until there are only 1 or 2 left
164 while (keys
[all...] |
| H A D | utfhash.t | 13 # Two hashes one with all 8-bit possible keys (initially), other
50 # Check we have not got an spurious extra keys
51 is(join('',sort { ord $a <=> ord $b } keys %hash8),"\x7f\xff");
52 is(join('',sort { ord $a <=> ord $b } keys %hashu),"\x7f\xff\x{1ff}");
57 # Check we have not got an spurious extra keys
58 is(join('',sort { ord $a <=> ord $b } keys %hash8),"\x7f\xff\x{1ff}");
72 is(join('',sort keys %hashu),"\x7f\xff");
89 print "# Unicode hash keys and \\w\n";
102 my $keys = scalar @u;
103 $keys
[all...] |
| H A D | each.t | 45 my @keys = keys %h;
48 is ($#keys, 29, "keys");
54 if ($key eq $keys[$i] && $value eq $values[$i]
63 @keys = ('blurfl', keys(%h), 'dyick');
64 is ($#keys, 31, "added a key");
72 keys %h = $size * 5;
75 keys
[all...] |
| /openbsd-current/gnu/usr.bin/perl/cpan/Tie-RefHash/t/ |
| H A D | storable.t | 49 my @keys = keys %$clone;
50 is( scalar(@keys), 2, "two keys in clone");
51 my $key = ref($keys[0]) ? shift @keys : pop @keys;
52 my $reg = $keys[0];
71 my @keys = keys
[all...] |
| /openbsd-current/regress/usr.bin/ssh/ |
| H A D | agent-timeout.sh | 14 trace "add keys with timeout"
15 keys=0
21 keys=$((${keys} + 1))
24 trace "agent has $n keys"
25 if [ $n -ne $keys ]; then
26 fail "ssh-add -l did not return $keys keys: $n"
33 fail "ssh-add -l still returns keys after timeout"
|
| /openbsd-current/gnu/usr.bin/perl/h2pl/ |
| H A D | getioctlsizes | 11 foreach $key ( sort keys %need ) {
|
| /openbsd-current/gnu/usr.bin/perl/t/re/ |
| H A D | reg_namedcapture.t | 26 print 0<keys(%Y) ? "" :"not ","ok ",++$test,"\n";
|
| /openbsd-current/gnu/usr.bin/perl/lib/perl5db/t/ |
| H A D | symbol-table-bug | 9 my @undef_symbols = grep { !defined $main{$_} } (keys %main);
|
| /openbsd-current/gnu/usr.bin/perl/t/comp/ |
| H A D | retainedlines.t | 47 my @before = grep { /eval/ } keys %::;
58 # sort in decreasing number so that $keys[0] is the from the most
60 # breaks we might have more than one, and keys will return them in a
63 my @keys = map { $_->[0] }
66 keys %::;
68 is ((scalar @keys), 1, "1 new eval");
70 my @got_lines = @{$::{$keys[0]}};
79 # so we need to mark them all seen (older code only marked $keys[0]
81 $seen{$_}++ for @keys;
133 my @after = grep { /eval/ } keys
[all...] |
| /openbsd-current/gnu/usr.bin/perl/cpan/Scalar-List-Utils/t/ |
| H A D | rt-96343.t | 15 is( ( first { 'hello world' eq lc($_) } keys %$hash ), "HellO WorlD",
29 any { lc($_); $var = $_; } keys %$hash;
|
| /openbsd-current/gnu/usr.bin/perl/t/porting/ |
| H A D | args_assert.t | 40 cmp_ok(scalar keys %declared, '>', 0, 'Some macros were declared');
59 foreach (keys %declared) {
63 if (keys %unused) {
64 fail("$_ is declared but not used") foreach sort keys %unused;
|
| H A D | re_context.t | 32 sort keys %::;
|
| /openbsd-current/usr.bin/mandoc/ |
| H A D | tbl_opts.c | 40 static const struct tbl_phrase keys[] = { variable in typeref:struct:tbl_phrase
58 #define KEY_MAXKEYS ((int)(sizeof(keys)/sizeof(keys[0])))
105 "%s", keys[key].name);
108 "%s want %d have %d", keys[key].name, want, len);
152 (strncasecmp(p + pos, keys[i].name, len) ||
153 keys[i].name[len] != '\0'))
166 if (keys[i].key)
167 tbl->opts.opts |= keys[i].key;
|
| /openbsd-current/gnu/usr.bin/perl/t/perf/ |
| H A D | benchmarks.t | 39 plan keys(%benchmarks) * 4;
46 for my $token (sort keys %benchmarks) {
49 my @keys = sort keys %{$benchmarks{$token}};
50 my @invalid = grep !exists $valid_keys{$_}, @keys;
51 ok(!@invalid, "$token: only valid keys present")
52 or diag("saw these invalid keys: (@invalid)");
55 ok(!@missing, "$token: all required keys present")
56 or diag("these keys are missing: (@missing)");
61 for my $token (sort keys
[all...] |
| /openbsd-current/gnu/usr.bin/perl/dist/Text-Abbrev/t/ |
| H A D | Abbrev.t | 13 my $r = join ':', sort keys %x;
35 my $s = join ':', sort keys %y;
39 $s = join ':', sort keys %$y;
45 $s = join ':', sort keys %y;
|
| /openbsd-current/gnu/usr.bin/perl/ext/Hash-Util/t/ |
| H A D | Util.t | 140 is( keys %hash, 0, 'lock_keys() w/keyset shouldnt add new keys' );
142 is( keys %hash, 1, '1 element in hash' );
155 is( keys %hash, 3, 'lock_keys() w/keyset didnt add new keys' );
216 is (scalar keys %hash, 0, "place holder isn't a key");
218 is (scalar keys %hash, 1, "we now have a key");
220 is (scalar keys %hash, 0, "now no key");
225 is (scalar keys %hash, 1, "key again");
227 is (scalar keys
[all...] |
| /openbsd-current/gnu/usr.bin/perl/ext/SDBM_File/t/ |
| H A D | prep.t | 22 is(keys %h, 0, "should be empty");
33 is_deeply([ sort keys %h] , [ qw(abc def) ], "should have two keys");
|
| /openbsd-current/gnu/usr.bin/perl/t/bigmem/ |
| H A D | hash.t | 25 qr/^\QSorry, hash keys must be smaller than 2**31 bytes\E\b/,
31 qr/^\QSorry, hash keys must be smaller than 2**31 bytes\E\b/,
|
| /openbsd-current/regress/usr.sbin/pkg_add/ |
| H A D | inject-order | 19 my @l = keys %{$self->{all_dependencies}};
|
| /openbsd-current/gnu/usr.bin/perl/t/benchmark/ |
| H A D | gh7094-speed-up-keys-on-empty-hash.t | 10 gh7094 - benchmark speed for keys() on empty hashes
14 If you have an empty hash, the speed of keys() depends
15 on how many keys the hash previously held.
21 the number or list of keys from an empty hash is about the same
39 delete @h_big{keys %h_big};
40 delete @h_small{keys %h_small};
41 delete @l_big{keys %l_big};
42 delete @l_small{keys %l_small};
45 big => '1 for keys %h_big',
46 small => '1 for keys
[all...] |
| /openbsd-current/gnu/usr.bin/perl/lib/Tie/ |
| H A D | ExtraHash.t | 17 is_deeply([sort keys %hash], [sort keys %tied], "FIRSTKEY/NEXTKEY");
|
| /openbsd-current/usr.sbin/mtree/ |
| H A D | create.c | 59 extern u_int keys;
122 if (sflag && keys & F_CKSUM)
158 if (keys & F_UNAME) {
167 if (keys & F_UID)
171 if (keys & F_GNAME) {
180 if (keys & F_GID)
183 if (keys & F_MODE && (p->fts_statp->st_mode & MBITS) != mode)
185 if (keys & F_NLINK && p->fts_statp->st_nlink != 1)
187 if (keys & F_SIZE && S_ISREG(p->fts_statp->st_mode))
190 if (keys
[all...] |