Home
last modified time | relevance | path

Searched refs:keys (Results 1 – 25 of 718) sorted by relevance

12345678910>>...29

/openbsd/gnu/usr.bin/perl/ext/Hash-Util-FieldHash/t/
H A D02_function.t25 my ( $key) = keys %h;
39 my ( $key) = keys %h;
105 my ( $id) = keys %f;
157 keys %$ob_reg,
187 is( keys %f, $size, "many keys singly");
194 is( keys %f, 0, "many keys singly gone");
196 keys %$ob_reg,
204 is( keys %f, $size, "many keys at once");
211 is( keys %f, 0, "many keys at once gone");
213 keys %$ob_reg,
[all …]
/openbsd/gnu/usr.bin/perl/ext/Hash-Util/lib/Hash/
H A DUtil.pm177 my($hash, @keys) = @_;
180 if( @keys ) {
181 my %keys = map { ($_ => 1) } @keys;
185 unless $keys{$k};
188 foreach my $k (@keys) {
243 my ($hash,@keys) = @_;
246 foreach my $key (@keys) {
620 (( $keys / (2 * $buckets )) * ( $keys + ( 2 * $buckets ) - 1 ))
621 if $keys;
630 …return $keys, $buckets, $used, $keys ? ($score, $used/$buckets, ($keys-$used)/$keys, $mean, $stdde…
[all …]
/openbsd/gnu/usr.bin/perl/ext/XS-APItest/t/
H A Dhash.t26 foreach (@keys) {
29 main_tests (\@keys, \@testkeys, '');
31 foreach (@keys) {
368 @keys = sort keys %$hash;
381 @keys = sort keys %$hash;
394 @keys = sort keys %$hash;
401 @keys = sort keys %$hash;
408 @keys = sort keys %$hash;
415 @keys = sort keys %$hash;
514 @hash{@$keys} = @$keys;
[all …]
H A Dsavestack.t18 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, "<=", 2, "We expect no more than two keys in %ix if (?{ ... }) does not leak")
32 $keys= 0+keys %ix;
33 cmp_ok($keys,">",0, "We expect at least one key in %ix for (?(?{ ... })yes|no) test");
34 cmp_ok($keys, "<=", 2, "We expect no more than two keys in %ix if (?(?{ ... })yes|no) does not leak…
/openbsd/gnu/usr.bin/perl/t/comp/
H A Dretainedlines.t47 my @before = grep { /eval/ } keys %::;
63 my @keys = map { $_->[0] }
66 keys %::;
70 my @got_lines = @{$::{$keys[0]}};
81 $seen{$_}++ for @keys;
133 my @after = grep { /eval/ } keys %::;
135 is (scalar @after, 0 + keys %seen,
144 my @after = grep { /eval/ } keys %::;
146 is (scalar @after, 0 + keys %seen,
163 is (scalar @after, 0 + keys %seen,
[all …]
/openbsd/usr.sbin/mtree/
H A Dcreate.c59 extern u_int keys;
167 if (keys & F_UID) in statf()
180 if (keys & F_GID) in statf()
190 if (keys & F_TIME) in statf()
237 if (keys & F_SLINK && in statf()
321 if ((((keys & F_UNAME) | (keys & F_UID)) && (*puid != saveuid)) || in statd()
322 (((keys & F_GNAME) | (keys & F_GID)) && (*pgid != savegid)) || in statd()
335 if (keys & F_UID) in statd()
343 if (keys & F_GID) in statd()
345 if (keys & F_MODE) in statd()
[all …]
/openbsd/gnu/usr.bin/perl/t/op/
H A Dhash.t27 keys(%h) = 1;
133 my $count= 0+keys %$h;
164 while (keys %$h > 2) {
166 my @keys = (sort keys %$h)[0..$take];
169 delete @$h{@keys};
172 my $count = keys %$h;
176 ++$h2->{$_} foreach @keys;
202 my @keys = sort keys %$h;
203 delete @$h{@keys};
209 foreach (@keys) {
[all …]
H A Dutfhash.t51 is(join('',sort { ord $a <=> ord $b } keys %hash8),"\x7f\xff");
72 is(join('',sort keys %hashu),"\x7f\xff");
102 my $keys = scalar @u;
103 $keys .= ($keys == 1) ? " key" : " keys";
105 for (keys %u) {
145 for (keys %bytes_first) {
153 for (keys %bytes_first) {
161 for (keys %utf8_first) {
169 for (keys %utf8_first) {
199 for my $key (keys %foo) {
[all …]
H A Deach.t45 my @keys = keys %h;
63 @keys = ('blurfl', keys(%h), 'dyick');
72 keys %h = $size * 5;
75 keys %h = 1;
95 keys %hash;
129 keys(%hash) = keys(%hash);
133 keys(%hash) = $size + 100;
158 foreach (keys %u) {
195 for my $k (qw(each keys values)) {
203 my $count=keys %foo;
[all …]
H A Dupgrade.t35 my @keys = keys %types;
36 plan tests => @keys * @keys;
38 foreach my $source_type (@keys) {
39 foreach my $dest_type (@keys) {
H A Dtiehash.t83 my @want = sort keys %h;
98 keys %h;
132 keys %h;
179 @a = keys %tied;
201 my @keys = qw(bactrianus dromedarius ferus);
204 for @keys;
214 keys %Camelus;
220 my @all = keys %Camelus;
232 is(join(' ', sort keys %have), "@keys", 'Still the correct three keys');
/openbsd/regress/sbin/ipsecctl/
H A Dsafail3.ok1 stdin: 4: aesctr is disallowed with static keys
2 stdin: 8: aes-128-ctr is disallowed with static keys
3 stdin: 12: aes-192-ctr is disallowed with static keys
4 stdin: 16: aes-256-ctr is disallowed with static keys
5 stdin: 19: aes-128-gcm is disallowed with static keys
6 stdin: 22: aes-192-gcm is disallowed with static keys
7 stdin: 25: aes-256-gcm is disallowed with static keys
8 stdin: 28: aes-128-gmac is disallowed with static keys
9 stdin: 31: aes-192-gmac is disallowed with static keys
10 stdin: 34: aes-256-gmac is disallowed with static keys
/openbsd/gnu/usr.bin/perl/cpan/Tie-RefHash/t/
H A Dstorable.t49 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 %$clone;
72 is( scalar(@keys), 1, "one key in clone");
73 my $key = $keys[0];
/openbsd/gnu/gcc/gcc/
H A Dpointer-set.c198 void **keys; member
220 XDELETEVEC (pmap->keys); in pointer_map_destroy()
236 if (pmap->keys[n] == p) in pointer_map_contains()
238 else if (pmap->keys[n] == 0) in pointer_map_contains()
267 if (pmap->keys[i]) in pointer_map_insert()
269 void *key = pmap->keys[i]; in pointer_map_insert()
275 XDELETEVEC (pmap->keys); in pointer_map_insert()
279 pmap->keys = new_keys; in pointer_map_insert()
284 if (!pmap->keys[n]) in pointer_map_insert()
287 pmap->keys[n] = p; in pointer_map_insert()
[all …]
/openbsd/games/tetris/
H A Dtetris.c154 char *keys; in main() local
173 keys = "jkl pq"; in main()
217 if (keys[i] == keys[j]) in main()
220 if (keys[i] == ' ') in main()
223 key_write[i][0] = keys[i]; in main()
289 if (c == keys[5]) { in main()
293 if (c == keys[4]) { in main()
309 if (c == keys[0]) { in main()
315 if (c == keys[1]) { in main()
324 if (c == keys[2]) { in main()
[all …]
/openbsd/usr.bin/mandoc/
H A Dtbl_opts.c40 static const struct tbl_phrase keys[] = { variable
58 #define KEY_MAXKEYS ((int)(sizeof(keys)/sizeof(keys[0])))
105 "%s", keys[key].name); in arg()
108 "%s want %d have %d", keys[key].name, want, len); in arg()
152 (strncasecmp(p + pos, keys[i].name, len) || in tbl_option()
153 keys[i].name[len] != '\0')) in tbl_option()
166 if (keys[i].key) in tbl_option()
167 tbl->opts.opts |= keys[i].key; in tbl_option()
/openbsd/gnu/usr.bin/perl/dist/Storable/t/
H A Ddowngrade.t105 my @keys = keys %$hash;
114 ok (eq_array([keys %$hash], \@keys), "Still the same keys?");
119 my @keys = keys %$hash;
128 ok (eq_array([keys %$hash], \@keys), "Still the same keys?");
190 for (keys %$hash) {
199 for (keys %$hash) {
249 begin 101 Locked keys
254 begin 101 Locked keys placeholder
333 begin 101 Hash with utf8 keys
361 begin 301 Locked keys
[all …]
H A Dutf8hash.t61 return scalar keys %$href;
75 for my $k (sort keys %$thawed){
88 for my $k (sort keys %$retrieved){
99 for my $k (sort keys %$retrieved){
141 for (keys %hash) {
152 for (keys %$copy) {
168 cmp_ok (scalar keys %$just_utf8, '==', 1, "1 key in utf8?");
179 cmp_ok (scalar keys %$just_bytes, '==', 1, "1 key in bytes?");
193 cmp_ok (scalar keys %$both, '==', 2, "2 keys?");
/openbsd/gnu/usr.bin/perl/ext/Hash-Util/t/
H A DUtil.t274 my @keys = qw(small medium large);
286 lock_keys ( %target, @keys ) if $lock;
422 my @keys=sort(keys(%hash));
441 my @keys=sort numbers_first keys(%hash);
454 my @keys=sort(keys(%hash));
466 my @keys=sort numbers_first keys(%hash);
477 my @keys=sort numbers_first keys(%hash);
488 my @keys=sort numbers_first keys(%hash);
518 my @keys = ();
522 my $ref = all_keys(%hash, @keys, @ph);
[all …]
/openbsd/gnu/usr.bin/perl/dist/threads-shared/t/
H A D0nothread.t14 is(keys %hash, 0, "hash empty");
16 is(keys %hash,1, "Assign grows hash");
19 is(keys %hash,2, "Assign grows hash");
23 is(keys %hash,3,"Size correct");
24 my @keys = keys %hash;
25 is(join(',',sort @keys),'0,1,2',"Keys correct");
30 is(keys %hash,2,"Size correct");
35 is(keys %hash,0,"Clear hash");
/openbsd/gnu/usr.bin/perl/cpan/Digest-SHA/t/
H A Dfips198.t13 my @keys = ("", "", "", "");
15 for (0x00 .. 0x00+63) { $keys[0] .= chr($_) }
16 for (0x30 .. 0x30+19) { $keys[1] .= chr($_) }
17 for (0x50 .. 0x50+99) { $keys[2] .= chr($_) }
18 for (0x70 .. 0x70+48) { $keys[3] .= chr($_) }
25 print "not " unless hmac_sha1_hex(shift @data, shift @keys)
/openbsd/regress/usr.bin/ssh/
H A Dagent-timeout.sh15 keys=0
21 keys=$((${keys} + 1))
25 if [ $n -ne $keys ]; then
26 fail "ssh-add -l did not return $keys keys: $n"
/openbsd/gnu/usr.bin/perl/os2/OS2/OS2-PrfDB/
H A DPrfDB.pm83 my $keys = OS2::Prf::Get($self->[0]->[0], undef, undef);
84 return undef unless defined $keys;
85 chop($keys);
86 $self->[1] = [split /\0/, $keys];
173 my $keys = OS2::Prf::Get($self->[0]->[0], $self->[3], undef);
174 return undef unless defined $keys;
175 chop($keys);
176 $self->[1] = [split /\0/, $keys];
/openbsd/gnu/usr.bin/perl/t/perf/
H A Dbenchmarks.t39 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;
61 for my $token (sort keys %benchmarks) {
/openbsd/usr.sbin/unbound/testcode/
H A Dsignit.c128 ldns_key_list* keys = ldns_key_list_new(); in read_keys() local
135 if(!keys) fatal_exit("alloc failure"); in read_keys()
155 b = ldns_key_list_push_key(keys, k); in read_keys()
158 return keys; in read_keys()
198 signit(ldns_rr_list* rrs, ldns_key_list* keys) in signit() argument
206 sigs = ldns_sign_public(rrset, keys); in signit()
221 ldns_key_list* keys; in process_keys() local
226 keys = read_keys(1, argv+5, &settings); in process_keys()
228 signit(rrs, keys); in process_keys()
231 ldns_key_list_free(keys); in process_keys()

12345678910>>...29