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

GeomAlg.External.Utilities

Description

Hilfsfunktionen (|Utilities|)

Synopsis

fst3 :: (a, b, c) -> a snd3 :: (a, b, c) -> b thd3 :: (a, b, c) -> c fst4 :: (a, b, c, d) -> a snd4 :: (a, b, c, d) -> b thd4 :: (a, b, c, d) -> c frt4 :: (a, b, c, d) -> d curry3 :: ((a, b, c) -> d) -> a -> b -> c -> d uncurry3 :: (a -> b -> c -> d) -> (a, b, c) -> d type Rel a = a -> a -> Bool type Rel3 a = a -> a -> a -> Bool type OrderRel a = a -> a -> Ordering type OrderRel3 a = a -> a -> a -> Ordering leqRel :: OrderRel a -> Rel a equalRel :: OrderRel a -> Rel a geqRel :: OrderRel a -> Rel a greaterRel :: OrderRel a -> Rel a lessRel :: OrderRel a -> Rel a reverseOrd :: Ordering -> Ordering compareEps :: (Ord a, Num a) => a -> a -> a -> Ordering relToFst :: (a -> b -> c) -> (a, d) -> (b, e) -> c relToSnd :: (a -> b -> c) -> (d, a) -> (e, b) -> c choose2 :: Rel a -> a -> a -> a choose1 :: Rel a -> a -> a -> a maximumBy :: Rel a -> [a] -> a minimumBy :: Rel a -> [a] -> a extremaBy :: Rel a -> [a] -> [a] data With a b = a :& b sat :: With a b -> b liftToWith :: (a -> b -> c) -> With a d -> With b e -> c maximumWith :: Ord b => (a -> b) -> [a] -> a minimumWith :: Ord b => (a -> b) -> [a] -> a maxima :: Ord a => [a] -> [a] minima :: Ord a => [a] -> [a] maximaBy :: (a -> a -> Ordering) -> [a] -> [a] minimaBy :: (a -> a -> Ordering) -> [a] -> [a] maximaWith :: Ord b => (a -> b) -> [a] -> [a] minimaWith :: Ord b => (a -> b) -> [a] -> [a] maximaWithBy :: (a -> a -> Ordering) -> (b -> a) -> [b] -> [b] minimaWithBy :: (a -> a -> Ordering) -> (b -> a) -> [b] -> [b] longerThan :: [a] -> Int -> Bool splitsAt :: Int -> [a] -> [[a]] splitWhile :: (a -> Bool) -> [a] -> ([a], [a]) sublist2 :: Eq a => a -> a -> [a] -> [a] takeDrop :: Eq a => a -> a -> [a] -> [a] sublist :: Eq a => a -> a -> [a] -> [a] delete :: Eq a => a -> a -> [a] -> [a] split :: Eq a => a -> a -> [a] -> ([a], [a]) splitByIndex :: Int -> Int -> [a] -> ([a], [a]) rotateR :: [a] -> [a] rotateL :: [a] -> [a] rotate :: Int -> [a] -> [a] rotateTo :: Eq a => a -> [a] -> [a] rotateToBy :: (a -> a -> Bool) -> a -> [a] -> [a]

Documentation

fst3 :: (a, b, c) -> a Source

snd3 :: (a, b, c) -> b Source

thd3 :: (a, b, c) -> c Source

fst4 :: (a, b, c, d) -> a Source

snd4 :: (a, b, c, d) -> b Source

thd4 :: (a, b, c, d) -> c Source

frt4 :: (a, b, c, d) -> d Source

curry3 :: ((a, b, c) -> d) -> a -> b -> c -> d Source

uncurry3 :: (a -> b -> c -> d) -> (a, b, c) -> d Source

type Rel a = a -> a -> Bool Source

subsubsection{Relationen}

type Rel3 a = a -> a -> a -> Bool Source

type OrderRel a = a -> a -> Ordering Source

type OrderRel3 a = a -> a -> a -> Ordering Source

leqRel :: OrderRel a -> Rel a Source

equalRel :: OrderRel a -> Rel a Source

geqRel :: OrderRel a -> Rel a Source

greaterRel :: OrderRel a -> Rel a Source

lessRel :: OrderRel a -> Rel a Source

reverseOrd :: Ordering -> Ordering Source

compareEps :: (Ord a, Num a) => a -> a -> a -> Ordering Source

relToFst :: (a -> b -> c) -> (a, d) -> (b, e) -> c Source

relToSnd :: (a -> b -> c) -> (d, a) -> (e, b) -> c Source

choose2 :: Rel a -> a -> a -> a Source

choose1 :: Rel a -> a -> a -> a Source

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

subsubsection{Minima und Maxima}

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

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

data With a b Source

Constructors a :& b Instances Eq a => Eq (With a b) Ord a => Ord (With a b)

sat :: With a b -> b Source

liftToWith :: (a -> b -> c) -> With a d -> With b e -> c Source

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

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

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

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

maximaBy :: (a -> a -> Ordering) -> [a] -> [a] Source

minimaBy :: (a -> a -> Ordering) -> [a] -> [a] Source

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

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

maximaWithBy :: (a -> a -> Ordering) -> (b -> a) -> [b] -> [b] Source

minimaWithBy :: (a -> a -> Ordering) -> (b -> a) -> [b] -> [b] Source

longerThan :: [a] -> Int -> Bool Source

subsubsection*{Listen}

splitsAt :: Int -> [a] -> [[a]] Source

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

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

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

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

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

split| teilt ein Polygon in zwei Hlften, |split x y [1..20] = ([1..x,y..20], [x..y])| wenn |x<=y|

split :: Eq a => a -> a -> [a] -> ([a], [a]) Source

splitByIndex :: Int -> Int -> [a] -> ([a], [a]) Source

rotateR :: [a] -> [a] Source

rotateL :: [a] -> [a] Source

rotate :: Int -> [a] -> [a] Source

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

rotateToBy :: (a -> a -> Bool) -> a -> [a] -> [a] Source

Produced by Haddock version 2.4.2