vector-algorithms 0.6.0.1 → 0.6.0.2

raw patch · 7 files changed

+8/−8 lines, 7 files

Files

src/Data/Vector/Algorithms/AmericanFlag.hs +1/−1
src/Data/Vector/Algorithms/Heap.hs +1/−1
src/Data/Vector/Algorithms/Insertion.hs +1/−1
src/Data/Vector/Algorithms/Intro.hs +1/−1
src/Data/Vector/Algorithms/Merge.hs +1/−1
src/Data/Vector/Algorithms/Radix.hs +1/−1
vector-algorithms.cabal +2/−2

src/Data/Vector/Algorithms/AmericanFlag.hs view

@@ -206,7 +206,7 @@ sort v = sortBy compare terminate (size e) index v  where e :: e        e = undefined-{-# INLINABLE sort #-}+{-# INLINE sort #-}  -- | A fully parameterized version of the sorting algorithm. Again, this -- function takes both radix information and a comparison, because the

src/Data/Vector/Algorithms/Heap.hs view

@@ -52,7 +52,7 @@ -- | Sorts an entire array using the default ordering. sort :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m () sort = sortBy compare-{-# INLINABLE sort #-}+{-# INLINE sort #-}  -- | Sorts an entire array using a custom ordering. sortBy :: (PrimMonad m, MVector v e) => Comparison e -> v (PrimState m) e -> m ()

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

@@ -33,7 +33,7 @@ -- | Sorts an entire array using the default comparison for the type sort :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m () sort = sortBy compare-{-# INLINABLE sort #-}+{-# INLINE sort #-}  -- | Sorts an entire array using a given comparison sortBy :: (PrimMonad m, MVector v e) => Comparison e -> v (PrimState m) e -> m ()

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

@@ -62,7 +62,7 @@ -- | Sorts an entire array using the default ordering. sort :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m () sort = sortBy compare-{-# INLINABLE sort #-}+{-# INLINE sort #-}  -- | Sorts an entire array using a custom ordering. sortBy :: (PrimMonad m, MVector v e) => Comparison e -> v (PrimState m) e -> m ()

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

@@ -34,7 +34,7 @@ -- | Sorts an array using the default comparison. sort :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m () sort = sortBy compare-{-# INLINABLE sort #-}+{-# INLINE sort #-}  -- | Sorts an array using a custom comparison. sortBy :: (PrimMonad m, MVector v e) => Comparison e -> v (PrimState m) e -> m ()

src/Data/Vector/Algorithms/Radix.hs view

@@ -183,7 +183,7 @@  where  e :: e  e = undefined-{-# INLINABLE sort #-}+{-# INLINE sort #-}  -- | Radix sorts an array using custom radix information -- requires the number of passes to fully sort the array,

vector-algorithms.cabal view

@@ -1,10 +1,10 @@ name:              vector-algorithms-version:           0.6.0.1+version:           0.6.0.2 license:           BSD3 license-file:      LICENSE author:            Dan Doel maintainer:        Dan Doel <dan.doel@gmail.com>-copyright:         (c) 2008,2009,2010,2011,2012,2013 Dan Doel+copyright:         (c) 2008,2009,2010,2011,2012,2013,2014 Dan Doel homepage:          http://code.haskell.org/~dolio/ category:          Data synopsis:          Efficient algorithms for vector arrays