homepage: ''
changelog-type: ''
hash: 9bb9692231bcd361aadd5e73ab7d959c5c2a230d15b40c00a8a084e7bc532de0
test-bench-deps:
  exceptions: -any
  base: -any
  hspec: ! '>=2.1 && <2.3'
  quiver-sort: -any
  quiver: -any
  binary: -any
  transformers: -any
  temporary: -any
  quiver-instances: -any
  QuickCheck: ! '>=2.5 && <2.9'
  resourcet: -any
  directory: -any
maintainer: Ivan.Miljenovic@gmail.com
synopsis: Sort the values in a quiver
changelog: ''
basic-deps:
  exceptions: -any
  base: ! '>=4.8 && <4.9'
  quiver-bytestring: ==1.0.*
  quiver: ! '>=1.1.3 && <1.2'
  quiver-groups: ==0.1.*
  transformers: -any
  temporary: ==1.2.*
  quiver-instances: ==0.2.*
  quiver-binary: ! '>=0.1.1.0 && <0.1.2'
  resourcet: ==1.1.*
  quiver-interleave: ==0.2.*
  directory: -any
all-versions:
- '0.1.0.0'
author: Ivan Lazar Miljenovic
latest: '0.1.0.0'
description-type: markdown
description: ! 'quiver-sort

  ===========


  [![Hackage](https://img.shields.io/hackage/v/quiver-sort.svg)](https://hackage.haskell.org/package/quiver-sort)
  [![Build Status](https://travis-ci.org/ivan-m/quiver-sort.svg)](https://travis-ci.org/ivan-m/quiver-sort)


  Sort the values in a [Quiver], either in-memory for shorter ones or by

  using temporary files for larger/longer Quivers.


  [Quiver]: http://hackage.haskell.org/package/quiver

'
license-name: MIT

Update from Hackage at 2016-04-11T01:20:23+0000
Update from Hackage at 2016-04-11T01:20:23+0000
