Fabian Schmidt fapmaster
0 Followers · 0 Following
Overview Repositories
1
 Projects Packages Public Activity Starred Repositories
fapmaster pushed to main at Playground/1brc 2024-09-02 07:41:19 +02:00
4d586c809e Under 2 minutes, could probably start optimizing as I did for rust, but it's good enough for now
5bb2363eee mmapped file slightly faster
eb2ed15e33 First julia impl, very slow
dfcc8562e6 ran cargo clippy
212e595a7e ran cargo fmt
Compare 17 commits »
fapmaster pushed to main at Playground/1brc 2024-08-23 11:14:20 +02:00
53ea542f36 update dependencies, create benches
d246c54cd9 removed polars example because it wouldn't compile anymore, even when updating to latest version. It also massively reduced the number of downloaded crates
2a89d061a0 Use FxHashMap for multi_threaded_smol.rs
7add8793a5 managed to get library version on par with the reference implementation by using memmap2. I'm understanding scoped threads a little better now... I think
Compare 4 commits »
fapmaster pushed to main at Playground/1brc 2024-08-13 14:14:46 +02:00
b1d7ebaaea Create multi threaded version using smol for async reading of the file ~1 seconds faster
fapmaster pushed to main at Playground/1brc 2024-08-13 13:50:40 +02:00
bbc89aa2b3 Create single threaded version using smol for async reading of the file 46 -> 40 seconds
fapmaster pushed to master at dotfiles/nvim 2024-08-13 11:50:35 +02:00
4f2c968b33 added jdtls, need to play with it some more to add missing keymaps and
fapmaster pushed to master at dotfiles/nvim 2024-08-13 07:55:34 +02:00
11763243dc Update everything and add light theme modifications for kanagawa
fapmaster pushed to main at Playground/1brc 2024-08-12 10:47:39 +02:00
b53212103b Tried looking at what the performance would be if I read the data from a file where every line would have the same length ie. not having to read until eol. But despite not having to search the \n byte (or ; because every station name and temperatures are padded with null bytes) and having a fixed size array instead of vec this is slower (the normal read_until version is actually still just as fast, while the new one is 10x slower)
fapmaster pushed to main at projects/MyDB 2024-08-07 15:12:20 +02:00
8956442679 Continuation
fapmaster pushed to main at projects/MyDB 2024-08-06 16:07:52 +02:00
e72ce51fdd Initial Readme
fapmaster created repository projects/MyDB 2024-08-06 15:53:38 +02:00
fapmaster pushed to main at Playground/1brc 2024-08-05 12:52:45 +02:00
8ffea918c4 either it's slightly faster or it's a measurement error
fapmaster pushed to main at Playground/1brc 2024-08-05 11:21:55 +02:00
3b3801ba0d Going back because compile times trippled
fapmaster pushed to main at Playground/1brc 2024-08-05 10:54:36 +02:00
1c066ec113 accidentally committed bug
fapmaster pushed to main at Playground/1brc 2024-08-05 10:52:55 +02:00
13c54a2811 FxHashMap made me faster, memmap makes me slower, guess I'm using it wrong
fapmaster pushed to main at Playground/1brc 2024-08-02 11:43:03 +02:00
40627f9aeb add solution using libraries to see how fast I can get. For now no difference
fapmaster pushed to main at Playground/1brc 2024-08-01 15:02:10 +02:00
45ae29d3cd organize differently, added criterion as dev-dependency for benchmarks
fapmaster pushed to main at Playground/1brc 2024-08-01 10:24:43 +02:00
8eefe06e8b Formatting
fapmaster pushed to main at Playground/1brc 2024-07-31 14:00:02 +02:00
34768d3ec1 forgot feature flag in last commit
fapmaster pushed to main at Playground/1brc 2024-07-31 13:58:24 +02:00
0ffbff4cbf added 2 new implementations from users who commented on my reddit post as a comparison
fapmaster pushed to main at Playground/1brc 2024-07-31 12:49:13 +02:00
25d20169aa some improvements by reducing the casts, implemented a get_pos function to get position of byte in byteslice by bitmasking... slightly slower