mirror of
https://github.com/erg-lang/erg.git
synced 2025-08-04 10:49:54 +00:00
fix: type-var instantiation bugs
This commit is contained in:
Shunsuke Shibayama
parent
1f49e08ed8
commit
21025096a3
9 changed files with 193 additions and 81 deletions
|
|
@ -1,94 +1,129 @@
|
|||
.Count: ClassType
|
||||
.Count = 'count': ClassType
|
||||
.Count <: Iterable Int
|
||||
.Count.
|
||||
__call__: (start: Int, step: Int) -> .Count
|
||||
.count: (start: Int, step: Int) -> .Count
|
||||
|
||||
.Cycle: ClassType
|
||||
.Cycle.
|
||||
__call__: |T|(iterable: Iterable T) -> Iterable T
|
||||
.cycle: |T|(iterable: Iterable T) -> Iterable T
|
||||
.Cycle = 'cycle': (T: Type) -> ClassType
|
||||
.Cycle(T) <: Output T
|
||||
.Cycle(T) <: Iterable T
|
||||
.Cycle(T).
|
||||
__call__: (iterable: Iterable T) -> .Cycle(T)
|
||||
.cycle: |T|(iterable: Iterable T) -> .Cycle(T)
|
||||
|
||||
.Repeat: ClassType
|
||||
.Repeat.
|
||||
__call__: |T|(value: T, times := Nat) -> Iterable T
|
||||
.repeat: |T|(value: T, times := Nat) -> Iterable T
|
||||
.Repeat = 'repeat': (T: Type) -> ClassType
|
||||
.Repeat(T) <: Output T
|
||||
.Repeat(T) <: Iterable T
|
||||
.Repeat(T).
|
||||
__call__: (value: T, times := Nat) -> .Repeat(T)
|
||||
.repeat: |T|(value: T, times := Nat) -> .Repeat(T)
|
||||
|
||||
.Accumulate: ClassType
|
||||
.Accumulate.
|
||||
__call__: |T|(iterable: Iterable(T), func := (T, T) -> T) -> Iterable T
|
||||
.accumulate: |T|(iterable: Iterable(T), func := (T, T) -> T) -> Iterable T
|
||||
.Accumulate = 'accumulate': (T: Type) -> ClassType
|
||||
.Accumulate(T) <: Output T
|
||||
.Accumulate(T) <: Iterable T
|
||||
.Accumulate(T).
|
||||
__call__: (iterable: Iterable(T), func := (T, T) -> T) -> .Accumulate(T)
|
||||
.accumulate: |T|(iterable: Iterable(T), func := (T, T) -> T) -> .Accumulate(T)
|
||||
|
||||
.Chain: ClassType
|
||||
.Chain.
|
||||
__call__: |T|(*iterables: Iterable T) -> Iterable T
|
||||
.chain: |T|(*iterables: Iterable T) -> Iterable T
|
||||
.Chain = 'chain': (T: Type) -> ClassType
|
||||
.Chain(T) <: Output T
|
||||
.Chain(T) <: Iterable T
|
||||
.Chain(T).
|
||||
__call__: (*iterables: Iterable T) -> .Chain(T)
|
||||
.chain: |T|(*iterables: Iterable T) -> .Chain(T)
|
||||
|
||||
.Compress: ClassType
|
||||
.Compress.
|
||||
__call__: |T|(data: Iterable(T), selectors: Iterable Bool) -> Iterable T
|
||||
.compress: |T|(data: Iterable(T), selectors: Iterable Bool) -> Iterable T
|
||||
.Compress = 'compress': (T: Type) -> ClassType
|
||||
.Compress(T) <: Output T
|
||||
.Compress(T) <: Iterable T
|
||||
.Compress(T).
|
||||
__call__: (data: Iterable(T), selectors: Iterable Bool) -> .Compress(T)
|
||||
.compress: |T|(data: Iterable(T), selectors: Iterable Bool) -> .Compress(T)
|
||||
|
||||
.DropWhile: ClassType
|
||||
.DropWhile.
|
||||
__call__: |T|(predicate: (T) -> Bool, iterable: Iterable T) -> Iterable T
|
||||
.dropwhile: |T|(predicate: (T) -> Bool, iterable: Iterable T) -> Iterable T
|
||||
.DropWhile = 'dropwhile': (T: Type) -> ClassType
|
||||
.DropWhile(T) <: Output T
|
||||
.DropWhile(T) <: Iterable T
|
||||
.DropWhile(T).
|
||||
__call__: (predicate: (T) -> Bool, iterable: Iterable T) -> .DropWhile(T)
|
||||
.dropwhile: |T|(predicate: (T) -> Bool, iterable: Iterable T) -> .DropWhile(T)
|
||||
|
||||
.FilterFalse: ClassType
|
||||
.FilterFalse.
|
||||
__call__: |T|(predicate: (T) -> Bool, iterable: Iterable T) -> Iterable T
|
||||
.filterfalse: |T|(predicate: (T) -> Bool, iterable: Iterable T) -> Iterable T
|
||||
.FilterFalse = 'filterfalse': (T: Type) -> ClassType
|
||||
.FilterFalse(T) <: Output T
|
||||
.FilterFalse(T) <: Iterable T
|
||||
.FilterFalse(T).
|
||||
__call__: (predicate: (T) -> Bool, iterable: Iterable T) -> .FilterFalse(T)
|
||||
.filterfalse: |T|(predicate: (T) -> Bool, iterable: Iterable T) -> .FilterFalse(T)
|
||||
|
||||
.GroupBy: ClassType
|
||||
.GroupBy.
|
||||
__call__: |T, K|(iterable: Iterable(T), key := (T) -> K) -> Iterable((K, Iterable(T)))
|
||||
.groupby: |T, K|(iterable: Iterable(T), key := (T) -> K) -> Iterable((K, Iterable(T)))
|
||||
.GroupBy = 'groupby': (T: Type, K: Type) -> ClassType
|
||||
.GroupBy(T, _) <: Output T
|
||||
.GroupBy(_, K) <: Output K
|
||||
.GroupBy(T, K) <: Iterable((K, Iterable(T)),)
|
||||
.GroupBy(T, K).
|
||||
__call__: (iterable: Iterable(T), key := (T) -> K) -> .GroupBy(T, K)
|
||||
.groupby: |T, K|(iterable: Iterable(T), key := (T) -> K) -> .GroupBy(T, K)
|
||||
|
||||
.Islice: ClassType
|
||||
.Islice.
|
||||
__call__: |T|(iterable: Iterable(T), start := Int, stop := Int, step := Int) -> Iterable T
|
||||
.islice: |T|(iterable: Iterable(T), start := Int, stop := Int, step := Int) -> Iterable T
|
||||
.Islice = 'islice': (T: Type) -> ClassType
|
||||
.Islice(T) <: Output T
|
||||
.Islice(T) <: Iterable T
|
||||
.Islice(T).
|
||||
__call__: (iterable: Iterable(T), start := Int, stop := Int, step := Int) -> .Islice(T)
|
||||
.islice: |T|(iterable: Iterable(T), start := Int, stop := Int, step := Int) -> .Islice(T)
|
||||
|
||||
.Pairwise: ClassType
|
||||
.Pairwise.
|
||||
__call__: |T|(iterable: Iterable(T)) -> Iterable((T, T))
|
||||
.pairwise: |T|(iterable: Iterable(T)) -> Iterable((T, T))
|
||||
.Pairwise = 'pairwise': (T: Type) -> ClassType
|
||||
.Pairwise(T) <: Output T
|
||||
.Pairwise(T) <: Iterable((T, T),)
|
||||
.Pairwise(T).
|
||||
__call__: (iterable: Iterable(T)) -> .Pairwise(T)
|
||||
.pairwise: |T|(iterable: Iterable(T)) -> .Pairwise(T)
|
||||
|
||||
# .Startmap = 'startmap': ClassType
|
||||
# .Startmap.
|
||||
# __call__: |T|(function: (T) -> T, iterable: Iterable T) -> Iterable T
|
||||
|
||||
.Takewhile: ClassType
|
||||
.Takewhile.
|
||||
__call__: |T|(predicate: (T) -> Bool, iterable: Iterable T) -> Iterable T
|
||||
.takewhile: |T|(predicate: (T) -> Bool, iterable: Iterable T) -> Iterable T
|
||||
.Takewhile = 'takewhile': (T: Type) -> ClassType
|
||||
.Takewhile(T) <: Output T
|
||||
.Takewhile(T) <: Iterable T
|
||||
.Takewhile(T).
|
||||
__call__: (predicate: (T) -> Bool, iterable: Iterable T) -> .Takewhile(T)
|
||||
.takewhile: |T|(predicate: (T) -> Bool, iterable: Iterable T) -> .Takewhile(T)
|
||||
|
||||
.Tee: ClassType
|
||||
.Tee.
|
||||
__call__: |T|(iterable: Iterable(T), n := Nat) -> [Iterable(T); _]
|
||||
.tee: |T|(iterable: Iterable(T), n := Nat) -> [Iterable(T); _]
|
||||
.Tee = 'tee': (T: Type) -> ClassType
|
||||
.Tee(T) <: Output T
|
||||
.Tee(T) <: Iterable T
|
||||
.Tee(T).
|
||||
__call__: (iterable: Iterable(T), n := Nat) -> [.Tee(T); _]
|
||||
.tee: |T|(iterable: Iterable(T), n := Nat) -> [.Tee(T); _]
|
||||
|
||||
.ZipLongest: ClassType
|
||||
.ZipLongest.
|
||||
__call__: |T|(*iterables: Iterable(T), fillvalue := T) -> Iterable [T; _]
|
||||
.zip_longest: |T|(*iterables: Iterable(T), fillvalue := T) -> Iterable [T; _]
|
||||
.ZipLongest = 'zip_longest': (T: Type) -> ClassType
|
||||
.ZipLongest(T) <: Output T
|
||||
.ZipLongest(T) <: Iterable [T; _]
|
||||
.ZipLongest(T).
|
||||
__call__: (*iterables: Iterable(T), fillvalue := T) -> .ZipLongest(T)
|
||||
.zip_longest: |T|(*iterables: Iterable(T), fillvalue := T) -> .ZipLongest(T)
|
||||
|
||||
.Product: ClassType
|
||||
.Product.
|
||||
__call__: |T|(*iterables: Iterable(T), repeat := Nat) -> Iterable [T; _]
|
||||
.product: |T|(*iterables: Iterable(T), repeat := Nat) -> Iterable [T; _]
|
||||
.Product = 'product': (T: Type) -> ClassType
|
||||
.Product(T) <: Output T
|
||||
.Product(T) <: Iterable [T; _]
|
||||
.Product(T).
|
||||
__call__: (*iterables: Iterable(T), repeat := Nat) -> .Product(T)
|
||||
.product: |T|(*iterables: Iterable(T), repeat := Nat) -> .Product(T)
|
||||
|
||||
.Permutations: ClassType
|
||||
.Permutations.
|
||||
__call__: |T|(iterable: Iterable(T), r := Nat) -> Iterable [T; _]
|
||||
.permutations: |T|(iterable: Iterable(T), r := Nat) -> Iterable [T; _]
|
||||
.Permutations = 'permutations': (T: Type) -> ClassType
|
||||
.Permutations(T) <: Output T
|
||||
.Permutations(T) <: Iterable [T; _]
|
||||
.Permutations(T).
|
||||
__call__: (iterable: Iterable(T), r := Nat) -> .Permutations(T)
|
||||
.permutations: |T|(iterable: Iterable(T), r := Nat) -> .Permutations(T)
|
||||
|
||||
.Combinations: ClassType
|
||||
.Combinations.
|
||||
__call__: |T|(iterable: Iterable(T), r := Nat) -> Iterable [T; _]
|
||||
.combinations: |T|(iterable: Iterable(T), r := Nat) -> Iterable [T; _]
|
||||
.Combinations = 'combinations': (T: Type) -> ClassType
|
||||
.Combinations(T) <: Output T
|
||||
.Combinations(T) <: Iterable [T; _]
|
||||
.Combinations(T).
|
||||
__call__: (iterable: Iterable(T), r := Nat) -> .Combinations(T)
|
||||
.combinations: |T|(iterable: Iterable(T), r := Nat) -> .Combinations(T)
|
||||
|
||||
.CombinationsWithReplacement: ClassType
|
||||
.CombinationsWithReplacement.
|
||||
__call__: |T|(iterable: Iterable(T), r := Nat) -> Iterable [T; _]
|
||||
.combinations_with_replacement: |T|(iterable: Iterable(T), r := Nat) -> Iterable [T; _]
|
||||
.CombinationsWithReplacement = 'combinations_with_replacement': (T: Type) -> ClassType
|
||||
.CombinationsWithReplacement(T) <: Output T
|
||||
.CombinationsWithReplacement(T) <: Iterable [T; _]
|
||||
.CombinationsWithReplacement(T).
|
||||
__call__: (iterable: Iterable(T), r := Nat) -> .CombinationsWithReplacement(T)
|
||||
.combinations_with_replacement: |T|(iterable: Iterable(T), r := Nat) -> .CombinationsWithReplacement(T)
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue