File | Code |
---|---|
CTILMES/DB-Pg…/Converter.pm6 :120: |
'_int2' => Array[Int], |
CTILMES/DB-Pg…/Converter.pm6 :121: |
'_int4' => Array[Int], |
CTILMES/DB-Pg…/Converter.pm6 :125: |
'_int8' => Array[Int], |
CTILMES/DB-Pg…/Converter.pm6 :133: |
'_oid' => Array[Int], |
TITSUKI/Algorithm-MinMaxHeap…/README.md :16: |
my $heap = Algorithm::MinMaxHeap[Int].new; |
TITSUKI/Algorithm-MinMaxHeap…/README.md :95: |
my $heap = Algorithm::MinMaxHeap[Int].new; |
TITSUKI/Algorithm-MinMaxHeap…/MinMaxHeap.pm6 :353: |
my $heap = Algorithm::MinMaxHeap[Int].new; |
TITSUKI/Algorithm-MinMaxHeap…/MinMaxHeap.pm6 :429: |
my $heap = Algorithm::MinMaxHeap[Int].new; |
TITSUKI/Algorithm-MinMaxHeap…/01-basic.t :5: |
lives-ok { my $heap = Algorithm::MinMaxHeap[Int].new; } |
TITSUKI/Algorithm-MinMaxHeap…/02-insert.t :7: |
my $heap = Algorithm::MinMaxHeap[Int].new; |
TITSUKI/Algorithm-MinMaxHeap…/02-insert.t :30: |
my $heap = Algorithm::MinMaxHeap[Int].new; |
TITSUKI/Algorithm-MinMaxHeap…/03-pop-max.t :6: |
my $heap = Algorithm::MinMaxHeap[Int].new; |
TITSUKI/Algorithm-MinMaxHeap…/03-pop-max.t :25: |
my $heap = Algorithm::MinMaxHeap[Int].new; |
TITSUKI/Algorithm-MinMaxHeap…/04-pop-min.t :6: |
my $heap = Algorithm::MinMaxHeap[Int].new; |
TITSUKI/Algorithm-MinMaxHeap…/04-pop-min.t :25: |
my $heap = Algorithm::MinMaxHeap[Int].new; |
TITSUKI/Algorithm-MinMaxHeap…/05-find-max.t :6: |
my $heap = Algorithm::MinMaxHeap[Int].new; |
TITSUKI/Algorithm-MinMaxHeap…/06-find-min.t :6: |
my $heap = Algorithm::MinMaxHeap[Int].new; |
TITSUKI/Algorithm-MinMaxHeap…/07-clear.t :6: |
my $heap = Algorithm::MinMaxHeap[Int].new; |
TITSUKI/Algorithm-MinMaxHeap…/08-clone.t :6: |
my $heap = Algorithm::MinMaxHeap[Int].new; |
WARRINGD/Font-AFM…/AFM.pm :214: |
:IsFixedPitch(Bool), :FontBBox(Array[Int]), :UnderlinePosition(Int), :UnderlineThickness(Int), |
WARRINGD/Font-AFM…/AFM.pm :228: |
when Array[Int] { [ $val.comb(/[<[+-]>|\w|"."]+/).map(*.Int) ] } |
WBIKER/IO-Prompt…/01-simple.t :44: |
[ q{ask_int( 'i3?' )}, 'i3? [Int] ', '11', 11 ], |
FCO/OrderedHash…/README.md :19: |
my %oh2 does OrderedHash[Int] = b => 2, a => 1; |
FCO/OrderedHash…/02-ordered-hash.t :45: |
my %oh3 does OrderedHash[Int]; |
Leont/getopt-long6…/basic.t :69: |
is-deeply($capture19, \(val('3'), :foo(Array[Int].new(1, 2))), 'Repeat specifier works'); |
Leont/getopt-long6…/basic.t :72: |
is-deeply($capture20, \(val('3'), :foo(Array[Int].new(1, 2))), 'Repeat specifier works with range'); |
MARTIMM/mongo-perl6-driver…/MongoDB.sxml :698: |
$td [Int] |
MARTIMM/mongo-perl6-driver…/MongoDB.sxml :722: |
$td [Int] |
atweiden/config-toml…/02-arrays.t :1218: |
┃ Success ┃ ~~ Array[Int] |
drforr/perl6-Marpa…/Marpa.pm6 :181: |
( Pointer[Int] $version ) |
drforr/perl6-Marpa…/Marpa.pm6 :185: |
( Pointer[Int] $version ) |
drforr/perl6-Marpa…/Marpa.pm6 :1078: |
( Marpa-Recognizer $r, Marpa-Earley-Set-ID $earley_set, Pointer[Int] $p_value, Pointer[Pointer[void]] $p_pvalue ) |
drforr/perl6-Marpa…/Marpa.pm6 :1082: |
( Marpa-Recognizer $r, Marpa-Earley-Set-ID $earley-set, Pointer[Int] $p-value, Pointer[Pointer[void]] $p-pvalue ) |
drforr/perl6-Marpa…/Marpa.pm6 :1327: |
( Marpa-Recognizer $r, Pointer[Int] $position, Pointer[Marpa-Earley-Set-ID] $origin ) |
drforr/perl6-Marpa…/Marpa.pm6 :1331: |
( Marpa-Recognizer $r, Pointer[Int] $position, Pointer[Marpa-Earley-Set-ID] $origin ) |
drforr/perl6-readline…/02-base.t :288: |
# lives-ok { my $rv = $r.get-history-event( $line, Pointer[Int] $cIndex, Str $delimiting-quote ) returns Str }; # XXX fix later |
drforr/perl6-readline…/02-base.t :323: |
## lives-ok { my $rv = $r.function-of-keyseq( $keyseq, $map, Pointer[Int] $type ) returns &callback (Int, Int --> Int) }; |
jonathanstowe/Audio-Sndfile…/Documentation.md :172: |
multi method read-int(Audio::Sndfile:D: Int $frames) returns Array[Int] |
jonathanstowe/Audio-Sndfile…/Sndfile.pm :237: |
multi method read-int(Audio::Sndfile:D: Int $frames) returns Array[Int] |
jonathanstowe/Chronic…/Chronic.pm :195: |
sub expand-expression(Str $exp, Range $r) returns Array[Int] { |
perl6/DBIish…/Native.pm6 :330: |
1005 => Array[Int], # Array(int2) |
perl6/DBIish…/Native.pm6 :331: |
1007 => Array[Int], # Array(int4) |
perl6/DBIish…/Native.pm6 :336: |
1028 => Array[Int], # Array<oid> |
perl6/DBIish…/36-pg-array.t :75: |
isa-ok $obj.pay_by_quarter, Array[Int], 'Array[Int]'; |
perl6/doc…/list.pod6 :509: |
is of type C<Array[Int]> and one can create one with C<Array[Int].new>. If |
perl6/doc…/list.pod6 :515: |
my @b := Array[Int].new(1, 2, 3); # Same thing, but the variable is not typed |
perl6/doc…/list.pod6 :516: |
my @b := Array[Int](1, 2, 3); # Rakudo shortcut for the same code |
perl6/doc…/list.pod6 :533: |
my @a := Array[Int].new(1, 2, 3); # fine |
perl6/doc…/list.pod6 :535: |
my Int @b := Array[Int].new(1, 2, 3); # fine |
perl6/doc…/list.pod6 :547: |
Calls that pass an Array[Int] will be successful: |
perl6/doc…/list.pod6 :551: |
say mean(@b); # @b is Array[Int] |
perl6/doc…/list.pod6 :552: |
say mean(Array[Int].new(1, 3, 5)); # Anonymous Array[Int] |
perl6/doc…/list.pod6 :553: |
say mean(my Int @ = 1, 3, 5); # Another anonymous Array[Int] |
perl6/doc…/objects.pod6 :949: |
my $t = BinaryTree[Int].new-from-list(4, 5, 6); |
perl6/doc…/terms.pod6 :271: |
constant @foo = Array[Int].new: 42; |
perl6/doc…/traps.pod6 :525: |
bar([1, 2, 3]); # expected Positional[Int] but got Array |
perl6/doc…/traps.pod6 :527: |
The problem here is that [1, 2, 3] is not an C<Array[Int]>, it is a plain |
perl6/doc…/traps.pod6 :529: |
the argument must also be an C<Array[Int]>. |
perl6/doc…/traps.pod6 :534: |
bar(Array[Int].new(1, 2, 3)); |
perl6/doc…/Attribute.pod6 :181: |
# OUTPUT: «(Positional[Int]) |
spitsh/spitsh…/CHANGELOG.md :213: |
- You can now augment parameterized classes. E.g List[Int].sum is |
spitsh/spitsh…/CHANGELOG.md :217: |
augment List[Int] { |
spitsh/spitsh…/CHANGELOG.md :221: |
say <1 2 3 4>.sum #->10, only works on List[Int]. |
spitsh/spitsh…/Bool.md :15: |
>method Int( ⟶ [Int](./Int.md)) |
spitsh/spitsh…/FD.md :20: |
>method getc([Int](./Int.md) **$n** ⟶ Bool) |
spitsh/spitsh…/File.md :31: |
>method at-pos([Int](./Int.md) **$i** ⟶ Str) |
spitsh/spitsh…/File.md :217: |
>method s( ⟶ [Int](./Int.md)) |
spitsh/spitsh…/File.md :221: |
>method size( ⟶ [Int](./Int.md)) |
spitsh/spitsh…/Int.md :4: |
>method ACCEPTS([Int](./Int.md) **$b** ⟶ Bool) |
spitsh/spitsh…/List.md :5: |
my List[Int] $ints = 1..10; |
spitsh/spitsh…/List.md :9: |
>method Int( ⟶ [Int](./Int.md)) |
spitsh/spitsh…/List.md :17: |
>method at-pos([Int](./Int.md) **$i** ⟶ Elem-Type) |
spitsh/spitsh…/List.md :30: |
>method elems( ⟶ [Int](./Int.md)) |
spitsh/spitsh…/List.md :64: |
>method set-pos([Int](./Int.md) **$pos**, Elem-Type **$item** ⟶ List) |
spitsh/spitsh…/Str.md :16: |
>method bytes( ⟶ [Int](./Int.md)) |
spitsh/spitsh…/Str.md :20: |
>method chars( ⟶ [Int](./Int.md)) |
spitsh/spitsh…/subs.md :75: |
>sub sleep([Int](../Int.md) **$seconds**) |
spitsh/spitsh…/Metamodel.pm6 :19: |
# say Foo[Int] ⟵ |
spitsh/spitsh…/Metamodel.pm6 :33: |
# you'll get a List[Int] |
spitsh/spitsh…/SAST.pm6 :602: |
expected => 'Int or List[Int]', |
spitsh/spitsh…/Int.sp :14: |
augment List[Int] { |
spitsh/spitsh…/List.sp :9: |
my List[Int] $ints = 1..10; |
spitsh/spitsh…/at-list-pos.t :15: |
class Foo is List[Int] {} |
spitsh/spitsh…/Pair.t :49: |
ok @a.values ~~ List[Int], '.values ~~ List[Int]'; |
spitsh/spitsh…/Pair.t :50: |
is @a.values.WHAT, 'List[Int]','.values.WHAT'; |
spitsh/spitsh…/for.t :135: |
is @o.WHAT, 'List[Int]', |
spitsh/spitsh…/for.t :138: |
is ( @(for <foo bar> { .chars,.chars }) ).WHAT, 'List[Int]', |
spitsh/spitsh…/for.t :139: |
"block that returns List[Int] doesn't make expr return List[List[Int]]"; |
spitsh/spitsh…/for.t :184: |
# This checks that a List[Int] doesn't get coerced to an Int |
spitsh/spitsh…/for.t :185: |
# in List[Int] context |
spitsh/spitsh…/for.t :186: |
is @b, <0 1 2 3 1 1 2 3 2 1 2 3>, 'for in List[Int] context'; |
spitsh/spitsh…/for.t :192: |
ok $i ~~ Int, 'iterating over List[Int] gives a -> $iterator element type Int'; |
spitsh/spitsh…/for.t :193: |
ok $i == 1, 'can use -> $iterator variable as a Int while iterating over List[Int]'; |
spitsh/spitsh…/int.t :8: |
is (1..5).sum, 15, 'List[Int].sum'; |
spitsh/spitsh…/list.t :20: |
is @a.WHAT,'List[Int]','@a = 0..5 has correct type'; |
spitsh/spitsh…/list.t :42: |
is @a.WHAT,'List[Int]','@a = 0..5 has correct type'; |
spitsh/spitsh…/list.t :129: |
class IntList is List[Int] { |
spitsh/spitsh…/list.t :135: |
ok IntList ~~ List[Int], 'IntList ~~ List[Int]'; |
spitsh/spitsh…/list.t :136: |
is IntList.PRIMITIVE, 'List[Int]', 'IntList primitive is List[Int]'; |
spitsh/spitsh…/list.t :151: |
ok @m.first(/3/) < @m.first(/88/), '.first on List[Int] return Int'; |
spitsh/spitsh…/list.t :152: |
is @m.grep(/^[45]/).sum, 100, '.grep on List[Int] returns a List[Int]'; |
spitsh/spitsh…/loop.t :22: |
ok (my $loop = (loop (my $j = 0; $j < 5; $j++) { $j*$j })) ~~ List[Int], |
spitsh/spitsh…/loop.t :36: |
is @d, <0 1 2 3 1 1 2 3 2 1 2 3>, 'loop in List[Int] context'; |
spitsh/spitsh…/parameterized-class.t :18: |
augment Foo[Int] { |
spitsh/spitsh…/parameterized-class.t :22: |
ok Foo[Int].doit ~~ Int,"Foo[Int].method returns Int"; |
spitsh/spitsh…/parameterized-class.t :23: |
is Foo[Int].doit.WHAT, 'Int', '.method.WHAT is "Int"'; |
spitsh/spitsh…/parameterized-class.t :24: |
is Foo[Int].echo(5),5,"Foo[Int].echo --> Int"; |
spitsh/spitsh…/parameterized-class.t :27: |
is Foo[Int].echo-list(5).WHAT, 'List[Int]', |
spitsh/spitsh…/parameterized-class.t :28: |
'--> List[Type] becomes List[Int]'; |
spitsh/spitsh…/parameterized-class.t :30: |
ok Foo[Int].return-type ~~ Foo[Int], '*return on Foo[Int]'; |
spitsh/spitsh…/parameterized-class.t :31: |
is Foo[Int].first-in-list(<4 3 2 1>), 4, 'List[Type] param accepts List[Int] in Foo[Int]'; |
spitsh/spitsh…/parameterized-class.t :33: |
is Foo[Int].aug-echo(5),5,"Foo[Int].aug-echo --> Int"; |
spitsh/spitsh…/parameterized-class.t :36: |
is Foo[Int].WHAT,Foo[Int],"Foo[Int].WHAT eq Foo[Int]"; |
spitsh/spitsh…/parameterized-class.t :37: |
is Foo[Int],'Foo[Int]',"Foo[Int] as a string is Foo[Int]"; |
spitsh/spitsh…/parameterized-class.t :39: |
ok Foo[Int] ~~ Foo, "Foo[Int] ~~ Foo"; |
spitsh/spitsh…/parameterized-class.t :40: |
ok Foo[Int] ~~ Foo[Int],"Foo[Int] ~~ Foo[Int]"; |
spitsh/spitsh…/parameterized-class.t :41: |
nok Foo ~~ Foo[Int], "Foo !~~ Foo[Int]"; |
spitsh/spitsh…/parameterized-class.t :42: |
ok Foo[Int] ~~ Foo[Str],'Foo[Int] ~~ Foo[Str]'; |
spitsh/spitsh…/parameterized-class.t :43: |
nok Foo[Str] ~~ Foo[Int],'Foo[Str] !~~ Foo[Str]'; |
spitsh/spitsh…/parameterized-class.t :45: |
is Foo[Int].double(3), 6, 'augment Foo[int] with a method'; |
spitsh/spitsh…/parameterized-class.t :70: |
class Child is Parent[Int] { |
spitsh/spitsh…/parameterized-class.t :74: |
is Parent[Int]<one>.return-self.WHAT, 'Parent[Int]', '* return .WHAT is parent'; |
spitsh/spitsh…/parameterized-class.t :75: |
ok Parent[Int]<one>.return-self ~~ Parent[Int], '* return ~~ parent type'; |
spitsh/spitsh…/sub.t :116: |
sub list-param(Int @a )-->List[Int] { |
spitsh/spitsh…/while.t :143: |
is @d, <0 1 2 3 1 1 2 3 2 1 2 3>, 'while in List[Int] context'; |
spitsh/spitsh…/curl.t :15: |
my @version = Pkg<curl>.version.split('.')-->List[Int]; |
spitsh/spitsh…/exceptions.t :66: |
Foo[Int].echo("blah"); |
titsuki/p6-Algorithm-Treap…/README.md :14: |
my $treap = Algorithm::Treap[Int].new; |
titsuki/p6-Algorithm-Treap…/Treap.pm6 :224: |
my $treap = Algorithm::Treap[Int].new; |
titsuki/p6-Algorithm-Treap…/02-insert.t :12: |
my $treap = Algorithm::Treap[Int].new; |
titsuki/p6-Algorithm-Treap…/02-insert.t :28: |
my $treap = Algorithm::Treap[Int].new; |
titsuki/p6-Algorithm-Treap…/02-insert.t :37: |
my $treap = Algorithm::Treap[Int].new; |
titsuki/p6-Algorithm-Treap…/02-insert.t :52: |
my $treap = Algorithm::Treap[Int].new; |
titsuki/p6-Algorithm-Treap…/03-delete.t :6: |
my $treap = Algorithm::Treap[Int].new; |
titsuki/p6-Algorithm-Treap…/03-delete.t :16: |
my $treap = Algorithm::Treap[Int].new; |
titsuki/p6-Algorithm-Treap…/03-delete.t :31: |
my $treap = Algorithm::Treap[Int].new; |
titsuki/p6-Algorithm-Treap…/03-delete.t :46: |
my $treap = Algorithm::Treap[Int].new; |
titsuki/p6-Algorithm-Treap…/03-delete.t :61: |
my $treap = Algorithm::Treap[Int].new; |
titsuki/p6-Algorithm-Treap…/04-find.t :7: |
my $treap = Algorithm::Treap[Int].new; |
titsuki/p6-Algorithm-Treap…/04-find.t :35: |
my $treap = Algorithm::Treap[Int].new; |
titsuki/p6-Algorithm-Treap…/04-find.t :48: |
my $treap = Algorithm::Treap[Int].new; |
titsuki/p6-Algorithm-Treap…/04-find.t :61: |
my $treap = Algorithm::Treap[Int].new; |
titsuki/p6-Algorithm-Treap…/04-find.t :74: |
my $treap = Algorithm::Treap[Int].new; |
titsuki/p6-Algorithm-Treap…/04-find.t :87: |
my $treap = Algorithm::Treap[Int].new; |
titsuki/p6-Algorithm-Treap…/05-find-first-key.t :6: |
my $treap = Algorithm::Treap[Int].new; |
titsuki/p6-Algorithm-Treap…/05-find-first-key.t :18: |
my $treap = Algorithm::Treap[Int].new(order-by => TOrder::DESC); |
titsuki/p6-Algorithm-Treap…/05-find-first-key.t :54: |
my $treap = Algorithm::Treap[Int].new; |
titsuki/p6-Algorithm-Treap…/06-find-last-key.t :6: |
my $treap = Algorithm::Treap[Int].new; |
titsuki/p6-Algorithm-Treap…/06-find-last-key.t :18: |
my $treap = Algorithm::Treap[Int].new(order-by => TOrder::DESC); |
titsuki/p6-Algorithm-Treap…/06-find-last-key.t :54: |
my $treap = Algorithm::Treap[Int].new; |
yowcow/p6-Algorithm-BloomFilter…/README.md :49: |
### calculate-shortest-filter-length(Int:D :$num-keys, Rat:D $error-rate) returns Hash[Int] |
yowcow/p6-Algorithm-BloomFilter…/README.md :53: |
### create-salts(Int:D :$count) returns Seq[Int] |
yowcow/p6-Algorithm-BloomFilter…/BloomFilter.pm6 :37: |
method calculate-shortest-filter-length(Int:D :$num-keys, Rat:D :$error-rate --> Hash[Int]) { |
yowcow/p6-Algorithm-BloomFilter…/BloomFilter.pm6 :155: |
=head3 calculate-shortest-filter-length(Int:D :$num-keys, Rat:D $error-rate) returns Hash[Int] |
yowcow/p6-Algorithm-BloomFilter…/BloomFilter.pm6 :159: |
=head3 create-salts(Int:D :$count) returns Seq[Int] |
yowcow/p6-Digest-MurmurHash3…/README.md :39: |
murmurhash3_128(Str $key, uint32 $seed) returns Array[Int] |
yowcow/p6-Digest-MurmurHash3…/README.md :42: |
Calculates 128-bit hash, and returns as Array[Int] with length of 4. |
yowcow/p6-Digest-MurmurHash3…/MurmurHash3.pm6 :49: |
our sub murmurhash3_128(Str:D $key, Int:D $seed --> Array[Int]) is export { |
yowcow/p6-Digest-MurmurHash3…/MurmurHash3.pm6 :55: |
Array[Int].new((fix-sign-bit(@hash[$_]) for ^4)); |
yowcow/p6-Digest-MurmurHash3…/MurmurHash3.pm6 :95: |
=head2 murmurhash3_128(Str $key, uint32 $seed) returns Array[Int] |
yowcow/p6-Digest-MurmurHash3…/MurmurHash3.pm6 :97: |
Calculates 128-bit hash, and returns as Array[Int] with length of 4. |
yowcow/p6-Digest-MurmurHash3…/02-murmurhash.t :38: |
is-deeply @result, Array[Int].new( |
zostay/P6W…/README.md :662: |
* The status code MUST be an [Int](http://doc.perl6.org/type/Int) or object that coerces to an Int. It MUST be a valid status code for the SERVER_PROTOCOL. |
zostay/P6W…/README.md :761: |
* The `CONTENT_LENGTH` SHOULD be set to an undefined [Int](http://doc.perl6.org/type/Int). |
Created
December 18, 2018 17:56
-
-
Save Whateverable/3b8524bcefea2103694183862a318289 to your computer and use it in GitHub Desktop.
greppable6
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
\[Int\] |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment