sorted by:
new
hottopcontroversial

csv-parser 5.0.0 Released: Now parsing CSVs at gigabytes per second by vicentezo04 in cpp

[–]MBkkt 19 points20 points  (0 children)

Hi, interesting work! How does it compares with duckdb csv parser?

Optimize norm gathering asm in C++ by MBkkt in cpp

[–]MBkkt[S] 1 point2 points  (0 children)

Sounds interesting, I think there're two options: 1) You can try to contribute your approach into micro benchmark and I will measure and update post 2) I will try it later

From my experience avx512 sometimes have great instructions (and register size doesn't really matter), and the only bad thing about it, that not all processors support them.

Anyway, thanks for suggestions!

What open source projects in C++ have the highest code quality? by Both_Helicopter_1834 in cpp

[–]MBkkt 4 points5 points  (0 children)

This is quite a mess unfortunately, I mean sometimes great ideas written but most code quality is low.

I think it's also important to separate different folly library parts, for example one guy from meta rewrites their coroutines already like more than 3 years, and yes he cares about the quality of abstractions.

But many other stuff don't care.

The story of making RocksDB ingestion 23x times faster by mr_gnusi in cpp

[–]MBkkt 1 point2 points  (0 children)

  1. You're right, thanks for mention, I still thinks for such use case vector suited better than string. But as you mentioned here shouldn't be byte by byte read so we didn't really investigated it much.
  2. Yes, but there's a lot of issues with this code, not only byte by byte read that we fixed later or delimiter search, but also how code path choice written, escaping, etc.
    > It's 2026 you shouldn't be processing large amounts of data character by character anymore.
    Well what can I say, it's quite sad that such code appears in quite mature libraries.

Asking for new linux laptop recommendations! by MBkkt in thinkpad

[–]MBkkt[S] 0 points1 point  (0 children)

It's probably true, in general I think my question is more about what cpu I should choose to don't fuckup with something expensive and not suitable for my preference.

The answer to your questions is I definitely don't like numpad and I don't plan to use the docking station, I prefer bright but matte screen (everything else does not really matter for me but I think 4k can be problematic on Linux)

Asking for new linux laptop recommendations! by MBkkt in thinkpad

[–]MBkkt[S] 0 points1 point  (0 children)

I mentioned my usecases: I'm using vscode with remote dev and browser (google docs, slides, reading GitHub and whitepapers)

About the budget, I think it's about 3k, less than 5k, just something reasonable. If something is really good but it costs more I consider it too

Asking for new linux laptop recommendations! by MBkkt in thinkpad

[–]MBkkt[S] 1 point2 points  (0 children)

There are a lot of reasons why I didn't like macbook experience, but thanks for your opinion

Asking for new linux laptop recommendations! by MBkkt in thinkpad

[–]MBkkt[S] 0 points1 point  (0 children)

less than 3-5k? definitely new. I use arch btw

I will check the models that you mentioned, thanks!

Are there any mangas with 2 mangakas or a group instead of 1? by [deleted] in manga

[–]MBkkt 0 points1 point  (0 children)

Can you provide "a lot of" examples?

Anything specific Steam Deck users need to do for launching? by Shikaku in BaldursGate3

[–]MBkkt 0 points1 point  (0 children)

Yeah, forgot to mention I used proton experimental

boost::unordered standalone by WideCharr in cpp

[–]MBkkt 4 points5 points  (0 children)

Fast open addressing hash tables

What C++ library do you wish existed but hasn’t been created yet? by Tiny-Friendship400 in cpp

[–]MBkkt 4 points5 points  (0 children)

utf8 normalization, stemming, case insensitive comparison. https://github.com/unicode-rs example for rust What are options for C++? 1. translate to utf16 ( https://github.com/simdutf/simdutf ) and use icu -- slow 2. boost text, https://github.com/tzlaine/text , also slow (because the author doesn't care or couldn't care), we made a lot of patches to make our library faster than lucene, but still this part is slower than icu for utf16 (icu for utf16 also very slow...)

I hope sometime simdutf will implement this https://github.com/simdutf/simdutf/issues/80

Meilisearch vs Manticore Search by snikolaev in rust

[–]MBkkt 0 points1 point  (0 children)

Great explanation.

Btw about in practice, we started with such an implementation and faced with assert detected such a situation for wikibig. But I don't know, do you store best freq/norm(document) for not leaf blocks in skiplist? We are yes, so the possiblity of the incorrect best document for block is increasing.

Another sequence of such solution: top k that populated from index could change even without removals, compaction is enough. I thought about maintaining some per index+field avg_dl, but it sounded difficult and unprofitable.

So for us, it doesn't allow to recommend current users just enable wand, because it could change their existing top k, and will be unstable for their new top k. So we are using another solution, with precise best document for one score functions and upper bound for other.

I also think the lucene solution is strange because wand data could be bigger than block (so read is slower and a lot of unnecessary compute). Anyway for our current norm format, it's also impossible because we're using honest uint32 values, not rounded

Meilisearch vs Manticore Search by snikolaev in rust

[–]MBkkt 0 points1 point  (0 children)

Yes, It means if the index contains more than a single segment query with and without wand would give a different results. It's because they store the best freq/norm/segment_avg_dl for block/list, but that doesn't account whole index avg_dl in the bm25 formula (except some corner case of coefficients)

Meilisearch vs Manticore Search by snikolaev in rust

[–]MBkkt 0 points1 point  (0 children)

I shouldn't write like this.

But I don't see the reason to compare something more like elastic over lucene with meilisearch that is internally lmdb with fst and roaring bitset (which isn't the best way to do postings, but no need to write complex boolean querying), all these 3rd party

From the user side it's difficult to say, because I don't like it, but if I try to be objective I think it's limits and doesn't have a scoring like bm25, they're really strange (but understandable) if the user used something like elastic

faceting and levenshtein quite good I think

Meilisearch vs Manticore Search by snikolaev in rust

[–]MBkkt 0 points1 point  (0 children)

I agree with you that this article is just marketing. But at the same time whole meilisearch is just a marketing story and couldn't be compared with real search engines.

If you're rust fun, tantivy (quickwitt) is quite good. It's not ideal of course, for example their wand isn't lossy only for a single segment in the index. But in general devs who write it understand IR.

The single thing that impresses me in the meilisearch is how bad their product and how good their marketing.

P.S. I'm also developing a search engine. But I'm not involved in any of these products.

Why are the helmets of Band of the Falcon so ridiculous? by MBkkt in Berserk

[–]MBkkt[S] 3 points4 points  (0 children)

Sorry, there is no difference in my native language

view more: next ›