ic-mops 0.8.5 → 0.8.7

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (99) hide show
  1. package/package.json +3 -1
  2. package/.mops/base@0.7.4/LICENSE +0 -208
  3. package/.mops/base@0.7.4/README.md +0 -64
  4. package/.mops/base@0.7.4/mops.toml +0 -5
  5. package/.mops/base@0.7.4/src/Array.mo +0 -686
  6. package/.mops/base@0.7.4/src/AssocList.mo +0 -203
  7. package/.mops/base@0.7.4/src/Blob.mo +0 -55
  8. package/.mops/base@0.7.4/src/Bool.mo +0 -44
  9. package/.mops/base@0.7.4/src/Buffer.mo +0 -1937
  10. package/.mops/base@0.7.4/src/CertifiedData.mo +0 -29
  11. package/.mops/base@0.7.4/src/Char.mo +0 -67
  12. package/.mops/base@0.7.4/src/Debug.mo +0 -15
  13. package/.mops/base@0.7.4/src/Deque.mo +0 -75
  14. package/.mops/base@0.7.4/src/Error.mo +0 -41
  15. package/.mops/base@0.7.4/src/ExperimentalCycles.mo +0 -51
  16. package/.mops/base@0.7.4/src/ExperimentalInternetComputer.mo +0 -36
  17. package/.mops/base@0.7.4/src/ExperimentalStableMemory.mo +0 -121
  18. package/.mops/base@0.7.4/src/Float.mo +0 -150
  19. package/.mops/base@0.7.4/src/Func.mo +0 -38
  20. package/.mops/base@0.7.4/src/Hash.mo +0 -83
  21. package/.mops/base@0.7.4/src/HashMap.mo +0 -229
  22. package/.mops/base@0.7.4/src/Heap.mo +0 -113
  23. package/.mops/base@0.7.4/src/Int.mo +0 -150
  24. package/.mops/base@0.7.4/src/Int16.mo +0 -159
  25. package/.mops/base@0.7.4/src/Int32.mo +0 -160
  26. package/.mops/base@0.7.4/src/Int64.mo +0 -161
  27. package/.mops/base@0.7.4/src/Int8.mo +0 -160
  28. package/.mops/base@0.7.4/src/Iter.mo +0 -220
  29. package/.mops/base@0.7.4/src/IterType.mo +0 -7
  30. package/.mops/base@0.7.4/src/List.mo +0 -433
  31. package/.mops/base@0.7.4/src/Nat.mo +0 -75
  32. package/.mops/base@0.7.4/src/Nat16.mo +0 -146
  33. package/.mops/base@0.7.4/src/Nat32.mo +0 -146
  34. package/.mops/base@0.7.4/src/Nat64.mo +0 -146
  35. package/.mops/base@0.7.4/src/Nat8.mo +0 -146
  36. package/.mops/base@0.7.4/src/None.mo +0 -19
  37. package/.mops/base@0.7.4/src/Option.mo +0 -160
  38. package/.mops/base@0.7.4/src/Order.mo +0 -46
  39. package/.mops/base@0.7.4/src/Prelude.mo +0 -33
  40. package/.mops/base@0.7.4/src/Principal.mo +0 -58
  41. package/.mops/base@0.7.4/src/RBTree.mo +0 -218
  42. package/.mops/base@0.7.4/src/Random.mo +0 -188
  43. package/.mops/base@0.7.4/src/Result.mo +0 -210
  44. package/.mops/base@0.7.4/src/Stack.mo +0 -40
  45. package/.mops/base@0.7.4/src/Text.mo +0 -615
  46. package/.mops/base@0.7.4/src/Time.mo +0 -37
  47. package/.mops/base@0.7.4/src/Trie.mo +0 -1200
  48. package/.mops/base@0.7.4/src/TrieMap.mo +0 -180
  49. package/.mops/base@0.7.4/src/TrieSet.mo +0 -97
  50. package/.mops/base@0.8.3/LICENSE +0 -208
  51. package/.mops/base@0.8.3/README.md +0 -64
  52. package/.mops/base@0.8.3/mops.toml +0 -6
  53. package/.mops/base@0.8.3/src/Array.mo +0 -717
  54. package/.mops/base@0.8.3/src/AssocList.mo +0 -404
  55. package/.mops/base@0.8.3/src/Blob.mo +0 -212
  56. package/.mops/base@0.8.3/src/Bool.mo +0 -44
  57. package/.mops/base@0.8.3/src/Buffer.mo +0 -2660
  58. package/.mops/base@0.8.3/src/CertifiedData.mo +0 -53
  59. package/.mops/base@0.8.3/src/Char.mo +0 -65
  60. package/.mops/base@0.8.3/src/Debug.mo +0 -56
  61. package/.mops/base@0.8.3/src/Deque.mo +0 -243
  62. package/.mops/base@0.8.3/src/Error.mo +0 -68
  63. package/.mops/base@0.8.3/src/ExperimentalCycles.mo +0 -151
  64. package/.mops/base@0.8.3/src/ExperimentalInternetComputer.mo +0 -60
  65. package/.mops/base@0.8.3/src/ExperimentalStableMemory.mo +0 -348
  66. package/.mops/base@0.8.3/src/Float.mo +0 -843
  67. package/.mops/base@0.8.3/src/Func.mo +0 -46
  68. package/.mops/base@0.8.3/src/Hash.mo +0 -82
  69. package/.mops/base@0.8.3/src/HashMap.mo +0 -457
  70. package/.mops/base@0.8.3/src/Heap.mo +0 -233
  71. package/.mops/base@0.8.3/src/Int.mo +0 -365
  72. package/.mops/base@0.8.3/src/Int16.mo +0 -521
  73. package/.mops/base@0.8.3/src/Int32.mo +0 -522
  74. package/.mops/base@0.8.3/src/Int64.mo +0 -522
  75. package/.mops/base@0.8.3/src/Int8.mo +0 -522
  76. package/.mops/base@0.8.3/src/Iter.mo +0 -227
  77. package/.mops/base@0.8.3/src/IterType.mo +0 -7
  78. package/.mops/base@0.8.3/src/List.mo +0 -930
  79. package/.mops/base@0.8.3/src/Nat.mo +0 -305
  80. package/.mops/base@0.8.3/src/Nat16.mo +0 -144
  81. package/.mops/base@0.8.3/src/Nat32.mo +0 -144
  82. package/.mops/base@0.8.3/src/Nat64.mo +0 -144
  83. package/.mops/base@0.8.3/src/Nat8.mo +0 -144
  84. package/.mops/base@0.8.3/src/None.mo +0 -19
  85. package/.mops/base@0.8.3/src/Option.mo +0 -154
  86. package/.mops/base@0.8.3/src/Order.mo +0 -46
  87. package/.mops/base@0.8.3/src/Prelude.mo +0 -33
  88. package/.mops/base@0.8.3/src/Principal.mo +0 -249
  89. package/.mops/base@0.8.3/src/RBTree.mo +0 -681
  90. package/.mops/base@0.8.3/src/Random.mo +0 -270
  91. package/.mops/base@0.8.3/src/Result.mo +0 -209
  92. package/.mops/base@0.8.3/src/Stack.mo +0 -93
  93. package/.mops/base@0.8.3/src/Text.mo +0 -761
  94. package/.mops/base@0.8.3/src/Time.mo +0 -36
  95. package/.mops/base@0.8.3/src/Timer.mo +0 -62
  96. package/.mops/base@0.8.3/src/Trie.mo +0 -1603
  97. package/.mops/base@0.8.3/src/TrieMap.mo +0 -392
  98. package/.mops/base@0.8.3/src/TrieSet.mo +0 -148
  99. package/network.txt +0 -1
