serializable-bptree 8.1.2 → 8.1.3
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +2 -0
- package/dist/cjs/index.cjs +1020 -950
- package/dist/esm/index.mjs +1020 -950
- package/dist/types/base/BPTreeTransaction.d.ts +9 -0
- package/dist/types/transaction/BPTreeAsyncTransaction.d.ts +4 -0
- package/dist/types/transaction/BPTreeSyncTransaction.d.ts +1 -0
- package/package.json +5 -4
package/README.md
CHANGED
|
@@ -2,6 +2,7 @@
|
|
|
2
2
|
|
|
3
3
|
[](https://www.jsdelivr.com/package/npm/serializable-bptree)
|
|
4
4
|
|
|
5
|
+
[](https://izure1.github.io/serializable-bptree/dev/bench/)
|
|
5
6
|
|
|
6
7
|
This is a B+tree that's totally okay with duplicate values. If you need to keep track of the B+ tree's state, don't just leave it in memory - make sure you write it down.
|
|
7
8
|
|
|
@@ -135,6 +136,7 @@ Explore the detailed guides and concepts of `serializable-bptree`:
|
|
|
135
136
|
- [Duplicate Value Handling](./docs/DUPLICATE_VALUES.md): Strategies for managing large amounts of duplicate data.
|
|
136
137
|
- [Concurrency & Synchronization](./docs/CONCURRENCY.md): Multi-instance usage and locking mechanisms.
|
|
137
138
|
- [Query Optimization Guide](./docs/QUERY.md#performance--optimization): How to use `ChooseDriver` and `keys()` for complex queries.
|
|
139
|
+
- [Performance Benchmark](https://izure1.github.io/serializable-bptree/dev/bench/): Real-time performance metrics and history.
|
|
138
140
|
|
|
139
141
|
## Quick Example: Query Optimization
|
|
140
142
|
|