You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
|🚫|`findBack`|||[note #2](#note2"Because of the async nature of TaskSeq sequences, iterating from the back would be bad practice. Instead, materialize the sequence to a list or array and then apply the 'Back' iterators.")|
|🚫|`findIndexBack`| n/a | n/a |[note #2](#note2"Because of the async nature of TaskSeq sequences, iterating from the back would be bad practice. Instead, materialize the sequence to a list or array and then apply the 'Back' iterators.")|
294
293
|✅[#2][]|`fold`|`fold`|`foldAsync`||
295
-
||`fold2`|`fold2`|`fold2Async`||
296
294
|🚫|`foldBack`|||[note #2](#note2"Because of the async nature of TaskSeq sequences, iterating from the back would be bad practice. Instead, materialize the sequence to a list or array and then apply the 'Back' iterators.")|
297
295
|🚫|`foldBack2`|||[note #2](#note2"Because of the async nature of TaskSeq sequences, iterating from the back would be bad practice. Instead, materialize the sequence to a list or array and then apply the 'Back' iterators.")|
|🚫|`mapFoldBack`|||[note #2](#note2"Because of the async nature of TaskSeq sequences, iterating from the back would be bad practice. Instead, materialize the sequence to a list or array and then apply the 'Back' iterators.")|
321
313
|✅[#2][]|`mapi`|`mapi`|`mapiAsync`||
322
-
||`mapi2`|`mapi2`|`mapi2Async`||
323
314
|✅[#221][]|`max`|`max`|||
324
315
|✅[#221][]|`maxBy`|`maxBy`|`maxByAsync`||
325
316
|✅[#221][]|`min`|`min`|||
@@ -337,27 +328,15 @@ This is what has been implemented so far, is planned or skipped:
|🚫|`readOnly`|||[note #3](#note3"The motivation for 'readOnly' in 'Seq' is that a cast from a mutable array or list to a 'seq<_>' is valid and can be cast back, leading to a mutable sequence. Since 'TaskSeq' doesn't implement 'IEnumerable<_>', such casts are not possible.")|
|🚫|`reduceBack`|||[note #2](#note2"Because of the async nature of TaskSeq sequences, iterating from the back would be bad practice. Instead, materialize the sequence to a list or array and then apply the 'Back' iterators.")|
|❓|`rev`|||[note #1](#note1"These functions require a form of pre-materializing through 'TaskSeq.cache', similar to the approach taken in the corresponding 'Seq' functions. It doesn't make much sense to have a cached async sequence. However, 'AsyncSeq' does implement these, so we'll probably do so eventually as well.")|
349
335
|✅[#296][]|`scan`|`scan`|`scanAsync`||
350
-
|🚫|`scanBack`|||[note #2](#note2"Because of the async nature of TaskSeq sequences, iterating from the back would be bad practice. Instead, materialize the sequence to a list or array and then apply the 'Back' iterators.")|
|❓|`sort`|||[note #1](#note1"These functions require a form of pre-materializing through 'TaskSeq.cache', similar to the approach taken in the corresponding 'Seq' functions. It doesn't make much sense to have a cached async sequence. However, 'AsyncSeq' does implement these, so we'll probably do so eventually as well.")|
356
-
|❓|`sortBy`|||[note #1](#note1"These functions require a form of pre-materializing through 'TaskSeq.cache', similar to the approach taken in the corresponding 'Seq' functions. It doesn't make much sense to have a cached async sequence. However, 'AsyncSeq' does implement these, so we'll probably do so eventually as well.")|
357
-
|❓|`sortByAscending`|||[note #1](#note1"These functions require a form of pre-materializing through 'TaskSeq.cache', similar to the approach taken in the corresponding 'Seq' functions. It doesn't make much sense to have a cached async sequence. However, 'AsyncSeq' does implement these, so we'll probably do so eventually as well.")|
358
-
|❓|`sortByDescending`|||[note #1](#note1"These functions require a form of pre-materializing through 'TaskSeq.cache', similar to the approach taken in the corresponding 'Seq' functions. It doesn't make much sense to have a cached async sequence. However, 'AsyncSeq' does implement these, so we'll probably do so eventually as well.")|
359
-
|❓|`sortWith`|||[note #1](#note1"These functions require a form of pre-materializing through 'TaskSeq.cache', similar to the approach taken in the corresponding 'Seq' functions. It doesn't make much sense to have a cached async sequence. However, 'AsyncSeq' does implement these, so we'll probably do so eventually as well.")|
360
-
||`splitInto`|`splitInto`|||
361
340
|✅[#304][]|`sum`|`sum`|||
362
341
|✅[#304][]|`sumBy`|`sumBy`|`sumByAsync`||
363
342
|✅[#76][]|`tail`|`tail`|||
@@ -369,14 +348,10 @@ This is what has been implemented so far, is planned or skipped:
|❓|`transpose`|||[note #1](#note1"These functions require a form of pre-materializing through 'TaskSeq.cache', similar to the approach taken in the corresponding 'Seq' functions. It doesn't make much sense to have a cached async sequence. However, 'AsyncSeq' does implement these, so we'll probably do so eventually as well.")|
|🚫|`tryFindBack`|||[note #2](#note2"Because of the async nature of TaskSeq sequences, iterating from the back would be bad practice. Instead, materialize the sequence to a list or array and then apply the 'Back' iterators.")|
|🚫|`tryFindIndexBack`|||[note #2](#note2"Because of the async nature of TaskSeq sequences, iterating from the back would be bad practice. Instead, materialize the sequence to a list or array and then apply the 'Back' iterators.")|
380
355
|✅[#23][]|`tryHead`|`tryHead`|||
381
356
|✅[#23][]|`tryItem`|`tryItem`|||
382
357
|✅[#23][]|`tryLast`|`tryLast`|||
@@ -387,9 +362,6 @@ This is what has been implemented so far, is planned or skipped:
387
362
|✅[#217][]|`where`|`where`|`whereAsync`||
388
363
|✅[#258][]|`windowed`|`windowed`|||
389
364
|✅[#2][]|`zip`|`zip`|||
390
-
|✅|`zip3`|`zip3`|||
391
-
|||`zip4`|||
392
-
393
365
394
366
<sup>¹⁾ <aid="note1"></a>_These functions require a form of pre-materializing through `TaskSeq.cache`, similar to the approach taken in the corresponding `Seq` functions. It doesn't make much sense to have a cached async sequence. However, `AsyncSeq` does implement these, so we'll probably do so eventually as well._</sup>
395
367
<sup>²⁾ <aid="note2"></a>_Because of the async nature of `TaskSeq` sequences, iterating from the back would be bad practice. Instead, materialize the sequence to a list or array and then apply the `xxxBack` iterators._</sup>
0 commit comments