stryku2393

7 ms·

1.
Optimizing okon's B-tree file creation. Going down from 477.2s to 342.2s(stryku.pl)
3 points by stryku2393 6y ago|0 comments
2.
Conversion of hexadecimal character to its binary value(stryku.pl)
1 points by stryku2393 6y ago|0 comments
3.
by stryku2393 6y ago
I thought about TOML for a while. Went with JSON because I just wanted to start working. Like I said in one of the comments, final decision has not been made yet. JSON is not written in stone, plus ffcms could support more than one language
4.
by stryku2393 6y ago
ffcms is not a finished tool. JSON is not written in stone. I fact, ffcms could support more than one language, e.g. JSON and TOML.
5.
by stryku2393 6y ago
Glad to hear that you like it (: Thank you for the links. I'll check them out. Aaand of course, thanks for the advice. Personally, I've never been in a situation where `filter_complex` caused problems. But, I've never done so
6.
by stryku2393 6y ago
True, but I wanted to stick to the official example.
7.
by stryku2393 6y ago
That's actually awesome. Didn't know about this feature but I'll take a look for sure.
8.
Ffcms – FFmpeg's -filter_complex made simple(stryku.pl)
93 points by stryku2393 6y ago|26 comments
9.
A journey to waking up and searching HIBP database in 3ms/14ms, NOT 49μs(stryku.pl)
1 points by stryku2393 7y ago|0 comments
10.
by stryku2393 7y ago
There is no restriction on using okon only for HIBP passwords. Actually, the goal is to handle hashes, no matter where they come from. User may have reasons to update db frequently. Yes, you're right that sorting data using B-tree is s
11.
by stryku2393 7y ago
True, the benchmarks are bad. I'll rewrite them (to drop the cache every time) and update the results.
12.
by stryku2393 7y ago
Thanks (: About the Postgres, I wanted to create a library and a CLI without dependencies. I wanted them to be a complete tools for doing this one thing. Tools that you can just grab and use, without installing anything.
13.
by stryku2393 7y ago
True, but I wanted to create a library and a CLI without dependencies. I don't want to force an end user to install and use a database (even under the hood).
14.
by stryku2393 7y ago
I don't think that expecting that an end user has installed a whole database toolchain is a good solution. The purpose of the tool and the library is to be a complete solution for this one thing. The user can grab the binary and just u
15.
by stryku2393 7y ago
As I said in the article, I rejected binary search and similar approaches on purpose. In general, I rejected all approaches that operates on a sorted file. That's simply because keeping the file sorted is slow, when you need to insert
16.
by stryku2393 7y ago
Just to confirm, the benchmarks are bad. Almost always the read parts of B-tree file are cached. I'll rewrite the benchmarks and update the results!
17.
by stryku2393 7y ago
Thanks for pointing this out. You're right. As I said in some comment up there, the benchmarks are bad. I benchmarked the best and the worst case in scope of the original file, so I look up for the first and the last hash. I totally mi
18.
by stryku2393 7y ago
That's exacly why I publish my pet projects. To learn from others. You're right. The benchmarks are bad. I benchmarked the best and the worst case in scope of the original file, so I look up for the first and the last hash. I tota
19.
A journey to searching Have I Been Pwned database in 49μs(stryku.pl)
333 points by stryku2393 7y ago|123 comments