runiq
filterer
Efficient filtering of duplicate lines from input data
An efficient way to filter duplicate lines from input, à la uniq.
210 stars
8 watching
23 forks
Language: Rust
last commit: about 2 months ago
Linked from 1 awesome list
algorithmsfiltering-uniquesmemory-efficiency
Related projects:
Repository | Description | Stars |
---|---|---|
koraa/huniq | Filtering out duplicates from data | 240 |
whitfin/bytelines | A high-performance library for reading input lines as byte slices without allocations. | 59 |
whitfin/hypex | A fast algorithm for counting unique values in Elixir/Erlang applications | 21 |
mhasbini/duprule | Removes duplicate hashcat rule modifications by identifying unique rule changes and selecting the one with the fewest function calls. | 41 |
maxpert/drep | Tool to dynamically filter and print lines from input streams based on user-defined patterns | 89 |
whitfin/jumper | A consistent hash implementation in Elixir | 12 |
ynqa/logu | Extracts patterns from streaming log messages by tokenizing and grouping similar logs into clusters | 83 |
ayrat555/fang | Background task processing and queueing system for Rust applications. | 623 |
crossfilter/crossfilter | Fast n-dimensional filtering and grouping of records in the browser. | 1,746 |
patois/xray | Tool for filtering and highlighting decompiler output based on regular expressions | 125 |
whitfin/tiny | A lightweight JSON parser written in Elixir | 47 |
nil0x42/duplicut | Tools to remove duplicates from massive wordlists used in password cracking | 881 |
whitfin/stash | A small Elixir library providing a user-friendly interface to Erlang's ETs caching system | 52 |
lierdakil/pandoc-crossref | A pandoc filter that adds numbering and cross-referencing to figures, equations, tables, and other elements in documents. | 952 |
tylertreat/boomfilters | Probabilistic data structures for processing continuous, unbounded streams | 1,595 |