Next: Data Structures, Up: (dir) [Index]

This manual is for *libx1f4l2*, a data structures library.

Copyright © 2009-2014 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".

• Data Structures: | Bit of classification | |

• Sequences: | Order preserving collections | |

• Sorted Associative Arrays: | Maps, sets and alike | |

• Split Sorted Associative Arrays: | Maps, tries | |

• Double Ended Queues: | Linked lists et al. | |

• 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 — Some Data Structures Classification | ||
---|---|---|

• Data Structures: | Bit of classification | |

• By Data Type: | Record classification | |

Sequences | ||

• Sequences: | ||

• Variable Size Data Sequences: | ||

• Fixed Size Data Sequences: | ||

Sorted Associative Arrays | ||

• Sorted Associative Arrays: | ||

• Variable Size Data Arrays: | ||

• Fixed Size Data Arrays: | General arrays, fixed size data | |

• Fixed Size Data Mini Arrays: | Preallocated, bounded capacity arrays | |

Split Sorted Associative Arrays | ||

• Split Sorted Associative Arrays: | ||

• String Key Pointer Value Arrays: | ||

• String Key Variable Size Value Arrays: | ||

Double Ended Queues | ||

• Double Ended Queues: | ||

• Variable Size Data Queues: | ||

• Fixed Size Data Queues: | ||

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: Data Structures, Up: (dir) [Index]