cabal-version: 1.12

-- This file has been generated from package.yaml by hpack version 0.31.2.
--
-- see: https://github.com/sol/hpack
--
-- hash: e50a80894df3e9028881c5fe836c7f7662523439319f741fe39f2039cbaab976

name:           tskiplist
version:        1.0.1
synopsis:       A Skip List Implementation in Software Transactional Memory (STM)
description:    This package provides a proof-of-concept implementation of a skip list in STM. A skip list is a probabilistic data structure with dictionary operations and support for efficient range-queries (similarly to Data.Map). In contrast to tree data structures, a skip list does not need any rebalancing, which makes it particularly suitable for concurrent programming. (See: William Pugh. Skip Lists: A Probabilistic Alternative to Balanced Trees.) 
category:       Data, Concurrency
homepage:       https://github.com/pwrobinson/tskiplist#readme
bug-reports:    https://github.com/pwrobinson/tskiplist/issues
author:         Peter Robinson
maintainer:     peter.robinson@monoid.at
copyright:      2010-2019 Peter Robinson
license:        LGPL
license-file:   LICENSE
build-type:     Simple

source-repository head
  type: git
  location: https://github.com/pwrobinson/tskiplist

library
  exposed-modules:
      Control.Concurrent.STM.TSkipList
      Control.Concurrent.STM.TSkipList.Internal
  other-modules:
      Paths_tskiplist
  hs-source-dirs:
      src
  build-depends:
      array >=0.2 && <2
    , base >=4.7 && <5
    , containers >=0.2 && <1
    , random >=1.0.0.1 && <2
    , stm >=2.1 && <3
  default-language: Haskell2010