GeomAlg-0.2.3: Library of geometric algorithms in Haskell Source code Contents Index

GeomAlg.External.Sorting

Description

Sorting

Synopsis

nubSort :: Ord a => [a] -> [a] nubSortBy :: OrderRel a -> [a] -> [a] partition :: (a -> Bool) -> [a] -> ([a], [a]) partition3 :: (a -> Ordering) -> [a] -> ([a], [a], [a]) partition3Sorted :: (a -> Ordering) -> [a] -> ([a], [a], [a]) merge :: Ord a => [a] -> [a] -> [a] mergeBy :: Rel a -> [a] -> [a] -> [a] sort :: Ord a => [a] -> [a] sortBy isort :: Ord a => [a] -> [a] isortBy :: Rel a -> [a] -> [a] sortMap :: Ord b => (a -> b) -> [a] -> [a] sortMapBy :: Rel b -> (a -> b) -> [a] -> [a] nubSorted :: Eq a => [a] -> [a] nubSortedBy :: Rel a -> [a] -> [a]

Documentation

nubSort :: Ord a => [a] -> [a] Source

nubSortBy :: OrderRel a -> [a] -> [a] Source

partition :: (a -> Bool) -> [a] -> ([a], [a]) Source

Die Version |List.partition| aus der Prelude hat unter Hugs Schwierigkeiten mit groen Listen aufgrund einer Beschrnkung des Control-Stacks. Listen mit mehr als 700 Elementen knnen unter Hugs nicht partitioniert werden, whrend folgende Version beliebig lange Listen erlaubt, aber den Nachteil hat, nicht `stabil' zu sein.

partition3 :: (a -> Ordering) -> [a] -> ([a], [a], [a]) Source

partition3Sorted :: (a -> Ordering) -> [a] -> ([a], [a], [a]) Source

merge :: Ord a => [a] -> [a] -> [a] Source

mergeBy :: Rel a -> [a] -> [a] -> [a] Source

sort :: Ord a => [a] -> [a] Source

Whrend sort nur ein Wrapper ist, sind sortMap und sortMapBy mit dem Utilities.With Datentyp implementiert.

sortBy

isort :: Ord a => [a] -> [a] Source

Einfaches Sortieren durch Einfgen.

isortBy :: Rel a -> [a] -> [a] Source

sortMap :: Ord b => (a -> b) -> [a] -> [a] Source

sortMapBy :: Rel b -> (a -> b) -> [a] -> [a] Source

nubSorted :: Eq a => [a] -> [a] Source

nubSorted lscht benachbarte quivalente Elemente.

nubSortedBy :: Rel a -> [a] -> [a] Source

Produced by Haddock version 2.4.2