A set of C++ template classes that implement a B+ tree key/data container in main memory.. #C++ classes #Template classes #Development libraries #STX #C++ #Template
STX B+ Tree is a command-line and graphical open source software that contains various C++ template classes, which allow developers to implement a B+ tree data and a B+ tree key container in the main memory of their applications.
The C++ classes provided by the STX B+ Tree program are specifically designed as alternatives for the STL (Standard Template Library) containers multiset, set, multimap, and map.
In order to make sure that the implementation is correct, the C++ template classes contain thorough verification and assertion mechanisms, by testing the tree invariants. It is an operating system independent software.
In addition to the command-line program, the project is available for download as a demo program. The STX B+ Tree demo program is a graphical software that allows you to test STX B+ Tree before implementing it in your application.
You will be able to set the data type and node slots for the B+ tree, enable support for duplicate keys, input the key and data values, as well as to choose an operation (insert, erase, insert random, find key, equal range, clear and load file).
To install and use the STX B+ Tree software on your GNU/Linux computer, you will have to configure, optimize (optionally) and compile the program via the command-line on a terminal emulator.
To do that, you will have to first download the latest version of the software from Softpedia, save the archive on a location of your choice (e.g. Home dir or Desktop), unpack it with your favorite archive manager, open a Terminal app and go to the location of the extracted archive files (e.g. cd /home/softpedia/stx-btree-0.9).
There, you must use the ‘./configure’ command to configure and optimize the program for a specific hardware architecture and/or operating system, then run the ‘make’ command to compile STX B+ Tree, followed by the ‘make install’ command to install it system wide.
What's new in STX B+ Tree 0.9:
- btree.h: changing find_lower() to not use binary search for small node sizes. More about this on my blog.
- btree.h: implementing bulk_load() to construct a B+ tree from a pre-sorted iterator range.
- btree.h: replacing copy loops with std::copy calls.
- btree.h: added template parameter UsedAsSet to skip copying of one byte value_type arrays in set container specializations.
STX B+ Tree 0.9
add to watchlist add to download basket send us an update REPORT- runs on:
- Linux
- main category:
- Programming
- developer:
- visit homepage
Zoom Client 6.0.0.37205
calibre 7.8.0
4k Video Downloader 1.5.3.0080 Plus / 4.30.0.5655
IrfanView 4.67
paint.net 5.0.13 (5.13.8830.42291)
7-Zip 23.01 / 24.04 Beta
ShareX 16.0.1
Microsoft Teams 24060.2623.2790.8046 Home / 1.7.00.7956 Work
Windows Sandbox Launcher 1.0.0
Bitdefender Antivirus Free 27.0.35.146
- Microsoft Teams
- Windows Sandbox Launcher
- Bitdefender Antivirus Free
- Zoom Client
- calibre
- 4k Video Downloader
- IrfanView
- paint.net
- 7-Zip
- ShareX