Home
last modified time | relevance | path

Searched refs:our (Results 1 – 25 of 954) sorted by relevance

12345678910>>...39

/openbsd/gnu/usr.bin/perl/t/lib/warnings/
H A Dpad23 our $x;
25 our $x;
52 our $x ;
61 our $z ;
81 our $x ;
105 our $x ;
110 our $p ;
114 our $z ;
120 our $q ;
285 our $y = our $y ;
[all …]
/openbsd/gnu/usr.bin/perl/t/mro/
H A Ddbic_c3_utf8.t21 our @ISA = qw/
33 our @ISA = qw/ Ẋẋ::ḐʙIＸ::Cl았::ﾛẈ /;
36 our @ISA = qw/ Ẋẋ::ḐʙIＸ::Cl았 /;
39 our @ISA = qw/
45 our @ISA = qw/
55 our @ISA = qw/
63 our @ISA = qw/ Ẋẋ::ḐʙIＸ::Cl았 /;
66 our @ISA = qw/ Ẋẋ::ḐʙIＸ::Cl았 /;
69 our @ISA = qw/ Ẋẋ::ḐʙIＸ::Cl았 /;
75 our @ISA = qw/
[all …]
H A Ddbic_dfs_utf8.t23 our @ISA = qw/
35 our @ISA = qw/ Ẋẋ::ḐʙIＸ::Cl았::ﾛẈ /;
38 our @ISA = qw/ Ẋẋ::ḐʙIＸ::Cl았 /;
41 our @ISA = qw/
47 our @ISA = qw/
57 our @ISA = qw/
65 our @ISA = qw/ Ẋẋ::ḐʙIＸ::Cl았 /;
68 our @ISA = qw/ Ẋẋ::ḐʙIＸ::Cl았 /;
71 our @ISA = qw/ Ẋẋ::ḐʙIＸ::Cl았 /;
77 our @ISA = qw/
[all …]
H A Ddbic_c3.t19 our @ISA = qw/
31 our @ISA = qw/ xx::DBIx::Class::Row /;
34 our @ISA = qw/ xx::DBIx::Class /;
37 our @ISA = qw/
43 our @ISA = qw/
53 our @ISA = qw/
61 our @ISA = qw/ xx::DBIx::Class /;
64 our @ISA = qw/ xx::DBIx::Class /;
67 our @ISA = qw/ xx::DBIx::Class /;
73 our @ISA = qw/
[all …]
H A Ddbic_dfs.t19 our @ISA = qw/
31 our @ISA = qw/ xx::DBIx::Class::Row /;
34 our @ISA = qw/ xx::DBIx::Class /;
37 our @ISA = qw/
43 our @ISA = qw/
53 our @ISA = qw/
61 our @ISA = qw/ xx::DBIx::Class /;
64 our @ISA = qw/ xx::DBIx::Class /;
67 our @ISA = qw/ xx::DBIx::Class /;
73 our @ISA = qw/
[all …]
H A Drecursion_dfs_utf8.t30 our @ISA = qw/ᶨ ィ/;
32 our @ISA = qw/ｆ/;
34 our @ISA = qw/ʰ ｆ/;
36 our @ISA = qw/ᶢ/;
38 our @ISA = qw/ᛞ/;
40 our @ISA = qw/ǝ/;
42 our @ISA = qw/ᛞ/;
44 our @ISA = qw/Ạ Ｂ ʗ/;
46 our @ISA = qw//;
48 our @ISA = qw//;
[all …]
H A Drecursion_c3_utf8.t33 our @ISA = qw/ᶨ ィ/;
36 our @ISA = qw/ｆ/;
39 our @ISA = qw/ʰ ｆ/;
42 our @ISA = qw/ᶢ/;
45 our @ISA = qw/ᛞ/;
48 our @ISA = qw/ǝ/;
51 our @ISA = qw/ᛞ/;
54 our @ISA = qw/Ạ Ｂ ʗ/;
57 our @ISA = qw//;
60 our @ISA = qw//;
[all …]
H A Drecursion_dfs.t27 our @ISA = qw/J I/;
29 our @ISA = qw/F/;
31 our @ISA = qw/H F/;
33 our @ISA = qw/G/;
35 our @ISA = qw/D/;
37 our @ISA = qw/E/;
39 our @ISA = qw/D/;
41 our @ISA = qw/A B C/;
43 our @ISA = qw//;
45 our @ISA = qw//;
[all …]
H A Drecursion_c3.t32 our @ISA = qw/J I/;
35 our @ISA = qw/F/;
38 our @ISA = qw/H F/;
41 our @ISA = qw/G/;
44 our @ISA = qw/D/;
47 our @ISA = qw/E/;
50 our @ISA = qw/D/;
53 our @ISA = qw/A B C/;
56 our @ISA = qw//;
59 our @ISA = qw//;
[all …]
H A Dbasic_utf8.t14 our @ISA = qw//;
16 our @ISA = qw//;
18 our @ISA = qw//;
20 our @ISA = qw/MRO_அ MRO_ɓ MRO_ᶝ/;
22 our @ISA = qw/MRO_அ MRO_ɓ MRO_ᶝ/;
24 our @ISA = qw/MRO_ｄ MRO_ɛ/;
146 our @ISA = qw/ｘｘ ƳƳ ƶƶ/;
163 our @ISA = qw/ＷẆ ｘｘ/;
166 our @ISA = qw/ƳƳ ƶƶ/;
180 our @ISA = qw/ＷẆ ｘｘ/;
[all …]
H A Dbasic.t18 our @ISA = qw//;
20 our @ISA = qw//;
22 our @ISA = qw//;
24 our @ISA = qw/MRO_A MRO_B MRO_C/;
26 our @ISA = qw/MRO_A MRO_B MRO_C/;
28 our @ISA = qw/MRO_D MRO_E/;
172 our @ISA = qw/WW XX/;
175 our @ISA = qw/YY ZZ/;
189 our @ISA = qw/WW XX/;
222 our @ISA = 'SUPERTEST';
[all …]
/openbsd/gnu/usr.bin/perl/cpan/Module-Metadata/t/
H A Dextract-version.t34 our $VERSION;
43 our $VERSION = '1.23';
52 our $VERSION;
60 our $VERSION = '1.23'; # our $VERSION = '4.56';
69 # our $VERSION = '4.56';
70 our $VERSION = '1.23';
361 our $VERSION;
371 our $VERSION;
381 our $VERSION;
391 our $VERSION;
[all …]
/openbsd/gnu/usr.bin/perl/t/comp/
H A Dour.t49 {our $x;}
52 {our ($x);}
55 {our %x;}
58 {our (%x);}
61 {our @x;}
64 {our (@x);}
72 our $y = $y;
/openbsd/gnu/usr.bin/perl/t/op/
H A Dattrs.t224 our $c;
231 our $t2a = \&{"t2"};
235 our $t3a = \&{"t3"};
240 our $t4b = $c;
245 our $t5b = $c;
260 our @GUKGUK := ();
264 our %GIGAZING := ();
276 our %THWUK := ();
280 our $BLIT := time;
284 our @FABADAP := ();
[all …]
H A Darray.t186 our @bee = @bee;
189 our (undef,@bee) = @bee;
192 our @bee = ('XXX',@bee,'YYY');
195 our @bee = our @bee = qw(foo bar burbl blah);
198 our (@bim) = our(@bee) = qw(foo bar);
377 our($x,$y,$z) = (1..3);
378 our($y,$z) = ($x,$y);
382 our($x,$y,$z) = (1..3);
383 (our $y, our $z) = ($x,$y);
389 our($x,$y,$z) = (1..3);
[all …]
/openbsd/gnu/usr.bin/perl/t/lib/strict/
H A Dvars346 our $freddy;
368 our $fred;
378 our $fred;
431 our $foo;
442 our $foo;
454 our $foo;
456 our $foo;
466 our $foo;
468 our $foo;
469 our $foo;
[all …]
/openbsd/gnu/usr.bin/perl/lib/perl5db/t/
H A Dgh-176613 { package C1; sub c1 { } our @ISA = qw(C2) }
4 { package C2; sub c2 { } our @ISA = qw(C3) }
5 { package C3; sub c3 { } our @ISA = qw( ) }
6 { package C4; sub c4 { } our @ISA = qw( ) }
7 { package C5; sub c5 { } our @ISA = qw(C1 C4) }
/openbsd/gnu/llvm/llvm/docs/tutorial/
H A DBuildingAJIT1.rst41 - `Chapter #4 <BuildingAJIT4.html>`_: Improve the laziness of our JIT by
49 To provide input for our JIT we will use a lightly modified version of the
92 In the previous section we described our API, now we examine a simple
99 use the lookup method of our JIT class find and execute the code for the
102 granted and focus our attention on the implementation of our JIT itself.
161 initialize our DL member. The constructor begins by initializing our
168 initialize our CompileLayer. The CompileLayer needs three things: (1) A
218 will build our IR modules.
233 this initial implementation of our JIT we will make our modules "available for
242 the Module's LLVMContext (our Ctx member) in a thread-friendly way. In our
[all …]
H A DBuildingAJIT2.rst42 added to it. In this Chapter we will make optimization a phase of our JIT
47 optimization managed by our JIT will allow us to optimize lazily too, rather
48 than having to do all our optimization up-front.
50 To add optimization support to our JIT we will take the KaleidoscopeJIT from
85 on top of our CompileLayer. We initialize our OptimizeLayer with a reference to
87 a *transform function*. For our transform function we supply our classes
97 Next we need to update our addModule method to replace the call to
204 fails, our emit function calls
235 our IRCompileLayer to compile the transformed IR, and our IRCompileLayer in
236 turn calls our ObjectLayer to link the object file produced by our compiler.
[all …]
/openbsd/gnu/usr.bin/perl/dist/Carp/t/
H A Dvivify_gv.t3 our $has_is_utf8; BEGIN { $has_is_utf8 = exists($utf8::{"is_utf8"}); }
4 our $has_dgrade; BEGIN { $has_dgrade = exists($utf8::{"downgrade"}); }
5 our $has_swashnew; BEGIN { $has_swashnew = exists($utf8::{"SWASHNEW"}); }
6 our $has_strval; BEGIN { $has_strval = exists($overload::{"StrVal"}); }
7 our $has_sv2obj; BEGIN { $has_sv2obj = exists($B::{"svref_2object"}); }
/openbsd/gnu/usr.bin/perl/cpan/NEXT/t/
H A Dunseen.t9 our @ISA = qw/B C D/;
16 our @ISA = qw/D C/;
21 our @ISA = qw/D/;
51 package Diamond::Left; our @ISA = qw[Diamond::Base];
53 package Diamond::Right; our @ISA = qw[Diamond::Base];
55 package Diamond::Top; our @ISA = qw[Diamond::Left Diamond::Right];
/openbsd/gnu/usr.bin/perl/dist/Storable/t/
H A Dmalice.t29 our $byteorder = $Config{byteorder};
31 our $file_magic_str = 'pst0';
32 our $other_magic = 7 + length $byteorder;
33 our $network_magic = 2;
34 our $major = 2;
35 our $minor = 12;
36 our $minor_write = $] >= 5.019 ? 11 : $] > 5.008 ? 9 : $] > 5.005_50 ? 8 : 4;
46 our $fancy = ($] > 5.007 ? 2 : 0);
52 our $file;
/openbsd/gnu/usr.bin/perl/lib/B/
H A DDeparse.t835 our @a;
839 our @a;
860 our $c;
1301 our @a;
1308 our @a;
1365 our @a;
2384 our $x;
2507 our $x;
2650 our @a;
2658 our @a;
[all …]
/openbsd/gnu/usr.bin/perl/t/uni/
H A Dwrite.t14 our ($bitem1, $uitem1) = ("\x{ff}", "\x{100}");
15 our ($bitem2, $uitem2) = ("\x{fe}", "\x{101}");
16 our ($blite1, $ulite1) = ("\x{fd}", "\x{102}");
17 our ($blite2, $ulite2) = ("\x{fc}", "\x{103}");
18 our ($bmulti, $umulti) = ("\x{fb}\n\x{fa}\n\x{f9}\n",
/openbsd/gnu/llvm/lldb/docs/use/
H A Dpython.rst32 When we try running our program, we find there is a problem. While it
55 trying to examine our binary search tree by hand is completely
97 Before we can call any Python function on any of our program's
100 the DFS function. The first parameter is going to be a node in our
182 is in our tree or not. To actually use it in LLDB on our dictionary program,
378 want to set our breakpoints on lines 113 and 115:
403 So, we set our breakpoints, enter our breakpoint command scripts, and see what happens:
449 After setting our breakpoints, adding our breakpoint commands and continuing,
452 tree, our search algorithm decided to go right, but our path says the node we
466 path from the current node to our word is:
[all …]

12345678910>>...39