-
-
Notifications
You must be signed in to change notification settings - Fork 373
/
Int.pm6
539 lines (479 loc) · 17 KB
/
Int.pm6
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
my class Rat { ... }
my class X::Cannot::Capture { ... }
my class X::Numeric::DivideByZero { ... }
my class X::NYI::BigInt { ... }
my class Int { ... }
my subset UInt of Int where {
nqp::not_i(nqp::isconcrete($_)) || nqp::isge_I($_,0)
}
my class Int does Real { # declared in BOOTSTRAP
# class Int is Cool
# has bigint $!value is box_target;
multi method WHICH(Int:D: --> ValueObjAt:D) {
nqp::box_s(
nqp::concat(
nqp::if(
nqp::eqaddr(self.WHAT,Int),
'Int|',
nqp::concat(nqp::unbox_s(self.^name), '|')
),
nqp::tostr_I(self)
),
ValueObjAt
)
}
proto method new(|) {*}
multi method new( \value --> Int:D) { self.new: value.Int }
multi method new(int \value --> Int:D) {
# rebox the value, so we get rid of any potential mixins
nqp::fromI_I(nqp::decont(value), self)
}
multi method new(Int:D \value = 0 --> Int:D) {
# rebox the value, so we get rid of any potential mixins
nqp::fromI_I(nqp::decont(value), self)
}
multi method perl(Int:D: --> Str:D) {
self.Str;
}
multi method Bool(Int:D: --> Bool:D) {
nqp::hllbool(nqp::bool_I(self));
}
method Capture() { X::Cannot::Capture.new( :what(self) ).throw }
method Int(--> Int) { self }
multi method Str(Int:D: --> Str:D) {
nqp::p6box_s(nqp::tostr_I(self));
}
method Num(Int:D: --> Num:D) {
nqp::p6box_n(nqp::tonum_I(self));
}
method Rat(Int:D: $? --> Rat:D) {
nqp::p6bindattrinvres(
nqp::p6bindattrinvres(nqp::create(Rat),Rat,'$!numerator',self),
Rat,'$!denominator',1
)
}
method FatRat(Int:D: $? --> FatRat:D) {
nqp::p6bindattrinvres(
nqp::p6bindattrinvres(nqp::create(FatRat),FatRat,'$!numerator',self),
FatRat,'$!denominator',1
)
}
method abs(Int:D: --> Int:D) {
nqp::abs_I(self, Int)
}
method Bridge(Int:D: --> Num:D) {
nqp::p6box_n(nqp::tonum_I(self));
}
method chr(Int:D: --> Str:D) {
nqp::if(
nqp::isbig_I(self),
die("Error encoding UTF-8 string: could not encode codepoint %i (0x%X), codepoint out of bounds.".sprintf(self, self)),
nqp::p6box_s(nqp::chr(nqp::unbox_i(self)))
)
}
method sqrt(Int:D: --> Num:D) {
nqp::p6box_n(nqp::sqrt_n(nqp::tonum_I(self)))
}
proto method base(|) {*}
multi method base(Int:D: Int:D $base --> Str:D) {
2 <= $base <= 36
?? nqp::p6box_s(nqp::base_I(self,nqp::unbox_i($base)))
!! Failure.new(X::OutOfRange.new(
what => "base argument to base", :got($base), :range<2..36>))
}
multi method base(Int:D: Int(Cool) $base, $digits? --> Str:D) {
2 <= $base <= 36
?? $digits && ! nqp::istype($digits, Whatever)
?? $digits < 0
?? Failure.new(X::OutOfRange.new(
:what('digits argument to base'),:got($digits),:range<0..1073741824>))
!! nqp::p6box_s(nqp::base_I(self,nqp::unbox_i($base)))
~ '.'
~ '0' x $digits
!! nqp::p6box_s(nqp::base_I(self,nqp::unbox_i($base)))
!! Failure.new(X::OutOfRange.new(
:what('base argument to base'),:got($base),:range<2..36>))
}
# If self is Int, we assume mods are Ints also. (div fails otherwise.)
# If do-not-want, user should cast invocant to proper domain.
method polymod(Int:D: +@mods --> Seq:D) {
fail X::OutOfRange.new(
:what('invocant to polymod'), :got(self), :range<0..^Inf>
) if self < 0;
gather {
my $more = self;
if @mods.is-lazy {
for @mods -> $mod {
$more
?? $mod
?? take $more mod $mod
!! Failure.new(X::Numeric::DivideByZero.new:
using => 'polymod', numerator => $more)
!! last;
$more = $more div $mod;
}
take $more if $more;
}
else {
for @mods -> $mod {
$mod
?? take $more mod $mod
!! Failure.new(X::Numeric::DivideByZero.new:
using => 'polymod', numerator => $more);
$more = $more div $mod;
}
take $more;
}
}
}
method expmod(Int:D: Int:D \base, Int:D \mod --> Int:D) {
nqp::expmod_I(self, nqp::decont(base), nqp::decont(mod), Int);
}
method is-prime(--> Bool:D) { nqp::hllbool(nqp::isprime_I(self,100)) }
method floor(Int:D: --> Int:D) { self }
method ceiling(Int:D: --> Int:D) { self }
proto method round(|) {*}
multi method round(Int:D: --> Int:D) { self }
multi method round(Int:D: Real(Cool) $scale --> Real:D) {
(self / $scale + 1/2).floor * $scale
}
method lsb(Int:D: --> Int:D) {
nqp::unless(
self, # short-circuit `0`, as it doesn't have any bits set…
Nil, # … and the algo we'll use requires at least one that is.
nqp::stmts(
(my int $lsb),
(my $x := nqp::abs_I(self, Int)),
nqp::while( # "fast-forward": shift off by whole all-zero-bit bytes
nqp::isfalse(nqp::bitand_I($x, 0xFF, Int)),
nqp::stmts(
($lsb += 8),
($x := nqp::bitshiftr_I($x, 8, Int)))),
nqp::while( # our lsb is in the current byte; shift off zero bits
nqp::isfalse(nqp::bitand_I($x, 0x01, Int)),
nqp::stmts(
++$lsb,
($x := nqp::bitshiftr_I($x, 1, Int)))),
$lsb)) # we shifted enough to get to the first set bit
}
method msb(Int:D: --> Int:D) {
nqp::unless(
self,
Nil,
nqp::if(
nqp::iseq_I(self, -1),
0,
nqp::stmts(
(my int $msb),
(my $x := self),
nqp::islt_I($x, 0) # handle conversion of negatives
&& ($x := nqp::mul_I(-2,
nqp::add_I($x, 1, Int), Int)),
nqp::while(
nqp::isgt_I($x, 0xFF),
nqp::stmts(
($msb += 8),
($x := nqp::bitshiftr_I($x, 8, Int)))),
nqp::isgt_I($x, 0x0F)
&& ($msb += 4) && ($x := nqp::bitshiftr_I($x, 4, Int)),
nqp::bitand_I($x, 0x8, Int) && ($msb += 3)
|| nqp::bitand_I($x, 0x4, Int) && ($msb += 2)
|| nqp::bitand_I($x, 0x2, Int) && ($msb += 1),
$msb)))
}
method narrow(Int:D: --> Int:D) { self }
method Range(Int:U: --> Range:D) {
given self {
when int { $?BITS == 64 ?? int64.Range !! int32.Range }
when uint { $?BITS == 64 ?? uint64.Range !! uint32.Range }
when int64 { Range.new(-9223372036854775808, 9223372036854775807) }
when int32 { Range.new( -2147483648, 2147483647 ) }
when int16 { Range.new( -32768, 32767 ) }
when int8 { Range.new( -128, 127 ) }
# Bring back in a future Perl 6 version, or just put on the type object
#when int4 { Range.new( -8, 7 ) }
#when int2 { Range.new( -2, 1 ) }
#when int1 { Range.new( -1, 0 ) }
when uint64 { Range.new( 0, 18446744073709551615 ) }
when uint32 { Range.new( 0, 4294967295 ) }
when uint16 { Range.new( 0, 65535 ) }
when uint8 { Range.new( 0, 255 ) }
when byte { Range.new( 0, 255 ) }
# Bring back in a future Perl 6 version, or just put on the type object
#when uint4 { Range.new( 0, 15 ) }
#when uint2 { Range.new( 0, 3 ) }
#when uint1 { Range.new( 0, 1 ) }
default { # some other kind of Int
.^name eq 'UInt'
?? Range.new( 0, Inf, :excludes-max )
!! Range.new( -Inf, Inf, :excludes-min, :excludes-max )
}
}
}
my $nuprop := nqp::null;
my $deprop := nqp::null;
method unival(Int:D:) {
my str $de = nqp::getuniprop_str(
self,
nqp::ifnull(
$deprop,
$deprop := nqp::unipropcode("Numeric_Value_Denominator")
)
);
nqp::if(
nqp::chars($de),
nqp::if( # some string to work with
nqp::iseq_s($de,"NaN"),
NaN, # no value found
nqp::stmts( # value for denominator
(my str $nu = nqp::getuniprop_str(
self,
nqp::ifnull(
$nuprop,
$nuprop := nqp::unipropcode("Numeric_Value_Numerator")
)
)),
nqp::if(
nqp::iseq_s($de,"1"),
nqp::atpos(nqp::radix(10,$nu,0,0),0), # just the numerator
Rat.new( # spotted a Rat
nqp::atpos(nqp::radix(10,$nu,0,0),0),
nqp::atpos(nqp::radix(10,$de,0,0),0)
)
)
)
),
Nil # no string, so no value
)
}
}
multi sub prefix:<++>(Int:D $a is rw --> Int:D) {
$a = nqp::add_I(nqp::decont($a), 1, Int);
}
multi sub prefix:<++>(int $a is rw --> int) {
$a = nqp::add_i($a, 1);
}
multi sub prefix:<-->(Int:D $a is rw --> Int:D) {
$a = nqp::sub_I(nqp::decont($a), 1, Int);
}
multi sub prefix:<-->(int $a is rw --> int) {
$a = nqp::sub_i($a, 1);
}
multi sub postfix:<++>(Int:D $a is rw --> Int:D) {
my \b := nqp::decont($a);
$a = nqp::add_I(b, 1, Int);
b
}
multi sub postfix:<++>(int $a is rw --> int) {
my int $b = $a;
$a = nqp::add_i($b, 1);
$b
}
multi sub postfix:<-->(Int:D $a is rw --> Int:D) {
my \b := nqp::decont($a);
$a = nqp::sub_I(b, 1, Int);
b
}
multi sub postfix:<-->(int $a is rw --> int) {
my int $b = $a;
$a = nqp::sub_i($b, 1);
$b
}
multi sub prefix:<->(Int:D \a --> Int:D) {
nqp::neg_I(nqp::decont(a), Int);
}
multi sub prefix:<->(int $a --> int) {
nqp::neg_i($a)
}
multi sub abs(Int:D \a --> Int:D) {
nqp::abs_I(nqp::decont(a), Int);
}
multi sub abs(int $a --> int) {
nqp::abs_i($a)
}
multi sub infix:<+>(Int:D \a, Int:D \b --> Int:D) {
nqp::add_I(nqp::decont(a), nqp::decont(b), Int);
}
multi sub infix:<+>(int $a, int $b --> int) {
nqp::add_i($a, $b)
}
multi sub infix:<->(Int:D \a, Int:D \b --> Int:D) {
nqp::sub_I(nqp::decont(a), nqp::decont(b), Int);
}
multi sub infix:<->(int $a, int $b --> int) {
nqp::sub_i($a, $b)
}
multi sub infix:<*>(Int:D \a, Int:D \b --> Int:D) {
nqp::mul_I(nqp::decont(a), nqp::decont(b), Int);
}
multi sub infix:<*>(int $a, int $b --> int) {
nqp::mul_i($a, $b);
}
multi sub infix:<eqv>(Int:D $a, Int:D $b --> Bool:D) {
nqp::hllbool( # need to check types as enums such as Bool wind up here
nqp::eqaddr($a.WHAT,$b.WHAT) && nqp::iseq_I($a,$b)
)
}
multi sub infix:<eqv>(int $a, int $b --> Bool:D) {
nqp::hllbool(nqp::iseq_i($a,$b))
}
multi sub infix:<div>(Int:D \a, Int:D \b --> Int:D) {
b
?? nqp::div_I(nqp::decont(a), nqp::decont(b), Int)
!! Failure.new(X::Numeric::DivideByZero.new(:using<div>, :numerator(a)))
}
multi sub infix:<div>(int $a, int $b --> int) {
# relies on opcode or hardware to detect division by 0
nqp::div_i($a, $b)
}
multi sub infix:<%>(Int:D \a, Int:D \b --> Int:D) {
nqp::if(
nqp::isbig_I(nqp::decont(a)) || nqp::isbig_I(nqp::decont(b)),
nqp::if(
b,
nqp::mod_I(nqp::decont(a),nqp::decont(b),Int),
Failure.new(X::Numeric::DivideByZero.new(:using<%>, :numerator(a)))
),
nqp::if(
nqp::isne_i(b,0),
nqp::mod_i( # quick fix RT #128318
nqp::add_i(nqp::mod_i(nqp::decont(a),nqp::decont(b)),b),
nqp::decont(b)
),
Failure.new(X::Numeric::DivideByZero.new(:using<%>, :numerator(a)))
)
)
}
multi sub infix:<%>(int $a, int $b --> int) {
# relies on opcode or hardware to detect division by 0
nqp::mod_i(nqp::add_i(nqp::mod_i($a,$b),$b),$b) # quick fix RT #128318
}
multi sub infix:<%%>(int $a, int $b --> Bool:D) {
nqp::hllbool(nqp::iseq_i(nqp::mod_i($a, $b), 0))
}
multi sub infix:<**>(Int:D \a, Int:D \b --> Real:D) {
my $power := nqp::pow_I(nqp::decont(a), nqp::decont(b >= 0 ?? b !! -b), Num, Int);
# when a**b is too big nqp::pow_I returns Inf
nqp::istype($power, Num)
?? Failure.new(
b >= 0 ?? X::Numeric::Overflow.new !! X::Numeric::Underflow.new
) !! b >= 0 ?? $power
!! ($power := 1 / $power) == 0 && a != 0
?? Failure.new(X::Numeric::Underflow.new)
!! $power;
}
multi sub infix:<**>(int $a, int $b --> int) {
nqp::pow_i($a, $b);
}
multi sub infix:<lcm>(Int:D \a, Int:D \b --> Int:D) {
nqp::lcm_I(nqp::decont(a), nqp::decont(b), Int);
}
multi sub infix:<lcm>(int $a, int $b --> int) {
nqp::lcm_i($a, $b)
}
multi sub infix:<gcd>(Int:D \a, Int:D \b --> Int:D) {
nqp::gcd_I(nqp::decont(a), nqp::decont(b), Int);
}
multi sub infix:<gcd>(int $a, int $b --> int) {
nqp::gcd_i($a, $b)
}
multi sub infix:<===>(Int:D $a, Int:D $b --> Bool:D) {
nqp::hllbool(
nqp::eqaddr($a.WHAT,$b.WHAT)
&& nqp::iseq_I($a, $b)
)
}
multi sub infix:<===>(int $a, int $b --> Bool:D) {
# hey, the optimizer is smart enough to figure that one out for us, no?
$a == $b
}
multi sub infix:<==>(Int:D \a, Int:D \b --> Bool:D) {
nqp::hllbool(nqp::iseq_I(nqp::decont(a), nqp::decont(b)))
}
multi sub infix:<==>(int $a, int $b --> Bool:D) {
nqp::hllbool(nqp::iseq_i($a, $b))
}
multi sub infix:<!=>(int $a, int $b --> Bool:D) {
nqp::hllbool(nqp::isne_i($a, $b))
}
multi sub infix:<!=>(Int:D \a, Int:D \b --> Bool:D) {
nqp::hllbool(nqp::isne_I(nqp::decont(a), nqp::decont(b)))
}
multi sub infix:«<»(Int:D \a, Int:D \b --> Bool:D) {
nqp::hllbool(nqp::islt_I(nqp::decont(a), nqp::decont(b)))
}
multi sub infix:«<»(int $a, int $b --> Bool:D) {
nqp::hllbool(nqp::islt_i($a, $b))
}
multi sub infix:«<=»(Int:D \a, Int:D \b --> Bool:D) {
nqp::hllbool(nqp::isle_I(nqp::decont(a), nqp::decont(b)))
}
multi sub infix:«<=»(int $a, int $b --> Bool:D) {
nqp::hllbool(nqp::isle_i($a, $b))
}
multi sub infix:«>»(Int:D \a, Int:D \b --> Bool:D) {
nqp::hllbool(nqp::isgt_I(nqp::decont(a), nqp::decont(b)))
}
multi sub infix:«>»(int $a, int $b --> Bool:D) {
nqp::hllbool(nqp::isgt_i($a, $b))
}
multi sub infix:«>=»(Int:D \a, Int:D \b --> Bool:D) {
nqp::hllbool(nqp::isge_I(nqp::decont(a), nqp::decont(b)))
}
multi sub infix:«>=»(int $a, int $b --> Bool:D) {
nqp::hllbool(nqp::isge_i($a, $b))
}
multi sub infix:<+|>(Int:D \a, Int:D \b --> Int:D) {
nqp::bitor_I(nqp::decont(a), nqp::decont(b), Int)
}
multi sub infix:<+|>(int $a, int $b --> int) {
nqp::bitor_i($a, $b)
}
multi sub infix:<+&>(Int:D \a, Int:D \b --> Int:D) {
nqp::bitand_I(nqp::decont(a), nqp::decont(b), Int)
}
multi sub infix:<+&>(int $a, int $b --> int) {
nqp::bitand_i($a, $b)
}
multi sub infix:<+^>(Int:D \a, Int:D \b --> Int:D) {
nqp::bitxor_I(nqp::decont(a), nqp::decont(b), Int)
}
multi sub infix:<+^>(int $a, int $b --> int) {
nqp::bitxor_i($a, $b);
}
multi sub infix:«+<»(Int:D \a, Int:D \b --> Int:D) {
nqp::bitshiftl_I(nqp::decont(a), nqp::unbox_i(b), Int)
}
multi sub infix:«+<»(int $a, int $b --> int) {
nqp::bitshiftl_i($a, $b);
}
multi sub infix:«+>»(Int:D \a, Int:D \b --> Int:D) {
nqp::bitshiftr_I(nqp::decont(a), nqp::unbox_i(b), Int)
}
multi sub infix:«+>»(int $a, int $b --> int) {
nqp::bitshiftr_i($a, $b)
}
multi sub prefix:<+^>(Int:D \a --> Int:D) {
nqp::bitneg_I(nqp::decont(a), Int);
}
multi sub prefix:<+^>(int $a --> int) {
nqp::bitneg_i($a);
}
proto sub chr($, *%) is pure {*}
multi sub chr(Int:D \x --> Str:D) { x.chr }
multi sub chr(Cool \x --> Str:D) { x.Int.chr }
multi sub chr(int $x --> str) { nqp::chr($x) }
proto sub is-prime($, *%) is pure {*}
multi sub is-prime(\x --> Int:D) { x.is-prime }
proto sub expmod($, $, $, *%) is pure {*}
multi sub expmod(Int:D \base, Int:D \exp, Int:D \mod --> Int:D) {
nqp::expmod_I(nqp::decont(base), nqp::decont(exp), nqp::decont(mod), Int);
}
multi sub expmod(\base, \exp, \mod --> Int:D) {
nqp::expmod_I(nqp::decont(base.Int), nqp::decont(exp.Int), nqp::decont(mod.Int), Int);
}
proto sub lsb($, *%) {*}
multi sub lsb(Int:D \i --> Int:D) { i.lsb }
proto sub msb($, *%) {*}
multi sub msb(Int:D \i --> Int:D) { i.msb }
# vim: ft=perl6 expandtab sw=4