TimelyDataflow / TimelyDataflow/differential-dataflow
Operations on sorted collections
Nobody has claimed this yet.
- Dominant language
- Rust
- Stars
- 3k
- Forks
- 211
- Avg merge
- 10h 42m
- Merged PRs (30d)
- 34
Description
If an input collection has a total ordering defined over its elements, what would be the best way of doing things like, for example, given two such collections producing for each element in the second collection a pair of itself and the closest element in the first collection (a consequence of this is that elements of the first collection may appear in multiple pairs in the output collection). Is that even remotely near what this library is designed for? What about being able to perform "scan"-like operations over ranges in the input data?
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
No files, tests, or entry points are named. Start by reading the library's collection APIs and documentation to determine whether ordered inputs, nearest-element matching, and range scans are supported. Done would require a settled design and clearly specified semantics for these operations.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- data-engineering
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 20/100