1brc - my implementations for the billion row challenge

	Commit message (Collapse)	Author	Age	Files	Lines
*	Inline and optimize value parsing code for each of the four semicolon ↵	Elliot Barlas	2024-01-23	1	-47/+112
\| \| \| \|	position processing branches. This provides a small but noticeable speed-up. It also expands and obfuscates the code, unfortunately. (#563)
*	Adjust rolling hash function to operate at int-scale rather than byte-scale. ↵	Elliot Barlas	2024-01-21	1	-22/+17
\| \| \| \|	Ensure 8-byte alignment in key buffer for faster comparisons. (#523)
*	Use Arena MemorySegments rather than ByteBuffers. (#505)	Elliot Barlas	2024-01-20	1	-120/+137
\|
*	Consider file size when calculating partition count. Add simple fast-path ↵	Elliot Barlas	2024-01-14	1	-2/+14
\| \| \| \|	optimization to equals method.
*	Consume four bytes at a time from buffer using getInt. Store key with unsafe ↵	Elliot Barlas	2024-01-10	1	-83/+142
\| \| \| \|	int array rather than byte array. Use custom equals rather than Arrays equals.
*	Continue unrolling and inlining value parser. Make targeted use of ↵	Elliot Barlas	2024-01-07	1	-43/+78
\| \| \| \|	ByteBuffer.getInt() instead of ByteBuffer.get(). Switch from GraalVM CE to GraalVM. (#201)
*	Implement imperative state machine for floating point parser rather then ↵	Elliot Barlas	2024-01-05	1	-28/+35
\| \| \| \|	generic, adaptive loop.
*	Elliot Barlas: Use proper hash key collision detection scheme	Elliot Barlas	2024-01-04	1	-30/+67
\| \| \| \| \| \| \|	* 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.
*	Auto reformat classes	Filip Hrisafov	2024-01-04	1	-8/+16
\|
*	Adding Elliot Barlas' submission	Elliot Barlas	2024-01-03	1	-0/+209