| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Consume four bytes at a time from buffer using getInt. Store key with unsafe ↵ | Elliot Barlas | 2024-01-10 | 1 | -1/+1 |
| | | | | | int array rather than byte array. Use custom equals rather than Arrays equals. | ||||
| * | Hyperfine: Script re-org | Gunnar Morling | 2024-01-09 | 1 | -3/+1 |
| | | |||||
| * | Continue unrolling and inlining value parser. Make targeted use of ↵ | Elliot Barlas | 2024-01-07 | 1 | -1/+1 |
| | | | | | ByteBuffer.getInt() instead of ByteBuffer.get(). Switch from GraalVM CE to GraalVM. (#201) | ||||
| * | Update calculate_average_ebarlas.sh | Elliot Barlas | 2024-01-05 | 1 | -1/+1 |
| | | | | Co-authored-by: Gunnar Morling <gunnar.morling@googlemail.com> | ||||
| * | Implement imperative state machine for floating point parser rather then ↵ | Elliot Barlas | 2024-01-05 | 1 | -0/+1 |
| | | | | | generic, adaptive loop. | ||||
| * | Elliot Barlas: Use proper hash key collision detection scheme | Elliot Barlas | 2024-01-04 | 1 | -1/+1 |
| | | | | | | | | * Use open-addressing scheme to deal with hash table collisions. Reduce concurrency from 16 to 8. Use bit mask rather than mod operator to confine hash code to table range. * Properly handle file partitions that reside entirely within a line. * Reorder statements in doProcessBuffer. | ||||
| * | Running ebarlas solution with GraalVM CE 21.0.1 | Elliot Barlas | 2024-01-03 | 1 | -1/+1 |
| | | |||||
| * | Adding Elliot Barlas' submission | Elliot Barlas | 2024-01-03 | 1 | -0/+20 |
 |
index : 1brc | |
| my implementations for the billion row challenge | nginx |
| aboutsummaryrefslogtreecommitdiff |