mirror of
https://github.com/featurebasedb/featurebase.git
synced 2026-10-06 19:07:50 +00:00
e167f1c7fa
This is a rework of Nia's radix sort. Still using stdlib sort for the tail ends of things, and should probably replace it at some point because it's still woefully inefficient, but this gets decent performance, and lets us do the fancy thing of doing quick partial sorting by record-key-only to get to shards, then deciding whether to sort by value-then-record (as for a set field) or just by record (as for int fields), which lets us reduce the amount of re-sorting the same data by different criteria we do. We also use a messy code-duplication basically-bubblesort for the inner loops because it's much cheaper for small N. This also lets us use field-aware sorting for shards, sorting them correctly for a corresponding field type, and add corresponding API support and fragment support for an option to tell the fragment code that we already ordered things in the order that's most efficient there, to avoid a second sort that we don't otherwise need. |
||
|---|---|---|
| .. | ||
| codec.go | ||
| codec_test.go | ||
| doc.go | ||
| op.go | ||
| op_test.go | ||
| shard.go | ||
| sort.go | ||
| sort_test.go | ||
| translate.go | ||
| update.go | ||
| vec.go | ||