| Safe Haskell | None |
|---|---|
| Language | Haskell98 |
Autolib.Util.Zufall
Synopsis
- contiguous_subsequence :: RandomC m => Int -> [a] -> m ([a], [a], [a])
- einige :: RandomC m => Int -> [a] -> m [a]
- eins :: RandomC m => [a] -> m a
- entweder :: RandomC m => m a -> m a -> m a
- entweders :: RandomC m => [m a] -> m a
- genau :: (Eq a, RandomC m) => Int -> [a] -> m [a]
- monotonic_subsequence :: RandomC m => Int -> [a] -> m ([a], [a])
- permutation :: RandomC m => [a] -> m [a]
- pick :: RandomC m => [a] -> m (a, [a])
- random_partition :: (RandomC m, Num a, Enum a) => Int -> Int -> m [a]
- randomized_sort :: Ord a => [a] -> IO [a]
- repeat_until :: RandomC m => m a -> (a -> Bool) -> m a
- selektion :: RandomC m => Int -> [a] -> m [a]
- someIO :: RandomC m => [a] -> Int -> m [a]
- subsequence :: RandomC m => Int -> [a] -> m ([a], [a])
- summe :: RandomC m => Int -> Int -> m [Int]
- test_ms :: IO ()
- module Autolib.Util.RandoM
Documentation
contiguous_subsequence :: RandomC m => Int -> [a] -> m ([a], [a], [a]) Source #
monotonic_subsequence :: RandomC m => Int -> [a] -> m ([a], [a]) Source #
permutation :: RandomC m => [a] -> m [a] Source #
random_partition :: (RandomC m, Num a, Enum a) => Int -> Int -> m [a] Source #
Zerlegung von n in genau k Summanden >= 1. Summanden sind nicht geordnet. Vorsicht: Laufzeit ist Theta(n), denn Implementierung würfelt (n-k) mal
randomized_sort :: Ord a => [a] -> IO [a] Source #
equal elements will be permuted randomly
repeat_until :: RandomC m => m a -> (a -> Bool) -> m a Source #
subsequence :: RandomC m => Int -> [a] -> m ([a], [a]) Source #
summe :: RandomC m => Int -> Int -> m [Int] Source #
finde eine zerlegung von n in genau k summanden >= 1 achtung: ist nicht gleichverteilt (?) Laufzeit ist Theta (k)
module Autolib.Util.RandoM