BTree implementation for Go
This package provides an in-memory B-Tree implementation for Go, useful as an ordered, mutable data structure.
This is a fork of the google/btree package which uses tidwall/pair as items.
-
Notifications
You must be signed in to change notification settings - Fork 2
btree with pair type as items
License
tidwall/pairtree
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
btree with pair type as items
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published