@@ -1,227 +0,0 @@
1
- /// Iterators
2
-
3
- import Array "Array";
4
- import Buffer "Buffer";
5
- import List "List";
6
- import Order "Order";
7
-
8
- module {
9
-
10
- /// An iterator that produces values of type `T`. Calling `next` returns
11
- /// `null` when iteration is finished.
12
- ///
13
- /// Iterators are inherently stateful. Calling `next` "consumes" a value from
14
- /// the Iterator that cannot be put back, so keep that in mind when sharing
15
- /// iterators between consumers.
16
- ///
17
- /// An iterater `i` can be iterated over using
18
- /// ```
19
- /// for (x in i) {
20
- /// …do something with x…
21
- /// }
22
- /// ```
23
- public type Iter<T> = { next : () -> ?T };
24
-
25
- /// Creates an iterator that produces all `Nat`s from `x` to `y` including
26
- /// both of the bounds.
27
- /// ```motoko
28
- /// import Iter "mo:base/Iter";
29
- /// let iter = Iter.range(1, 3);
30
- /// assert(?1 == iter.next());
31
- /// assert(?2 == iter.next());
32
- /// assert(?3 == iter.next());
33
- /// assert(null == iter.next());
34
- /// ```
35
- public class range(x : Nat, y : Int) {
36
- var i = x;
37
- public func next() : ?Nat {
38
- if (i > y) { null } else { let j = i; i += 1; ?j }
39
- }
40
- };
41
-
42
- /// Like `range` but produces the values in the opposite
43
- /// order.
44
- public class revRange(x : Int, y : Int) {
45
- var i = x;
46
- public func next() : ?Int {
47
- if (i < y) { null } else { let j = i; i -= 1; ?j }
48
- }
49
- };
50
-
51
- /// Calls a function `f` on every value produced by an iterator and discards
52
- /// the results. If you're looking to keep these results use `map` instead.
53
- ///
54
- /// ```motoko
55
- /// import Iter "mo:base/Iter";
56
- /// var sum = 0;
57
- /// Iter.iterate<Nat>(Iter.range(1, 3), func(x, _index) {
58
- /// sum += x;
59
- /// });
60
- /// assert(6 == sum)
61
- /// ```
62
- public func iterate<A>(
63
- xs : Iter<A>,
64
- f : (A, Nat) -> ()
65
- ) {
66
- var i = 0;
67
- label l loop {
68
- switch (xs.next()) {
69
- case (?next) {
70
- f(next, i)
71
- };
72
- case (null) {
73
- break l
74
- }
75
- };
76
- i += 1;
77
- continue l
78
- }
79
- };
80
-
81
- /// Consumes an iterator and counts how many elements were produced
82
- /// (discarding them in the process).
83
- public func size<A>(xs : Iter<A>) : Nat {
84
- var len = 0;
85
- iterate<A>(xs, func(x, i) { len += 1 });
86
- len
87
- };
88
-
89
- /// Takes a function and an iterator and returns a new iterator that lazily applies
90
- /// the function to every element produced by the argument iterator.
91
- /// ```motoko
92
- /// import Iter "mo:base/Iter";
93
- /// let iter = Iter.range(1, 3);
94
- /// let mappedIter = Iter.map(iter, func (x : Nat) : Nat { x * 2 });
95
- /// assert(?2 == mappedIter.next());
96
- /// assert(?4 == mappedIter.next());
97
- /// assert(?6 == mappedIter.next());
98
- /// assert(null == mappedIter.next());
99
- /// ```
100
- public func map<A, B>(xs : Iter<A>, f : A -> B) : Iter<B> = object {
101
- public func next() : ?B {
102
- switch (xs.next()) {
103
- case (?next) {
104
- ?f(next)
105
- };
106
- case (null) {
107
- null
108
- }
109
- }
110
- }
111
- };
112
-
113
- /// Takes a function and an iterator and returns a new iterator that produces
114
- /// elements from the original iterator if and only if the predicate is true.
115
- /// ```motoko
116
- /// import Iter "o:base/Iter";
117
- /// let iter = Iter.range(1, 3);
118
- /// let mappedIter = Iter.filter(iter, func (x : Nat) : Bool { x % 2 == 1 });
119
- /// assert(?1 == mappedIter.next());
120
- /// assert(?3 == mappedIter.next());
121
- /// assert(null == mappedIter.next());
122
- /// ```
123
- public func filter<A>(xs : Iter<A>, f : A -> Bool) : Iter<A> = object {
124
- public func next() : ?A {
125
- loop {
126
- switch (xs.next()) {
127
- case (null) {
128
- return null
129
- };
130
- case (?x) {
131
- if (f(x)) {
132
- return ?x
133
- }
134
- }
135
- }
136
- };
137
- null
138
- }
139
- };
140
-
141
- /// Creates an iterator that produces an infinite sequence of `x`.
142
- /// ```motoko
143
- /// import Iter "mo:base/Iter";
144
- /// let iter = Iter.make(10);
145
- /// assert(?10 == iter.next());
146
- /// assert(?10 == iter.next());
147
- /// assert(?10 == iter.next());
148
- /// // ...
149
- /// ```
150
- public func make<A>(x : A) : Iter<A> = object {
151
- public func next() : ?A {
152
- ?x
153
- }
154
- };
155
-
156
- /// Creates an iterator that produces the elements of an Array in ascending index order.
157
- /// ```motoko
158
- /// import Iter "mo:base/Iter";
159
- /// let iter = Iter.fromArray([1, 2, 3]);
160
- /// assert(?1 == iter.next());
161
- /// assert(?2 == iter.next());
162
- /// assert(?3 == iter.next());
163
- /// assert(null == iter.next());
164
- /// ```
165
- public func fromArray<A>(xs : [A]) : Iter<A> {
166
- var ix : Nat = 0;
167
- let size = xs.size();
168
- object {
169
- public func next() : ?A {
170
- if (ix >= size) {
171
- return null
172
- } else {
173
- let res = ?(xs[ix]);
174
- ix += 1;
175
- return res
176
- }
177
- }
178
- }
179
- };
180
-
181
- /// Like `fromArray` but for Arrays with mutable elements. Captures
182
- /// the elements of the Array at the time the iterator is created, so
183
- /// further modifications won't be reflected in the iterator.
184
- public func fromArrayMut<A>(xs : [var A]) : Iter<A> {
185
- fromArray<A>(Array.freeze<A>(xs))
186
- };
187
-
188
- /// Like `fromArray` but for Lists.
189
- public let fromList = List.toIter;
190
-
191
- /// Consumes an iterator and collects its produced elements in an Array.
192
- /// ```motoko
193
- /// import Iter "mo:base/Iter";
194
- /// let iter = Iter.range(1, 3);
195
- /// assert([1, 2, 3] == Iter.toArray(iter));
196
- /// ```
197
- public func toArray<A>(xs : Iter<A>) : [A] {
198
- let buffer = Buffer.Buffer<A>(8);
199
- iterate(xs, func(x : A, ix : Nat) { buffer.add(x) });
200
- return Buffer.toArray(buffer)
201
- };
202
-
203
- /// Like `toArray` but for Arrays with mutable elements.
204
- public func toArrayMut<A>(xs : Iter<A>) : [var A] {
205
- Array.thaw<A>(toArray<A>(xs))
206
- };
207
-
208
- /// Like `toArray` but for Lists.
209
- public func toList<A>(xs : Iter<A>) : List.List<A> {
210
- var result = List.nil<A>();
211
- iterate<A>(
212
- xs,
213
- func(x, _i) {
214
- result := List.push<A>(x, result)
215
- }
216
- );
217
- List.reverse<A>(result)
218
- };
219
-
220
- /// Sorted iterator. Will iterate over *all* elements to sort them, necessarily.
221
- public func sort<A>(xs : Iter<A>, compare : (A, A) -> Order.Order) : Iter<A> {
222
- let a = toArrayMut<A>(xs);
223
- Array.sortInPlace<A>(a, compare);
224
- fromArrayMut<A>(a)
225
- };
226
-
227
- }
@@ -1,7 +0,0 @@
1
- /// The Iterator type
2
-
3
- // Just here to break cyclic module definitions
4
-
5
- module {
6
- public type Iter<T> = { next : () -> ?T }
7
- }