The order-statistic-tree package

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain]

This repository contains an implementation of order statistic tree in Haskell programming language. I could not find an order statistic tree at Hackage, so I have to develop one.

This implementation uses weight-balanced trees which are desribed in

Also some code is based on containers package.

Implementation of order statistic tree is described in

= Benchmarks

I tried to make this tree as fast as possible. The results on my i7-4790 with 16Gb RAM are following:

Properties

Versions0.1.0.0, 0.1.0.0, 0.1.0.1, 0.1.1.0
Change logNone available
Dependenciesbase (==4.8.*) [details]
LicenseBSD3
CopyrightLambda Kazan, 2016
AuthorMansur Ziiatdinov
Maintainermz@lambdasoft.ru
CategoryData
Source repositoryhead: git clone https://github.com/lambdakazan/ostree.git
UploadedMon Feb 29 13:20:55 UTC 2016 by MZiatdinov

Modules

Downloads

Maintainers' corner

For package maintainers and hackage trustees