2 Repos
Divides a collection into consecutive groups where adjacent elements meet a specified comparison or transformation rule.
Distinct from Collection Element Transformations: Distinct from Collection Element Transformations: focuses on splitting collections into groups rather than mapping individual elements.
Explore 2 awesome GitHub repositories matching data & databases · Predicate-Based Chunking. Refine with filters or upvote what's useful.
Swift Algorithms is a library of sequence and collection algorithms for Swift, providing operations for splitting, cycling, combining, and sampling collections with lazy evaluation. It extends Swift's standard library with algorithms that work across all types conforming to Sequence and Collection protocols, enabling efficient data processing without intermediate storage. The library specializes in combinatorial enumeration, generating all possible permutations, combinations, and product sequences from collections for testing and exploration. It also includes utilities for splitting collectio
Ships algorithms for chunking collections by predicate conditions into consecutive groups.
This project is a library of algorithms for transforming, filtering, and combining asynchronous data streams in Swift. It provides a toolkit for managing asynchronous sequences, offering a concurrent sequence processor to merge, zip, and concatenate multiple streams into single outputs. The library distinguishes itself through specialized timing and flow control mechanisms. It implements asynchronous back-pressure to synchronize producer and consumer speeds and provides a toolkit for event timing, including debouncing, throttling, and the generation of periodic timers. The capability surface
Aggregates consecutive elements into collections based on custom comparison closures or projected values.