This is the Linux app named BTree implementation for Go whose latest release can be downloaded as btreev1.1.3sourcecode.tar.gz. It can be run online in the free hosting provider OnWorks for workstations.
Download and run online this app named BTree implementation for Go with OnWorks for free.
Volg deze instructies om deze app uit te voeren:
- 1. Download deze applicatie op uw pc.
- 2. Voer in onze bestandsbeheerder https://www.onworks.net/myfiles.php?username=XXXXX in met de gebruikersnaam die u wilt.
- 3. Upload deze applicatie in zo'n bestandsbeheerder.
- 4. Start de OnWorks Linux online of Windows online emulator of MACOS online emulator vanaf deze website.
- 5. Ga vanuit het OnWorks Linux-besturingssysteem dat u zojuist hebt gestart naar onze bestandsbeheerder https://www.onworks.net/myfiles.php?username=XXXXX met de gewenste gebruikersnaam.
- 6. Download de applicatie, installeer hem en voer hem uit.
SCREENSHOTS
Ad
BTree implementation for Go
PRODUCTBESCHRIJVING
This package is a high-performance, in-memory B-tree for Go that implements an ordered set/map with efficient insert, delete, and range iteration. It’s parameterized by tree degree so callers can tune cache behavior and memory overhead for their workload. Instead of relying on Go’s built-in maps—which are hash-based and unordered—btree preserves sorted order and provides rich traversal APIs like ascending, descending, and range scans. The implementation favors minimal allocations and locality, making it attractive for indexing, query engines, and caches that need predictable iteration costs. A simple Item interface with a Less method defines ordering, keeping the API small and flexible for custom types. The library includes benchmarks and optional freelists so users can trade memory reuse for speed in hot paths.
Kenmerken
- Ordered set/map semantics with fast range iteration
- Efficient insert, delete, get, and replace operations
- Tunable node degree to balance speed and memory locality
- Ascend/Descend and range-bounded traversal callbacks
- Minimal allocations with optional freelist reuse
- Small, idiomatic API using a Less interface for custom ordering
Programmeertaal
Go
Categorieën
This is an application that can also be fetched from https://sourceforge.net/projects/btree-implementation-go.mirror/. It has been hosted in OnWorks in order to be run online in an easiest way from one of our free Operative Systems.
