Next: Sorted Associative Arrays, Up: (dir) [Index]
This manual is for bps, a data structures library.
Copyright © 2009-2015 Ciprian Niculescu.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled "GNU Free Documentation License".
• Sorted Associative Arrays: | Maps, sets and alike | |
• Generic Constructs: | Patterns used throughout this library | |
• Generic Definitions: | Generic interface elements | |
• GNU Free Documentation License: | Licence for copying this manual. | |
• The Bitmapped B-tree: | A faster B-tree | |
• Function Index: | Function index | |
• Type Index: | Type index | |
• General Index: | General index | |
— The Detailed Node Listing — Sorted Associative Arrays | ||
---|---|---|
• Sorted Associative Arrays: | ||
• Fixed Size Data Arrays: | ||
Generic Constructs | ||
• Generic Constructs: | ||
• Memory Allocator Construct: | ||
Generic Definitions | ||
• Generic Definitions: | Generic interface elements | |
• Generics Library Reference: | Data types and symbolic definitions | |
Copying This Manual | ||
• GNU Free Documentation License: | Licence for copying this manual. | |
The Bitmapped B-tree | ||
• The Bitmapped B-tree: | A faster B-tree | |
• Bitmapped B-tree Root Node Layout: | ||
• Bitmapped B-tree Non Root Node Layout: | ||
Indices | ||
• Function Index: | Function index | |
• Type Index: | Type index | |
• General Index: | General index |
Next: Sorted Associative Arrays, Up: (dir) [Index]