vector-algorithms-0.7.0.1: Efficient algorithms for vector arrays

Copyright (c) 2011 Dan Doel Dan Doel Experimental Non-portable (FlexibleContexts, ScopedTypeVariables) None Haskell98

Data.Vector.Algorithms.AmericanFlag

Description

This module implements American flag sort: an in-place, unstable, bucket sort. Also in contrast to radix sort, the values are inspected in a big endian order, and buckets are sorted via recursive splitting. This, however, makes it sensible for sorting strings in lexicographic order (provided indexing is fast).

The algorithm works as follows: at each stage, the array is looped over, counting the number of elements for each bucket. Then, starting at the beginning of the array, elements are permuted in place to reside in the proper bucket, following chains until they reach back to the current base index. Finally, each bucket is sorted recursively. This lends itself well to the aforementioned variable-length strings, and so the algorithm takes a stopping predicate, which is given a representative of the stripe, rather than running for a set number of iterations.

Synopsis

# Documentation

sort :: forall e m v. (PrimMonad m, MVector v e, Lexicographic e, Ord e) => v (PrimState m) e -> m () #

Sorts an array using the default ordering. Both Lexicographic and Ord are necessary because the algorithm falls back to insertion sort for sufficiently small arrays.

Arguments

 :: (PrimMonad m, MVector v e) => Comparison e a comparison for the insertion sort flalback -> (e -> Int -> Bool) determines whether a stripe is complete -> Int the number of buckets necessary -> (Int -> e -> Int) the big-endian radix function -> v (PrimState m) e the array to be sorted -> m ()

A fully parameterized version of the sorting algorithm. Again, this function takes both radix information and a comparison, because the algorithms falls back to insertion sort for small arrays.

class Lexicographic e where #

The methods of this class specify the information necessary to sort arrays using the default ordering. The name Lexicographic is meant to convey that index should return results in a similar way to indexing into a string.

Minimal complete definition

Methods

terminate :: e -> Int -> Bool #

Given a representative of a stripe and an index number, this function should determine whether to stop sorting.

size :: e -> Int #

The size of the bucket array necessary for sorting es

index :: Int -> e -> Int #

Determines which bucket a given element should inhabit for a particular iteration.

Instances

 # Methodsterminate :: Int -> Int -> Bool #size :: Int -> Int #index :: Int -> Int -> Int # # Methodsterminate :: Int8 -> Int -> Bool #size :: Int8 -> Int #index :: Int -> Int8 -> Int # # Methodsterminate :: Int16 -> Int -> Bool #size :: Int16 -> Int #index :: Int -> Int16 -> Int # # Methodsterminate :: Int32 -> Int -> Bool #size :: Int32 -> Int #index :: Int -> Int32 -> Int # # Methodsterminate :: Int64 -> Int -> Bool #size :: Int64 -> Int #index :: Int -> Int64 -> Int # # Methodsterminate :: Word -> Int -> Bool #size :: Word -> Int #index :: Int -> Word -> Int # # Methodsterminate :: Word8 -> Int -> Bool #size :: Word8 -> Int #index :: Int -> Word8 -> Int # # Methodsterminate :: Word16 -> Int -> Bool #size :: Word16 -> Int #index :: Int -> Word16 -> Int # # Methodsterminate :: Word32 -> Int -> Bool #size :: Word32 -> Int #index :: Int -> Word32 -> Int # # Methodsterminate :: Word64 -> Int -> Bool #size :: Word64 -> Int #index :: Int -> Word64 -> Int # # Methodsindex :: Int -> ByteString -> Int #