6. Xiangpeng Hao open-sourced bbtree, a high-performance concurrent B-tree ordered map in Rust. It’s faster, leaner, no_std, and a drop-in BTreeMap replacement. XiangpengHao/bbtree
2 likes · 15 views
Decided to port it to C# and make it a bit faster:
LukaszRozmej/BBTree
Nuget also available: nuget.org
Let's make it a new trend!
11 likes · 2 reposts · 506 views
Bbtree: Fastest Concurrent Ordered Map
1 point · 1 comment
@rustaceans_rs We will decide whether to switch after verifying RustFS subsequently.
#rust #bbtree #rustfs
It should be this website: XiangpengHao/bbtree
4 likes · 99 views
bbtree: "the fastest concurrent BTree" bbtree.xiangpeng.systems
📁 XiangpengHao/bbtree
@sunny91752655 github.com/XiangpengHao/bbtree/tree/main/bbtree/v…
The blog and visualization is also in Rust
2 likes · 457 views
Okay I spent an hour trying to read this AI Slop. The prefix key idea is "cool" (see: 1). Gives you sort of "best of both words" B+ tree and B tree behavior.
It only applies to `u64`, `u128`, `[u8]`, `str` (and box/vec variants) AFAIT [2]. Their own 'agentic' pre-release checklist calls this out as work that needs to be done prior to release. But then I can be wrong because as OP says
> No human can write better code than LLMs. All of the implementation is written by LLMs, and cross-checked by LLMs from different providers.
cites:
1. bbtree.xiangpeng.systems
2. github.com/XiangpengHao/bbtree/blob/main/bbtree/s…
I built bbtree, the foundation of databases and filesystems, and the fastest concurrent btree.
Code: XiangpengHao/bbtree
Blog post & demo: bbtree.xiangpeng.systems t.co
110 likes · 12 reposts · 3,576 views
Mentions
6. Xiangpeng Hao open-sourced bbtree, a high-performance concurrent B-tree ordered map in Rust. It’s faster, leaner, no_std, and a drop-in BTreeMap replacement. XiangpengHao/bbtree
Decided to port it to C# and make it a bit faster: LukaszRozmej/BBTree Nuget also available: nuget.org Let's make it a new trend!
Bbtree: Fastest Concurrent Ordered Map
@rustaceans_rs We will decide whether to switch after verifying RustFS subsequently. #rust #bbtree #rustfs It should be this website: XiangpengHao/bbtree
bbtree: "the fastest concurrent BTree" bbtree.xiangpeng.systems 📁 XiangpengHao/bbtree
@sunny91752655 github.com/XiangpengHao/bbtree/tree/main/bbtree/v… The blog and visualization is also in Rust
Okay I spent an hour trying to read this AI Slop. The prefix key idea is "cool" (see: 1). Gives you sort of "best of both words" B+ tree and B tree behavior. It only applies to `u64`, `u128`, `[u8]`, `str` (and box/vec variants) AFAIT [2]. Their own 'agentic' pre-release checklist calls this out as work that needs to be done prior to release. But then I can be wrong because as OP says > No human can write better code than LLMs. All of the implementation is written by LLMs, and cross-checked by LLMs from different providers. cites: 1. bbtree.xiangpeng.systems 2. github.com/XiangpengHao/bbtree/blob/main/bbtree/s…
I built bbtree, the foundation of databases and filesystems, and the fastest concurrent btree. Code: XiangpengHao/bbtree Blog post & demo: bbtree.xiangpeng.systems t.co