-
Notifications
You must be signed in to change notification settings - Fork 22
Expand file tree
/
Copy patharray_api.py
More file actions
2980 lines (2307 loc) · 95.6 KB
/
array_api.py
File metadata and controls
2980 lines (2307 loc) · 95.6 KB
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
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
"""
Experimental Array API support.
"""
# mypy: disable-error-code="empty-body"
from __future__ import annotations
import contextlib
import itertools
import math
import numbers
import os
import sys
from collections.abc import Callable
from copy import copy
from fractions import Fraction
from functools import partial
from types import EllipsisType
from typing import TYPE_CHECKING, ClassVar, Protocol, TypeAlias, TypeVar, cast
import numpy as np
from opentelemetry import trace
from egglog import *
from egglog.runtime import RuntimeExpr
from .program_gen import *
if TYPE_CHECKING:
from collections.abc import Iterator
from types import ModuleType
_TRACER = trace.get_tracer(__name__)
# Pretend that exprs are numbers b/c sklearn does isinstance checks
numbers.Integral.register(RuntimeExpr)
# Set this to 1 before scipy is ever imported
# https://docs.scipy.org/doc/scipy/dev/api-dev/array_api.html#using-array-api-standard-support
os.environ["SCIPY_ARRAY_API"] = "1"
array_api_ruleset = ruleset(name="array_api_ruleset")
class Boolean(Expr, ruleset=array_api_ruleset):
"""
A boolean expression
"""
NEVER: ClassVar[Boolean]
def __init__(self, value: BoolLike) -> None: ...
@method(preserve=True)
def __bool__(self) -> bool:
"""
>>> bool(Boolean(True))
True
>>> bool(Boolean(False))
False
"""
# Special case bool so it works when comparing to arrays outside of tracing, like when indexing
if (
not _CURRENT_EGRAPH
and (
args := get_callable_args(self, Int.__eq__)
or get_callable_args(self, Boolean.__eq__) # type: ignore[arg-type]
or get_callable_args(self, Value.__eq__) # type: ignore[arg-type]
)
is not None
):
return bool(eq(args[0]).to(cast("Int", args[1])))
return self.eval()
@method(preserve=True)
def eval(self) -> bool:
return try_evaling(self)
@method(preserve=True) # type: ignore[prop-decorator]
@property
def value(self) -> bool:
match get_callable_args(self, Boolean):
case (b,):
return cast("Bool", b).value
raise ExprValueError(self, "Boolean(b)")
def __or__(self, other: BooleanLike) -> Boolean: ...
def __and__(self, other: BooleanLike) -> Boolean: ...
def __invert__(self) -> Boolean: ...
def __eq__(self, other: BooleanLike) -> Boolean: ... # type: ignore[override]
@classmethod
def if_(cls, b: BooleanLike, i: Callable[[], Boolean], j: Callable[[], Boolean]) -> Boolean:
"""
Returns i() if b is True, else j(). Wrapped in callables to avoid eager evaluation.
>>> bool(Boolean.if_(TRUE, lambda: Boolean(True), lambda: Boolean(False)))
True
"""
BooleanLike: TypeAlias = Boolean | BoolLike
TRUE = Boolean(True)
FALSE = Boolean(False)
converter(Bool, Boolean, Boolean)
@array_api_ruleset.register
def _bool(
x: Boolean, y: Boolean, i: Int, j: Int, b: Bool, b1: Bool, bt: Callable[[], Boolean], bf: Callable[[], Boolean]
):
return [
rewrite(TRUE | x).to(TRUE),
rewrite(FALSE | x).to(x),
rewrite(TRUE & x).to(x),
rewrite(FALSE & x).to(FALSE),
rewrite(~TRUE).to(FALSE),
rewrite(~FALSE).to(TRUE),
rule(eq(FALSE).to(TRUE)).then(panic("False cannot equal True")),
rewrite(x == x).to(TRUE), # noqa: PLR0124
rewrite(FALSE == TRUE).to(FALSE),
rewrite(TRUE == FALSE).to(FALSE),
rewrite(Boolean.if_(TRUE, bt, bf), subsume=True).to(bt()),
rewrite(Boolean.if_(FALSE, bt, bf), subsume=True).to(bf()),
rule(eq(Boolean(b)).to(Boolean(b1)), ne(b).to(b1)).then(panic("Different booleans cannot be equal")),
]
class Int(Expr, ruleset=array_api_ruleset):
# a never int is that should not exist. It could represent for example indexing into an array a value that is out of bounds
# https://en.wikipedia.org/wiki/Bottom_type
NEVER: ClassVar[Int]
@classmethod
def var(cls, name: StringLike) -> Int: ...
def __init__(self, value: i64Like) -> None: ...
def __invert__(self) -> Int: ...
def __lt__(self, other: IntLike) -> Boolean: ...
def __le__(self, other: IntLike) -> Boolean: ...
def __abs__(self) -> Int: ...
def __eq__(self, other: IntLike) -> Boolean: # type: ignore[override]
...
# add a hash so that this test can pass
# https://github.com/scikit-learn/scikit-learn/blob/6fd23fca53845b32b249f2b36051c081b65e2fab/sklearn/utils/validation.py#L486-L487
@method(preserve=True)
def __hash__(self) -> int:
# Only hash if we have a current e-graph saved, like in the middle of tracing
egraph = _CURRENT_EGRAPH
if egraph is None:
return hash(self.__egg_typed_expr__) # type: ignore[attr-defined]
egraph.register(self)
egraph.run(array_api_schedule)
simplified = egraph.extract(self)
return hash(cast("RuntimeExpr", simplified).__egg_typed_expr__)
def __round__(self, ndigits: OptionalIntLike = None) -> Int: ...
# TODO: Fix this?
# Make != always return a Bool, so that numpy.unique works on a tuple of ints
# In _unique1d
@method(preserve=True)
def __ne__(self, other: Int) -> bool: # type: ignore[override]
return not (self == other)
def __gt__(self, other: IntLike) -> Boolean: ...
def __ge__(self, other: IntLike) -> Boolean: ...
def __add__(self, other: IntLike) -> Int: ...
def __sub__(self, other: IntLike) -> Int: ...
def __mul__(self, other: IntLike) -> Int: ...
def __truediv__(self, other: IntLike) -> Int: ...
def __floordiv__(self, other: IntLike) -> Int: ...
def __mod__(self, other: IntLike) -> Int: ...
def __divmod__(self, other: IntLike) -> Int: ...
def __pow__(self, other: IntLike) -> Int: ...
def __lshift__(self, other: IntLike) -> Int: ...
def __rshift__(self, other: IntLike) -> Int: ...
def __and__(self, other: IntLike) -> Int: ...
def __xor__(self, other: IntLike) -> Int: ...
def __or__(self, other: IntLike) -> Int: ...
def __radd__(self, other: IntLike) -> Int: ...
def __rsub__(self, other: IntLike) -> Int: ...
def __rmul__(self, other: IntLike) -> Int: ...
def __rmatmul__(self, other: IntLike) -> Int: ...
def __rtruediv__(self, other: IntLike) -> Int: ...
def __rfloordiv__(self, other: IntLike) -> Int: ...
def __rmod__(self, other: IntLike) -> Int: ...
def __rpow__(self, other: IntLike) -> Int: ...
def __rlshift__(self, other: IntLike) -> Int: ...
def __rrshift__(self, other: IntLike) -> Int: ...
def __rand__(self, other: IntLike) -> Int: ...
def __rxor__(self, other: IntLike) -> Int: ...
def __ror__(self, other: IntLike) -> Int: ...
@method(preserve=True)
def eval(self) -> int:
return try_evaling(self)
@method(preserve=True) # type: ignore[prop-decorator]
@property
def value(self) -> int:
match get_callable_args(self, Int):
case (i,):
return cast("i64", i).value
raise ExprValueError(self, "Int(i)")
@method(preserve=True)
def __index__(self) -> int:
return self.eval()
@method(preserve=True)
def __int__(self) -> int:
return self.eval()
@method(preserve=True)
def __float__(self) -> float:
return float(self.eval())
@method(preserve=True)
def __bool__(self) -> bool:
return bool(self.eval())
@classmethod
def if_(cls, b: BooleanLike, i: Callable[[], Int], j: Callable[[], Int]) -> Int:
"""
Returns i() if b is True, else j(). Wrapped in callables to avoid eager evaluation.
>>> int(Int.if_(TRUE, lambda: Int(1), lambda: Int(2)))
1
"""
@array_api_ruleset.register
def _int(i: i64, j: i64, r: Boolean, o: Int, b: Int, ot: Callable[[], Int], bt: Callable[[], Int]):
yield rewrite(Int(i) == Int(i)).to(TRUE)
yield rule(eq(r).to(Int(i) == Int(j)), ne(i).to(j)).then(union(r).with_(FALSE))
yield rewrite(Int(i) >= Int(i)).to(TRUE)
yield rule(eq(r).to(Int(i) >= Int(j)), i > j).then(union(r).with_(TRUE))
yield rule(eq(r).to(Int(i) >= Int(j)), i < j).then(union(r).with_(FALSE))
yield rewrite(Int(i) < Int(i)).to(FALSE)
yield rule(eq(r).to(Int(i) < Int(j)), i < j).then(union(r).with_(TRUE))
yield rule(eq(r).to(Int(i) < Int(j)), i > j).then(union(r).with_(FALSE))
yield rewrite(Int(i) > Int(i)).to(FALSE)
yield rule(eq(r).to(Int(i) > Int(j)), i > j).then(union(r).with_(TRUE))
yield rule(eq(r).to(Int(i) > Int(j)), i < j).then(union(r).with_(FALSE))
yield rule(eq(Int(i)).to(Int(j)), ne(i).to(j)).then(panic("Real ints cannot be equal to different ints"))
yield rewrite(Int(i) + Int(j)).to(Int(i + j))
yield rewrite(Int(i) - Int(j)).to(Int(i - j))
yield rewrite(Int(i) * Int(j)).to(Int(i * j))
yield rewrite(Int(i) // Int(j)).to(Int(i / j))
yield rewrite(Int(i) % Int(j)).to(Int(i % j))
yield rewrite(Int(i) & Int(j)).to(Int(i & j))
yield rewrite(Int(i) | Int(j)).to(Int(i | j))
yield rewrite(Int(i) ^ Int(j)).to(Int(i ^ j))
yield rewrite(Int(i) << Int(j)).to(Int(i << j))
yield rewrite(Int(i) >> Int(j)).to(Int(i >> j))
yield rewrite(~Int(i)).to(Int(~i))
yield rewrite(Int(i).__abs__()).to(Int(i.__abs__()))
yield rewrite(Int.if_(TRUE, ot, bt), subsume=True).to(ot())
yield rewrite(Int.if_(FALSE, ot, bt), subsume=True).to(bt())
yield rewrite(o.__round__(OptionalInt.none)).to(o)
# Never cannot be equal to anything real
yield rule(eq(Int.NEVER).to(Int(i))).then(panic("Int.NEVER cannot be equal to any real int"))
# If two integers are equal, panic
yield rule(eq(Int(i)).to(Int(j)), ne(i).to(j)).then(panic("Different ints cannot be equal"))
converter(i64, Int, Int)
IntLike: TypeAlias = Int | i64Like
@function(ruleset=array_api_ruleset)
def check_index(length: IntLike, idx: IntLike) -> Int:
"""
Returns the index if 0 <= idx < length, otherwise returns Int.NEVER
"""
length = cast("Int", length)
idx = cast("Int", idx)
return Int.if_(((idx >= 0) & (idx < length)), lambda: idx, lambda: Int.NEVER)
class OptionalInt(Expr, ruleset=array_api_ruleset):
none: ClassVar[OptionalInt]
@classmethod
def some(cls, value: Int) -> OptionalInt: ...
OptionalIntLike: TypeAlias = OptionalInt | IntLike | None
converter(type(None), OptionalInt, lambda _: OptionalInt.none)
converter(Int, OptionalInt, lambda x: OptionalInt.some(x))
# @array_api_ruleset.register
# def _check_index(i: i64, j: i64, x: Int):
# yield rewrite(
# check_index(Int(i), Int(j)),
# ).to(
# Int(j),
# i >= 0,
# i < j,
# )
# yield rewrite(
# check_index(x, Int(i)),
# ).to(
# Int.NEVER,
# i < 0,
# )
# yield rewrite(
# check_index(Int(i), Int(j)),
# ).to(
# Int.NEVER,
# i >= j,
# )
class Float(Expr, ruleset=array_api_ruleset):
# Differentiate costs of three constructors so extraction is deterministic if all three are present
@method(cost=3)
def __init__(self, value: f64Like) -> None: ...
@method(cost=2)
@classmethod
def rational(cls, r: BigRat) -> Float: ...
@method(preserve=True)
def eval(self) -> float | Fraction:
return try_evaling(self)
@method(preserve=True) # type: ignore[prop-decorator]
@property
def value(self) -> float | Fraction:
match get_callable_args(self, Float.rational):
case (r,):
return r.value
match get_callable_args(self, Float):
case (f,):
return cast("f64", f).value
raise ExprValueError(self, "Float(f) or Float.rational(r)")
def __float__(self) -> float:
return float(self.eval())
@classmethod
def from_int(cls, i: IntLike) -> Float: ...
def abs(self) -> Float: ...
def __truediv__(self, other: FloatLike) -> Float: ...
def __mul__(self, other: FloatLike) -> Float: ...
def __add__(self, other: FloatLike) -> Float: ...
def __sub__(self, other: FloatLike) -> Float: ...
def __abs__(self) -> Float: ...
def __pow__(self, other: FloatLike) -> Float: ...
def __round__(self, ndigits: OptionalIntLike = None) -> Float: ...
def __eq__(self, other: FloatLike) -> Boolean: ... # type: ignore[override]
def __ne__(self, other: FloatLike) -> Boolean: ... # type: ignore[override]
def __lt__(self, other: FloatLike) -> Boolean: ...
def __le__(self, other: FloatLike) -> Boolean: ...
def __gt__(self, other: FloatLike) -> Boolean: ...
def __ge__(self, other: FloatLike) -> Boolean: ...
FloatLike: TypeAlias = Float | float | IntLike
converter(float, Float, Float)
converter(Int, Float, lambda x: Float.from_int(x))
converter(BigRat, Float, lambda x: Float.rational(x))
@array_api_ruleset.register
def _float(fl: Float, f: f64, f2: f64, i: i64, r: BigRat, r1: BigRat, i_: Int):
return [
rewrite(Float.from_int(Int(i))).to(Float(f64.from_i64(i))),
rewrite(Float(f).abs()).to(Float(f), f >= 0.0),
rewrite(Float(f).abs()).to(Float(-f), f < 0.0),
# Convert from float to rational, if its a whole number i.e. can be converted to int
rewrite(Float(f)).to(Float.rational(BigRat(f.to_i64(), 1)), eq(f64.from_i64(f.to_i64())).to(f)),
# always convert from int to rational
rewrite(Float.from_int(Int(i))).to(Float.rational(BigRat(i, 1))),
rewrite(Float.rational(r)).to(Float(r.to_f64())),
rewrite(Float(f) + Float(f2)).to(Float(f + f2)),
rewrite(Float(f) - Float(f2)).to(Float(f - f2)),
rewrite(Float(f) * Float(f2)).to(Float(f * f2)),
rewrite(Float.rational(r) / Float.rational(r1)).to(Float.rational(r / r1)),
rewrite(Float.rational(r) + Float.rational(r1)).to(Float.rational(r + r1)),
rewrite(Float.rational(r) - Float.rational(r1)).to(Float.rational(r - r1)),
rewrite(Float.rational(r) * Float.rational(r1)).to(Float.rational(r * r1)),
rewrite(Float(f) ** Float(f2)).to(Float(f**f2)),
# comparisons
rewrite(Float(f) == Float(f)).to(TRUE),
rewrite(Float(f) == Float(f2)).to(FALSE, ne(f).to(f2)),
rewrite(Float(f) != Float(f2)).to(TRUE, f != f2),
rewrite(Float(f) != Float(f)).to(FALSE),
rewrite(Float(f) >= Float(f2)).to(TRUE, f >= f2),
rewrite(Float(f) >= Float(f2)).to(FALSE, f < f2),
rewrite(Float(f) <= Float(f2)).to(TRUE, f <= f2),
rewrite(Float(f) <= Float(f2)).to(FALSE, f > f2),
rewrite(Float(f) > Float(f2)).to(TRUE, f > f2),
rewrite(Float(f) > Float(f2)).to(FALSE, f <= f2),
rewrite(Float(f) < Float(f2)).to(TRUE, f < f2),
rewrite(Float.rational(r) == Float.rational(r)).to(TRUE),
rewrite(Float.rational(r) == Float.rational(r1)).to(FALSE, ne(r).to(r1)),
rewrite(Float.rational(r).__round__()).to(Float.rational(r.round())),
rewrite(Float(f).__abs__()).to(Float(f.__abs__())),
# Two different floats cannot be equal
rule(eq(Float(f)).to(Float(f2)), ne(f).to(f2)).then(panic("Different floats cannot be equal")),
]
class TupleInt(Expr, ruleset=array_api_ruleset):
"""
A tuple of integers.
The following is true for all types of tuple:
Tuples have two main constructors:
- `Tuple[T](vs: Vec[T]=[])`
- `Tuple.fn(length: Int, idx_fn: Callable[[Int], T])`
This is so that they can be defined either with a known fixed integer length or a symbolic
length that could not be resolved to an integer.
Both constructors must implement two methods:
* `l.length() -> Int`
* `l.__getitem__(i: Int) -> T`
Lists with a known length will be subsumed into the vector representation.
Lists that have vecs that are equal will have the elements unified.
Methods that transform lists should also subsume or be unextractable, so that the vector version will be preferred.
"""
def __init__(self, vec: VecLike[Int, IntLike] = Vec[Int].empty()) -> None:
"""
Create a TupleInt from a Vec of Ints.
>>> list(TupleInt(Vec(i64(1), i64(2), i64(3))))
[i64(1), i64(2), i64(3)]
>>> list(TupleInt())
[]
"""
@classmethod
def fn(cls, length: IntLike, idx_fn: Callable[[Int], Int]) -> TupleInt:
"""
Create a TupleInt from a length and an index function.
>>> list(TupleInt.fn(3, lambda i: i * 10))
[Int(0), Int(10), Int(20)]
"""
def length(self) -> Int:
"""
Return the length of the tuple.
>>> int(TupleInt([1, 2, 3]).length())
3
>>> int(TupleInt.fn(5, lambda i: i).length())
5
"""
def __getitem__(self, i: IntLike) -> Int:
"""
Return the integer at index i.
>>> int(TupleInt([10, 20, 30])[1])
20
>>> int(TupleInt.fn(3, lambda i: i * 10)[2])
20
"""
def __eq__(self, other: TupleIntLike) -> Boolean: # type: ignore[override]
other = cast("TupleInt", other)
return Boolean.if_(
self.length() == other.length(),
lambda: TupleInt.range(self.length()).foldl_boolean(lambda acc, i: acc & (self[i] == other[i]), TRUE),
lambda: FALSE,
)
@method(preserve=True)
def __len__(self) -> int:
"""
>>> len(TupleInt([1, 2, 3]))
3
"""
return self.length().eval()
@method(preserve=True)
def __iter__(self) -> Iterator[Int]:
return iter(self.eval())
@method(preserve=True)
def eval(self) -> tuple[Int, ...]:
"""
Returns the evaluated tuple of Ints.
"""
return try_evaling(self)
@method(preserve=True) # type: ignore[prop-decorator]
@property
def value(self) -> tuple[Int, ...]:
match get_callable_args(self, TupleInt):
case (vec,):
return tuple(cast("Vec[Int]", vec))
raise ExprValueError(self, "TupleInt(vec)")
@method(unextractable=True)
def append(self, i: IntLike) -> TupleInt:
"""
Append an integer to the end of the tuple.
>>> ti = TupleInt.range(3)
>>> ti2 = ti.append(3)
>>> list(ti2)
[Int(0), Int(1), Int(2), Int(3)]
"""
return TupleInt.fn(
self.length() + 1, lambda j: Int.if_(j == self.length(), lambda: cast("Int", i), lambda: self[j])
)
@method(unextractable=True)
def append_start(self, i: IntLike) -> TupleInt:
"""
Prepend an integer to the start of the tuple.
>>> ti = TupleInt.range(3)
>>> ti2 = ti.append_start( -1)
>>> list(ti2)
[Int(-1), Int(0), Int(1), Int(2)]
"""
return TupleInt.fn(self.length() + 1, lambda j: Int.if_(j == 0, lambda: cast("Int", i), lambda: self[j - 1]))
@method(unextractable=True)
def __add__(self, other: TupleIntLike) -> TupleInt:
"""
Concatenate two TupleInts.
>>> ti1 = TupleInt.range(3)
>>> ti2 = TupleInt.range(2)
>>> ti3 = ti1 + ti2
>>> list(ti3)
[Int(0), Int(1), Int(2), Int(0), Int(1)]
"""
other = cast("TupleInt", other)
return TupleInt.fn(
self.length() + other.length(),
lambda i: Int.if_(i < self.length(), lambda: self[i], lambda: other[i - self.length()]),
)
@method(unextractable=True)
def drop(self, n: IntLike) -> TupleInt:
"""
Return a new tuple with the first n elements dropped.
>>> ti = TupleInt([1, 2, 3, 4])
>>> list(ti.drop(2))
[Int(3), Int(4)]
"""
return TupleInt.fn(self.length() - n, lambda i: self[i + n])
@method(unextractable=True)
def take(self, n: IntLike) -> TupleInt:
"""
Return a new tuple with only the first n elements,
>>> ti = TupleInt([1, 2, 3, 4])
>>> list(ti.take(2))
[Int(1), Int(2)]
"""
return TupleInt.fn(n, self.__getitem__)
@method(unextractable=True)
def rest(self) -> TupleInt:
"""
Return a new tuple with the first element dropped.
>>> ti = TupleInt([1, 2, 3])
>>> list(ti.rest())
[Int(2), Int(3)]
"""
return self.drop(i64(1))
@method(unextractable=True)
def last(self) -> Int:
"""
Return the last element in the tuple.
>>> ti = TupleInt([1, 2, 3])
>>> int(ti.last())
3
"""
return self[self.length() - 1]
@method(unextractable=True)
def drop_last(self) -> TupleInt:
"""
Return a new tuple with the last element dropped.
>>> ti = TupleInt([1, 2, 3])
>>> list(ti.drop_last())
[Int(1), Int(2)]
"""
return TupleInt.fn(self.length() - 1, self.__getitem__)
@method(unextractable=True)
@classmethod
def range(cls, stop: IntLike) -> TupleInt:
"""
Create a TupleInt with the integers from 0 to stop - 1.
>>> list(TupleInt.range(5))
[Int(0), Int(1), Int(2), Int(3), Int(4)]
"""
return TupleInt.fn(stop, lambda i: i)
@method(unextractable=True)
def foldl(self, f: Callable[[Int, Int], Int], init: Int) -> Int:
"""
Fold the tuple from the left with the given function and initial value.
>>> ti = TupleInt([1, 2, 3])
>>> int(ti.foldl(lambda acc, x: acc + x, i64(0)))
6
"""
return Int.if_(self.length() == 0, lambda: init, lambda: f(self.drop_last().foldl(f, init), self.last()))
@method(unextractable=True)
def foldl_boolean(self, f: Callable[[Boolean, Int], Boolean], init: Boolean) -> Boolean:
"""
Fold the tuple from the left with the given boolean function and initial value.
>>> ti = TupleInt([1, 2, 3])
>>> bool(ti.foldl_boolean(lambda acc, x: acc | (x == i64(2)), FALSE))
True
>>> bool(ti.foldl_boolean(lambda acc, x: acc & (x < i64(3)), TRUE))
False
"""
return Boolean.if_(
self.length() == 0, lambda: init, lambda: f(self.drop_last().foldl_boolean(f, init), self.last())
)
@method(unextractable=True)
def foldl_tuple_int(self, f: Callable[[TupleInt, Int], TupleInt], init: TupleIntLike) -> TupleInt:
"""
Fold the tuple from the left with the given tuple function and initial value.
>>> ti = TupleInt([1, 2, 3])
>>> ti2 = ti.foldl_tuple_int(lambda acc, x: acc.append(x * 2), TupleInt())
>>> list(ti2)
[Int(2), Int(4), Int(6)]
"""
init = cast("TupleInt", init)
return TupleInt.if_(
self.length() == 0, lambda: init, lambda: f(self.drop_last().foldl_tuple_int(f, init), self.last())
)
@method(unextractable=True)
def foldl_value(self, f: Callable[[Value, Int], Value], init: ValueLike) -> Value:
"""
Fold the tuple from the left with the given value function and initial value.
>>> ti = TupleInt([1, 2, 3])
>>> v = ti.foldl_value(lambda acc, x: Value.from_int(x) + acc, Value.from_int(0))
>>> int(v.to_int)
6
"""
init = cast("Value", init)
return Value.if_(
self.length() == 0, lambda: init, lambda: f(self.drop_last().foldl_value(f, init), self.last())
)
@method(unextractable=True)
def contains(self, i: Int) -> Boolean:
"""
Returns True if the tuple contains the given integer.
>>> ti = TupleInt([1, 2, 3])
>>> bool(ti.contains(i64(2)))
True
>>> bool(ti.contains(i64(4)))
False
"""
return self.foldl_boolean(lambda acc, j: acc | (i == j), FALSE)
@method(unextractable=True)
def filter(self, f: Callable[[Int], Boolean]) -> TupleInt:
"""
Returns a new tuple with only the elements that satisfy the given predicate.
>>> ti = TupleInt([1, 2, 3, 4])
>>> list(ti.filter(lambda x: x % Int(2) == Int(0)))
[Int(2), Int(4)]
>>> list(ti.filter(lambda x: x > Int(2)))
[Int(3), Int(4)]
"""
return self.foldl_tuple_int(
lambda acc, v: TupleInt.if_(f(v), lambda: acc.append(v), lambda: acc),
TupleInt(),
)
@classmethod
def if_(cls, b: BooleanLike, i: Callable[[], TupleInt], j: Callable[[], TupleInt]) -> TupleInt:
"""
Returns i() if b is True, else j(). Wrapped in callables to avoid eager evaluation.
>>> ti1 = TupleInt([1, 2])
>>> ti2 = TupleInt([3, 4])
>>> ti = TupleInt.if_(TRUE, lambda: ti1, lambda: ti2)
>>> list(map(int, ti))
[1, 2]
"""
@method(unextractable=True)
def product(self) -> Int:
"""
Return the product of all elements in the tuple.
>>> ti = TupleInt([1, 2, 3, 4])
>>> int(ti.product())
24
"""
return self.foldl(lambda acc, i: acc * i, Int(1))
@method(unextractable=True)
def select(self, indices: TupleIntLike) -> TupleInt:
"""
Return a new tuple with the elements at the given indices
>>> ti = TupleInt([10, 20, 30, 40])
>>> indices = TupleInt([1, 3])
>>> list(ti.select(indices))
[Int(20), Int(40)]
"""
indices = cast("TupleInt", indices)
return indices.map(lambda i: self[i])
@method(unextractable=True)
def deselect(self, indices: TupleIntLike) -> TupleInt:
"""
Return a new tuple with the elements not at the given indices
>>> ti = TupleInt([10, 20, 30, 40])
>>> indices = TupleInt([1, 3])
>>> list(ti.deselect(indices))
[Int(10), Int(30)]
"""
indices = cast("TupleInt", indices)
return TupleInt.range(self.length()).filter(lambda i: ~indices.contains(i)).map(lambda i: self[i])
@method(unextractable=True)
def reverse(self) -> TupleInt:
"""
Return a new tuple with the elements in reverse order.
>>> ti = TupleInt([1, 2, 3])
>>> list(ti.reverse())
[Int(3), Int(2), Int(1)]
"""
return TupleInt.fn(self.length(), lambda i: self[self.length() - i - 1])
@method(unextractable=True)
def map(self, f: Callable[[Int], Int]) -> TupleInt:
"""
Returns a new tuple with each element transformed by the given function.
>>> ti = TupleInt([1, 2])
>>> list(ti.map(lambda x: x * Int(2)))
[Int(2), Int(4)]
"""
return TupleInt.fn(self.length(), lambda i: f(self[i]))
# Put at bottom so can use previous methods when resolving
@method(unextractable=True)
def map_tuple_int(self, f: Callable[[Int], TupleInt]) -> TupleTupleInt:
"""
Returns a new tuple of TupleInts with each element transformed by the given function.
>>> ti = TupleInt([1, 2])
>>> tti = ti.map_tuple_int(lambda x: TupleInt([x, x + 10]))
>>> list(tti[0])
[Int(1), Int(11)]
>>> list(tti[1])
[Int(2), Int(12)]
"""
return TupleTupleInt.fn(self.length(), lambda i: f(self[i]))
@method(unextractable=True)
def map_value(self, f: Callable[[Int], Value]) -> TupleValue:
"""
Returns a new tuple of Values with each element transformed by the given function.
>>> ti = TupleInt([1, 2])
>>> tv = ti.map_value(lambda x: Value.from_int(x * 3))
>>> list(tv)
[Value.from_int(Int(3)), Value.from_int(Int(6))]
"""
return TupleValue.fn(self.length(), lambda i: f(self[i]))
converter(Vec[Int], TupleInt, TupleInt)
TupleIntLike: TypeAlias = TupleInt | VecLike[Int, IntLike]
@array_api_ruleset.register
def _tuple_int(
i: Int,
i2: Int,
idx_fn: Callable[[Int], Int],
vs: Vec[Int],
vs2: Vec[Int],
ti: TupleInt,
k: i64,
lt: Callable[[], TupleInt],
lf: Callable[[], TupleInt],
):
# Unify the elements of equal tuples
yield rule(eq(ti).to(TupleInt(vs)), eq(ti).to(TupleInt(vs2)), vs != vs2).then(vs | vs2)
yield rewrite(TupleInt.fn(i2, idx_fn).length(), subsume=False).to(i2)
yield rewrite(TupleInt.fn(i2, idx_fn)[i], subsume=True).to(idx_fn(check_index(i2, i)))
yield rewrite(TupleInt(vs).length()).to(Int(vs.length()))
yield rewrite(TupleInt(vs)[Int(k)]).to(vs[k])
yield rewrite(TupleInt.if_(TRUE, lt, lf), subsume=True).to(lt())
yield rewrite(TupleInt.if_(FALSE, lt, lf), subsume=True).to(lf())
yield rewrite(TupleInt.fn(Int(k), idx_fn), subsume=True).to(TupleInt(k.range().map(lambda i: idx_fn(Int(i)))))
class TupleTupleInt(Expr, ruleset=array_api_ruleset):
def __init__(self, vec: VecLike[TupleInt, TupleIntLike] = ()) -> None: ...
@classmethod
def fn(cls, length: IntLike, idx_fn: Callable[[Int], TupleInt]) -> TupleTupleInt: ...
def length(self) -> Int: ...
def __getitem__(self, i: IntLike) -> TupleInt: ...
@method(preserve=True)
def __len__(self) -> int:
return self.length().eval()
@method(preserve=True)
def __iter__(self) -> Iterator[TupleInt]:
return iter(self.eval())
@method(preserve=True)
def eval(self) -> tuple[TupleInt, ...]:
return try_evaling(self)
@method(preserve=True) # type: ignore[prop-decorator]
@property
def value(self) -> tuple[TupleInt, ...]:
match get_callable_args(self, TupleTupleInt):
case (vec,):
return tuple(cast("Vec[TupleInt]", vec))
raise ExprValueError(self, "TupleTupleInt(vec)")
@method(unextractable=True)
def append(self, i: TupleIntLike) -> TupleTupleInt:
return TupleTupleInt.fn(
self.length() + 1, lambda j: TupleInt.if_(j == self.length(), lambda: cast("TupleInt", i), lambda: self[j])
)
@method(unextractable=True)
def __add__(self, other: TupleTupleIntLike) -> TupleTupleInt:
other = cast("TupleTupleInt", other)
return TupleTupleInt.fn(
self.length() + other.length(),
lambda i: TupleInt.if_(i < self.length(), lambda: self[i], lambda: other[i - self.length()]),
)
@method(unextractable=True)
def drop(self, n: Int) -> TupleTupleInt:
return TupleTupleInt.fn(self.length() - n, lambda i: self[i + n])
@method(unextractable=True)
def map_int(self, f: Callable[[TupleInt], Int]) -> TupleInt:
return TupleInt.fn(self.length(), lambda i: f(self[i]))
@method(unextractable=True)
def foldl_value(self, f: Callable[[Value, TupleInt], Value], init: ValueLike) -> Value:
return Value.if_(
self.length() == 0,
lambda: cast("Value", init),
lambda: f(self.drop_last().foldl_value(f, init), self.last()),
)
@method(unextractable=True)
def last(self) -> TupleInt:
return self[self.length() - 1]
@method(unextractable=True)
def drop_last(self) -> TupleTupleInt:
return TupleTupleInt.fn(self.length() - 1, self.__getitem__)
@classmethod
def if_(cls, b: BooleanLike, i: Callable[[], TupleTupleInt], j: Callable[[], TupleTupleInt]) -> TupleTupleInt: ...
@method(unextractable=True)
def product(self) -> TupleTupleInt:
"""
Cartesian product of inputs
https://docs.python.org/3/library/itertools.html#itertools.product
https://github.com/saulshanabrook/saulshanabrook/discussions/39
>>> [[int(x) for x in row] for row in TupleTupleInt([TupleInt([1, 2]), TupleInt([3, 4])]).product()]
[[1, 3], [1, 4], [2, 3], [2, 4]]
"""
return TupleTupleInt.fn(
self.map_int(lambda x: x.length()).product(),
lambda i: TupleInt.fn(
self.length(),
lambda j: self[j][(i // self.drop(j + 1).map_int(lambda x: x.length()).product()) % self[j].length()],
),
)
converter(Vec[TupleInt], TupleTupleInt, TupleTupleInt)
TupleTupleIntLike: TypeAlias = TupleTupleInt | VecLike[TupleInt, TupleIntLike]
@array_api_ruleset.register
def _tuple_tuple_int(
i: Int,
i2: Int,
idx_fn: Callable[[Int], TupleInt],
vs: Vec[TupleInt],
vs2: Vec[TupleInt],
ti: TupleTupleInt,
k: i64,
lt: Callable[[], TupleTupleInt],
lf: Callable[[], TupleTupleInt],
):
yield rule(eq(ti).to(TupleTupleInt(vs)), eq(ti).to(TupleTupleInt(vs2)), vs != vs2).then(vs | vs2)
yield rewrite(TupleTupleInt.fn(i2, idx_fn).length(), subsume=False).to(i2)
yield rewrite(TupleTupleInt.fn(i2, idx_fn)[i], subsume=True).to(idx_fn(check_index(i2, i)))
yield rewrite(TupleTupleInt(vs).length(), subsume=False).to(Int(vs.length()))
yield rewrite(TupleTupleInt(vs)[Int(k)], subsume=False).to(vs[k])
yield rewrite(TupleTupleInt.fn(Int(k), idx_fn), subsume=True).to(