| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Data.BTree.Pure.Setup
Contents
Description
This module contains structures relating the the setup of a pure B+-tree.
Synopsis
- data TreeSetup = TreeSetup {
- minFanout :: Int
- maxFanout :: Int
- minIdxKeys :: Int
- maxIdxKeys :: Int
- minLeafItems :: Int
- maxLeafItems :: Int
- twoThreeSetup :: TreeSetup
- setupWithMinimumDegreeOf :: Int -> TreeSetup
Setup
Setup of a pure B+-tree.
Constructors
| TreeSetup | |
Fields
| |
Predefined setups
twoThreeSetup :: TreeSetup Source #
Setup of a 2-3 tree.
setupWithMinimumDegreeOf :: Int -> TreeSetup Source #
Setup of a B+-tree with a certain minimum degree, as defined in CLRS.
To get for example a 2-3-4 tree, use
>>>setupWithMinimumDegreeOf 2