# -*- coding: utf-8; mode: tcl; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- vim:fenc=utf-8:ft=tcl:et:sw=4:ts=4:sts=4
# $Id$

PortSystem          1.0
PortGroup           haskell 1.0

haskell.setup       fingertree 0.1.0.0
revision            3
checksums           rmd160  9158053e9546fe3e866d0427aa544586c15914ac \
                    sha256  baa601587f8ed614886e02ca8b1eb915e6946e9937f4c4f7565c46fd7dd66530

license             BSD
maintainers         cal openmaintainer
platforms           darwin

description         Generic finger-tree structure, with example instances
long_description    \
    A general sequence representation with arbitrary annotations, for use as \
    a base for implementations of various collection types, with examples, as \
    described in section 4 of Ralf Hinze and Ross Paterson, \"Finger trees: \
    a simple general-purpose data structure\", Journal of Functional \
    Programming 16:2 (2006) pp 197-217. For a tuned sequence type, see \
    Data.Sequence in the containers package, which is a specialization of this \
    structure.