-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathSet.php
548 lines (499 loc) · 12.1 KB
/
Set.php
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
<?php
declare(strict_types = 1);
namespace Innmind\Immutable;
/**
* @template-covariant T
* @psalm-immutable
*/
final class Set implements \Countable
{
/** @var Sequence<T> */
private Sequence $implementation;
private function __construct(Sequence $implementation)
{
$this->implementation = $implementation;
}
/**
* Add an element to the set
*
* Example:
* <code>
* Set::of()(1)(3)
* </code>
*
* @param T $element
*
* @return self<T>
*/
public function __invoke($element): self
{
return new self(($this->implementation)($element)->distinct());
}
/**
* @template V
* @no-named-arguments
* @psalm-pure
*
* @param V $values
*
* @return self<V>
*/
public static function of(...$values): self
{
return new self(Sequence::of(...$values)->distinct());
}
/**
* It will load the values inside the generator only upon the first use
* of the set
*
* Use this mode when the amount of data may not fit in memory
*
* @template V
* @psalm-pure
* @deprecated You should use ::snap() instead
*
* @param \Generator<V> $generator
*
* @return self<V>
*/
public static function defer(\Generator $generator): self
{
return new self(Sequence::defer($generator)->distinct());
}
/**
* It will call the given function every time a new operation is done on the
* set. This means the returned structure may not be truly immutable as
* between the calls the underlying source may change.
*
* Use this mode when calling to an external source (meaning IO bound) such
* as parsing a file or calling an API
*
* @template V
* @psalm-pure
*
* @param callable(RegisterCleanup): \Generator<V> $generator
*
* @return self<V>
*/
public static function lazy(callable $generator): self
{
return new self(Sequence::lazy($generator)->distinct());
}
/**
* @no-named-arguments
* @psalm-pure
*
* @return self<mixed>
*/
public static function mixed(mixed ...$values): self
{
return self::of(...$values);
}
/**
* @no-named-arguments
* @psalm-pure
*
* @return self<int>
*/
public static function ints(int ...$values): self
{
/** @var self<int> */
$self = self::of(...$values);
return $self;
}
/**
* @no-named-arguments
* @psalm-pure
*
* @return self<float>
*/
public static function floats(float ...$values): self
{
/** @var self<float> */
$self = self::of(...$values);
return $self;
}
/**
* @no-named-arguments
* @psalm-pure
*
* @return self<string>
*/
public static function strings(string ...$values): self
{
/** @var self<string> */
$self = self::of(...$values);
return $self;
}
/**
* @no-named-arguments
* @psalm-pure
*
* @return self<object>
*/
public static function objects(object ...$values): self
{
/** @var self<object> */
$self = self::of(...$values);
return $self;
}
/**
* @return 0|positive-int
*/
public function size(): int
{
return $this->implementation->size();
}
/**
* @return 0|positive-int
*/
#[\Override]
public function count(): int
{
return $this->implementation->size();
}
/**
* Intersect this set with the given one
*
* @param self<T> $set
*
* @return self<T>
*/
public function intersect(self $set): self
{
if ($this === $set) {
// this is necessary as the manipulation of the same iterator below
// leads to unexpected behaviour
return $this;
}
return new self($this->implementation->intersect(
$set->implementation,
));
}
/**
* Add an element to the set
*
* @param T $element
*
* @return self<T>
*/
public function add($element): self
{
return ($this)($element);
}
/**
* Check if the set contains the given element
*
* @param T $element
*/
public function contains($element): bool
{
return $this->implementation->contains($element);
}
/**
* Remove the element from the set
*
* @param T $element
*
* @return self<T>
*/
public function remove($element): self
{
return new self($this->implementation->filter(
static fn($value) => $value !== $element,
));
}
/**
* Return the diff between this set and the given one
*
* @param self<T> $set
*
* @return self<T>
*/
public function diff(self $set): self
{
return new self($this->implementation->diff(
$set->implementation,
));
}
/**
* Check if the given set is identical to this one
*
* @param self<T> $set
*/
public function equals(self $set): bool
{
$size = $this->size();
if ($size !== $set->size()) {
return false;
}
return $this->intersect($set)->size() === $size;
}
/**
* This is the same behaviour as `filter` but it allows Psalm to understand
* the type of the values contained in the returned Set
*
* @template S
*
* @param Predicate<S> $predicate
*
* @return self<S>
*/
public function keep(Predicate $predicate): self
{
/** @var self<S> */
return $this->filter($predicate);
}
/**
* Return all elements that satisfy the given predicate
*
* @param callable(T): bool $predicate
*
* @return self<T>
*/
public function filter(callable $predicate): self
{
return new self($this->implementation->filter($predicate));
}
/**
* Return all elements that don't satisfy the given predicate
*
* @param callable(T): bool $predicate
*
* @return self<T>
*/
public function exclude(callable $predicate): self
{
/** @psalm-suppress MixedArgument */
return $this->filter(static fn($value) => !$predicate($value));
}
/**
* Apply the given function to all elements of the set
*
* @param callable(T): void $function
*/
public function foreach(callable $function): SideEffect
{
return $this->implementation->foreach($function);
}
/**
* Return a new map of pairs grouped by keys determined with the given
* discriminator function
*
* @template D
*
* @param callable(T): D $discriminator
*
* @return Map<D, self<T>>
*/
public function groupBy(callable $discriminator): Map
{
return $this
->implementation
->groupBy($discriminator)
->map(static fn(mixed $_, $sequence) => $sequence->toSet());
}
/**
* Return a new set by applying the given function to all elements
*
* @template S
*
* @param callable(T): S $function
*
* @return self<S>
*/
public function map(callable $function): self
{
return new self(
$this
->implementation
->map($function)
->distinct(),
);
}
/**
* Merge all sets created by each value from the original set
*
* @template S
*
* @param callable(T): self<S> $map
*
* @return self<S>
*/
public function flatMap(callable $map): self
{
/** @psalm-suppress MixedArgument */
return new self(
$this
->implementation
->flatMap(static fn($value) => $map($value)->unsorted())
->distinct(),
);
}
/**
* Return a sequence of 2 sets partitioned according to the given predicate
*
* @param callable(T): bool $predicate
*
* @return Map<bool, self<T>>
*/
public function partition(callable $predicate): Map
{
return $this
->implementation
->partition($predicate)
->map(static fn($_, $sequence) => $sequence->toSet());
}
/**
* Return a sequence sorted with the given function
*
* @param callable(T, T): int $function
*
* @return Sequence<T>
*/
public function sort(callable $function): Sequence
{
return $this->implementation->sort($function);
}
/**
* Return an unsorted sequence
*
* @return Sequence<T>
*/
public function unsorted(): Sequence
{
return $this->implementation;
}
/**
* Create a new set with elements of both sets
*
* @param self<T> $set
*
* @return self<T>
*/
public function merge(self $set): self
{
return new self(
$this
->implementation
->append($set->implementation)
->distinct(),
);
}
/**
* Reduce the set to a single value
*
* @template I
* @template R
*
* @param I $carry
* @param callable(I|R, T): R $reducer
*
* @return I|R
*/
public function reduce($carry, callable $reducer)
{
return $this->implementation->reduce($carry, $reducer);
}
/**
* Return a set of the same type but without any value
*
* @return self<T>
*/
public function clear(): self
{
return new self(Sequence::of());
}
public function empty(): bool
{
return $this->implementation->empty();
}
/**
* @param callable(T): bool $predicate
*
* @return Maybe<T>
*/
public function find(callable $predicate): Maybe
{
return $this->implementation->find($predicate);
}
/**
* @template R
*
* @param callable(T, self<T>): R $match
* @param callable(): R $empty
*
* @return R
*/
public function match(callable $match, callable $empty)
{
/** @psalm-suppress MixedArgument */
return $this->implementation->match(
static fn($first, $rest) => $match($first, $rest->toSet()),
$empty,
);
}
/**
* @param callable(T): bool $predicate
*/
public function matches(callable $predicate): bool
{
return $this->implementation->matches($predicate);
}
/**
* @param callable(T): bool $predicate
*/
public function any(callable $predicate): bool
{
return $this->implementation->any($predicate);
}
/**
* @return list<T>
*/
public function toList(): array
{
return $this->implementation->toList();
}
/**
* Make sure every value conforms to the assertion, you must throw an
* exception when a value does not conform.
*
* For deferred and lazy sets the assertion is called on the go, meaning
* subsequent operations may start before reaching a value that doesn't
* conform. To be used carefully.
*
* @template R
*
* @param R $carry
* @param callable(R, T): R $assert
*
* @return self<T>
*/
public function safeguard($carry, callable $assert)
{
return new self($this->implementation->safeguard($carry, $assert));
}
/**
* Force to load all values into memory (only useful for deferred and lazy Set)
*
* @return self<T>
*/
public function memoize(): self
{
return new self($this->implementation->memoize());
}
/**
* This method will make sure all the underlying data is loaded when a
* future method that needs to access data is called.
*
* This is similar to ::defer() except it loads everything in memory at once
* before doing the operation. This avoids to deal with partially loaded
* iterators that may lead to bugs.
*
* @return self<T>
*/
public function snap(): self
{
return new self($this->implementation->snap());
}
}