| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Larger heap, small tweaks (#593) | Roy van Rijn | 2024-01-27 | 1 | -34/+50 |
| | | | | More small tweaks, perf from 775~ to 738~ | ||||
| * | Rewrote to always read 16 bytes, this has less instructions on perf. (#562) | Roy van Rijn | 2024-01-23 | 1 | -181/+116 |
| | | | | It doesn't make a lot of sense since quite some code can be written shorter, but this is what gives the best numbers. | ||||
| * | Reverting ByteBuffer idea, using Thomas's trick instead. (#538) | Roy van Rijn | 2024-01-21 | 1 | -8/+36 |
| | | |||||
| * | Added dedicated reader (#493) | Roy van Rijn | 2024-01-19 | 1 | -211/+457 |
| | | | | Started running perf, perhaps this helps. No idea how to use it yet | ||||
| * | Locally another 5% faster, much faster for larger set, made more general (#352) | Roy van Rijn | 2024-01-12 | 1 | -75/+113 |
| | | |||||
| * | Adding delayed string creation again for (no-) gc, small tweaks (#315) | Roy van Rijn | 2024-01-11 | 1 | -33/+38 |
| | | |||||
| * | Fixing the off-by-one error and updating to native, redone layout of code. ↵ | Roy van Rijn | 2024-01-11 | 1 | -202/+166 |
| | | | | | (#307) | ||||
| * | Roy: Adding a bit of unsafe... | Roy van Rijn | 2024-01-07 | 1 | -254/+155 |
| | | | | Co-authored-by: Gunnar Morling <gunnar.morling@googlemail.com> | ||||
| * | Adding more speed improvements, going for first again. | Roy van Rijn | 2024-01-05 | 1 | -214/+164 |
| | | | | | Updating script | ||||
| * | Updating Roy's submission | Roy van Rijn | 2024-01-04 | 1 | -68/+215 |
| | | | | | | | | | | | | | | | | | | * Added tests for endian-calculations (had these in a different class, perhaps handy for others to see as well) Inlined the hash function, runs locally in 2.4sec now, hopefully endian issues fix Added equals to support any city name up to 1024 in length, don't rely on hash * For clarity I've updated the code so endian doesn't change the hashes, easier to debug. * Fixing bug in array check Simple is faster * Also spotted the diff, not just the big exception Fixed buffer limit issue | ||||
| * | Roy van Rijn: memory mapped files, branchless parsing, bitwiddle magic | Roy van Rijn | 2024-01-03 | 1 | -34/+278 |
| | | | | | | | Added SWAR (SIMD Within A Register) code to increase bytebuffer processing/throughput Delaying the creation of the String by comparing hash, segmenting like spullara, improved EOL finding Co-authored-by: Gunnar Morling <gunnar.morling@googlemail.com> | ||||
| * | Adding Sam Pullara's submission; | Sam Pullara | 2024-01-03 | 1 | -2/+2 |
| | | |||||
| * | Removed changes to formatting | Rene Schwietzke | 2024-01-03 | 1 | -2/+2 |
| | | |||||
| * | Faster version of the data generator | Rene Schwietzke | 2024-01-03 | 1 | -2/+2 |
| | | |||||
| * | Initial implementation, using BufferedReader, parallel processing, combining ↵ | Roy van Rijn | 2024-01-01 | 1 | -0/+79 |
| everything in a single go, sorting afterwards (unoptimized) | |||||
 |
index : 1brc | |
| my implementations for the billion row challenge | nginx |
| aboutsummaryrefslogtreecommitdiff |