uvector-algorithms 0.1 → 0.1.1

raw patch · 6 files changed

+13/−3 lines, 6 files

Files

Data/Array/Vector/Algorithms/Insertion.hs +1/−0
Data/Array/Vector/Algorithms/Intro.hs +1/−0
Data/Array/Vector/Algorithms/Merge.hs +6/−1
Data/Array/Vector/Algorithms/Optimal.hs +1/−0
Data/Array/Vector/Algorithms/TriHeap.hs +3/−1
uvector-algorithms.cabal +1/−1

Data/Array/Vector/Algorithms/Insertion.hs view

@@ -16,6 +16,7 @@        , sortBy        , sortByBounds        , sortByBounds'+       , Comparison        ) where

Data/Array/Vector/Algorithms/Intro.hs view

@@ -42,6 +42,7 @@        , partialSort        , partialSortBy        , partialSortByBounds+       , Comparison        ) where  import Control.Monad

Data/Array/Vector/Algorithms/Merge.hs view

@@ -11,7 +11,12 @@ -- the entire sorting process to ease the amount of allocation performed in -- total. This is a stable sort. -module Data.Array.Vector.Algorithms.Merge (sort, sortBy, sortByBounds) where+module Data.Array.Vector.Algorithms.Merge+       ( sort+       , sortBy+       , sortByBounds+       , Comparison+       ) where  import Control.Monad.ST

Data/Array/Vector/Algorithms/Optimal.hs view

@@ -28,6 +28,7 @@        , sort3ByOffset        , sort4ByIndex        , sort4ByOffset+       , Comparison        ) where  import Control.Monad.ST

Data/Array/Vector/Algorithms/TriHeap.hs view

@@ -32,7 +32,9 @@        , heapify        , pop        , popTo-       , sortHeap ) where+       , sortHeap+       , Comparison+       ) where  import Control.Monad import Control.Monad.ST

uvector-algorithms.cabal view

@@ -1,5 +1,5 @@ Name:              uvector-algorithms-Version:           0.1+Version:           0.1.1 License:           BSD3 License-File:      LICENSE Author:            Dan Doel