| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | split_for_sort: key colission with 63, switch to 128 lists | Thorsten Töpper | 2025-08-30 | 1 | -3/+5 |
| | | |||||
| * | split_for_sort: performance improvement | Thorsten Töpper | 2025-08-30 | 1 | -36/+62 |
| | | | | | | | | | | In the background distribute the metadata across 63 lists instead of a single one. a-z A-Z 0-9 _ are the possible bytes on which decision via modulo happens. TODO: check whether this makes sense or wasting memory with 256 is more effective. | ||||
| * | split_for_sort: handle filename - as stdin | Thorsten Töpper | 2025-08-30 | 1 | -7/+125 |
| | | |||||
| * | split_for_sort: Append mode implemented | Thorsten Töpper | 2025-08-29 | 1 | -16/+54 |
| | | | | | | | | There may be situations when not every input file is available at once, so those can't be handled in a single session. The append mode opens the files without overwriting the previous content so making the way the tool can be used in scripts more flexible. | ||||
| * | mem_internal_check: dump and map filter array onto/from FS | Thorsten Töpper | 2025-08-24 | 1 | -24/+221 |
| | | |||||
| * | split_for_sort: set RLIMIT_NOFILE to max | Thorsten Töpper | 2025-08-23 | 1 | -0/+25 |
| | | |||||
| * | split_for_sort: make use of FS cache | Thorsten Töpper | 2025-08-23 | 1 | -3/+0 |
| | | |||||
| * | Added SPDX string to headers | Thorsten Töpper | 2025-08-21 | 2 | -2/+8 |
| | | |||||
| * | mem_internal_check: simplified towards qsort and bsearch | Thorsten Töpper | 2025-08-21 | 2 | -477/+162 |
| | | |||||
| * | time_utils.h: difftime_timespec() | Thorsten Töpper | 2025-08-21 | 1 | -0/+40 |
| | | |||||
| * | hex_conversion: introduce ishex_string | Thorsten Töpper | 2025-08-20 | 2 | -2/+16 |
| | | |||||
| * | mem_internal_check: switch reason for search cancel | Thorsten Töpper | 2025-08-20 | 1 | -1/+1 |
| | | |||||
| * | mem_internal_check: alternative to tree_based_check | Thorsten Töpper | 2025-08-19 | 2 | -5/+693 |
| | | |||||
| * | tree_based_check: SPDX Flag | Thorsten Töpper | 2025-08-19 | 1 | -1/+4 |
| | | |||||
| * | tree_based_check: fixes for debug build. | Thorsten Töpper | 2025-08-14 | 2 | -12/+15 |
| | | |||||
| * | tree_based_check: switch to unsigned values | Thorsten Töpper | 2025-08-14 | 2 | -18/+20 |
| | | |||||
| * | Makefile: all route equivalent for debug | Thorsten Töpper | 2025-08-13 | 1 | -0/+3 |
| | | |||||
| * | tree_based_check: filter utility for hash lists | Thorsten Töpper | 2025-08-12 | 3 | -3/+694 |
| | | |||||
| * | split_for_sort: add filename to warning | Thorsten Töpper | 2025-08-11 | 1 | -1/+1 |
| | | |||||
| * | split_for_sort: switch from strncpy to memcpy | Thorsten Töpper | 2025-08-10 | 1 | -4/+4 |
| | | |||||
| * | split_for_sort: Split a given file into buckets | Thorsten Töpper | 2025-08-10 | 5 | -1/+519 |
| | | | | | | | | | | | | | | | | | | | The target bucket is decided based on the first X characters of a line. The bucket name gets a prefix defined as argument and can be sorted faster on weak hardware. Note: This is just a split alternative. Real world usage in a shell script with a file in which the first 10 characters are the equal in each line, the following 2 bytes are evaluated for splitting: split_for_sort TMPSFS 12 raw_data.txt for f in TMPSFS ; do sort -o "${f}_sorted" -u "${f}" done \# Rely on the argument resolution to go with lexical order cat TMPSFS*_sorted > sorted_data.txt rm TMPSFS* | ||||
| * | Apache 2.0 LICENSE and gitignore | Thorsten Töpper | 2025-08-10 | 2 | -0/+206 |
| | | |||||
| * | Initial commit | Thorsten Töpper | 2025-08-10 | 1 | -0/+10 |
 |
index : small-utils | |
| utils written for specific uses | Thorsten Töpper |
| aboutsummaryrefslogtreecommitdiff |