diff --git a/data/base-unicode-symbols.txt b/data/base-unicode-symbols.txt deleted file mode 100644 --- a/data/base-unicode-symbols.txt +++ /dev/null @@ -1,347 +0,0 @@ --- Hoogle documentation, generated by Haddock --- See Hoogle, http://www.haskell.org/hoogle/ - - --- | Unicode alternatives for common functions and operators --- --- This package defines new symbols for a number of functions and --- operators in the base package. --- --- All symbols are documented with their actual definition and --- information regarding their Unicode code point. They should be --- completely interchangeable with their definitions. --- --- For further Unicode goodness you can enable the UnicodeSyntax --- language extension [1]. This extension enables Unicode characters to --- be used to stand for certain ASCII character sequences, i.e. → instead --- of ->, ∀ instead of forall and many others. --- --- Original idea by Péter Diviánszky. --- --- [1] --- http://www.haskell.org/ghc/docs/latest/html/users_guide/syntax-extns.html#unicode-syntax -@package base-unicode-symbols -@version 0.2.1.5 - - -module Data.Ord.Unicode - --- | (≤) = (<=) --- --- U+2264, LESS-THAN OR EQUAL TO -(≤) :: Ord α => α -> α -> Bool - --- | (≥) = (>=) --- --- U+2265, GREATER-THAN OR EQUAL TO -(≥) :: Ord α => α -> α -> Bool - --- | (≮) = (>=) --- --- U+226E, NOT LESS-THAN -(≮) :: Ord α => α -> α -> Bool - --- | (≯) = (<=) --- --- U+226F, NOT GREATER-THAN -(≯) :: Ord α => α -> α -> Bool - - -module Data.Monoid.Unicode - --- | (∅) = mempty --- --- U+2205, EMPTY SET -(∅) :: Monoid α => α - --- | (⊕) = mappend --- --- U+2295, CIRCLED PLUS -(⊕) :: Monoid α => α -> α -> α - - -module Data.List.Unicode - --- | (⧺) = (++) --- --- U+29FA, DOUBLE PLUS -(⧺) :: [α] -> [α] -> [α] - --- | (∈) = elem --- --- U+2208, ELEMENT OF -(∈) :: Eq α => α -> [α] -> Bool - --- | (∋) = flip (∈) --- --- U+220B, CONTAINS AS MEMBER -(∋) :: Eq α => [α] -> α -> Bool - --- | (∉) = notElem --- --- U+2209, NOT AN ELEMENT OF -(∉) :: Eq α => α -> [α] -> Bool - --- | (∌) = flip (∉) --- --- U+220C, DOES NOT CONTAIN AS MEMBER -(∌) :: Eq α => [α] -> α -> Bool - --- | (∪) = union --- --- U+222A, UNION -(∪) :: Eq α => [α] -> [α] -> [α] - --- | (∖) = (\\) --- --- U+2216, SET MINUS -(∖) :: Eq α => [α] -> [α] -> [α] - --- | Symmetric difference --- --- a ∆ b = (a ∖ b) ∪ (b ∖ a) --- --- U+2206, INCREMENT -(∆) :: Eq α => [α] -> [α] -> [α] - --- | (∩) = intersect --- --- U+2229, INTERSECTION -(∩) :: Eq α => [α] -> [α] -> [α] - - -module Data.Function.Unicode - --- | (∘) = (.) --- --- U+2218, RING OPERATOR -(∘) :: (β -> γ) -> (α -> β) -> (α -> γ) - - -module Data.Foldable.Unicode - --- | (∈) = elem --- --- U+2208, ELEMENT OF -(∈) :: (Foldable t, Eq α) => α -> t α -> Bool - --- | (∋) = flip (∈) --- --- U+220B, CONTAINS AS MEMBER -(∋) :: (Foldable t, Eq α) => t α -> α -> Bool - --- | (∉) = notElem --- --- U+2209, NOT AN ELEMENT OF -(∉) :: (Foldable t, Eq α) => α -> t α -> Bool - --- | (∌) = flip (∉) --- --- U+220C, DOES NOT CONTAIN AS MEMBER -(∌) :: (Foldable t, Eq α) => t α -> α -> Bool - - -module Data.Eq.Unicode - --- | (≡) = (==) --- --- U+2261, IDENTICAL TO -(≡) :: Eq α => α -> α -> Bool - --- | (≢) = (/=) --- --- U+2262, NOT IDENTICAL TO -(≢) :: Eq α => α -> α -> Bool - --- | (≠) = (/=) --- --- U+2260, NOT EQUAL TO -(≠) :: Eq α => α -> α -> Bool - - -module Data.Bool.Unicode - --- | (∧) = (&&) --- --- U+2227, LOGICAL AND -(∧) :: Bool -> Bool -> Bool - --- | (∨) = (||) --- --- U+2228, LOGICAL OR -(∨) :: Bool -> Bool -> Bool - --- | (¬) = not --- --- U+00AC, NOT SIGN -(¬) :: Bool -> Bool - - -module Prelude.Unicode - --- | (¬) = not --- --- U+00AC, NOT SIGN -(¬) :: Bool -> Bool - --- | (∧) = (&&) --- --- U+2227, LOGICAL AND -(∧) :: Bool -> Bool -> Bool - --- | (∨) = (||) --- --- U+2228, LOGICAL OR -(∨) :: Bool -> Bool -> Bool - --- | (≡) = (==) --- --- U+2261, IDENTICAL TO -(≡) :: Eq α => α -> α -> Bool - --- | (≢) = (/=) --- --- U+2262, NOT IDENTICAL TO -(≢) :: Eq α => α -> α -> Bool - --- | (≠) = (/=) --- --- U+2260, NOT EQUAL TO -(≠) :: Eq α => α -> α -> Bool - --- | (≤) = (<=) --- --- U+2264, LESS-THAN OR EQUAL TO -(≤) :: Ord α => α -> α -> Bool - --- | (≥) = (>=) --- --- U+2265, GREATER-THAN OR EQUAL TO -(≥) :: Ord α => α -> α -> Bool - --- | (≮) = (>=) --- --- U+226E, NOT LESS-THAN -(≮) :: Ord α => α -> α -> Bool - --- | (≯) = (<=) --- --- U+226F, NOT GREATER-THAN -(≯) :: Ord α => α -> α -> Bool - --- | π = pi --- --- U+03C0, GREEK SMALL LETTER PI -π :: Floating α => α - --- | (÷) = (/) --- --- U+00F7, DIVISION SIGN -(÷) :: Fractional α => α -> α -> α - --- | (⋅) = (*) --- --- U+22C5, DOT OPERATOR -(⋅) :: Num α => α -> α -> α - --- | (∘) = (.) --- --- U+2218, RING OPERATOR -(∘) :: (β -> γ) -> (α -> β) -> (α -> γ) - --- | (⧺) = (++) --- --- U+29FA, DOUBLE PLUS -(⧺) :: [α] -> [α] -> [α] - --- | (∈) = elem --- --- U+2208, ELEMENT OF -(∈) :: Eq α => α -> [α] -> Bool - --- | (∉) = notElem --- --- U+2209, NOT AN ELEMENT OF -(∉) :: Eq α => α -> [α] -> Bool - --- | (⊥) = undefined --- --- U+22A5, UP TACK -(⊥) :: α - - -module Control.Monad.Unicode - --- | (≫=) = (>>=) --- --- (U+226B, MUCH GREATER-THAN) + (U+3D, EQUALS SIGN) -(≫=) :: Monad m => m α -> (α -> m β) -> m β - --- | (≫) = (>>) --- --- U+226B, MUCH GREATER-THAN -(≫) :: Monad m => m α -> m β -> m β - --- | (=≪) = (=<<) --- --- (U+3D, EQUALS SIGN) + (U+226A, MUCH LESS-THAN) -(=≪) :: Monad m => (α -> m β) -> m α -> m β - - -module Control.Applicative.Unicode - --- | (⊛) = <*> --- --- U+229B, CIRCLED ASTERISK OPERATOR -(⊛) :: Applicative f => f (α -> β) -> f α -> f β - --- | (∅) = empty --- --- U+2205, EMPTY SET -(∅) :: Alternative f => f α - - -module Control.Category.Unicode - --- | (∘) = (.) --- --- U+2218, RING OPERATOR -(∘) :: Category ⇝ => (β ⇝ γ) -> (α ⇝ β) -> (α ⇝ γ) - --- | (⋙) = (>>>) --- --- U+22D9, VERY MUCH GREATER-THAN -(⋙) :: Category ⇝ => (α ⇝ β) -> (β ⇝ γ) -> (α ⇝ γ) - --- | (⋘) = (<<<) --- --- U+22D8, VERY MUCH LESS-THAN -(⋘) :: Category ⇝ => (β ⇝ γ) -> (α ⇝ β) -> (α ⇝ γ) - - -module Control.Arrow.Unicode - --- | (⋙) = (>>>) --- --- U+22D9, VERY MUCH GREATER-THAN -(⋙) :: Category ⇝ => (α ⇝ β) -> (β ⇝ γ) -> (α ⇝ γ) - --- | (⋘) = (<<<) --- --- U+22D8, VERY MUCH LESS-THAN -(⋘) :: Category ⇝ => (β ⇝ γ) -> (α ⇝ β) -> (α ⇝ γ) - --- | (⁂) = (***) --- --- U+2042, ASTERISM -(⁂) :: Arrow ⇝ => (α ⇝ β) -> (α' ⇝ β') -> (α, α') ⇝ (β, β') - --- | (⧻) = (+++) --- --- U+29FB, TRIPLE PLUS -(⧻) :: ArrowChoice ⇝ => (α ⇝ β) -> (α' ⇝ β') -> (Either α α' ⇝ Either β β') - --- | (⫴) = (|||) --- --- U+2AF4, TRIPLE VERTICAL BAR BINARY RELATION -(⫴) :: ArrowChoice ⇝ => (α ⇝ δ) -> (β ⇝ δ) -> (Either α β ⇝ δ) diff --git a/data/containers.txt b/data/containers.txt deleted file mode 100644 --- a/data/containers.txt +++ /dev/null @@ -1,2909 +0,0 @@ --- Hoogle documentation, generated by Haddock --- See Hoogle, http://www.haskell.org/hoogle/ - - --- | Assorted concrete container types --- --- This package contains efficient general-purpose implementations of --- various basic immutable container types. The declared cost of each --- operation is either worst-case or amortized, but remains valid even if --- structures are shared. -@package containers -@version 0.4.0.0 - - --- | An efficient implementation of sets. --- --- Since many function names (but not the type name) clash with --- Prelude names, this module is usually imported --- qualified, e.g. --- --- 
---   import Data.Set (Set)
---   import qualified Data.Set as Set
---
--- --- The implementation of Set is based on size balanced --- binary trees (or trees of bounded balance) as described by: --- --- --- --- Note that the implementation is left-biased -- the elements of --- a first argument are always preferred to the second, for example in --- union or insert. Of course, left-biasing can only be --- observed when equality is an equivalence relation instead of --- structural equality. -module Data.Set - --- | A set of values a. -data Set a - --- | O(n+m). See difference. -(\\) :: Ord a => Set a -> Set a -> Set a - --- | O(1). Is this the empty set? -null :: Set a -> Bool - --- | O(1). The number of elements in the set. -size :: Set a -> Int - --- | O(log n). Is the element in the set? -member :: Ord a => a -> Set a -> Bool - --- | O(log n). Is the element not in the set? -notMember :: Ord a => a -> Set a -> Bool - --- | O(n+m). Is this a subset? (s1 isSubsetOf s2) --- tells whether s1 is a subset of s2. -isSubsetOf :: Ord a => Set a -> Set a -> Bool - --- | O(n+m). Is this a proper subset? (ie. a subset but not equal). -isProperSubsetOf :: Ord a => Set a -> Set a -> Bool - --- | O(1). The empty set. -empty :: Set a - --- | O(1). Create a singleton set. -singleton :: a -> Set a - --- | O(log n). Insert an element in a set. If the set already --- contains an element equal to the given value, it is replaced with the --- new value. -insert :: Ord a => a -> Set a -> Set a - --- | O(log n). Delete an element from a set. -delete :: Ord a => a -> Set a -> Set a - --- | O(n+m). The union of two sets, preferring the first set when --- equal elements are encountered. The implementation uses the efficient --- hedge-union algorithm. Hedge-union is more efficient on (bigset --- union smallset). -union :: Ord a => Set a -> Set a -> Set a - --- | The union of a list of sets: (unions == foldl --- union empty). -unions :: Ord a => [Set a] -> Set a - --- | O(n+m). Difference of two sets. The implementation uses an --- efficient hedge algorithm comparable with hedge-union. -difference :: Ord a => Set a -> Set a -> Set a - --- | O(n+m). The intersection of two sets. Elements of the result --- come from the first set, so for example --- --- 
---   import qualified Data.Set as S
---   data AB = A | B deriving Show
---   instance Ord AB where compare _ _ = EQ
---   instance Eq AB where _ == _ = True
---   main = print (S.singleton A `S.intersection` S.singleton B,
---                 S.singleton B `S.intersection` S.singleton A)
---
--- --- prints (fromList [A],fromList [B]). -intersection :: Ord a => Set a -> Set a -> Set a - --- | O(n). Filter all elements that satisfy the predicate. -filter :: Ord a => (a -> Bool) -> Set a -> Set a - --- | O(n). Partition the set into two sets, one with all elements --- that satisfy the predicate and one with all elements that don't --- satisfy the predicate. See also split. -partition :: Ord a => (a -> Bool) -> Set a -> (Set a, Set a) - --- | O(log n). The expression (split x set) is a --- pair (set1,set2) where set1 comprises the elements --- of set less than x and set2 comprises the --- elements of set greater than x. -split :: Ord a => a -> Set a -> (Set a, Set a) - --- | O(log n). Performs a split but also returns whether the --- pivot element was found in the original set. -splitMember :: Ord a => a -> Set a -> (Set a, Bool, Set a) - --- | O(n*log n). map f s is the set obtained by --- applying f to each element of s. --- --- It's worth noting that the size of the result may be smaller if, for --- some (x,y), x /= y && f x == f y -map :: (Ord a, Ord b) => (a -> b) -> Set a -> Set b - --- | O(n). The --- --- mapMonotonic f s == map f s, but works only --- when f is monotonic. The precondition is not checked. --- Semi-formally, we have: --- --- 
---   and [x < y ==> f x < f y | x <- ls, y <- ls] 
---                       ==> mapMonotonic f s == map f s
---       where ls = toList s
---
-mapMonotonic :: (a -> b) -> Set a -> Set b - --- | O(n). Fold over the elements of a set in an unspecified order. -fold :: (a -> b -> b) -> b -> Set a -> b - --- | O(log n). The minimal element of a set. -findMin :: Set a -> a - --- | O(log n). The maximal element of a set. -findMax :: Set a -> a - --- | O(log n). Delete the minimal element. -deleteMin :: Set a -> Set a - --- | O(log n). Delete the maximal element. -deleteMax :: Set a -> Set a - --- | O(log n). Delete and find the minimal element. --- --- 
---   deleteFindMin set = (findMin set, deleteMin set)
---
-deleteFindMin :: Set a -> (a, Set a) - --- | O(log n). Delete and find the maximal element. --- --- 
---   deleteFindMax set = (findMax set, deleteMax set)
---
-deleteFindMax :: Set a -> (a, Set a) - --- | O(log n). Retrieves the maximal key of the set, and the set --- stripped of that element, or Nothing if passed an empty set. -maxView :: Set a -> Maybe (a, Set a) - --- | O(log n). Retrieves the minimal key of the set, and the set --- stripped of that element, or Nothing if passed an empty set. -minView :: Set a -> Maybe (a, Set a) - --- | O(n). The elements of a set. -elems :: Set a -> [a] - --- | O(n). Convert the set to a list of elements. -toList :: Set a -> [a] - --- | O(n*log n). Create a set from a list of elements. -fromList :: Ord a => [a] -> Set a - --- | O(n). Convert the set to an ascending list of elements. -toAscList :: Set a -> [a] - --- | O(n). Build a set from an ascending list in linear time. The --- precondition (input list is ascending) is not checked. -fromAscList :: Eq a => [a] -> Set a - --- | O(n). Build a set from an ascending list of distinct elements --- in linear time. The precondition (input list is strictly ascending) --- is not checked. -fromDistinctAscList :: [a] -> Set a - --- | O(n). Show the tree that implements the set. The tree is shown --- in a compressed, hanging format. -showTree :: Show a => Set a -> String - --- | O(n). The expression (showTreeWith hang wide map) --- shows the tree that implements the set. If hang is --- True, a hanging tree is shown otherwise a rotated tree --- is shown. If wide is True, an extra wide version is --- shown. --- --- 
---   Set> putStrLn $ showTreeWith True False $ fromDistinctAscList [1..5]
---   4
---   +--2
---   |  +--1
---   |  +--3
---   +--5
---   
---   Set> putStrLn $ showTreeWith True True $ fromDistinctAscList [1..5]
---   4
---   |
---   +--2
---   |  |
---   |  +--1
---   |  |
---   |  +--3
---   |
---   +--5
---   
---   Set> putStrLn $ showTreeWith False True $ fromDistinctAscList [1..5]
---   +--5
---   |
---   4
---   |
---   |  +--3
---   |  |
---   +--2
---      |
---      +--1
---
-showTreeWith :: Show a => Bool -> Bool -> Set a -> String - --- | O(n). Test if the internal set structure is valid. -valid :: Ord a => Set a -> Bool -instance Typeable1 Set -instance (Read a, Ord a) => Read (Set a) -instance Show a => Show (Set a) -instance Ord a => Ord (Set a) -instance Eq a => Eq (Set a) -instance (Data a, Ord a) => Data (Set a) -instance Foldable Set -instance Ord a => Monoid (Set a) - - --- | An efficient implementation of maps from keys to values --- (dictionaries). --- --- Since many function names (but not the type name) clash with --- Prelude names, this module is usually imported --- qualified, e.g. --- --- 
---   import Data.Map (Map)
---   import qualified Data.Map as Map
---
--- --- The implementation of Map is based on size balanced --- binary trees (or trees of bounded balance) as described by: --- --- --- --- Note that the implementation is left-biased -- the elements of --- a first argument are always preferred to the second, for example in --- union or insert. --- --- Operation comments contain the operation time complexity in the Big-O --- notation http://en.wikipedia.org/wiki/Big_O_notation. -module Data.Map - --- | A Map from keys k to values a. -data Map k a - --- | O(log n). Find the value at a key. Calls error when the --- element can not be found. --- --- 
---   fromList [(5,'a'), (3,'b')] ! 1    Error: element not in the map
---   fromList [(5,'a'), (3,'b')] ! 5 == 'a'
---
-(!) :: Ord k => Map k a -> k -> a - --- | Same as difference. -(\\) :: Ord k => Map k a -> Map k b -> Map k a - --- | O(1). Is the map empty? --- --- 
---   Data.Map.null (empty)           == True
---   Data.Map.null (singleton 1 'a') == False
---
-null :: Map k a -> Bool - --- | O(1). The number of elements in the map. --- --- 
---   size empty                                   == 0
---   size (singleton 1 'a')                       == 1
---   size (fromList([(1,'a'), (2,'c'), (3,'b')])) == 3
---
-size :: Map k a -> Int - --- | O(log n). Is the key a member of the map? See also --- notMember. --- --- 
---   member 5 (fromList [(5,'a'), (3,'b')]) == True
---   member 1 (fromList [(5,'a'), (3,'b')]) == False
---
-member :: Ord k => k -> Map k a -> Bool - --- | O(log n). Is the key not a member of the map? See also --- member. --- --- 
---   notMember 5 (fromList [(5,'a'), (3,'b')]) == False
---   notMember 1 (fromList [(5,'a'), (3,'b')]) == True
---
-notMember :: Ord k => k -> Map k a -> Bool - --- | O(log n). Lookup the value at a key in the map. --- --- The function will return the corresponding value as (Just --- value), or Nothing if the key isn't in the map. --- --- An example of using lookup: --- --- 
---   import Prelude hiding (lookup)
---   import Data.Map
---   
---   employeeDept = fromList([("John","Sales"), ("Bob","IT")])
---   deptCountry = fromList([("IT","USA"), ("Sales","France")])
---   countryCurrency = fromList([("USA", "Dollar"), ("France", "Euro")])
---   
---   employeeCurrency :: String -> Maybe String
---   employeeCurrency name = do
---       dept <- lookup name employeeDept
---       country <- lookup dept deptCountry
---       lookup country countryCurrency
---   
---   main = do
---       putStrLn $ "John's currency: " ++ (show (employeeCurrency "John"))
---       putStrLn $ "Pete's currency: " ++ (show (employeeCurrency "Pete"))
---
--- --- The output of this program: --- --- 
---   John's currency: Just "Euro"
---   Pete's currency: Nothing
---
-lookup :: Ord k => k -> Map k a -> Maybe a - --- | O(log n). The expression (findWithDefault def k --- map) returns the value at key k or returns default value --- def when the key is not in the map. --- --- 
---   findWithDefault 'x' 1 (fromList [(5,'a'), (3,'b')]) == 'x'
---   findWithDefault 'x' 5 (fromList [(5,'a'), (3,'b')]) == 'a'
---
-findWithDefault :: Ord k => a -> k -> Map k a -> a - --- | O(1). The empty map. --- --- 
---   empty      == fromList []
---   size empty == 0
---
-empty :: Map k a - --- | O(1). A map with a single element. --- --- 
---   singleton 1 'a'        == fromList [(1, 'a')]
---   size (singleton 1 'a') == 1
---
-singleton :: k -> a -> Map k a - --- | O(log n). Insert a new key and value in the map. If the key is --- already present in the map, the associated value is replaced with the --- supplied value. insert is equivalent to insertWith --- const. --- --- 
---   insert 5 'x' (fromList [(5,'a'), (3,'b')]) == fromList [(3, 'b'), (5, 'x')]
---   insert 7 'x' (fromList [(5,'a'), (3,'b')]) == fromList [(3, 'b'), (5, 'a'), (7, 'x')]
---   insert 5 'x' empty                         == singleton 5 'x'
---
-insert :: Ord k => k -> a -> Map k a -> Map k a - --- | O(log n). Insert with a function, combining new value and old --- value. insertWith f key value mp will insert the pair --- (key, value) into mp if key does not exist in the map. If the --- key does exist, the function will insert the pair (key, f --- new_value old_value). --- --- 
---   insertWith (++) 5 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "xxxa")]
---   insertWith (++) 7 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a"), (7, "xxx")]
---   insertWith (++) 5 "xxx" empty                         == singleton 5 "xxx"
---
-insertWith :: Ord k => (a -> a -> a) -> k -> a -> Map k a -> Map k a - --- | Same as insertWith, but the combining function is applied --- strictly. This is often the most desirable behavior. --- --- For example, to update a counter: --- --- 
---   insertWith' (+) k 1 m
---
-insertWith' :: Ord k => (a -> a -> a) -> k -> a -> Map k a -> Map k a - --- | O(log n). Insert with a function, combining key, new value and --- old value. insertWithKey f key value mp will insert --- the pair (key, value) into mp if key does not exist in the --- map. If the key does exist, the function will insert the pair --- (key,f key new_value old_value). Note that the key passed to --- f is the same key passed to insertWithKey. --- --- 
---   let f key new_value old_value = (show key) ++ ":" ++ new_value ++ "|" ++ old_value
---   insertWithKey f 5 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "5:xxx|a")]
---   insertWithKey f 7 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a"), (7, "xxx")]
---   insertWithKey f 5 "xxx" empty                         == singleton 5 "xxx"
---
-insertWithKey :: Ord k => (k -> a -> a -> a) -> k -> a -> Map k a -> Map k a - --- | Same as insertWithKey, but the combining function is applied --- strictly. -insertWithKey' :: Ord k => (k -> a -> a -> a) -> k -> a -> Map k a -> Map k a - --- | O(log n). Combines insert operation with old value retrieval. --- The expression (insertLookupWithKey f k x map) is a --- pair where the first element is equal to (lookup k --- map) and the second element equal to (insertWithKey f --- k x map). --- --- 
---   let f key new_value old_value = (show key) ++ ":" ++ new_value ++ "|" ++ old_value
---   insertLookupWithKey f 5 "xxx" (fromList [(5,"a"), (3,"b")]) == (Just "a", fromList [(3, "b"), (5, "5:xxx|a")])
---   insertLookupWithKey f 7 "xxx" (fromList [(5,"a"), (3,"b")]) == (Nothing,  fromList [(3, "b"), (5, "a"), (7, "xxx")])
---   insertLookupWithKey f 5 "xxx" empty                         == (Nothing,  singleton 5 "xxx")
---
--- --- This is how to define insertLookup using --- insertLookupWithKey: --- --- 
---   let insertLookup kx x t = insertLookupWithKey (\_ a _ -> a) kx x t
---   insertLookup 5 "x" (fromList [(5,"a"), (3,"b")]) == (Just "a", fromList [(3, "b"), (5, "x")])
---   insertLookup 7 "x" (fromList [(5,"a"), (3,"b")]) == (Nothing,  fromList [(3, "b"), (5, "a"), (7, "x")])
---
-insertLookupWithKey :: Ord k => (k -> a -> a -> a) -> k -> a -> Map k a -> (Maybe a, Map k a) - --- | O(log n). A strict version of insertLookupWithKey. -insertLookupWithKey' :: Ord k => (k -> a -> a -> a) -> k -> a -> Map k a -> (Maybe a, Map k a) - --- | O(log n). Delete a key and its value from the map. When the key --- is not a member of the map, the original map is returned. --- --- 
---   delete 5 (fromList [(5,"a"), (3,"b")]) == singleton 3 "b"
---   delete 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")]
---   delete 5 empty                         == empty
---
-delete :: Ord k => k -> Map k a -> Map k a - --- | O(log n). Update a value at a specific key with the result of --- the provided function. When the key is not a member of the map, the --- original map is returned. --- --- 
---   adjust ("new " ++) 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "new a")]
---   adjust ("new " ++) 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")]
---   adjust ("new " ++) 7 empty                         == empty
---
-adjust :: Ord k => (a -> a) -> k -> Map k a -> Map k a - --- | O(log n). Adjust a value at a specific key. When the key is not --- a member of the map, the original map is returned. --- --- 
---   let f key x = (show key) ++ ":new " ++ x
---   adjustWithKey f 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "5:new a")]
---   adjustWithKey f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")]
---   adjustWithKey f 7 empty                         == empty
---
-adjustWithKey :: Ord k => (k -> a -> a) -> k -> Map k a -> Map k a - --- | O(log n). The expression (update f k map) --- updates the value x at k (if it is in the map). If --- (f x) is Nothing, the element is deleted. If it is --- (Just y), the key k is bound to the new value --- y. --- --- 
---   let f x = if x == "a" then Just "new a" else Nothing
---   update f 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "new a")]
---   update f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")]
---   update f 3 (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"
---
-update :: Ord k => (a -> Maybe a) -> k -> Map k a -> Map k a - --- | O(log n). The expression (updateWithKey f k --- map) updates the value x at k (if it is in the --- map). If (f k x) is Nothing, the element is deleted. --- If it is (Just y), the key k is bound to the --- new value y. --- --- 
---   let f k x = if x == "a" then Just ((show k) ++ ":new a") else Nothing
---   updateWithKey f 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "5:new a")]
---   updateWithKey f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")]
---   updateWithKey f 3 (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"
---
-updateWithKey :: Ord k => (k -> a -> Maybe a) -> k -> Map k a -> Map k a - --- | O(log n). Lookup and update. See also updateWithKey. The --- function returns changed value, if it is updated. Returns the original --- key value if the map entry is deleted. --- --- 
---   let f k x = if x == "a" then Just ((show k) ++ ":new a") else Nothing
---   updateLookupWithKey f 5 (fromList [(5,"a"), (3,"b")]) == (Just "5:new a", fromList [(3, "b"), (5, "5:new a")])
---   updateLookupWithKey f 7 (fromList [(5,"a"), (3,"b")]) == (Nothing,  fromList [(3, "b"), (5, "a")])
---   updateLookupWithKey f 3 (fromList [(5,"a"), (3,"b")]) == (Just "b", singleton 5 "a")
---
-updateLookupWithKey :: Ord k => (k -> a -> Maybe a) -> k -> Map k a -> (Maybe a, Map k a) - --- | O(log n). The expression (alter f k map) alters --- the value x at k, or absence thereof. alter --- can be used to insert, delete, or update a value in a Map. In --- short : lookup k (alter f k m) = f (lookup k --- m). --- --- 
---   let f _ = Nothing
---   alter f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")]
---   alter f 5 (fromList [(5,"a"), (3,"b")]) == singleton 3 "b"
---   
---   let f _ = Just "c"
---   alter f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a"), (7, "c")]
---   alter f 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "c")]
---
-alter :: Ord k => (Maybe a -> Maybe a) -> k -> Map k a -> Map k a - --- | O(n+m). The expression (union t1 t2) takes the --- left-biased union of t1 and t2. It prefers --- t1 when duplicate keys are encountered, i.e. --- (union == unionWith const). The --- implementation uses the efficient hedge-union algorithm. --- Hedge-union is more efficient on (bigset `union` smallset). --- --- 
---   union (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == fromList [(3, "b"), (5, "a"), (7, "C")]
---
-union :: Ord k => Map k a -> Map k a -> Map k a - --- | O(n+m). Union with a combining function. The implementation --- uses the efficient hedge-union algorithm. --- --- 
---   unionWith (++) (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == fromList [(3, "b"), (5, "aA"), (7, "C")]
---
-unionWith :: Ord k => (a -> a -> a) -> Map k a -> Map k a -> Map k a - --- | O(n+m). Union with a combining function. The implementation --- uses the efficient hedge-union algorithm. Hedge-union is more --- efficient on (bigset `union` smallset). --- --- 
---   let f key left_value right_value = (show key) ++ ":" ++ left_value ++ "|" ++ right_value
---   unionWithKey f (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == fromList [(3, "b"), (5, "5:a|A"), (7, "C")]
---
-unionWithKey :: Ord k => (k -> a -> a -> a) -> Map k a -> Map k a -> Map k a - --- | The union of a list of maps: (unions == foldl --- union empty). --- --- 
---   unions [(fromList [(5, "a"), (3, "b")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "A3"), (3, "B3")])]
---       == fromList [(3, "b"), (5, "a"), (7, "C")]
---   unions [(fromList [(5, "A3"), (3, "B3")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "a"), (3, "b")])]
---       == fromList [(3, "B3"), (5, "A3"), (7, "C")]
---
-unions :: Ord k => [Map k a] -> Map k a - --- | The union of a list of maps, with a combining operation: --- (unionsWith f == foldl (unionWith f) --- empty). --- --- 
---   unionsWith (++) [(fromList [(5, "a"), (3, "b")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "A3"), (3, "B3")])]
---       == fromList [(3, "bB3"), (5, "aAA3"), (7, "C")]
---
-unionsWith :: Ord k => (a -> a -> a) -> [Map k a] -> Map k a - --- | O(n+m). Difference of two maps. Return elements of the first --- map not existing in the second map. The implementation uses an --- efficient hedge algorithm comparable with hedge-union. --- --- 
---   difference (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == singleton 3 "b"
---
-difference :: Ord k => Map k a -> Map k b -> Map k a - --- | O(n+m). Difference with a combining function. When two equal --- keys are encountered, the combining function is applied to the values --- of these keys. If it returns Nothing, the element is discarded --- (proper set difference). If it returns (Just y), the --- element is updated with a new value y. The implementation --- uses an efficient hedge algorithm comparable with --- hedge-union. --- --- 
---   let f al ar = if al == "b" then Just (al ++ ":" ++ ar) else Nothing
---   differenceWith f (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (3, "B"), (7, "C")])
---       == singleton 3 "b:B"
---
-differenceWith :: Ord k => (a -> b -> Maybe a) -> Map k a -> Map k b -> Map k a - --- | O(n+m). Difference with a combining function. When two equal --- keys are encountered, the combining function is applied to the key and --- both values. If it returns Nothing, the element is discarded --- (proper set difference). If it returns (Just y), the --- element is updated with a new value y. The implementation --- uses an efficient hedge algorithm comparable with --- hedge-union. --- --- 
---   let f k al ar = if al == "b" then Just ((show k) ++ ":" ++ al ++ "|" ++ ar) else Nothing
---   differenceWithKey f (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (3, "B"), (10, "C")])
---       == singleton 3 "3:b|B"
---
-differenceWithKey :: Ord k => (k -> a -> b -> Maybe a) -> Map k a -> Map k b -> Map k a - --- | O(n+m). Intersection of two maps. Return data in the first map --- for the keys existing in both maps. (intersection m1 m2 == --- intersectionWith const m1 m2). --- --- 
---   intersection (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == singleton 5 "a"
---
-intersection :: Ord k => Map k a -> Map k b -> Map k a - --- | O(n+m). Intersection with a combining function. --- --- 
---   intersectionWith (++) (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == singleton 5 "aA"
---
-intersectionWith :: Ord k => (a -> b -> c) -> Map k a -> Map k b -> Map k c - --- | O(n+m). Intersection with a combining function. Intersection is --- more efficient on (bigset `intersection` smallset). --- --- 
---   let f k al ar = (show k) ++ ":" ++ al ++ "|" ++ ar
---   intersectionWithKey f (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == singleton 5 "5:a|A"
---
-intersectionWithKey :: Ord k => (k -> a -> b -> c) -> Map k a -> Map k b -> Map k c - --- | O(n). Map a function over all values in the map. --- --- 
---   map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]
---
-map :: (a -> b) -> Map k a -> Map k b - --- | O(n). Map a function over all values in the map. --- --- 
---   let f key x = (show key) ++ ":" ++ x
---   mapWithKey f (fromList [(5,"a"), (3,"b")]) == fromList [(3, "3:b"), (5, "5:a")]
---
-mapWithKey :: (k -> a -> b) -> Map k a -> Map k b - --- | O(n). The function mapAccum threads an accumulating --- argument through the map in ascending order of keys. --- --- 
---   let f a b = (a ++ b, b ++ "X")
---   mapAccum f "Everything: " (fromList [(5,"a"), (3,"b")]) == ("Everything: ba", fromList [(3, "bX"), (5, "aX")])
---
-mapAccum :: (a -> b -> (a, c)) -> a -> Map k b -> (a, Map k c) - --- | O(n). The function mapAccumWithKey threads an --- accumulating argument through the map in ascending order of keys. --- --- 
---   let f a k b = (a ++ " " ++ (show k) ++ "-" ++ b, b ++ "X")
---   mapAccumWithKey f "Everything:" (fromList [(5,"a"), (3,"b")]) == ("Everything: 3-b 5-a", fromList [(3, "bX"), (5, "aX")])
---
-mapAccumWithKey :: (a -> k -> b -> (a, c)) -> a -> Map k b -> (a, Map k c) - --- | O(n). The function mapAccumR threads an accumulating --- argument through the map in descending order of keys. -mapAccumRWithKey :: (a -> k -> b -> (a, c)) -> a -> Map k b -> (a, Map k c) - --- | O(n*log n). mapKeys f s is the map obtained by --- applying f to each key of s. --- --- The size of the result may be smaller if f maps two or more --- distinct keys to the same new key. In this case the value at the --- smallest of these keys is retained. --- --- 
---   mapKeys (+ 1) (fromList [(5,"a"), (3,"b")])                        == fromList [(4, "b"), (6, "a")]
---   mapKeys (\ _ -> 1) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")]) == singleton 1 "c"
---   mapKeys (\ _ -> 3) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")]) == singleton 3 "c"
---
-mapKeys :: Ord k2 => (k1 -> k2) -> Map k1 a -> Map k2 a - --- | O(n*log n). mapKeysWith c f s is the map --- obtained by applying f to each key of s. --- --- The size of the result may be smaller if f maps two or more --- distinct keys to the same new key. In this case the associated values --- will be combined using c. --- --- 
---   mapKeysWith (++) (\ _ -> 1) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")]) == singleton 1 "cdab"
---   mapKeysWith (++) (\ _ -> 3) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")]) == singleton 3 "cdab"
---
-mapKeysWith :: Ord k2 => (a -> a -> a) -> (k1 -> k2) -> Map k1 a -> Map k2 a - --- | O(n). mapKeysMonotonic f s == mapKeys f --- s, but works only when f is strictly monotonic. That is, --- for any values x and y, if x < --- y then f x < f y. The precondition is --- not checked. Semi-formally, we have: --- --- 
---   and [x < y ==> f x < f y | x <- ls, y <- ls] 
---                       ==> mapKeysMonotonic f s == mapKeys f s
---       where ls = keys s
---
--- --- This means that f maps distinct original keys to distinct --- resulting keys. This function has better performance than --- mapKeys. --- --- 
---   mapKeysMonotonic (\ k -> k * 2) (fromList [(5,"a"), (3,"b")]) == fromList [(6, "b"), (10, "a")]
---   valid (mapKeysMonotonic (\ k -> k * 2) (fromList [(5,"a"), (3,"b")])) == True
---   valid (mapKeysMonotonic (\ _ -> 1)     (fromList [(5,"a"), (3,"b")])) == False
---
-mapKeysMonotonic :: (k1 -> k2) -> Map k1 a -> Map k2 a - --- | O(n). Fold the values in the map, such that fold f z --- == foldr f z . elems. For example, --- --- 
---   elems map = fold (:) [] map
---
--- --- 
---   let f a len = len + (length a)
---   fold f 0 (fromList [(5,"a"), (3,"bbb")]) == 4
---
-fold :: (a -> b -> b) -> b -> Map k a -> b - --- | O(n). Fold the keys and values in the map, such that --- foldWithKey f z == foldr (uncurry f) z . --- toAscList. For example, --- --- 
---   keys map = foldWithKey (\k x ks -> k:ks) [] map
---
--- --- 
---   let f k a result = result ++ "(" ++ (show k) ++ ":" ++ a ++ ")"
---   foldWithKey f "Map: " (fromList [(5,"a"), (3,"b")]) == "Map: (5:a)(3:b)"
---
--- --- This is identical to foldrWithKey, and you should use that one --- instead of this one. This name is kept for backward compatibility. -foldWithKey :: (k -> a -> b -> b) -> b -> Map k a -> b - --- | O(n). Post-order fold. The function will be applied from the --- lowest value to the highest. -foldrWithKey :: (k -> a -> b -> b) -> b -> Map k a -> b - --- | O(n). Pre-order fold. The function will be applied from the --- highest value to the lowest. -foldlWithKey :: (b -> k -> a -> b) -> b -> Map k a -> b - --- | O(n). Return all elements of the map in the ascending order of --- their keys. --- --- 
---   elems (fromList [(5,"a"), (3,"b")]) == ["b","a"]
---   elems empty == []
---
-elems :: Map k a -> [a] - --- | O(n). Return all keys of the map in ascending order. --- --- 
---   keys (fromList [(5,"a"), (3,"b")]) == [3,5]
---   keys empty == []
---
-keys :: Map k a -> [k] - --- | O(n). The set of all keys of the map. --- --- 
---   keysSet (fromList [(5,"a"), (3,"b")]) == Data.Set.fromList [3,5]
---   keysSet empty == Data.Set.empty
---
-keysSet :: Map k a -> Set k - --- | O(n). Return all key/value pairs in the map in ascending key --- order. --- --- 
---   assocs (fromList [(5,"a"), (3,"b")]) == [(3,"b"), (5,"a")]
---   assocs empty == []
---
-assocs :: Map k a -> [(k, a)] - --- | O(n). Convert to a list of key/value pairs. --- --- 
---   toList (fromList [(5,"a"), (3,"b")]) == [(3,"b"), (5,"a")]
---   toList empty == []
---
-toList :: Map k a -> [(k, a)] - --- | O(n*log n). Build a map from a list of key/value pairs. See --- also fromAscList. If the list contains more than one value for --- the same key, the last value for the key is retained. --- --- 
---   fromList [] == empty
---   fromList [(5,"a"), (3,"b"), (5, "c")] == fromList [(5,"c"), (3,"b")]
---   fromList [(5,"c"), (3,"b"), (5, "a")] == fromList [(5,"a"), (3,"b")]
---
-fromList :: Ord k => [(k, a)] -> Map k a - --- | O(n*log n). Build a map from a list of key/value pairs with a --- combining function. See also fromAscListWith. --- --- 
---   fromListWith (++) [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"a")] == fromList [(3, "ab"), (5, "aba")]
---   fromListWith (++) [] == empty
---
-fromListWith :: Ord k => (a -> a -> a) -> [(k, a)] -> Map k a - --- | O(n*log n). Build a map from a list of key/value pairs with a --- combining function. See also fromAscListWithKey. --- --- 
---   let f k a1 a2 = (show k) ++ a1 ++ a2
---   fromListWithKey f [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"a")] == fromList [(3, "3ab"), (5, "5a5ba")]
---   fromListWithKey f [] == empty
---
-fromListWithKey :: Ord k => (k -> a -> a -> a) -> [(k, a)] -> Map k a - --- | O(n). Convert to an ascending list. --- --- 
---   toAscList (fromList [(5,"a"), (3,"b")]) == [(3,"b"), (5,"a")]
---
-toAscList :: Map k a -> [(k, a)] - --- | O(n). Convert to a descending list. -toDescList :: Map k a -> [(k, a)] - --- | O(n). Build a map from an ascending list in linear time. The --- precondition (input list is ascending) is not checked. --- --- 
---   fromAscList [(3,"b"), (5,"a")]          == fromList [(3, "b"), (5, "a")]
---   fromAscList [(3,"b"), (5,"a"), (5,"b")] == fromList [(3, "b"), (5, "b")]
---   valid (fromAscList [(3,"b"), (5,"a"), (5,"b")]) == True
---   valid (fromAscList [(5,"a"), (3,"b"), (5,"b")]) == False
---
-fromAscList :: Eq k => [(k, a)] -> Map k a - --- | O(n). Build a map from an ascending list in linear time with a --- combining function for equal keys. The precondition (input list is --- ascending) is not checked. --- --- 
---   fromAscListWith (++) [(3,"b"), (5,"a"), (5,"b")] == fromList [(3, "b"), (5, "ba")]
---   valid (fromAscListWith (++) [(3,"b"), (5,"a"), (5,"b")]) == True
---   valid (fromAscListWith (++) [(5,"a"), (3,"b"), (5,"b")]) == False
---
-fromAscListWith :: Eq k => (a -> a -> a) -> [(k, a)] -> Map k a - --- | O(n). Build a map from an ascending list in linear time with a --- combining function for equal keys. The precondition (input list is --- ascending) is not checked. --- --- 
---   let f k a1 a2 = (show k) ++ ":" ++ a1 ++ a2
---   fromAscListWithKey f [(3,"b"), (5,"a"), (5,"b"), (5,"b")] == fromList [(3, "b"), (5, "5:b5:ba")]
---   valid (fromAscListWithKey f [(3,"b"), (5,"a"), (5,"b"), (5,"b")]) == True
---   valid (fromAscListWithKey f [(5,"a"), (3,"b"), (5,"b"), (5,"b")]) == False
---
-fromAscListWithKey :: Eq k => (k -> a -> a -> a) -> [(k, a)] -> Map k a - --- | O(n). Build a map from an ascending list of distinct elements --- in linear time. The precondition is not checked. --- --- 
---   fromDistinctAscList [(3,"b"), (5,"a")] == fromList [(3, "b"), (5, "a")]
---   valid (fromDistinctAscList [(3,"b"), (5,"a")])          == True
---   valid (fromDistinctAscList [(3,"b"), (5,"a"), (5,"b")]) == False
---
-fromDistinctAscList :: [(k, a)] -> Map k a - --- | O(n). Filter all values that satisfy the predicate. --- --- 
---   filter (> "a") (fromList [(5,"a"), (3,"b")]) == singleton 3 "b"
---   filter (> "x") (fromList [(5,"a"), (3,"b")]) == empty
---   filter (< "a") (fromList [(5,"a"), (3,"b")]) == empty
---
-filter :: Ord k => (a -> Bool) -> Map k a -> Map k a - --- | O(n). Filter all keys/values that satisfy the predicate. --- --- 
---   filterWithKey (\k _ -> k > 4) (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"
---
-filterWithKey :: Ord k => (k -> a -> Bool) -> Map k a -> Map k a - --- | O(n). Partition the map according to a predicate. The first map --- contains all elements that satisfy the predicate, the second all --- elements that fail the predicate. See also split. --- --- 
---   partition (> "a") (fromList [(5,"a"), (3,"b")]) == (singleton 3 "b", singleton 5 "a")
---   partition (< "x") (fromList [(5,"a"), (3,"b")]) == (fromList [(3, "b"), (5, "a")], empty)
---   partition (> "x") (fromList [(5,"a"), (3,"b")]) == (empty, fromList [(3, "b"), (5, "a")])
---
-partition :: Ord k => (a -> Bool) -> Map k a -> (Map k a, Map k a) - --- | O(n). Partition the map according to a predicate. The first map --- contains all elements that satisfy the predicate, the second all --- elements that fail the predicate. See also split. --- --- 
---   partitionWithKey (\ k _ -> k > 3) (fromList [(5,"a"), (3,"b")]) == (singleton 5 "a", singleton 3 "b")
---   partitionWithKey (\ k _ -> k < 7) (fromList [(5,"a"), (3,"b")]) == (fromList [(3, "b"), (5, "a")], empty)
---   partitionWithKey (\ k _ -> k > 7) (fromList [(5,"a"), (3,"b")]) == (empty, fromList [(3, "b"), (5, "a")])
---
-partitionWithKey :: Ord k => (k -> a -> Bool) -> Map k a -> (Map k a, Map k a) - --- | O(n). Map values and collect the Just results. --- --- 
---   let f x = if x == "a" then Just "new a" else Nothing
---   mapMaybe f (fromList [(5,"a"), (3,"b")]) == singleton 5 "new a"
---
-mapMaybe :: Ord k => (a -> Maybe b) -> Map k a -> Map k b - --- | O(n). Map keys/values and collect the Just results. --- --- 
---   let f k _ = if k < 5 then Just ("key : " ++ (show k)) else Nothing
---   mapMaybeWithKey f (fromList [(5,"a"), (3,"b")]) == singleton 3 "key : 3"
---
-mapMaybeWithKey :: Ord k => (k -> a -> Maybe b) -> Map k a -> Map k b - --- | O(n). Map values and separate the Left and Right --- results. --- --- 
---   let f a = if a < "c" then Left a else Right a
---   mapEither f (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")])
---       == (fromList [(3,"b"), (5,"a")], fromList [(1,"x"), (7,"z")])
---   
---   mapEither (\ a -> Right a) (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")])
---       == (empty, fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")])
---
-mapEither :: Ord k => (a -> Either b c) -> Map k a -> (Map k b, Map k c) - --- | O(n). Map keys/values and separate the Left and --- Right results. --- --- 
---   let f k a = if k < 5 then Left (k * 2) else Right (a ++ a)
---   mapEitherWithKey f (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")])
---       == (fromList [(1,2), (3,6)], fromList [(5,"aa"), (7,"zz")])
---   
---   mapEitherWithKey (\_ a -> Right a) (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")])
---       == (empty, fromList [(1,"x"), (3,"b"), (5,"a"), (7,"z")])
---
-mapEitherWithKey :: Ord k => (k -> a -> Either b c) -> Map k a -> (Map k b, Map k c) - --- | O(log n). The expression (split k map) is a --- pair (map1,map2) where the keys in map1 are smaller --- than k and the keys in map2 larger than k. --- Any key equal to k is found in neither map1 nor --- map2. --- --- 
---   split 2 (fromList [(5,"a"), (3,"b")]) == (empty, fromList [(3,"b"), (5,"a")])
---   split 3 (fromList [(5,"a"), (3,"b")]) == (empty, singleton 5 "a")
---   split 4 (fromList [(5,"a"), (3,"b")]) == (singleton 3 "b", singleton 5 "a")
---   split 5 (fromList [(5,"a"), (3,"b")]) == (singleton 3 "b", empty)
---   split 6 (fromList [(5,"a"), (3,"b")]) == (fromList [(3,"b"), (5,"a")], empty)
---
-split :: Ord k => k -> Map k a -> (Map k a, Map k a) - --- | O(log n). The expression (splitLookup k map) --- splits a map just like split but also returns lookup --- k map. --- --- 
---   splitLookup 2 (fromList [(5,"a"), (3,"b")]) == (empty, Nothing, fromList [(3,"b"), (5,"a")])
---   splitLookup 3 (fromList [(5,"a"), (3,"b")]) == (empty, Just "b", singleton 5 "a")
---   splitLookup 4 (fromList [(5,"a"), (3,"b")]) == (singleton 3 "b", Nothing, singleton 5 "a")
---   splitLookup 5 (fromList [(5,"a"), (3,"b")]) == (singleton 3 "b", Just "a", empty)
---   splitLookup 6 (fromList [(5,"a"), (3,"b")]) == (fromList [(3,"b"), (5,"a")], Nothing, empty)
---
-splitLookup :: Ord k => k -> Map k a -> (Map k a, Maybe a, Map k a) - --- | O(n+m). This function is defined as (isSubmapOf = --- isSubmapOfBy (==)). -isSubmapOf :: (Ord k, Eq a) => Map k a -> Map k a -> Bool - --- | O(n+m). The expression (isSubmapOfBy f t1 t2) --- returns True if all keys in t1 are in tree --- t2, and when f returns True when applied to --- their respective values. For example, the following expressions are --- all True: --- --- 
---   isSubmapOfBy (==) (fromList [('a',1)]) (fromList [('a',1),('b',2)])
---   isSubmapOfBy (<=) (fromList [('a',1)]) (fromList [('a',1),('b',2)])
---   isSubmapOfBy (==) (fromList [('a',1),('b',2)]) (fromList [('a',1),('b',2)])
---
--- --- But the following are all False: --- --- 
---   isSubmapOfBy (==) (fromList [('a',2)]) (fromList [('a',1),('b',2)])
---   isSubmapOfBy (<)  (fromList [('a',1)]) (fromList [('a',1),('b',2)])
---   isSubmapOfBy (==) (fromList [('a',1),('b',2)]) (fromList [('a',1)])
---
-isSubmapOfBy :: Ord k => (a -> b -> Bool) -> Map k a -> Map k b -> Bool - --- | O(n+m). Is this a proper submap? (ie. a submap but not equal). --- Defined as (isProperSubmapOf = isProperSubmapOfBy --- (==)). -isProperSubmapOf :: (Ord k, Eq a) => Map k a -> Map k a -> Bool - --- | O(n+m). Is this a proper submap? (ie. a submap but not equal). --- The expression (isProperSubmapOfBy f m1 m2) returns --- True when m1 and m2 are not equal, all keys --- in m1 are in m2, and when f returns --- True when applied to their respective values. For example, the --- following expressions are all True: --- --- 
---   isProperSubmapOfBy (==) (fromList [(1,1)]) (fromList [(1,1),(2,2)])
---   isProperSubmapOfBy (<=) (fromList [(1,1)]) (fromList [(1,1),(2,2)])
---
--- --- But the following are all False: --- --- 
---   isProperSubmapOfBy (==) (fromList [(1,1),(2,2)]) (fromList [(1,1),(2,2)])
---   isProperSubmapOfBy (==) (fromList [(1,1),(2,2)]) (fromList [(1,1)])
---   isProperSubmapOfBy (<)  (fromList [(1,1)])       (fromList [(1,1),(2,2)])
---
-isProperSubmapOfBy :: Ord k => (a -> b -> Bool) -> Map k a -> Map k b -> Bool - --- | O(log n). Lookup the index of a key. The index is a --- number from 0 up to, but not including, the size of the --- map. --- --- 
---   isJust (lookupIndex 2 (fromList [(5,"a"), (3,"b")]))   == False
---   fromJust (lookupIndex 3 (fromList [(5,"a"), (3,"b")])) == 0
---   fromJust (lookupIndex 5 (fromList [(5,"a"), (3,"b")])) == 1
---   isJust (lookupIndex 6 (fromList [(5,"a"), (3,"b")]))   == False
---
-lookupIndex :: Ord k => k -> Map k a -> Maybe Int - --- | O(log n). Return the index of a key. The index is a --- number from 0 up to, but not including, the size of the --- map. Calls error when the key is not a member of the --- map. --- --- 
---   findIndex 2 (fromList [(5,"a"), (3,"b")])    Error: element is not in the map
---   findIndex 3 (fromList [(5,"a"), (3,"b")]) == 0
---   findIndex 5 (fromList [(5,"a"), (3,"b")]) == 1
---   findIndex 6 (fromList [(5,"a"), (3,"b")])    Error: element is not in the map
---
-findIndex :: Ord k => k -> Map k a -> Int - --- | O(log n). Retrieve an element by index. Calls --- error when an invalid index is used. --- --- 
---   elemAt 0 (fromList [(5,"a"), (3,"b")]) == (3,"b")
---   elemAt 1 (fromList [(5,"a"), (3,"b")]) == (5, "a")
---   elemAt 2 (fromList [(5,"a"), (3,"b")])    Error: index out of range
---
-elemAt :: Int -> Map k a -> (k, a) - --- | O(log n). Update the element at index. Calls --- error when an invalid index is used. --- --- 
---   updateAt (\ _ _ -> Just "x") 0    (fromList [(5,"a"), (3,"b")]) == fromList [(3, "x"), (5, "a")]
---   updateAt (\ _ _ -> Just "x") 1    (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "x")]
---   updateAt (\ _ _ -> Just "x") 2    (fromList [(5,"a"), (3,"b")])    Error: index out of range
---   updateAt (\ _ _ -> Just "x") (-1) (fromList [(5,"a"), (3,"b")])    Error: index out of range
---   updateAt (\_ _  -> Nothing)  0    (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"
---   updateAt (\_ _  -> Nothing)  1    (fromList [(5,"a"), (3,"b")]) == singleton 3 "b"
---   updateAt (\_ _  -> Nothing)  2    (fromList [(5,"a"), (3,"b")])    Error: index out of range
---   updateAt (\_ _  -> Nothing)  (-1) (fromList [(5,"a"), (3,"b")])    Error: index out of range
---
-updateAt :: (k -> a -> Maybe a) -> Int -> Map k a -> Map k a - --- | O(log n). Delete the element at index. Defined as --- (deleteAt i map = updateAt (k x -> --- Nothing) i map). --- --- 
---   deleteAt 0  (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"
---   deleteAt 1  (fromList [(5,"a"), (3,"b")]) == singleton 3 "b"
---   deleteAt 2 (fromList [(5,"a"), (3,"b")])     Error: index out of range
---   deleteAt (-1) (fromList [(5,"a"), (3,"b")])  Error: index out of range
---
-deleteAt :: Int -> Map k a -> Map k a - --- | O(log n). The minimal key of the map. Calls error is the --- map is empty. --- --- 
---   findMin (fromList [(5,"a"), (3,"b")]) == (3,"b")
---   findMin empty                            Error: empty map has no minimal element
---
-findMin :: Map k a -> (k, a) - --- | O(log n). The maximal key of the map. Calls error is the --- map is empty. --- --- 
---   findMax (fromList [(5,"a"), (3,"b")]) == (5,"a")
---   findMax empty                            Error: empty map has no maximal element
---
-findMax :: Map k a -> (k, a) - --- | O(log n). Delete the minimal key. Returns an empty map if the --- map is empty. --- --- 
---   deleteMin (fromList [(5,"a"), (3,"b"), (7,"c")]) == fromList [(5,"a"), (7,"c")]
---   deleteMin empty == empty
---
-deleteMin :: Map k a -> Map k a - --- | O(log n). Delete the maximal key. Returns an empty map if the --- map is empty. --- --- 
---   deleteMax (fromList [(5,"a"), (3,"b"), (7,"c")]) == fromList [(3,"b"), (5,"a")]
---   deleteMax empty == empty
---
-deleteMax :: Map k a -> Map k a - --- | O(log n). Delete and find the minimal element. --- --- 
---   deleteFindMin (fromList [(5,"a"), (3,"b"), (10,"c")]) == ((3,"b"), fromList[(5,"a"), (10,"c")]) 
---   deleteFindMin                                            Error: can not return the minimal element of an empty map
---
-deleteFindMin :: Map k a -> ((k, a), Map k a) - --- | O(log n). Delete and find the maximal element. --- --- 
---   deleteFindMax (fromList [(5,"a"), (3,"b"), (10,"c")]) == ((10,"c"), fromList [(3,"b"), (5,"a")])
---   deleteFindMax empty                                      Error: can not return the maximal element of an empty map
---
-deleteFindMax :: Map k a -> ((k, a), Map k a) - --- | O(log n). Update the value at the minimal key. --- --- 
---   updateMin (\ a -> Just ("X" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3, "Xb"), (5, "a")]
---   updateMin (\ _ -> Nothing)         (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"
---
-updateMin :: (a -> Maybe a) -> Map k a -> Map k a - --- | O(log n). Update the value at the maximal key. --- --- 
---   updateMax (\ a -> Just ("X" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "Xa")]
---   updateMax (\ _ -> Nothing)         (fromList [(5,"a"), (3,"b")]) == singleton 3 "b"
---
-updateMax :: (a -> Maybe a) -> Map k a -> Map k a - --- | O(log n). Update the value at the minimal key. --- --- 
---   updateMinWithKey (\ k a -> Just ((show k) ++ ":" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3,"3:b"), (5,"a")]
---   updateMinWithKey (\ _ _ -> Nothing)                     (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"
---
-updateMinWithKey :: (k -> a -> Maybe a) -> Map k a -> Map k a - --- | O(log n). Update the value at the maximal key. --- --- 
---   updateMaxWithKey (\ k a -> Just ((show k) ++ ":" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3,"b"), (5,"5:a")]
---   updateMaxWithKey (\ _ _ -> Nothing)                     (fromList [(5,"a"), (3,"b")]) == singleton 3 "b"
---
-updateMaxWithKey :: (k -> a -> Maybe a) -> Map k a -> Map k a - --- | O(log n). Retrieves the value associated with minimal key of --- the map, and the map stripped of that element, or Nothing if --- passed an empty map. --- --- 
---   minView (fromList [(5,"a"), (3,"b")]) == Just ("b", singleton 5 "a")
---   minView empty == Nothing
---
-minView :: Map k a -> Maybe (a, Map k a) - --- | O(log n). Retrieves the value associated with maximal key of --- the map, and the map stripped of that element, or Nothing if --- passed an --- --- 
---   maxView (fromList [(5,"a"), (3,"b")]) == Just ("a", singleton 3 "b")
---   maxView empty == Nothing
---
-maxView :: Map k a -> Maybe (a, Map k a) - --- | O(log n). Retrieves the minimal (key,value) pair of the map, --- and the map stripped of that element, or Nothing if passed an --- empty map. --- --- 
---   minViewWithKey (fromList [(5,"a"), (3,"b")]) == Just ((3,"b"), singleton 5 "a")
---   minViewWithKey empty == Nothing
---
-minViewWithKey :: Map k a -> Maybe ((k, a), Map k a) - --- | O(log n). Retrieves the maximal (key,value) pair of the map, --- and the map stripped of that element, or Nothing if passed an --- empty map. --- --- 
---   maxViewWithKey (fromList [(5,"a"), (3,"b")]) == Just ((5,"a"), singleton 3 "b")
---   maxViewWithKey empty == Nothing
---
-maxViewWithKey :: Map k a -> Maybe ((k, a), Map k a) - --- | O(n). Show the tree that implements the map. The tree is shown --- in a compressed, hanging format. See showTreeWith. -showTree :: (Show k, Show a) => Map k a -> String - --- | O(n). The expression (showTreeWith showelem hang --- wide map) shows the tree that implements the map. Elements are --- shown using the showElem function. If hang is --- True, a hanging tree is shown otherwise a rotated tree --- is shown. If wide is True, an extra wide version is --- shown. --- --- 
---   Map> let t = fromDistinctAscList [(x,()) | x <- [1..5]]
---   Map> putStrLn $ showTreeWith (\k x -> show (k,x)) True False t
---   (4,())
---   +--(2,())
---   |  +--(1,())
---   |  +--(3,())
---   +--(5,())
---   
---   Map> putStrLn $ showTreeWith (\k x -> show (k,x)) True True t
---   (4,())
---   |
---   +--(2,())
---   |  |
---   |  +--(1,())
---   |  |
---   |  +--(3,())
---   |
---   +--(5,())
---   
---   Map> putStrLn $ showTreeWith (\k x -> show (k,x)) False True t
---   +--(5,())
---   |
---   (4,())
---   |
---   |  +--(3,())
---   |  |
---   +--(2,())
---      |
---      +--(1,())
---
-showTreeWith :: (k -> a -> String) -> Bool -> Bool -> Map k a -> String - --- | O(n). Test if the internal map structure is valid. --- --- 
---   valid (fromAscList [(3,"b"), (5,"a")]) == True
---   valid (fromAscList [(5,"a"), (3,"b")]) == False
---
-valid :: Ord k => Map k a -> Bool -instance Typeable2 Map -instance (Show k, Show a) => Show (Map k a) -instance (Ord k, Read k, Read e) => Read (Map k e) -instance Foldable (Map k) -instance Traversable (Map k) -instance Functor (Map k) -instance (Ord k, Ord v) => Ord (Map k v) -instance (Eq k, Eq a) => Eq (Map k a) -instance (Data k, Data a, Ord k) => Data (Map k a) -instance Ord k => Monoid (Map k v) - - --- | An efficient implementation of integer sets. --- --- Since many function names (but not the type name) clash with --- Prelude names, this module is usually imported --- qualified, e.g. --- --- 
---   import Data.IntSet (IntSet)
---   import qualified Data.IntSet as IntSet
---
--- --- The implementation is based on big-endian patricia trees. This --- data structure performs especially well on binary operations like --- union and intersection. However, my benchmarks show that --- it is also (much) faster on insertions and deletions when compared to --- a generic size-balanced set implementation (see Data.Set). --- --- --- --- Many operations have a worst-case complexity of O(min(n,W)). --- This means that the operation can become linear in the number of --- elements with a maximum of W -- the number of bits in an --- Int (32 or 64). -module Data.IntSet - --- | A set of integers. -data IntSet - --- | O(n+m). See difference. -(\\) :: IntSet -> IntSet -> IntSet - --- | O(1). Is the set empty? -null :: IntSet -> Bool - --- | O(n). Cardinality of the set. -size :: IntSet -> Int - --- | O(min(n,W)). Is the value a member of the set? -member :: Int -> IntSet -> Bool - --- | O(min(n,W)). Is the element not in the set? -notMember :: Int -> IntSet -> Bool - --- | O(n+m). Is this a subset? (s1 isSubsetOf s2) --- tells whether s1 is a subset of s2. -isSubsetOf :: IntSet -> IntSet -> Bool - --- | O(n+m). Is this a proper subset? (ie. a subset but not equal). -isProperSubsetOf :: IntSet -> IntSet -> Bool - --- | O(1). The empty set. -empty :: IntSet - --- | O(1). A set of one element. -singleton :: Int -> IntSet - --- | O(min(n,W)). Add a value to the set. When the value is already --- an element of the set, it is replaced by the new one, ie. --- insert is left-biased. -insert :: Int -> IntSet -> IntSet - --- | O(min(n,W)). Delete a value in the set. Returns the original --- set when the value was not present. -delete :: Int -> IntSet -> IntSet - --- | O(n+m). The union of two sets. -union :: IntSet -> IntSet -> IntSet - --- | The union of a list of sets. -unions :: [IntSet] -> IntSet - --- | O(n+m). Difference between two sets. -difference :: IntSet -> IntSet -> IntSet - --- | O(n+m). The intersection of two sets. -intersection :: IntSet -> IntSet -> IntSet - --- | O(n). Filter all elements that satisfy some predicate. -filter :: (Int -> Bool) -> IntSet -> IntSet - --- | O(n). partition the set according to some predicate. -partition :: (Int -> Bool) -> IntSet -> (IntSet, IntSet) - --- | O(min(n,W)). The expression (split x set) is a --- pair (set1,set2) where set1 comprises the elements --- of set less than x and set2 comprises the --- elements of set greater than x. --- --- 
---   split 3 (fromList [1..5]) == (fromList [1,2], fromList [4,5])
---
-split :: Int -> IntSet -> (IntSet, IntSet) - --- | O(min(n,W)). Performs a split but also returns whether --- the pivot element was found in the original set. -splitMember :: Int -> IntSet -> (IntSet, Bool, IntSet) - --- | O(min(n,W)). The minimal element of the set. -findMin :: IntSet -> Int - --- | O(min(n,W)). The maximal element of a set. -findMax :: IntSet -> Int - --- | O(min(n,W)). Delete the minimal element. -deleteMin :: IntSet -> IntSet - --- | O(min(n,W)). Delete the maximal element. -deleteMax :: IntSet -> IntSet - --- | O(min(n,W)). Delete and find the minimal element. --- --- 
---   deleteFindMin set = (findMin set, deleteMin set)
---
-deleteFindMin :: IntSet -> (Int, IntSet) - --- | O(min(n,W)). Delete and find the maximal element. --- --- 
---   deleteFindMax set = (findMax set, deleteMax set)
---
-deleteFindMax :: IntSet -> (Int, IntSet) - --- | O(min(n,W)). Retrieves the maximal key of the set, and the set --- stripped of that element, or Nothing if passed an empty set. -maxView :: IntSet -> Maybe (Int, IntSet) - --- | O(min(n,W)). Retrieves the minimal key of the set, and the set --- stripped of that element, or Nothing if passed an empty set. -minView :: IntSet -> Maybe (Int, IntSet) - --- | O(n*min(n,W)). map f s is the set obtained by --- applying f to each element of s. --- --- It's worth noting that the size of the result may be smaller if, for --- some (x,y), x /= y && f x == f y -map :: (Int -> Int) -> IntSet -> IntSet - --- | O(n). Fold over the elements of a set in an unspecified order. --- --- 
---   sum set   == fold (+) 0 set
---   elems set == fold (:) [] set
---
-fold :: (Int -> b -> b) -> b -> IntSet -> b - --- | O(n). The elements of a set. (For sets, this is equivalent to --- toList) -elems :: IntSet -> [Int] - --- | O(n). Convert the set to a list of elements. -toList :: IntSet -> [Int] - --- | O(n*min(n,W)). Create a set from a list of integers. -fromList :: [Int] -> IntSet - --- | O(n). Convert the set to an ascending list of elements. -toAscList :: IntSet -> [Int] - --- | O(n). Build a set from an ascending list of elements. The --- precondition (input list is ascending) is not checked. -fromAscList :: [Int] -> IntSet - --- | O(n). Build a set from an ascending list of distinct elements. --- The precondition (input list is strictly ascending) is not --- checked. -fromDistinctAscList :: [Int] -> IntSet - --- | O(n). Show the tree that implements the set. The tree is shown --- in a compressed, hanging format. -showTree :: IntSet -> String - --- | O(n). The expression (showTreeWith hang wide --- map) shows the tree that implements the set. If hang is --- True, a hanging tree is shown otherwise a rotated tree --- is shown. If wide is True, an extra wide version is --- shown. -showTreeWith :: Bool -> Bool -> IntSet -> String -instance Typeable IntSet -instance Read IntSet -instance Show IntSet -instance Ord IntSet -instance Eq IntSet -instance Data IntSet -instance Monoid IntSet - - --- | An efficient implementation of maps from integer keys to values. --- --- Since many function names (but not the type name) clash with --- Prelude names, this module is usually imported --- qualified, e.g. --- --- 
---   import Data.IntMap (IntMap)
---   import qualified Data.IntMap as IntMap
---
--- --- The implementation is based on big-endian patricia trees. This --- data structure performs especially well on binary operations like --- union and intersection. However, my benchmarks show that --- it is also (much) faster on insertions and deletions when compared to --- a generic size-balanced map implementation (see Data.Map). --- --- --- --- Operation comments contain the operation time complexity in the Big-O --- notation http://en.wikipedia.org/wiki/Big_O_notation. Many --- operations have a worst-case complexity of O(min(n,W)). This --- means that the operation can become linear in the number of elements --- with a maximum of W -- the number of bits in an Int (32 --- or 64). -module Data.IntMap - --- | A map of integers to values a. -data IntMap a -type Key = Int - --- | O(min(n,W)). Find the value at a key. Calls error when --- the element can not be found. --- --- 
---   fromList [(5,'a'), (3,'b')] ! 1    Error: element not in the map
---   fromList [(5,'a'), (3,'b')] ! 5 == 'a'
---
-(!) :: IntMap a -> Key -> a - --- | Same as difference. -(\\) :: IntMap a -> IntMap b -> IntMap a - --- | O(1). Is the map empty? --- --- 
---   Data.IntMap.null (empty)           == True
---   Data.IntMap.null (singleton 1 'a') == False
---
-null :: IntMap a -> Bool - --- | O(n). Number of elements in the map. --- --- 
---   size empty                                   == 0
---   size (singleton 1 'a')                       == 1
---   size (fromList([(1,'a'), (2,'c'), (3,'b')])) == 3
---
-size :: IntMap a -> Int - --- | O(min(n,W)). Is the key a member of the map? --- --- 
---   member 5 (fromList [(5,'a'), (3,'b')]) == True
---   member 1 (fromList [(5,'a'), (3,'b')]) == False
---
-member :: Key -> IntMap a -> Bool - --- | O(log n). Is the key not a member of the map? --- --- 
---   notMember 5 (fromList [(5,'a'), (3,'b')]) == False
---   notMember 1 (fromList [(5,'a'), (3,'b')]) == True
---
-notMember :: Key -> IntMap a -> Bool - --- | O(min(n,W)). Lookup the value at a key in the map. See also --- Data.Map.lookup. -lookup :: Key -> IntMap a -> Maybe a - --- | O(min(n,W)). The expression (findWithDefault def k --- map) returns the value at key k or returns def --- when the key is not an element of the map. --- --- 
---   findWithDefault 'x' 1 (fromList [(5,'a'), (3,'b')]) == 'x'
---   findWithDefault 'x' 5 (fromList [(5,'a'), (3,'b')]) == 'a'
---
-findWithDefault :: a -> Key -> IntMap a -> a - --- | O(1). The empty map. --- --- 
---   empty      == fromList []
---   size empty == 0
---
-empty :: IntMap a - --- | O(1). A map of one element. --- --- 
---   singleton 1 'a'        == fromList [(1, 'a')]
---   size (singleton 1 'a') == 1
---
-singleton :: Key -> a -> IntMap a - --- | O(min(n,W)). Insert a new key/value pair in the map. If the key --- is already present in the map, the associated value is replaced with --- the supplied value, i.e. insert is equivalent to --- insertWith const. --- --- 
---   insert 5 'x' (fromList [(5,'a'), (3,'b')]) == fromList [(3, 'b'), (5, 'x')]
---   insert 7 'x' (fromList [(5,'a'), (3,'b')]) == fromList [(3, 'b'), (5, 'a'), (7, 'x')]
---   insert 5 'x' empty                         == singleton 5 'x'
---
-insert :: Key -> a -> IntMap a -> IntMap a - --- | O(min(n,W)). Insert with a combining function. --- insertWith f key value mp will insert the pair (key, --- value) into mp if key does not exist in the map. If the key --- does exist, the function will insert f new_value old_value. --- --- 
---   insertWith (++) 5 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "xxxa")]
---   insertWith (++) 7 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a"), (7, "xxx")]
---   insertWith (++) 5 "xxx" empty                         == singleton 5 "xxx"
---
-insertWith :: (a -> a -> a) -> Key -> a -> IntMap a -> IntMap a - --- | O(min(n,W)). Insert with a combining function. --- insertWithKey f key value mp will insert the pair --- (key, value) into mp if key does not exist in the map. If the --- key does exist, the function will insert f key new_value --- old_value. --- --- 
---   let f key new_value old_value = (show key) ++ ":" ++ new_value ++ "|" ++ old_value
---   insertWithKey f 5 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "5:xxx|a")]
---   insertWithKey f 7 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a"), (7, "xxx")]
---   insertWithKey f 5 "xxx" empty                         == singleton 5 "xxx"
---
-insertWithKey :: (Key -> a -> a -> a) -> Key -> a -> IntMap a -> IntMap a - --- | O(min(n,W)). The expression (insertLookupWithKey f k --- x map) is a pair where the first element is equal to --- (lookup k map) and the second element equal to --- (insertWithKey f k x map). --- --- 
---   let f key new_value old_value = (show key) ++ ":" ++ new_value ++ "|" ++ old_value
---   insertLookupWithKey f 5 "xxx" (fromList [(5,"a"), (3,"b")]) == (Just "a", fromList [(3, "b"), (5, "5:xxx|a")])
---   insertLookupWithKey f 7 "xxx" (fromList [(5,"a"), (3,"b")]) == (Nothing,  fromList [(3, "b"), (5, "a"), (7, "xxx")])
---   insertLookupWithKey f 5 "xxx" empty                         == (Nothing,  singleton 5 "xxx")
---
--- --- This is how to define insertLookup using --- insertLookupWithKey: --- --- 
---   let insertLookup kx x t = insertLookupWithKey (\_ a _ -> a) kx x t
---   insertLookup 5 "x" (fromList [(5,"a"), (3,"b")]) == (Just "a", fromList [(3, "b"), (5, "x")])
---   insertLookup 7 "x" (fromList [(5,"a"), (3,"b")]) == (Nothing,  fromList [(3, "b"), (5, "a"), (7, "x")])
---
-insertLookupWithKey :: (Key -> a -> a -> a) -> Key -> a -> IntMap a -> (Maybe a, IntMap a) - --- | O(min(n,W)). Delete a key and its value from the map. When the --- key is not a member of the map, the original map is returned. --- --- 
---   delete 5 (fromList [(5,"a"), (3,"b")]) == singleton 3 "b"
---   delete 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")]
---   delete 5 empty                         == empty
---
-delete :: Key -> IntMap a -> IntMap a - --- | O(min(n,W)). Adjust a value at a specific key. When the key is --- not a member of the map, the original map is returned. --- --- 
---   adjust ("new " ++) 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "new a")]
---   adjust ("new " ++) 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")]
---   adjust ("new " ++) 7 empty                         == empty
---
-adjust :: (a -> a) -> Key -> IntMap a -> IntMap a - --- | O(min(n,W)). Adjust a value at a specific key. When the key is --- not a member of the map, the original map is returned. --- --- 
---   let f key x = (show key) ++ ":new " ++ x
---   adjustWithKey f 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "5:new a")]
---   adjustWithKey f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")]
---   adjustWithKey f 7 empty                         == empty
---
-adjustWithKey :: (Key -> a -> a) -> Key -> IntMap a -> IntMap a - --- | O(min(n,W)). The expression (update f k map) --- updates the value x at k (if it is in the map). If --- (f x) is Nothing, the element is deleted. If it is --- (Just y), the key k is bound to the new value --- y. --- --- 
---   let f x = if x == "a" then Just "new a" else Nothing
---   update f 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "new a")]
---   update f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")]
---   update f 3 (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"
---
-update :: (a -> Maybe a) -> Key -> IntMap a -> IntMap a - --- | O(min(n,W)). The expression (update f k map) --- updates the value x at k (if it is in the map). If --- (f k x) is Nothing, the element is deleted. If it is --- (Just y), the key k is bound to the new value --- y. --- --- 
---   let f k x = if x == "a" then Just ((show k) ++ ":new a") else Nothing
---   updateWithKey f 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "5:new a")]
---   updateWithKey f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")]
---   updateWithKey f 3 (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"
---
-updateWithKey :: (Key -> a -> Maybe a) -> Key -> IntMap a -> IntMap a - --- | O(min(n,W)). Lookup and update. The function returns original --- value, if it is updated. This is different behavior than --- Data.Map.updateLookupWithKey. Returns the original key value --- if the map entry is deleted. --- --- 
---   let f k x = if x == "a" then Just ((show k) ++ ":new a") else Nothing
---   updateLookupWithKey f 5 (fromList [(5,"a"), (3,"b")]) == (Just "a", fromList [(3, "b"), (5, "5:new a")])
---   updateLookupWithKey f 7 (fromList [(5,"a"), (3,"b")]) == (Nothing,  fromList [(3, "b"), (5, "a")])
---   updateLookupWithKey f 3 (fromList [(5,"a"), (3,"b")]) == (Just "b", singleton 5 "a")
---
-updateLookupWithKey :: (Key -> a -> Maybe a) -> Key -> IntMap a -> (Maybe a, IntMap a) - --- | O(log n). The expression (alter f k map) alters --- the value x at k, or absence thereof. alter --- can be used to insert, delete, or update a value in an IntMap. --- In short : lookup k (alter f k m) = f (lookup --- k m). -alter :: (Maybe a -> Maybe a) -> Int -> IntMap a -> IntMap a - --- | O(n+m). The (left-biased) union of two maps. It prefers the --- first map when duplicate keys are encountered, i.e. (union --- == unionWith const). --- --- 
---   union (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == fromList [(3, "b"), (5, "a"), (7, "C")]
---
-union :: IntMap a -> IntMap a -> IntMap a - --- | O(n+m). The union with a combining function. --- --- 
---   unionWith (++) (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == fromList [(3, "b"), (5, "aA"), (7, "C")]
---
-unionWith :: (a -> a -> a) -> IntMap a -> IntMap a -> IntMap a - --- | O(n+m). The union with a combining function. --- --- 
---   let f key left_value right_value = (show key) ++ ":" ++ left_value ++ "|" ++ right_value
---   unionWithKey f (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == fromList [(3, "b"), (5, "5:a|A"), (7, "C")]
---
-unionWithKey :: (Key -> a -> a -> a) -> IntMap a -> IntMap a -> IntMap a - --- | The union of a list of maps. --- --- 
---   unions [(fromList [(5, "a"), (3, "b")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "A3"), (3, "B3")])]
---       == fromList [(3, "b"), (5, "a"), (7, "C")]
---   unions [(fromList [(5, "A3"), (3, "B3")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "a"), (3, "b")])]
---       == fromList [(3, "B3"), (5, "A3"), (7, "C")]
---
-unions :: [IntMap a] -> IntMap a - --- | The union of a list of maps, with a combining operation. --- --- 
---   unionsWith (++) [(fromList [(5, "a"), (3, "b")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "A3"), (3, "B3")])]
---       == fromList [(3, "bB3"), (5, "aAA3"), (7, "C")]
---
-unionsWith :: (a -> a -> a) -> [IntMap a] -> IntMap a - --- | O(n+m). Difference between two maps (based on keys). --- --- 
---   difference (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == singleton 3 "b"
---
-difference :: IntMap a -> IntMap b -> IntMap a - --- | O(n+m). Difference with a combining function. --- --- 
---   let f al ar = if al == "b" then Just (al ++ ":" ++ ar) else Nothing
---   differenceWith f (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (3, "B"), (7, "C")])
---       == singleton 3 "b:B"
---
-differenceWith :: (a -> b -> Maybe a) -> IntMap a -> IntMap b -> IntMap a - --- | O(n+m). Difference with a combining function. When two equal --- keys are encountered, the combining function is applied to the key and --- both values. If it returns Nothing, the element is discarded --- (proper set difference). If it returns (Just y), the --- element is updated with a new value y. --- --- 
---   let f k al ar = if al == "b" then Just ((show k) ++ ":" ++ al ++ "|" ++ ar) else Nothing
---   differenceWithKey f (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (3, "B"), (10, "C")])
---       == singleton 3 "3:b|B"
---
-differenceWithKey :: (Key -> a -> b -> Maybe a) -> IntMap a -> IntMap b -> IntMap a - --- | O(n+m). The (left-biased) intersection of two maps (based on --- keys). --- --- 
---   intersection (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == singleton 5 "a"
---
-intersection :: IntMap a -> IntMap b -> IntMap a - --- | O(n+m). The intersection with a combining function. --- --- 
---   intersectionWith (++) (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == singleton 5 "aA"
---
-intersectionWith :: (a -> b -> c) -> IntMap a -> IntMap b -> IntMap c - --- | O(n+m). The intersection with a combining function. --- --- 
---   let f k al ar = (show k) ++ ":" ++ al ++ "|" ++ ar
---   intersectionWithKey f (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == singleton 5 "5:a|A"
---
-intersectionWithKey :: (Key -> a -> b -> c) -> IntMap a -> IntMap b -> IntMap c - --- | O(n). Map a function over all values in the map. --- --- 
---   map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]
---
-map :: (a -> b) -> IntMap a -> IntMap b - --- | O(n). Map a function over all values in the map. --- --- 
---   let f key x = (show key) ++ ":" ++ x
---   mapWithKey f (fromList [(5,"a"), (3,"b")]) == fromList [(3, "3:b"), (5, "5:a")]
---
-mapWithKey :: (Key -> a -> b) -> IntMap a -> IntMap b - --- | O(n). The function mapAccum threads an --- accumulating argument through the map in ascending order of keys. --- --- 
---   let f a b = (a ++ b, b ++ "X")
---   mapAccum f "Everything: " (fromList [(5,"a"), (3,"b")]) == ("Everything: ba", fromList [(3, "bX"), (5, "aX")])
---
-mapAccum :: (a -> b -> (a, c)) -> a -> IntMap b -> (a, IntMap c) - --- | O(n). The function mapAccumWithKey threads an --- accumulating argument through the map in ascending order of keys. --- --- 
---   let f a k b = (a ++ " " ++ (show k) ++ "-" ++ b, b ++ "X")
---   mapAccumWithKey f "Everything:" (fromList [(5,"a"), (3,"b")]) == ("Everything: 3-b 5-a", fromList [(3, "bX"), (5, "aX")])
---
-mapAccumWithKey :: (a -> Key -> b -> (a, c)) -> a -> IntMap b -> (a, IntMap c) - --- | O(n). The function mapAccumR threads an --- accumulating argument through the map in descending order of keys. -mapAccumRWithKey :: (a -> Key -> b -> (a, c)) -> a -> IntMap b -> (a, IntMap c) - --- | O(n). Fold the values in the map, such that fold f z --- == Prelude.foldr f z . elems. For example, --- --- 
---   elems map = fold (:) [] map
---
--- --- 
---   let f a len = len + (length a)
---   fold f 0 (fromList [(5,"a"), (3,"bbb")]) == 4
---
-fold :: (a -> b -> b) -> b -> IntMap a -> b - --- | O(n). Fold the keys and values in the map, such that --- foldWithKey f z == Prelude.foldr (uncurry --- f) z . toAscList. For example, --- --- 
---   keys map = foldWithKey (\k x ks -> k:ks) [] map
---
--- --- 
---   let f k a result = result ++ "(" ++ (show k) ++ ":" ++ a ++ ")"
---   foldWithKey f "Map: " (fromList [(5,"a"), (3,"b")]) == "Map: (5:a)(3:b)"
---
-foldWithKey :: (Key -> a -> b -> b) -> b -> IntMap a -> b - --- | O(n). Return all elements of the map in the ascending order of --- their keys. --- --- 
---   elems (fromList [(5,"a"), (3,"b")]) == ["b","a"]
---   elems empty == []
---
-elems :: IntMap a -> [a] - --- | O(n). Return all keys of the map in ascending order. --- --- 
---   keys (fromList [(5,"a"), (3,"b")]) == [3,5]
---   keys empty == []
---
-keys :: IntMap a -> [Key] - --- | O(n*min(n,W)). The set of all keys of the map. --- --- 
---   keysSet (fromList [(5,"a"), (3,"b")]) == Data.IntSet.fromList [3,5]
---   keysSet empty == Data.IntSet.empty
---
-keysSet :: IntMap a -> IntSet - --- | O(n). Return all key/value pairs in the map in ascending key --- order. --- --- 
---   assocs (fromList [(5,"a"), (3,"b")]) == [(3,"b"), (5,"a")]
---   assocs empty == []
---
-assocs :: IntMap a -> [(Key, a)] - --- | O(n). Convert the map to a list of key/value pairs. --- --- 
---   toList (fromList [(5,"a"), (3,"b")]) == [(3,"b"), (5,"a")]
---   toList empty == []
---
-toList :: IntMap a -> [(Key, a)] - --- | O(n*min(n,W)). Create a map from a list of key/value pairs. --- --- 
---   fromList [] == empty
---   fromList [(5,"a"), (3,"b"), (5, "c")] == fromList [(5,"c"), (3,"b")]
---   fromList [(5,"c"), (3,"b"), (5, "a")] == fromList [(5,"a"), (3,"b")]
---
-fromList :: [(Key, a)] -> IntMap a - --- | O(n*min(n,W)). Create a map from a list of key/value pairs with --- a combining function. See also fromAscListWith. --- --- 
---   fromListWith (++) [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"a")] == fromList [(3, "ab"), (5, "aba")]
---   fromListWith (++) [] == empty
---
-fromListWith :: (a -> a -> a) -> [(Key, a)] -> IntMap a - --- | O(n*min(n,W)). Build a map from a list of key/value pairs with --- a combining function. See also fromAscListWithKey'. --- --- 
---   fromListWith (++) [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"a")] == fromList [(3, "ab"), (5, "aba")]
---   fromListWith (++) [] == empty
---
-fromListWithKey :: (Key -> a -> a -> a) -> [(Key, a)] -> IntMap a - --- | O(n). Convert the map to a list of key/value pairs where the --- keys are in ascending order. --- --- 
---   toAscList (fromList [(5,"a"), (3,"b")]) == [(3,"b"), (5,"a")]
---
-toAscList :: IntMap a -> [(Key, a)] - --- | O(n). Build a map from a list of key/value pairs where the keys --- are in ascending order. --- --- 
---   fromAscList [(3,"b"), (5,"a")]          == fromList [(3, "b"), (5, "a")]
---   fromAscList [(3,"b"), (5,"a"), (5,"b")] == fromList [(3, "b"), (5, "b")]
---
-fromAscList :: [(Key, a)] -> IntMap a - --- | O(n). Build a map from a list of key/value pairs where the keys --- are in ascending order, with a combining function on equal keys. --- The precondition (input list is ascending) is not checked. --- --- 
---   fromAscListWith (++) [(3,"b"), (5,"a"), (5,"b")] == fromList [(3, "b"), (5, "ba")]
---
-fromAscListWith :: (a -> a -> a) -> [(Key, a)] -> IntMap a - --- | O(n). Build a map from a list of key/value pairs where the keys --- are in ascending order, with a combining function on equal keys. --- The precondition (input list is ascending) is not checked. --- --- 
---   fromAscListWith (++) [(3,"b"), (5,"a"), (5,"b")] == fromList [(3, "b"), (5, "ba")]
---
-fromAscListWithKey :: (Key -> a -> a -> a) -> [(Key, a)] -> IntMap a - --- | O(n). Build a map from a list of key/value pairs where the keys --- are in ascending order and all distinct. The precondition (input --- list is strictly ascending) is not checked. --- --- 
---   fromDistinctAscList [(3,"b"), (5,"a")] == fromList [(3, "b"), (5, "a")]
---
-fromDistinctAscList :: [(Key, a)] -> IntMap a - --- | O(n). Filter all values that satisfy some predicate. --- --- 
---   filter (> "a") (fromList [(5,"a"), (3,"b")]) == singleton 3 "b"
---   filter (> "x") (fromList [(5,"a"), (3,"b")]) == empty
---   filter (< "a") (fromList [(5,"a"), (3,"b")]) == empty
---
-filter :: (a -> Bool) -> IntMap a -> IntMap a - --- | O(n). Filter all keys/values that satisfy some predicate. --- --- 
---   filterWithKey (\k _ -> k > 4) (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"
---
-filterWithKey :: (Key -> a -> Bool) -> IntMap a -> IntMap a - --- | O(n). Partition the map according to some predicate. The first --- map contains all elements that satisfy the predicate, the second all --- elements that fail the predicate. See also split. --- --- 
---   partition (> "a") (fromList [(5,"a"), (3,"b")]) == (singleton 3 "b", singleton 5 "a")
---   partition (< "x") (fromList [(5,"a"), (3,"b")]) == (fromList [(3, "b"), (5, "a")], empty)
---   partition (> "x") (fromList [(5,"a"), (3,"b")]) == (empty, fromList [(3, "b"), (5, "a")])
---
-partition :: (a -> Bool) -> IntMap a -> (IntMap a, IntMap a) - --- | O(n). Partition the map according to some predicate. The first --- map contains all elements that satisfy the predicate, the second all --- elements that fail the predicate. See also split. --- --- 
---   partitionWithKey (\ k _ -> k > 3) (fromList [(5,"a"), (3,"b")]) == (singleton 5 "a", singleton 3 "b")
---   partitionWithKey (\ k _ -> k < 7) (fromList [(5,"a"), (3,"b")]) == (fromList [(3, "b"), (5, "a")], empty)
---   partitionWithKey (\ k _ -> k > 7) (fromList [(5,"a"), (3,"b")]) == (empty, fromList [(3, "b"), (5, "a")])
---
-partitionWithKey :: (Key -> a -> Bool) -> IntMap a -> (IntMap a, IntMap a) - --- | O(n). Map values and collect the Just results. --- --- 
---   let f x = if x == "a" then Just "new a" else Nothing
---   mapMaybe f (fromList [(5,"a"), (3,"b")]) == singleton 5 "new a"
---
-mapMaybe :: (a -> Maybe b) -> IntMap a -> IntMap b - --- | O(n). Map keys/values and collect the Just results. --- --- 
---   let f k _ = if k < 5 then Just ("key : " ++ (show k)) else Nothing
---   mapMaybeWithKey f (fromList [(5,"a"), (3,"b")]) == singleton 3 "key : 3"
---
-mapMaybeWithKey :: (Key -> a -> Maybe b) -> IntMap a -> IntMap b - --- | O(n). Map values and separate the Left and Right --- results. --- --- 
---   let f a = if a < "c" then Left a else Right a
---   mapEither f (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")])
---       == (fromList [(3,"b"), (5,"a")], fromList [(1,"x"), (7,"z")])
---   
---   mapEither (\ a -> Right a) (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")])
---       == (empty, fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")])
---
-mapEither :: (a -> Either b c) -> IntMap a -> (IntMap b, IntMap c) - --- | O(n). Map keys/values and separate the Left and --- Right results. --- --- 
---   let f k a = if k < 5 then Left (k * 2) else Right (a ++ a)
---   mapEitherWithKey f (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")])
---       == (fromList [(1,2), (3,6)], fromList [(5,"aa"), (7,"zz")])
---   
---   mapEitherWithKey (\_ a -> Right a) (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")])
---       == (empty, fromList [(1,"x"), (3,"b"), (5,"a"), (7,"z")])
---
-mapEitherWithKey :: (Key -> a -> Either b c) -> IntMap a -> (IntMap b, IntMap c) - --- | O(log n). The expression (split k map) is a --- pair (map1,map2) where all keys in map1 are lower --- than k and all keys in map2 larger than k. --- Any key equal to k is found in neither map1 nor --- map2. --- --- 
---   split 2 (fromList [(5,"a"), (3,"b")]) == (empty, fromList [(3,"b"), (5,"a")])
---   split 3 (fromList [(5,"a"), (3,"b")]) == (empty, singleton 5 "a")
---   split 4 (fromList [(5,"a"), (3,"b")]) == (singleton 3 "b", singleton 5 "a")
---   split 5 (fromList [(5,"a"), (3,"b")]) == (singleton 3 "b", empty)
---   split 6 (fromList [(5,"a"), (3,"b")]) == (fromList [(3,"b"), (5,"a")], empty)
---
-split :: Key -> IntMap a -> (IntMap a, IntMap a) - --- | O(log n). Performs a split but also returns whether the --- pivot key was found in the original map. --- --- 
---   splitLookup 2 (fromList [(5,"a"), (3,"b")]) == (empty, Nothing, fromList [(3,"b"), (5,"a")])
---   splitLookup 3 (fromList [(5,"a"), (3,"b")]) == (empty, Just "b", singleton 5 "a")
---   splitLookup 4 (fromList [(5,"a"), (3,"b")]) == (singleton 3 "b", Nothing, singleton 5 "a")
---   splitLookup 5 (fromList [(5,"a"), (3,"b")]) == (singleton 3 "b", Just "a", empty)
---   splitLookup 6 (fromList [(5,"a"), (3,"b")]) == (fromList [(3,"b"), (5,"a")], Nothing, empty)
---
-splitLookup :: Key -> IntMap a -> (IntMap a, Maybe a, IntMap a) - --- | O(n+m). Is this a submap? Defined as (isSubmapOf = --- isSubmapOfBy (==)). -isSubmapOf :: Eq a => IntMap a -> IntMap a -> Bool - --- | O(n+m). The expression (isSubmapOfBy f m1 m2) --- returns True if all keys in m1 are in m2, and --- when f returns True when applied to their respective --- values. For example, the following expressions are all True: --- --- 
---   isSubmapOfBy (==) (fromList [(1,1)]) (fromList [(1,1),(2,2)])
---   isSubmapOfBy (<=) (fromList [(1,1)]) (fromList [(1,1),(2,2)])
---   isSubmapOfBy (==) (fromList [(1,1),(2,2)]) (fromList [(1,1),(2,2)])
---
--- --- But the following are all False: --- --- 
---   isSubmapOfBy (==) (fromList [(1,2)]) (fromList [(1,1),(2,2)])
---   isSubmapOfBy (<) (fromList [(1,1)]) (fromList [(1,1),(2,2)])
---   isSubmapOfBy (==) (fromList [(1,1),(2,2)]) (fromList [(1,1)])
---
-isSubmapOfBy :: (a -> b -> Bool) -> IntMap a -> IntMap b -> Bool - --- | O(n+m). Is this a proper submap? (ie. a submap but not equal). --- Defined as (isProperSubmapOf = isProperSubmapOfBy --- (==)). -isProperSubmapOf :: Eq a => IntMap a -> IntMap a -> Bool - --- | O(n+m). Is this a proper submap? (ie. a submap but not equal). --- The expression (isProperSubmapOfBy f m1 m2) returns --- True when m1 and m2 are not equal, all keys --- in m1 are in m2, and when f returns --- True when applied to their respective values. For example, the --- following expressions are all True: --- --- 
---   isProperSubmapOfBy (==) (fromList [(1,1)]) (fromList [(1,1),(2,2)])
---   isProperSubmapOfBy (<=) (fromList [(1,1)]) (fromList [(1,1),(2,2)])
---
--- --- But the following are all False: --- --- 
---   isProperSubmapOfBy (==) (fromList [(1,1),(2,2)]) (fromList [(1,1),(2,2)])
---   isProperSubmapOfBy (==) (fromList [(1,1),(2,2)]) (fromList [(1,1)])
---   isProperSubmapOfBy (<)  (fromList [(1,1)])       (fromList [(1,1),(2,2)])
---
-isProperSubmapOfBy :: (a -> b -> Bool) -> IntMap a -> IntMap b -> Bool - --- | O(log n). Retrieves the maximal key of the map, and the map --- stripped of that element, or Nothing if passed an empty map. -maxView :: IntMap a -> Maybe (a, IntMap a) - --- | O(log n). Retrieves the minimal key of the map, and the map --- stripped of that element, or Nothing if passed an empty map. -minView :: IntMap a -> Maybe (a, IntMap a) - --- | O(log n). The minimal key of the map. -findMin :: IntMap a -> (Int, a) - --- | O(log n). The maximal key of the map. -findMax :: IntMap a -> (Int, a) - --- | O(log n). Delete the minimal key. An error is thrown if the --- IntMap is already empty. Note, this is not the same behavior Map. -deleteMin :: IntMap a -> IntMap a - --- | O(log n). Delete the maximal key. An error is thrown if the --- IntMap is already empty. Note, this is not the same behavior Map. -deleteMax :: IntMap a -> IntMap a - --- | O(log n). Delete and find the minimal element. -deleteFindMin :: IntMap a -> (a, IntMap a) - --- | O(log n). Delete and find the maximal element. -deleteFindMax :: IntMap a -> (a, IntMap a) - --- | O(log n). Update the value at the minimal key. --- --- 
---   updateMin (\ a -> Just ("X" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3, "Xb"), (5, "a")]
---   updateMin (\ _ -> Nothing)         (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"
---
-updateMin :: (a -> a) -> IntMap a -> IntMap a - --- | O(log n). Update the value at the maximal key. --- --- 
---   updateMax (\ a -> Just ("X" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "Xa")]
---   updateMax (\ _ -> Nothing)         (fromList [(5,"a"), (3,"b")]) == singleton 3 "b"
---
-updateMax :: (a -> a) -> IntMap a -> IntMap a - --- | O(log n). Update the value at the minimal key. --- --- 
---   updateMinWithKey (\ k a -> Just ((show k) ++ ":" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3,"3:b"), (5,"a")]
---   updateMinWithKey (\ _ _ -> Nothing)                     (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"
---
-updateMinWithKey :: (Key -> a -> a) -> IntMap a -> IntMap a - --- | O(log n). Update the value at the maximal key. --- --- 
---   updateMaxWithKey (\ k a -> Just ((show k) ++ ":" ++ a)) (fromList [(5,"a"), (3,"b")]) == fromList [(3,"b"), (5,"5:a")]
---   updateMaxWithKey (\ _ _ -> Nothing)                     (fromList [(5,"a"), (3,"b")]) == singleton 3 "b"
---
-updateMaxWithKey :: (Key -> a -> a) -> IntMap a -> IntMap a - --- | O(log n). Retrieves the minimal (key,value) pair of the map, --- and the map stripped of that element, or Nothing if passed an --- empty map. --- --- 
---   minViewWithKey (fromList [(5,"a"), (3,"b")]) == Just ((3,"b"), singleton 5 "a")
---   minViewWithKey empty == Nothing
---
-minViewWithKey :: IntMap a -> Maybe ((Key, a), IntMap a) - --- | O(log n). Retrieves the maximal (key,value) pair of the map, --- and the map stripped of that element, or Nothing if passed an --- empty map. --- --- 
---   maxViewWithKey (fromList [(5,"a"), (3,"b")]) == Just ((5,"a"), singleton 3 "b")
---   maxViewWithKey empty == Nothing
---
-maxViewWithKey :: IntMap a -> Maybe ((Key, a), IntMap a) - --- | O(n). Show the tree that implements the map. The tree is shown --- in a compressed, hanging format. -showTree :: Show a => IntMap a -> String - --- | O(n). The expression (showTreeWith hang wide --- map) shows the tree that implements the map. If hang is --- True, a hanging tree is shown otherwise a rotated tree --- is shown. If wide is True, an extra wide version is --- shown. -showTreeWith :: Show a => Bool -> Bool -> IntMap a -> String -instance Typeable1 IntMap -instance Read e => Read (IntMap e) -instance Show a => Show (IntMap a) -instance Functor IntMap -instance Ord a => Ord (IntMap a) -instance Eq a => Eq (IntMap a) -instance Data a => Data (IntMap a) -instance Traversable IntMap -instance Foldable IntMap -instance Monoid (IntMap a) - - --- | General purpose finite sequences. Apart from being finite and having --- strict operations, sequences also differ from lists in supporting a --- wider variety of operations efficiently. --- --- An amortized running time is given for each operation, with n --- referring to the length of the sequence and i being the --- integral index used by some operations. These bounds hold even in a --- persistent (shared) setting. --- --- The implementation uses 2-3 finger trees annotated with sizes, as --- described in section 4.2 of --- --- --- --- Note: Many of these operations have the same names as similar --- operations on lists in the Prelude. The ambiguity may be --- resolved using either qualification or the hiding clause. -module Data.Sequence - --- | General-purpose finite sequences. -data Seq a - --- | O(1). The empty sequence. -empty :: Seq a - --- | O(1). A singleton sequence. -singleton :: a -> Seq a - --- | O(1). Add an element to the left end of a sequence. Mnemonic: a --- triangle with the single element at the pointy end. -(<|) :: a -> Seq a -> Seq a - --- | O(1). Add an element to the right end of a sequence. Mnemonic: --- a triangle with the single element at the pointy end. -(|>) :: Seq a -> a -> Seq a - --- | O(log(min(n1,n2))). Concatenate two sequences. -(><) :: Seq a -> Seq a -> Seq a - --- | O(n). Create a sequence from a finite list of elements. There --- is a function toList in the opposite direction for all --- instances of the Foldable class, including Seq. -fromList :: [a] -> Seq a - --- | O(log n). replicate n x is a sequence consisting of --- n copies of x. -replicate :: Int -> a -> Seq a - --- | replicateA is an Applicative version of --- replicate, and makes O(log n) calls to <*> --- and pure. --- --- 
---   replicateA n x = sequenceA (replicate n x)
---
-replicateA :: Applicative f => Int -> f a -> f (Seq a) - --- | replicateM is a sequence counterpart of --- Control.Monad.replicateM. --- --- 
---   replicateM n x = sequence (replicate n x)
---
-replicateM :: Monad m => Int -> m a -> m (Seq a) - --- | O(n). Constructs a sequence by repeated application of a --- function to a seed value. --- --- 
---   iterateN n f x = fromList (Prelude.take n (Prelude.iterate f x))
---
-iterateN :: Int -> (a -> a) -> a -> Seq a - --- | Builds a sequence from a seed value. Takes time linear in the number --- of generated elements. WARNING: If the number of generated --- elements is infinite, this method will not terminate. -unfoldr :: (b -> Maybe (a, b)) -> b -> Seq a - --- | unfoldl f x is equivalent to reverse --- (unfoldr (swap . f) x). -unfoldl :: (b -> Maybe (b, a)) -> b -> Seq a - --- | O(1). Is this the empty sequence? -null :: Seq a -> Bool - --- | O(1). The number of elements in the sequence. -length :: Seq a -> Int - --- | View of the left end of a sequence. -data ViewL a - --- | empty sequence -EmptyL :: ViewL a - --- | leftmost element and the rest of the sequence -(:<) :: a -> Seq a -> ViewL a - --- | O(1). Analyse the left end of a sequence. -viewl :: Seq a -> ViewL a - --- | View of the right end of a sequence. -data ViewR a - --- | empty sequence -EmptyR :: ViewR a - --- | the sequence minus the rightmost element, and the rightmost element -(:>) :: Seq a -> a -> ViewR a - --- | O(1). Analyse the right end of a sequence. -viewr :: Seq a -> ViewR a - --- | scanl is similar to foldl, but returns a sequence of --- reduced values from the left: --- --- 
---   scanl f z (fromList [x1, x2, ...]) = fromList [z, z `f` x1, (z `f` x1) `f` x2, ...]
---
-scanl :: (a -> b -> a) -> a -> Seq b -> Seq a - --- | scanl1 is a variant of scanl that has no starting value --- argument: --- --- 
---   scanl1 f (fromList [x1, x2, ...]) = fromList [x1, x1 `f` x2, ...]
---
-scanl1 :: (a -> a -> a) -> Seq a -> Seq a - --- | scanr is the right-to-left dual of scanl. -scanr :: (a -> b -> b) -> b -> Seq a -> Seq b - --- | scanr1 is a variant of scanr that has no starting value --- argument. -scanr1 :: (a -> a -> a) -> Seq a -> Seq a - --- | O(n). Returns a sequence of all suffixes of this sequence, --- longest first. For example, --- --- 
---   tails (fromList "abc") = fromList [fromList "abc", fromList "bc", fromList "c", fromList ""]
---
--- --- Evaluating the ith suffix takes O(log(min(i, n-i))), but --- evaluating every suffix in the sequence takes O(n) due to --- sharing. -tails :: Seq a -> Seq (Seq a) - --- | O(n). Returns a sequence of all prefixes of this sequence, --- shortest first. For example, --- --- 
---   inits (fromList "abc") = fromList [fromList "", fromList "a", fromList "ab", fromList "abc"]
---
--- --- Evaluating the ith prefix takes O(log(min(i, n-i))), but --- evaluating every prefix in the sequence takes O(n) due to --- sharing. -inits :: Seq a -> Seq (Seq a) - --- | O(i) where i is the prefix length. takeWhileL, --- applied to a predicate p and a sequence xs, returns --- the longest prefix (possibly empty) of xs of elements that --- satisfy p. -takeWhileL :: (a -> Bool) -> Seq a -> Seq a - --- | O(i) where i is the suffix length. takeWhileR, --- applied to a predicate p and a sequence xs, returns --- the longest suffix (possibly empty) of xs of elements that --- satisfy p. --- --- takeWhileR p xs is equivalent to reverse --- (takeWhileL p (reverse xs)). -takeWhileR :: (a -> Bool) -> Seq a -> Seq a - --- | O(i) where i is the prefix length. dropWhileL --- p xs returns the suffix remaining after takeWhileL p --- xs. -dropWhileL :: (a -> Bool) -> Seq a -> Seq a - --- | O(i) where i is the suffix length. dropWhileR --- p xs returns the prefix remaining after takeWhileR p --- xs. --- --- dropWhileR p xs is equivalent to reverse --- (dropWhileL p (reverse xs)). -dropWhileR :: (a -> Bool) -> Seq a -> Seq a - --- | O(i) where i is the prefix length. spanl, applied --- to a predicate p and a sequence xs, returns a pair --- whose first element is the longest prefix (possibly empty) of --- xs of elements that satisfy p and the second element --- is the remainder of the sequence. -spanl :: (a -> Bool) -> Seq a -> (Seq a, Seq a) - --- | O(i) where i is the suffix length. spanr, applied --- to a predicate p and a sequence xs, returns a pair --- whose first element is the longest suffix (possibly --- empty) of xs of elements that satisfy p and the --- second element is the remainder of the sequence. -spanr :: (a -> Bool) -> Seq a -> (Seq a, Seq a) - --- | O(i) where i is the breakpoint index. breakl, --- applied to a predicate p and a sequence xs, returns --- a pair whose first element is the longest prefix (possibly empty) of --- xs of elements that do not satisfy p and the --- second element is the remainder of the sequence. --- --- breakl p is equivalent to spanl (not . --- p). -breakl :: (a -> Bool) -> Seq a -> (Seq a, Seq a) - --- | breakr p is equivalent to spanr (not . --- p). -breakr :: (a -> Bool) -> Seq a -> (Seq a, Seq a) - --- | O(n). The partition function takes a predicate --- p and a sequence xs and returns sequences of those --- elements which do and do not satisfy the predicate. -partition :: (a -> Bool) -> Seq a -> (Seq a, Seq a) - --- | O(n). The filter function takes a predicate p --- and a sequence xs and returns a sequence of those elements --- which satisfy the predicate. -filter :: (a -> Bool) -> Seq a -> Seq a - --- | O(n log n). sort sorts the specified Seq by the --- natural ordering of its elements. The sort is stable. If stability is --- not required, unstableSort can be considerably faster, and in --- particular uses less memory. -sort :: Ord a => Seq a -> Seq a - --- | O(n log n). sortBy sorts the specified Seq --- according to the specified comparator. The sort is stable. If --- stability is not required, unstableSortBy can be considerably --- faster, and in particular uses less memory. -sortBy :: (a -> a -> Ordering) -> Seq a -> Seq a - --- | O(n log n). unstableSort sorts the specified Seq --- by the natural ordering of its elements, but the sort is not stable. --- This algorithm is frequently faster and uses less memory than --- sort, and performs extremely well -- frequently twice as fast --- as sort -- when the sequence is already nearly sorted. -unstableSort :: Ord a => Seq a -> Seq a - --- | O(n log n). A generalization of unstableSort, --- unstableSortBy takes an arbitrary comparator and sorts the --- specified sequence. The sort is not stable. This algorithm is --- frequently faster and uses less memory than sortBy, and --- performs extremely well -- frequently twice as fast as sortBy --- -- when the sequence is already nearly sorted. -unstableSortBy :: (a -> a -> Ordering) -> Seq a -> Seq a - --- | O(log(min(i,n-i))). The element at the specified position, --- counting from 0. The argument should thus be a non-negative integer --- less than the size of the sequence. If the position is out of range, --- index fails with an error. -index :: Seq a -> Int -> a - --- | O(log(min(i,n-i))). Update the element at the specified --- position. If the position is out of range, the original sequence is --- returned. -adjust :: (a -> a) -> Int -> Seq a -> Seq a - --- | O(log(min(i,n-i))). Replace the element at the specified --- position. If the position is out of range, the original sequence is --- returned. -update :: Int -> a -> Seq a -> Seq a - --- | O(log(min(i,n-i))). The first i elements of a --- sequence. If i is negative, take i s yields --- the empty sequence. If the sequence contains fewer than i --- elements, the whole sequence is returned. -take :: Int -> Seq a -> Seq a - --- | O(log(min(i,n-i))). Elements of a sequence after the first --- i. If i is negative, drop i s yields --- the whole sequence. If the sequence contains fewer than i --- elements, the empty sequence is returned. -drop :: Int -> Seq a -> Seq a - --- | O(log(min(i,n-i))). Split a sequence at a given position. --- splitAt i s = (take i s, drop i s). -splitAt :: Int -> Seq a -> (Seq a, Seq a) - --- | elemIndexL finds the leftmost index of the specified element, --- if it is present, and otherwise Nothing. -elemIndexL :: Eq a => a -> Seq a -> Maybe Int - --- | elemIndicesL finds the indices of the specified element, from --- left to right (i.e. in ascending order). -elemIndicesL :: Eq a => a -> Seq a -> [Int] - --- | elemIndexR finds the rightmost index of the specified element, --- if it is present, and otherwise Nothing. -elemIndexR :: Eq a => a -> Seq a -> Maybe Int - --- | elemIndicesR finds the indices of the specified element, from --- right to left (i.e. in descending order). -elemIndicesR :: Eq a => a -> Seq a -> [Int] - --- | findIndexL p xs finds the index of the leftmost --- element that satisfies p, if any exist. -findIndexL :: (a -> Bool) -> Seq a -> Maybe Int - --- | findIndicesL p finds all indices of elements that --- satisfy p, in ascending order. -findIndicesL :: (a -> Bool) -> Seq a -> [Int] - --- | findIndexR p xs finds the index of the rightmost --- element that satisfies p, if any exist. -findIndexR :: (a -> Bool) -> Seq a -> Maybe Int - --- | findIndicesR p finds all indices of elements that --- satisfy p, in descending order. -findIndicesR :: (a -> Bool) -> Seq a -> [Int] - --- | foldlWithIndex is a version of foldl that also provides --- access to the index of each element. -foldlWithIndex :: (b -> Int -> a -> b) -> b -> Seq a -> b - --- | foldrWithIndex is a version of foldr that also provides --- access to the index of each element. -foldrWithIndex :: (Int -> a -> b -> b) -> b -> Seq a -> b - --- | A generalization of fmap, mapWithIndex takes a mapping --- function that also depends on the element's index, and applies it to --- every element in the sequence. -mapWithIndex :: (Int -> a -> b) -> Seq a -> Seq b - --- | O(n). The reverse of a sequence. -reverse :: Seq a -> Seq a - --- | O(min(n1,n2)). zip takes two sequences and returns a --- sequence of corresponding pairs. If one input is short, excess --- elements are discarded from the right end of the longer sequence. -zip :: Seq a -> Seq b -> Seq (a, b) - --- | O(min(n1,n2)). zipWith generalizes zip by zipping --- with the function given as the first argument, instead of a tupling --- function. For example, zipWith (+) is applied to two --- sequences to take the sequence of corresponding sums. -zipWith :: (a -> b -> c) -> Seq a -> Seq b -> Seq c - --- | O(min(n1,n2,n3)). zip3 takes three sequences and returns --- a sequence of triples, analogous to zip. -zip3 :: Seq a -> Seq b -> Seq c -> Seq (a, b, c) - --- | O(min(n1,n2,n3)). zipWith3 takes a function which --- combines three elements, as well as three sequences and returns a --- sequence of their point-wise combinations, analogous to --- zipWith. -zipWith3 :: (a -> b -> c -> d) -> Seq a -> Seq b -> Seq c -> Seq d - --- | O(min(n1,n2,n3,n4)). zip4 takes four sequences and --- returns a sequence of quadruples, analogous to zip. -zip4 :: Seq a -> Seq b -> Seq c -> Seq d -> Seq (a, b, c, d) - --- | O(min(n1,n2,n3,n4)). zipWith4 takes a function which --- combines four elements, as well as four sequences and returns a --- sequence of their point-wise combinations, analogous to --- zipWith. -zipWith4 :: (a -> b -> c -> d -> e) -> Seq a -> Seq b -> Seq c -> Seq d -> Seq e -instance Eq a => Eq (ViewR a) -instance Ord a => Ord (ViewR a) -instance Show a => Show (ViewR a) -instance Read a => Read (ViewR a) -instance Data a => Data (ViewR a) -instance Eq a => Eq (ViewL a) -instance Ord a => Ord (ViewL a) -instance Show a => Show (ViewL a) -instance Read a => Read (ViewL a) -instance Data a => Data (ViewL a) -instance Traversable ViewR -instance Foldable ViewR -instance Functor ViewR -instance Typeable1 ViewR -instance Traversable ViewL -instance Foldable ViewL -instance Functor ViewL -instance Typeable1 ViewL -instance Applicative (State s) -instance Monad (State s) -instance Functor (State s) -instance Applicative Id -instance Monad Id -instance Functor Id -instance Traversable Elem -instance Foldable Elem -instance Functor Elem -instance Sized (Elem a) -instance Sized (Node a) -instance Traversable Node -instance Functor Node -instance Foldable Node -instance Sized a => Sized (Digit a) -instance Traversable Digit -instance Functor Digit -instance Foldable Digit -instance Traversable FingerTree -instance Functor FingerTree -instance Foldable FingerTree -instance Sized a => Sized (FingerTree a) -instance Data a => Data (Seq a) -instance Typeable1 Seq -instance Monoid (Seq a) -instance Read a => Read (Seq a) -instance Show a => Show (Seq a) -instance Ord a => Ord (Seq a) -instance Eq a => Eq (Seq a) -instance MonadPlus Seq -instance Monad Seq -instance Traversable Seq -instance Foldable Seq -instance Functor Seq - - --- | Multi-way trees (aka rose trees) and forests. -module Data.Tree - --- | Multi-way trees, also known as rose trees. -data Tree a -Node :: a -> Forest a -> Tree a - --- | label value -rootLabel :: Tree a -> a - --- | zero or more child trees -subForest :: Tree a -> Forest a -type Forest a = [Tree a] - --- | Neat 2-dimensional drawing of a tree. -drawTree :: Tree String -> String - --- | Neat 2-dimensional drawing of a forest. -drawForest :: Forest String -> String - --- | The elements of a tree in pre-order. -flatten :: Tree a -> [a] - --- | Lists of nodes at each level of the tree. -levels :: Tree a -> [[a]] - --- | Build a tree from a seed value -unfoldTree :: (b -> (a, [b])) -> b -> Tree a - --- | Build a forest from a list of seed values -unfoldForest :: (b -> (a, [b])) -> [b] -> Forest a - --- | Monadic tree builder, in depth-first order -unfoldTreeM :: Monad m => (b -> m (a, [b])) -> b -> m (Tree a) - --- | Monadic forest builder, in depth-first order -unfoldForestM :: Monad m => (b -> m (a, [b])) -> [b] -> m (Forest a) - --- | Monadic tree builder, in breadth-first order, using an algorithm --- adapted from Breadth-First Numbering: Lessons from a Small Exercise --- in Algorithm Design, by Chris Okasaki, ICFP'00. -unfoldTreeM_BF :: Monad m => (b -> m (a, [b])) -> b -> m (Tree a) - --- | Monadic forest builder, in breadth-first order, using an algorithm --- adapted from Breadth-First Numbering: Lessons from a Small Exercise --- in Algorithm Design, by Chris Okasaki, ICFP'00. -unfoldForestM_BF :: Monad m => (b -> m (a, [b])) -> [b] -> m (Forest a) -instance Eq a => Eq (Tree a) -instance Read a => Read (Tree a) -instance Show a => Show (Tree a) -instance Data a => Data (Tree a) -instance Foldable Tree -instance Traversable Tree -instance Monad Tree -instance Applicative Tree -instance Functor Tree -instance Typeable1 Tree - - --- | A version of the graph algorithms described in: --- --- Lazy Depth-First Search and Linear Graph Algorithms in Haskell, --- by David King and John Launchbury. -module Data.Graph - --- | The strongly connected components of a directed graph, topologically --- sorted. -stronglyConnComp :: Ord key => [(node, key, [key])] -> [SCC node] - --- | The strongly connected components of a directed graph, topologically --- sorted. The function is the same as stronglyConnComp, except --- that all the information about each node retained. This interface is --- used when you expect to apply SCC to (some of) the result of --- SCC, so you don't want to lose the dependency information. -stronglyConnCompR :: Ord key => [(node, key, [key])] -> [SCC (node, key, [key])] - --- | Strongly connected component. -data SCC vertex - --- | A single vertex that is not in any cycle. -AcyclicSCC :: vertex -> SCC vertex - --- | A maximal set of mutually reachable vertices. -CyclicSCC :: [vertex] -> SCC vertex - --- | The vertices of a strongly connected component. -flattenSCC :: SCC vertex -> [vertex] - --- | The vertices of a list of strongly connected components. -flattenSCCs :: [SCC a] -> [a] - --- | Adjacency list representation of a graph, mapping each vertex to its --- list of successors. -type Graph = Table [Vertex] - --- | Table indexed by a contiguous set of vertices. -type Table a = Array Vertex a - --- | The bounds of a Table. -type Bounds = (Vertex, Vertex) - --- | An edge from the first vertex to the second. -type Edge = (Vertex, Vertex) - --- | Abstract representation of vertices. -type Vertex = Int - --- | Build a graph from a list of nodes uniquely identified by keys, with a --- list of keys of nodes this node should have edges to. The out-list may --- contain keys that don't correspond to nodes of the graph; they are --- ignored. -graphFromEdges :: Ord key => [(node, key, [key])] -> (Graph, Vertex -> (node, key, [key]), key -> Maybe Vertex) - --- | Identical to graphFromEdges, except that the return value does --- not include the function which maps keys to vertices. This version of --- graphFromEdges is for backwards compatibility. -graphFromEdges' :: Ord key => [(node, key, [key])] -> (Graph, Vertex -> (node, key, [key])) - --- | Build a graph from a list of edges. -buildG :: Bounds -> [Edge] -> Graph - --- | The graph obtained by reversing all edges. -transposeG :: Graph -> Graph - --- | All vertices of a graph. -vertices :: Graph -> [Vertex] - --- | All edges of a graph. -edges :: Graph -> [Edge] - --- | A table of the count of edges from each node. -outdegree :: Graph -> Table Int - --- | A table of the count of edges into each node. -indegree :: Graph -> Table Int - --- | A spanning forest of the part of the graph reachable from the listed --- vertices, obtained from a depth-first search of the graph starting at --- each of the listed vertices in order. -dfs :: Graph -> [Vertex] -> Forest Vertex - --- | A spanning forest of the graph, obtained from a depth-first search of --- the graph starting from each vertex in an unspecified order. -dff :: Graph -> Forest Vertex - --- | A topological sort of the graph. The order is partially specified by --- the condition that a vertex i precedes j whenever --- j is reachable from i but not vice versa. -topSort :: Graph -> [Vertex] - --- | The connected components of a graph. Two vertices are connected if --- there is a path between them, traversing edges in either direction. -components :: Graph -> Forest Vertex - --- | The strongly connected components of a graph. -scc :: Graph -> Forest Vertex - --- | The biconnected components of a graph. An undirected graph is --- biconnected if the deletion of any vertex leaves it connected. -bcc :: Graph -> Forest [Vertex] - --- | A list of vertices reachable from a given vertex. -reachable :: Graph -> Vertex -> [Vertex] - --- | Is the second vertex reachable from the first? -path :: Graph -> Vertex -> Vertex -> Bool -instance Monad (SetM s) diff --git a/data/ghc-mtl.txt b/data/ghc-mtl.txt deleted file mode 100644 --- a/data/ghc-mtl.txt +++ /dev/null @@ -1,56 +0,0 @@ --- Hoogle documentation, generated by Haddock --- See Hoogle, http://www.haskell.org/hoogle/ - - --- | An mtl compatible version of the Ghc-Api monads --- and monad-transformers. --- --- Provides an mtl compatible version of the GhcT --- monad-transformer defined in the 'GHC-API' since version 6.10.1. -@package ghc-mtl -@version 1.0.1.0 - -module Control.Monad.Ghc -data Ghc a -runGhc :: Maybe FilePath -> Ghc a -> IO a -data GhcT m a -runGhcT :: (Functor m, MonadCatchIO m) => Maybe FilePath -> GhcT m a -> m a - --- | A monad that has all the features needed by GHC API calls. --- --- In short, a GHC monad --- --- --- --- If you do not use Ghc or GhcT, make sure to call --- GHC.initGhcMonad before any call to the GHC API functions can --- occur. -class (Functor m, MonadIO m, WarnLogMonad m, ExceptionMonad m) => GhcMonad m :: (* -> *) -getSession :: GhcMonad m => m HscEnv -setSession :: GhcMonad m => HscEnv -> m () -instance Functor Ghc -instance Monad Ghc -instance WarnLogMonad Ghc -instance ExceptionMonad Ghc -instance MonadIO Ghc -instance GhcMonad Ghc -instance Functor m => Functor (MTLAdapter m) -instance Monad m => Monad (MTLAdapter m) -instance Functor m => Functor (GhcT m) -instance Monad m => Monad (GhcT m) -instance MonadCatchIO m => ExceptionMonad (MTLAdapter m) -instance MonadIO m => MonadIO (MTLAdapter m) -instance (Functor m, MonadCatchIO m) => GhcMonad (GhcT m) -instance MonadIO m => WarnLogMonad (GhcT m) -instance MonadCatchIO m => ExceptionMonad (GhcT m) -instance MonadCatchIO m => MonadCatchIO (GhcT m) -instance MonadIO m => MonadIO (GhcT m) -instance MonadIO m => MonadIO (GhcT m) -instance MonadTrans GhcT -instance MonadCatchIO Ghc -instance MonadIO Ghc diff --git a/data/ghc-prim.txt b/data/ghc-prim.txt deleted file mode 100644 --- a/data/ghc-prim.txt +++ /dev/null @@ -1,1158 +0,0 @@ --- Hoogle documentation, generated by Haddock --- See Hoogle, http://www.haskell.org/hoogle/ - - --- | GHC primitives --- --- GHC primitives. -@package ghc-prim - - --- | GHC magic. Use GHC.Exts from the base package instead of importing --- this module directly. -module GHC.Magic - --- | The call '(inline f)' reduces to f, but inline has a --- BuiltInRule that tries to inline f (if it has an unfolding) --- unconditionally The NOINLINE pragma arranges that inline only --- gets inlined (and hence eliminated) late in compilation, after the --- rule has had a good chance to fire. -inline :: a -> a - -module GHC.Generics -data Unit -Unit :: Unit -data (:+:) a b -Inl :: a -> :+: a b -Inr :: b -> :+: a b -data (:*:) a b -(:*:) :: a -> b -> :*: a b - - --- | GHC type definitions. Use GHC.Exts from the base package instead of --- importing this module directly. -module GHC.Types - --- | The character type Char is an enumeration whose values --- represent Unicode (or equivalently ISO/IEC 10646) characters (see --- http://www.unicode.org/ for details). This set extends the ISO --- 8859-1 (Latin-1) character set (the first 256 charachers), which is --- itself an extension of the ASCII character set (the first 128 --- characters). A character literal in Haskell has type Char. --- --- To convert a Char to or from the corresponding Int value --- defined by Unicode, use Prelude.toEnum and --- Prelude.fromEnum from the Prelude.Enum class --- respectively (or equivalently ord and chr). -data Char -C# :: Char# -> Char - --- | A fixed-precision integer type with at least the range [-2^29 .. --- 2^29-1]. The exact range for a given implementation can be --- determined by using Prelude.minBound and --- Prelude.maxBound from the Prelude.Bounded class. -data Int -I# :: Int# -> Int - --- | Single-precision floating point numbers. It is desirable that this --- type be at least equal in range and precision to the IEEE --- single-precision type. -data Float -F# :: Float# -> Float - --- | Double-precision floating point numbers. It is desirable that this --- type be at least equal in range and precision to the IEEE --- double-precision type. -data Double -D# :: Double# -> Double - --- | A value of type IO a is a computation which, when --- performed, does some I/O before returning a value of type a. --- --- There is really only one way to "perform" an I/O action: bind it to --- Main.main in your program. When your program is run, the I/O --- will be performed. It isn't possible to perform I/O from an arbitrary --- function, unless that function is itself in the IO monad and --- called at some point, directly or indirectly, from Main.main. --- --- IO is a monad, so IO actions can be combined using --- either the do-notation or the >> and >>= --- operations from the Monad class. -newtype IO a -IO :: (State# RealWorld -> (# State# RealWorld, a #)) -> IO a - -module GHC.Unit - --- | The unit datatype () has one non-undefined member, the --- nullary constructor (). -data () -() :: () - -module GHC.Debug -debugLn :: [Char] -> IO () -debugErrLn :: [Char] -> IO () - -module GHC.Ordering -data Ordering -LT :: Ordering -EQ :: Ordering -GT :: Ordering - - --- | The tuple data types -module GHC.Tuple -data (,) a b -(,) :: a -> b -> (,) a b -data (,,) a b c -(,,) :: a -> b -> c -> (,,) a b c -data (,,,) a b c d -(,,,) :: a -> b -> c -> d -> (,,,) a b c d -data (,,,,) a b c d e -(,,,,) :: a -> b -> c -> d -> e -> (,,,,) a b c d e -data (,,,,,) a b c d e f -(,,,,,) :: a -> b -> c -> d -> e -> f -> (,,,,,) a b c d e f -data (,,,,,,) a b c d e f g -(,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> (,,,,,,) a b c d e f g -data (,,,,,,,) a b c d e f g h -(,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> (,,,,,,,) a b c d e f g h -data (,,,,,,,,) a b c d e f g h i -(,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> (,,,,,,,,) a b c d e f g h i -data (,,,,,,,,,) a b c d e f g h i j -(,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> (,,,,,,,,,) a b c d e f g h i j -data (,,,,,,,,,,) a b c d e f g h i j k -(,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> (,,,,,,,,,,) a b c d e f g h i j k -data (,,,,,,,,,,,) a b c d e f g h i j k l -(,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> (,,,,,,,,,,,) a b c d e f g h i j k l -data (,,,,,,,,,,,,) a b c d e f g h i j k l m -(,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> (,,,,,,,,,,,,) a b c d e f g h i j k l m -data (,,,,,,,,,,,,,) a b c d e f g h i j k l m n -(,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> (,,,,,,,,,,,,,) a b c d e f g h i j k l m n -data (,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o -(,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> (,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o -data (,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p -(,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> (,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p -data (,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q -(,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> (,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q -data (,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r -(,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> (,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r -data (,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s -(,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> (,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s -data (,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t -(,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> (,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t -data (,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u -(,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> (,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u -data (,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v -(,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> (,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v -data (,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w -(,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> (,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w -data (,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x -(,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> (,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x -data (,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y -(,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> (,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y -data (,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z -(,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> (,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z -data (,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> l_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> l_ -> m_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> l_ -> m_ -> n_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> l_ -> m_ -> n_ -> o_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> l_ -> m_ -> n_ -> o_ -> p_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> l_ -> m_ -> n_ -> o_ -> p_ -> q_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> l_ -> m_ -> n_ -> o_ -> p_ -> q_ -> r_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> l_ -> m_ -> n_ -> o_ -> p_ -> q_ -> r_ -> s_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> l_ -> m_ -> n_ -> o_ -> p_ -> q_ -> r_ -> s_ -> t_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> l_ -> m_ -> n_ -> o_ -> p_ -> q_ -> r_ -> s_ -> t_ -> u_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> l_ -> m_ -> n_ -> o_ -> p_ -> q_ -> r_ -> s_ -> t_ -> u_ -> v_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> l_ -> m_ -> n_ -> o_ -> p_ -> q_ -> r_ -> s_ -> t_ -> u_ -> v_ -> w_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> l_ -> m_ -> n_ -> o_ -> p_ -> q_ -> r_ -> s_ -> t_ -> u_ -> v_ -> w_ -> x_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ y_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> l_ -> m_ -> n_ -> o_ -> p_ -> q_ -> r_ -> s_ -> t_ -> u_ -> v_ -> w_ -> x_ -> y_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ y_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ y_ z_ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> l_ -> m_ -> n_ -> o_ -> p_ -> q_ -> r_ -> s_ -> t_ -> u_ -> v_ -> w_ -> x_ -> y_ -> z_ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ y_ z_ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ y_ z_ a__ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> l_ -> m_ -> n_ -> o_ -> p_ -> q_ -> r_ -> s_ -> t_ -> u_ -> v_ -> w_ -> x_ -> y_ -> z_ -> a__ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ y_ z_ a__ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ y_ z_ a__ b__ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> l_ -> m_ -> n_ -> o_ -> p_ -> q_ -> r_ -> s_ -> t_ -> u_ -> v_ -> w_ -> x_ -> y_ -> z_ -> a__ -> b__ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ y_ z_ a__ b__ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ y_ z_ a__ b__ c__ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> l_ -> m_ -> n_ -> o_ -> p_ -> q_ -> r_ -> s_ -> t_ -> u_ -> v_ -> w_ -> x_ -> y_ -> z_ -> a__ -> b__ -> c__ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ y_ z_ a__ b__ c__ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ y_ z_ a__ b__ c__ d__ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> l_ -> m_ -> n_ -> o_ -> p_ -> q_ -> r_ -> s_ -> t_ -> u_ -> v_ -> w_ -> x_ -> y_ -> z_ -> a__ -> b__ -> c__ -> d__ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ y_ z_ a__ b__ c__ d__ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ y_ z_ a__ b__ c__ d__ e__ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> l_ -> m_ -> n_ -> o_ -> p_ -> q_ -> r_ -> s_ -> t_ -> u_ -> v_ -> w_ -> x_ -> y_ -> z_ -> a__ -> b__ -> c__ -> d__ -> e__ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ y_ z_ a__ b__ c__ d__ e__ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ y_ z_ a__ b__ c__ d__ e__ f__ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> l_ -> m_ -> n_ -> o_ -> p_ -> q_ -> r_ -> s_ -> t_ -> u_ -> v_ -> w_ -> x_ -> y_ -> z_ -> a__ -> b__ -> c__ -> d__ -> e__ -> f__ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ y_ z_ a__ b__ c__ d__ e__ f__ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ y_ z_ a__ b__ c__ d__ e__ f__ g__ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> l_ -> m_ -> n_ -> o_ -> p_ -> q_ -> r_ -> s_ -> t_ -> u_ -> v_ -> w_ -> x_ -> y_ -> z_ -> a__ -> b__ -> c__ -> d__ -> e__ -> f__ -> g__ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ y_ z_ a__ b__ c__ d__ e__ f__ g__ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ y_ z_ a__ b__ c__ d__ e__ f__ g__ h__ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> l_ -> m_ -> n_ -> o_ -> p_ -> q_ -> r_ -> s_ -> t_ -> u_ -> v_ -> w_ -> x_ -> y_ -> z_ -> a__ -> b__ -> c__ -> d__ -> e__ -> f__ -> g__ -> h__ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ y_ z_ a__ b__ c__ d__ e__ f__ g__ h__ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ y_ z_ a__ b__ c__ d__ e__ f__ g__ h__ i__ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> l_ -> m_ -> n_ -> o_ -> p_ -> q_ -> r_ -> s_ -> t_ -> u_ -> v_ -> w_ -> x_ -> y_ -> z_ -> a__ -> b__ -> c__ -> d__ -> e__ -> f__ -> g__ -> h__ -> i__ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ y_ z_ a__ b__ c__ d__ e__ f__ g__ h__ i__ -data (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ y_ z_ a__ b__ c__ d__ e__ f__ g__ h__ i__ j__ -(,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) :: a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t -> u -> v -> w -> x -> y -> z -> a_ -> b_ -> c_ -> d_ -> e_ -> f_ -> g_ -> h_ -> i_ -> j_ -> k_ -> l_ -> m_ -> n_ -> o_ -> p_ -> q_ -> r_ -> s_ -> t_ -> u_ -> v_ -> w_ -> x_ -> y_ -> z_ -> a__ -> b__ -> c__ -> d__ -> e__ -> f__ -> g__ -> h__ -> i__ -> j__ -> (,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,) a b c d e f g h i j k l m n o p q r s t u v w x y z a_ b_ c_ d_ e_ f_ g_ h_ i_ j_ k_ l_ m_ n_ o_ p_ q_ r_ s_ t_ u_ v_ w_ x_ y_ z_ a__ b__ c__ d__ e__ f__ g__ h__ i__ j__ - -module GHC.Bool -data Bool -False :: Bool -True :: Bool - - --- | GHC's primitive types and operations. Use GHC.Exts from the base --- package instead of importing this module directly. -module GHC.Prim -data Char# -gtChar# :: Char# -> Char# -> Bool -geChar# :: Char# -> Char# -> Bool -eqChar# :: Char# -> Char# -> Bool -neChar# :: Char# -> Char# -> Bool -ltChar# :: Char# -> Char# -> Bool -leChar# :: Char# -> Char# -> Bool -ord# :: Char# -> Int# -data Int# -(+#) :: Int# -> Int# -> Int# -(-#) :: Int# -> Int# -> Int# - --- | Low word of signed integer multiply. -(*#) :: Int# -> Int# -> Int# - --- | Return non-zero if there is any possibility that the upper word of a --- signed integer multiply might contain useful information. Return zero --- only if you are completely sure that no overflow can occur. On a --- 32-bit platform, the recommmended implementation is to do a 32 x 32 --- -> 64 signed multiply, and subtract result[63:32] from (result[31] --- >>signed 31). If this is zero, meaning that the upper word is --- merely a sign extension of the lower one, no overflow can occur. --- --- On a 64-bit platform it is not always possible to acquire the top 64 --- bits of the result. Therefore, a recommended implementation is to take --- the absolute value of both operands, and return 0 iff bits[63:31] of --- them are zero, since that means that their magnitudes fit within 31 --- bits, so the magnitude of the product must fit into 62 bits. --- --- If in doubt, return non-zero, but do make an effort to create the --- correct answer for small args, since otherwise the performance of --- (*) :: Integer -> Integer -> Integer will be poor. -mulIntMayOflo# :: Int# -> Int# -> Int# - --- | Rounds towards zero. -quotInt# :: Int# -> Int# -> Int# - --- | Satisfies (quotInt# x y) *# y +# (remInt# x y) == x. -remInt# :: Int# -> Int# -> Int# -negateInt# :: Int# -> Int# - --- | Add with carry. First member of result is (wrapped) sum; second member --- is 0 iff no overflow occured. -addIntC# :: Int# -> Int# -> (# Int#, Int# #) - --- | Subtract with carry. First member of result is (wrapped) difference; --- second member is 0 iff no overflow occured. -subIntC# :: Int# -> Int# -> (# Int#, Int# #) -(>#) :: Int# -> Int# -> Bool -(>=#) :: Int# -> Int# -> Bool -(==#) :: Int# -> Int# -> Bool -(/=#) :: Int# -> Int# -> Bool -(<#) :: Int# -> Int# -> Bool -(<=#) :: Int# -> Int# -> Bool -chr# :: Int# -> Char# -int2Word# :: Int# -> Word# -int2Float# :: Int# -> Float# -int2Double# :: Int# -> Double# - --- | Shift left. Result undefined if shift amount is not in the range 0 to --- word size - 1 inclusive. -uncheckedIShiftL# :: Int# -> Int# -> Int# - --- | Shift right arithmetic. Result undefined if shift amount is not in the --- range 0 to word size - 1 inclusive. -uncheckedIShiftRA# :: Int# -> Int# -> Int# - --- | Shift right logical. Result undefined if shift amount is not in the --- range 0 to word size - 1 inclusive. -uncheckedIShiftRL# :: Int# -> Int# -> Int# -data Word# -plusWord# :: Word# -> Word# -> Word# -minusWord# :: Word# -> Word# -> Word# -timesWord# :: Word# -> Word# -> Word# -quotWord# :: Word# -> Word# -> Word# -remWord# :: Word# -> Word# -> Word# -and# :: Word# -> Word# -> Word# -or# :: Word# -> Word# -> Word# -xor# :: Word# -> Word# -> Word# -not# :: Word# -> Word# - --- | Shift left logical. Result undefined if shift amount is not in the --- range 0 to word size - 1 inclusive. -uncheckedShiftL# :: Word# -> Int# -> Word# - --- | Shift right logical. Result undefined if shift amount is not in the --- range 0 to word size - 1 inclusive. -uncheckedShiftRL# :: Word# -> Int# -> Word# -word2Int# :: Word# -> Int# -gtWord# :: Word# -> Word# -> Bool -geWord# :: Word# -> Word# -> Bool -eqWord# :: Word# -> Word# -> Bool -neWord# :: Word# -> Word# -> Bool -ltWord# :: Word# -> Word# -> Bool -leWord# :: Word# -> Word# -> Bool -narrow8Int# :: Int# -> Int# -narrow16Int# :: Int# -> Int# -narrow32Int# :: Int# -> Int# -narrow8Word# :: Word# -> Word# -narrow16Word# :: Word# -> Word# -narrow32Word# :: Word# -> Word# -data Double# -(>##) :: Double# -> Double# -> Bool -(>=##) :: Double# -> Double# -> Bool -(==##) :: Double# -> Double# -> Bool -(/=##) :: Double# -> Double# -> Bool -(<##) :: Double# -> Double# -> Bool -(<=##) :: Double# -> Double# -> Bool -(+##) :: Double# -> Double# -> Double# -(-##) :: Double# -> Double# -> Double# -(*##) :: Double# -> Double# -> Double# -(/##) :: Double# -> Double# -> Double# -negateDouble# :: Double# -> Double# - --- | Truncates a Double. Results are undefined if the truncation --- if truncation yields a value outside the range of Int#. -double2Int# :: Double# -> Int# -double2Float# :: Double# -> Float# -expDouble# :: Double# -> Double# -logDouble# :: Double# -> Double# -sqrtDouble# :: Double# -> Double# -sinDouble# :: Double# -> Double# -cosDouble# :: Double# -> Double# -tanDouble# :: Double# -> Double# -asinDouble# :: Double# -> Double# -acosDouble# :: Double# -> Double# -atanDouble# :: Double# -> Double# -sinhDouble# :: Double# -> Double# -coshDouble# :: Double# -> Double# -tanhDouble# :: Double# -> Double# - --- | Exponentiation. -(**##) :: Double# -> Double# -> Double# - --- | Convert to integer. First component of the result is -1 or 1, --- indicating the sign of the mantissa. The next two are the high and low --- 32 bits of the mantissa respectively, and the last is the exponent. -decodeDouble_2Int# :: Double# -> (# Int#, Word#, Word#, Int# #) -data Float# -gtFloat# :: Float# -> Float# -> Bool -geFloat# :: Float# -> Float# -> Bool -eqFloat# :: Float# -> Float# -> Bool -neFloat# :: Float# -> Float# -> Bool -ltFloat# :: Float# -> Float# -> Bool -leFloat# :: Float# -> Float# -> Bool -plusFloat# :: Float# -> Float# -> Float# -minusFloat# :: Float# -> Float# -> Float# -timesFloat# :: Float# -> Float# -> Float# -divideFloat# :: Float# -> Float# -> Float# -negateFloat# :: Float# -> Float# - --- | Truncates a Float. Results are undefined if the truncation if --- truncation yields a value outside the range of Int#. -float2Int# :: Float# -> Int# -expFloat# :: Float# -> Float# -logFloat# :: Float# -> Float# -sqrtFloat# :: Float# -> Float# -sinFloat# :: Float# -> Float# -cosFloat# :: Float# -> Float# -tanFloat# :: Float# -> Float# -asinFloat# :: Float# -> Float# -acosFloat# :: Float# -> Float# -atanFloat# :: Float# -> Float# -sinhFloat# :: Float# -> Float# -coshFloat# :: Float# -> Float# -tanhFloat# :: Float# -> Float# -powerFloat# :: Float# -> Float# -> Float# -float2Double# :: Float# -> Double# - --- | Convert to integers. First Int# in result is the mantissa; --- second is the exponent. -decodeFloat_Int# :: Float# -> (# Int#, Int# #) -data Array# a -data MutableArray# s a - --- | Create a new mutable array with the specified number of elements, in --- the specified state thread, with each element containing the specified --- initial value. -newArray# :: Int# -> a -> State# s -> (# State# s, MutableArray# s a #) -sameMutableArray# :: MutableArray# s a -> MutableArray# s a -> Bool - --- | Read from specified index of mutable array. Result is not yet --- evaluated. -readArray# :: MutableArray# s a -> Int# -> State# s -> (# State# s, a #) - --- | Write to specified index of mutable array. -writeArray# :: MutableArray# s a -> Int# -> a -> State# s -> State# s - --- | Read from specified index of immutable array. Result is packaged into --- an unboxed singleton; the result itself is not yet evaluated. -indexArray# :: Array# a -> Int# -> (# a #) - --- | Make a mutable array immutable, without copying. -unsafeFreezeArray# :: MutableArray# s a -> State# s -> (# State# s, Array# a #) - --- | Make an immutable array mutable, without copying. -unsafeThawArray# :: Array# a -> State# s -> (# State# s, MutableArray# s a #) -data ByteArray# -data MutableByteArray# s - --- | Create a new mutable byte array of specified size (in bytes), in the --- specified state thread. -newByteArray# :: Int# -> State# s -> (# State# s, MutableByteArray# s #) - --- | Create a mutable byte array that the GC guarantees not to move. -newPinnedByteArray# :: Int# -> State# s -> (# State# s, MutableByteArray# s #) - --- | Create a mutable byte array, aligned by the specified amount, that the --- GC guarantees not to move. -newAlignedPinnedByteArray# :: Int# -> Int# -> State# s -> (# State# s, MutableByteArray# s #) - --- | Intended for use with pinned arrays; otherwise very unsafe! -byteArrayContents# :: ByteArray# -> Addr# -sameMutableByteArray# :: MutableByteArray# s -> MutableByteArray# s -> Bool - --- | Make a mutable byte array immutable, without copying. -unsafeFreezeByteArray# :: MutableByteArray# s -> State# s -> (# State# s, ByteArray# #) - --- | Return the size of the array in bytes. -sizeofByteArray# :: ByteArray# -> Int# - --- | Return the size of the array in bytes. -sizeofMutableByteArray# :: MutableByteArray# s -> Int# - --- | Read 8-bit character; offset in bytes. -indexCharArray# :: ByteArray# -> Int# -> Char# - --- | Read 31-bit character; offset in 4-byte words. -indexWideCharArray# :: ByteArray# -> Int# -> Char# -indexIntArray# :: ByteArray# -> Int# -> Int# -indexWordArray# :: ByteArray# -> Int# -> Word# -indexAddrArray# :: ByteArray# -> Int# -> Addr# -indexFloatArray# :: ByteArray# -> Int# -> Float# -indexDoubleArray# :: ByteArray# -> Int# -> Double# -indexStablePtrArray# :: ByteArray# -> Int# -> StablePtr# a -indexInt8Array# :: ByteArray# -> Int# -> Int# -indexInt16Array# :: ByteArray# -> Int# -> Int# -indexInt32Array# :: ByteArray# -> Int# -> Int# -indexInt64Array# :: ByteArray# -> Int# -> Int# -indexWord8Array# :: ByteArray# -> Int# -> Word# -indexWord16Array# :: ByteArray# -> Int# -> Word# -indexWord32Array# :: ByteArray# -> Int# -> Word# -indexWord64Array# :: ByteArray# -> Int# -> Word# - --- | Read 8-bit character; offset in bytes. -readCharArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Char# #) - --- | Read 31-bit character; offset in 4-byte words. -readWideCharArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Char# #) -readIntArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Int# #) -readWordArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Word# #) -readAddrArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Addr# #) -readFloatArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Float# #) -readDoubleArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Double# #) -readStablePtrArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, StablePtr# a #) -readInt8Array# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Int# #) -readInt16Array# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Int# #) -readInt32Array# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Int# #) -readInt64Array# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Int# #) -readWord8Array# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Word# #) -readWord16Array# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Word# #) -readWord32Array# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Word# #) -readWord64Array# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Word# #) - --- | Write 8-bit character; offset in bytes. -writeCharArray# :: MutableByteArray# s -> Int# -> Char# -> State# s -> State# s - --- | Write 31-bit character; offset in 4-byte words. -writeWideCharArray# :: MutableByteArray# s -> Int# -> Char# -> State# s -> State# s -writeIntArray# :: MutableByteArray# s -> Int# -> Int# -> State# s -> State# s -writeWordArray# :: MutableByteArray# s -> Int# -> Word# -> State# s -> State# s -writeAddrArray# :: MutableByteArray# s -> Int# -> Addr# -> State# s -> State# s -writeFloatArray# :: MutableByteArray# s -> Int# -> Float# -> State# s -> State# s -writeDoubleArray# :: MutableByteArray# s -> Int# -> Double# -> State# s -> State# s -writeStablePtrArray# :: MutableByteArray# s -> Int# -> StablePtr# a -> State# s -> State# s -writeInt8Array# :: MutableByteArray# s -> Int# -> Int# -> State# s -> State# s -writeInt16Array# :: MutableByteArray# s -> Int# -> Int# -> State# s -> State# s -writeInt32Array# :: MutableByteArray# s -> Int# -> Int# -> State# s -> State# s -writeInt64Array# :: MutableByteArray# s -> Int# -> Int# -> State# s -> State# s -writeWord8Array# :: MutableByteArray# s -> Int# -> Word# -> State# s -> State# s -writeWord16Array# :: MutableByteArray# s -> Int# -> Word# -> State# s -> State# s -writeWord32Array# :: MutableByteArray# s -> Int# -> Word# -> State# s -> State# s -writeWord64Array# :: MutableByteArray# s -> Int# -> Word# -> State# s -> State# s - --- | An arbitrary machine address assumed to point outside the --- garbage-collected heap. -data Addr# - --- | The null address. -nullAddr# :: Addr# -plusAddr# :: Addr# -> Int# -> Addr# - --- | Result is meaningless if two Addr#s are so far apart that --- their difference doesn't fit in an Int#. -minusAddr# :: Addr# -> Addr# -> Int# - --- | Return the remainder when the Addr# arg, treated like an --- Int#, is divided by the Int# arg. -remAddr# :: Addr# -> Int# -> Int# - --- | Coerce directly from address to int. Strongly deprecated. -addr2Int# :: Addr# -> Int# - --- | Coerce directly from int to address. Strongly deprecated. -int2Addr# :: Int# -> Addr# -gtAddr# :: Addr# -> Addr# -> Bool -geAddr# :: Addr# -> Addr# -> Bool -eqAddr# :: Addr# -> Addr# -> Bool -neAddr# :: Addr# -> Addr# -> Bool -ltAddr# :: Addr# -> Addr# -> Bool -leAddr# :: Addr# -> Addr# -> Bool - --- | Reads 8-bit character; offset in bytes. -indexCharOffAddr# :: Addr# -> Int# -> Char# - --- | Reads 31-bit character; offset in 4-byte words. -indexWideCharOffAddr# :: Addr# -> Int# -> Char# -indexIntOffAddr# :: Addr# -> Int# -> Int# -indexWordOffAddr# :: Addr# -> Int# -> Word# -indexAddrOffAddr# :: Addr# -> Int# -> Addr# -indexFloatOffAddr# :: Addr# -> Int# -> Float# -indexDoubleOffAddr# :: Addr# -> Int# -> Double# -indexStablePtrOffAddr# :: Addr# -> Int# -> StablePtr# a -indexInt8OffAddr# :: Addr# -> Int# -> Int# -indexInt16OffAddr# :: Addr# -> Int# -> Int# -indexInt32OffAddr# :: Addr# -> Int# -> Int# -indexInt64OffAddr# :: Addr# -> Int# -> Int# -indexWord8OffAddr# :: Addr# -> Int# -> Word# -indexWord16OffAddr# :: Addr# -> Int# -> Word# -indexWord32OffAddr# :: Addr# -> Int# -> Word# -indexWord64OffAddr# :: Addr# -> Int# -> Word# - --- | Reads 8-bit character; offset in bytes. -readCharOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Char# #) - --- | Reads 31-bit character; offset in 4-byte words. -readWideCharOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Char# #) -readIntOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Int# #) -readWordOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Word# #) -readAddrOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Addr# #) -readFloatOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Float# #) -readDoubleOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Double# #) -readStablePtrOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, StablePtr# a #) -readInt8OffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Int# #) -readInt16OffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Int# #) -readInt32OffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Int# #) -readInt64OffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Int# #) -readWord8OffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Word# #) -readWord16OffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Word# #) -readWord32OffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Word# #) -readWord64OffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Word# #) -writeCharOffAddr# :: Addr# -> Int# -> Char# -> State# s -> State# s -writeWideCharOffAddr# :: Addr# -> Int# -> Char# -> State# s -> State# s -writeIntOffAddr# :: Addr# -> Int# -> Int# -> State# s -> State# s -writeWordOffAddr# :: Addr# -> Int# -> Word# -> State# s -> State# s -writeAddrOffAddr# :: Addr# -> Int# -> Addr# -> State# s -> State# s -writeFloatOffAddr# :: Addr# -> Int# -> Float# -> State# s -> State# s -writeDoubleOffAddr# :: Addr# -> Int# -> Double# -> State# s -> State# s -writeStablePtrOffAddr# :: Addr# -> Int# -> StablePtr# a -> State# s -> State# s -writeInt8OffAddr# :: Addr# -> Int# -> Int# -> State# s -> State# s -writeInt16OffAddr# :: Addr# -> Int# -> Int# -> State# s -> State# s -writeInt32OffAddr# :: Addr# -> Int# -> Int# -> State# s -> State# s -writeInt64OffAddr# :: Addr# -> Int# -> Int# -> State# s -> State# s -writeWord8OffAddr# :: Addr# -> Int# -> Word# -> State# s -> State# s -writeWord16OffAddr# :: Addr# -> Int# -> Word# -> State# s -> State# s -writeWord32OffAddr# :: Addr# -> Int# -> Word# -> State# s -> State# s -writeWord64OffAddr# :: Addr# -> Int# -> Word# -> State# s -> State# s - --- | A MutVar# behaves like a single-element mutable array. -data MutVar# s a - --- | Create MutVar# with specified initial value in specified --- state thread. -newMutVar# :: a -> State# s -> (# State# s, MutVar# s a #) - --- | Read contents of MutVar#. Result is not yet evaluated. -readMutVar# :: MutVar# s a -> State# s -> (# State# s, a #) - --- | Write contents of MutVar#. -writeMutVar# :: MutVar# s a -> a -> State# s -> State# s -sameMutVar# :: MutVar# s a -> MutVar# s a -> Bool -atomicModifyMutVar# :: MutVar# s a -> (a -> b) -> State# s -> (# State# s, c #) -catch# :: (State# (RealWorld) -> (# State# (RealWorld), a #)) -> (b -> State# (RealWorld) -> (# State# (RealWorld), a #)) -> State# (RealWorld) -> (# State# (RealWorld), a #) -raise# :: a -> b -raiseIO# :: a -> State# (RealWorld) -> (# State# (RealWorld), b #) -maskAsyncExceptions# :: (State# (RealWorld) -> (# State# (RealWorld), a #)) -> State# (RealWorld) -> (# State# (RealWorld), a #) -maskUninterruptible# :: (State# (RealWorld) -> (# State# (RealWorld), a #)) -> State# (RealWorld) -> (# State# (RealWorld), a #) -unmaskAsyncExceptions# :: (State# (RealWorld) -> (# State# (RealWorld), a #)) -> State# (RealWorld) -> (# State# (RealWorld), a #) -getMaskingState# :: State# (RealWorld) -> (# State# (RealWorld), Int# #) -data TVar# s a -atomically# :: (State# (RealWorld) -> (# State# (RealWorld), a #)) -> State# (RealWorld) -> (# State# (RealWorld), a #) -retry# :: State# (RealWorld) -> (# State# (RealWorld), a #) -catchRetry# :: (State# (RealWorld) -> (# State# (RealWorld), a #)) -> (State# (RealWorld) -> (# State# (RealWorld), a #)) -> State# (RealWorld) -> (# State# (RealWorld), a #) -catchSTM# :: (State# (RealWorld) -> (# State# (RealWorld), a #)) -> (b -> State# (RealWorld) -> (# State# (RealWorld), a #)) -> State# (RealWorld) -> (# State# (RealWorld), a #) -check# :: (State# (RealWorld) -> (# State# (RealWorld), a #)) -> State# (RealWorld) -> (# State# (RealWorld), () #) - --- | Create a new TVar# holding a specified initial value. -newTVar# :: a -> State# s -> (# State# s, TVar# s a #) - --- | Read contents of TVar#. Result is not yet evaluated. -readTVar# :: TVar# s a -> State# s -> (# State# s, a #) - --- | Read contents of TVar# outside an STM transaction -readTVarIO# :: TVar# s a -> State# s -> (# State# s, a #) - --- | Write contents of TVar#. -writeTVar# :: TVar# s a -> a -> State# s -> State# s -sameTVar# :: TVar# s a -> TVar# s a -> Bool - --- | A shared mutable variable (not the same as a --- MutVar#!). (Note: in a non-concurrent implementation, --- (MVar# a) can be represented by (MutVar# (Maybe --- a)).) -data MVar# s a - --- | Create new MVar#; initially empty. -newMVar# :: State# s -> (# State# s, MVar# s a #) - --- | If MVar# is empty, block until it becomes full. Then remove --- and return its contents, and set it empty. -takeMVar# :: MVar# s a -> State# s -> (# State# s, a #) - --- | If MVar# is empty, immediately return with integer 0 and --- value undefined. Otherwise, return with integer 1 and contents of --- MVar#, and set MVar# empty. -tryTakeMVar# :: MVar# s a -> State# s -> (# State# s, Int#, a #) - --- | If MVar# is full, block until it becomes empty. Then store --- value arg as its new contents. -putMVar# :: MVar# s a -> a -> State# s -> State# s - --- | If MVar# is full, immediately return with integer 0. --- Otherwise, store value arg as MVar#'s new contents, and --- return with integer 1. -tryPutMVar# :: MVar# s a -> a -> State# s -> (# State# s, Int# #) -sameMVar# :: MVar# s a -> MVar# s a -> Bool - --- | Return 1 if MVar# is empty; 0 otherwise. -isEmptyMVar# :: MVar# s a -> State# s -> (# State# s, Int# #) - --- | Sleep specified number of microseconds. -delay# :: Int# -> State# s -> State# s - --- | Block until input is available on specified file descriptor. -waitRead# :: Int# -> State# s -> State# s - --- | Block until output is possible on specified file descriptor. -waitWrite# :: Int# -> State# s -> State# s - --- | State# is the primitive, unlifted type of states. It has one --- type parameter, thus State# RealWorld, or State# s, --- where s is a type variable. The only purpose of the type parameter is --- to keep different state threads separate. It is represented by nothing --- at all. -data State# s - --- | RealWorld is deeply magical. It is primitive, but it --- is not unlifted (hence ptrArg). We never manipulate --- values of type RealWorld; it's only used in the type system, --- to parameterise State#. -data RealWorld - --- | (In a non-concurrent implementation, this can be a singleton type, --- whose (unique) value is returned by myThreadId#. The other --- operations can be omitted.) -data ThreadId# -fork# :: a -> State# (RealWorld) -> (# State# (RealWorld), ThreadId# #) -forkOn# :: Int# -> a -> State# (RealWorld) -> (# State# (RealWorld), ThreadId# #) -killThread# :: ThreadId# -> a -> State# (RealWorld) -> State# (RealWorld) -yield# :: State# (RealWorld) -> State# (RealWorld) -myThreadId# :: State# (RealWorld) -> (# State# (RealWorld), ThreadId# #) -labelThread# :: ThreadId# -> Addr# -> State# (RealWorld) -> State# (RealWorld) -isCurrentThreadBound# :: State# (RealWorld) -> (# State# (RealWorld), Int# #) -noDuplicate# :: State# (RealWorld) -> State# (RealWorld) -threadStatus# :: ThreadId# -> State# (RealWorld) -> (# State# (RealWorld), Int# #) -data Weak# b -mkWeak# :: o -> b -> c -> State# (RealWorld) -> (# State# (RealWorld), Weak# b #) -mkWeakForeignEnv# :: o -> b -> Addr# -> Addr# -> Int# -> Addr# -> State# (RealWorld) -> (# State# (RealWorld), Weak# b #) -deRefWeak# :: Weak# a -> State# (RealWorld) -> (# State# (RealWorld), Int#, a #) -finalizeWeak# :: Weak# a -> State# (RealWorld) -> (# State# (RealWorld), Int#, State# (RealWorld) -> (# State# (RealWorld), () #) #) -touch# :: o -> State# (RealWorld) -> State# (RealWorld) -data StablePtr# a -data StableName# a -makeStablePtr# :: a -> State# (RealWorld) -> (# State# (RealWorld), StablePtr# a #) -deRefStablePtr# :: StablePtr# a -> State# (RealWorld) -> (# State# (RealWorld), a #) -eqStablePtr# :: StablePtr# a -> StablePtr# a -> Int# -makeStableName# :: a -> State# (RealWorld) -> (# State# (RealWorld), StableName# a #) -eqStableName# :: StableName# a -> StableName# a -> Int# -stableNameToInt# :: StableName# a -> Int# -reallyUnsafePtrEquality# :: a -> a -> Int# -par# :: a -> Int# -getSpark# :: State# s -> (# State# s, Int#, a #) - --- | Returns the number of sparks in the local spark pool. -numSparks# :: State# s -> (# State# s, Int# #) -parGlobal# :: a -> Int# -> Int# -> Int# -> Int# -> b -> Int# -parLocal# :: a -> Int# -> Int# -> Int# -> Int# -> b -> Int# -parAt# :: b -> a -> Int# -> Int# -> Int# -> Int# -> c -> Int# -parAtAbs# :: a -> Int# -> Int# -> Int# -> Int# -> Int# -> b -> Int# -parAtRel# :: a -> Int# -> Int# -> Int# -> Int# -> Int# -> b -> Int# -parAtForNow# :: b -> a -> Int# -> Int# -> Int# -> Int# -> c -> Int# -dataToTag# :: a -> Int# -tagToEnum# :: Int# -> a - --- | Primitive bytecode type. -data BCO# - --- | Convert an Addr# to a followable type. -addrToHValue# :: Addr# -> (# a #) -mkApUpd0# :: BCO# -> (# a #) -newBCO# :: ByteArray# -> ByteArray# -> Array# a -> Int# -> ByteArray# -> State# s -> (# State# s, BCO# #) -unpackClosure# :: a -> (# Addr#, Array# b, ByteArray# #) -getApStackVal# :: a -> Int# -> (# Int#, b #) -traceCcs# :: a -> b -> b - --- | Evaluates its first argument to head normal form, and then returns its --- second argument as the result. -seq :: a -> b -> b - --- | The call (inline f) arranges that f is inlined, regardless of --- its size. More precisely, the call (inline f) rewrites to the --- right-hand side of f's definition. This allows the programmer --- to control inlining from a particular call site rather than the --- definition site of the function (c.f. INLINE pragmas in --- User's Guide, Section 7.10.3, "INLINE and NOINLINE pragmas"). --- --- This inlining occurs regardless of the argument to the call or the --- size of f's definition; it is unconditional. The main caveat --- is that f's definition must be visible to the compiler. That --- is, f must be let-bound in the current scope. If no --- inlining takes place, the inline function expands to the --- identity function in Phase zero; so its use imposes no overhead. --- --- It is good practice to mark the function with an INLINABLE pragma at --- its definition, (a) so that GHC guarantees to expose its unfolding --- regardless of size, and (b) so that you have control over exactly what --- is inlined. -inline :: a -> a - --- | The lazy function restrains strictness analysis a little. The --- call (lazy e) means the same as e, but lazy --- has a magical property so far as strictness analysis is concerned: it --- is lazy in its first argument, even though its semantics is strict. --- After strictness analysis has run, calls to lazy are inlined --- to be the identity function. --- --- This behaviour is occasionally useful when controlling evaluation --- order. Notably, lazy is used in the library definition of --- Control.Parallel.par: --- --- 
---   par :: a -> b -> b
---
--- --- 
---   par x y = case (par# x) of _ -> lazy y
---
--- --- If lazy were not lazy, par would look strict in --- y which would defeat the whole purpose of par. --- --- Like seq, the argument of lazy can have an unboxed --- type. -lazy :: a -> a - --- | The type constructor Any is type to which you can unsafely --- coerce any lifted type, and back. --- --- --- --- It's also used to instantiate un-constrained type variables after type --- checking. For example --- --- 
---   length Any []
---
--- --- Annoyingly, we sometimes need Anys of other kinds, such as --- (* -> *) etc. This is a bit like tuples. We define a --- couple of useful ones here, and make others up on the fly. If any of --- these others end up being exported into interface files, we'll get a --- crash; at least until we add interface-file syntax to support them. -data Any a - --- | The function unsafeCoerce# allows you to side-step the --- typechecker entirely. That is, it allows you to coerce any type into --- any other type. If you use this function, you had better get it right, --- otherwise segmentation faults await. It is generally used when you --- want to write a program that you know is well-typed, but where --- Haskell's type system is not expressive enough to prove that it is --- well typed. --- --- The following uses of unsafeCoerce# are supposed to work --- (i.e. not lead to spurious compile-time or run-time crashes): --- --- --- --- Other uses of unsafeCoerce# are undefined. In particular, you --- should not use unsafeCoerce# to cast a T to an algebraic data --- type D, unless T is also an algebraic data type. For example, do not --- cast Int->Int to Bool, even if you later cast --- that Bool back to Int->Int before applying it. --- The reasons have to do with GHC's internal representation details (for --- the congnoscenti, data values can be entered but function closures --- cannot). If you want a safe type to cast things to, use Any, --- which is not an algebraic data type. -unsafeCoerce# :: a -> b - --- | Emits an event via the RTS tracing framework. The contents of the --- event is the zero-terminated byte string passed as the first argument. --- The event will be emitted either to the .eventlog file, or to stderr, --- depending on the runtime RTS flags. -traceEvent# :: Addr# -> State# s -> State# s - -module GHC.PrimopWrappers -gtChar# :: Char# -> Char# -> Bool -geChar# :: Char# -> Char# -> Bool -eqChar# :: Char# -> Char# -> Bool -neChar# :: Char# -> Char# -> Bool -ltChar# :: Char# -> Char# -> Bool -leChar# :: Char# -> Char# -> Bool -ord# :: Char# -> Int# -(+#) :: Int# -> Int# -> Int# -(-#) :: Int# -> Int# -> Int# -(*#) :: Int# -> Int# -> Int# -mulIntMayOflo# :: Int# -> Int# -> Int# -quotInt# :: Int# -> Int# -> Int# -remInt# :: Int# -> Int# -> Int# -negateInt# :: Int# -> Int# -addIntC# :: Int# -> Int# -> (# Int#, Int# #) -subIntC# :: Int# -> Int# -> (# Int#, Int# #) -(>#) :: Int# -> Int# -> Bool -(>=#) :: Int# -> Int# -> Bool -(==#) :: Int# -> Int# -> Bool -(/=#) :: Int# -> Int# -> Bool -(<#) :: Int# -> Int# -> Bool -(<=#) :: Int# -> Int# -> Bool -chr# :: Int# -> Char# -int2Word# :: Int# -> Word# -int2Float# :: Int# -> Float# -int2Double# :: Int# -> Double# -uncheckedIShiftL# :: Int# -> Int# -> Int# -uncheckedIShiftRA# :: Int# -> Int# -> Int# -uncheckedIShiftRL# :: Int# -> Int# -> Int# -plusWord# :: Word# -> Word# -> Word# -minusWord# :: Word# -> Word# -> Word# -timesWord# :: Word# -> Word# -> Word# -quotWord# :: Word# -> Word# -> Word# -remWord# :: Word# -> Word# -> Word# -and# :: Word# -> Word# -> Word# -or# :: Word# -> Word# -> Word# -xor# :: Word# -> Word# -> Word# -not# :: Word# -> Word# -uncheckedShiftL# :: Word# -> Int# -> Word# -uncheckedShiftRL# :: Word# -> Int# -> Word# -word2Int# :: Word# -> Int# -gtWord# :: Word# -> Word# -> Bool -geWord# :: Word# -> Word# -> Bool -eqWord# :: Word# -> Word# -> Bool -neWord# :: Word# -> Word# -> Bool -ltWord# :: Word# -> Word# -> Bool -leWord# :: Word# -> Word# -> Bool -narrow8Int# :: Int# -> Int# -narrow16Int# :: Int# -> Int# -narrow32Int# :: Int# -> Int# -narrow8Word# :: Word# -> Word# -narrow16Word# :: Word# -> Word# -narrow32Word# :: Word# -> Word# -(>##) :: Double# -> Double# -> Bool -(>=##) :: Double# -> Double# -> Bool -(==##) :: Double# -> Double# -> Bool -(/=##) :: Double# -> Double# -> Bool -(<##) :: Double# -> Double# -> Bool -(<=##) :: Double# -> Double# -> Bool -(+##) :: Double# -> Double# -> Double# -(-##) :: Double# -> Double# -> Double# -(*##) :: Double# -> Double# -> Double# -(/##) :: Double# -> Double# -> Double# -negateDouble# :: Double# -> Double# -double2Int# :: Double# -> Int# -double2Float# :: Double# -> Float# -expDouble# :: Double# -> Double# -logDouble# :: Double# -> Double# -sqrtDouble# :: Double# -> Double# -sinDouble# :: Double# -> Double# -cosDouble# :: Double# -> Double# -tanDouble# :: Double# -> Double# -asinDouble# :: Double# -> Double# -acosDouble# :: Double# -> Double# -atanDouble# :: Double# -> Double# -sinhDouble# :: Double# -> Double# -coshDouble# :: Double# -> Double# -tanhDouble# :: Double# -> Double# -(**##) :: Double# -> Double# -> Double# -decodeDouble_2Int# :: Double# -> (# Int#, Word#, Word#, Int# #) -gtFloat# :: Float# -> Float# -> Bool -geFloat# :: Float# -> Float# -> Bool -eqFloat# :: Float# -> Float# -> Bool -neFloat# :: Float# -> Float# -> Bool -ltFloat# :: Float# -> Float# -> Bool -leFloat# :: Float# -> Float# -> Bool -plusFloat# :: Float# -> Float# -> Float# -minusFloat# :: Float# -> Float# -> Float# -timesFloat# :: Float# -> Float# -> Float# -divideFloat# :: Float# -> Float# -> Float# -negateFloat# :: Float# -> Float# -float2Int# :: Float# -> Int# -expFloat# :: Float# -> Float# -logFloat# :: Float# -> Float# -sqrtFloat# :: Float# -> Float# -sinFloat# :: Float# -> Float# -cosFloat# :: Float# -> Float# -tanFloat# :: Float# -> Float# -asinFloat# :: Float# -> Float# -acosFloat# :: Float# -> Float# -atanFloat# :: Float# -> Float# -sinhFloat# :: Float# -> Float# -coshFloat# :: Float# -> Float# -tanhFloat# :: Float# -> Float# -powerFloat# :: Float# -> Float# -> Float# -float2Double# :: Float# -> Double# -decodeFloat_Int# :: Float# -> (# Int#, Int# #) -newArray# :: Int# -> a -> State# s -> (# State# s, MutableArray# s a #) -sameMutableArray# :: MutableArray# s a -> MutableArray# s a -> Bool -readArray# :: MutableArray# s a -> Int# -> State# s -> (# State# s, a #) -writeArray# :: MutableArray# s a -> Int# -> a -> State# s -> State# s -indexArray# :: Array# a -> Int# -> (# a #) -unsafeFreezeArray# :: MutableArray# s a -> State# s -> (# State# s, Array# a #) -unsafeThawArray# :: Array# a -> State# s -> (# State# s, MutableArray# s a #) -newByteArray# :: Int# -> State# s -> (# State# s, MutableByteArray# s #) -newPinnedByteArray# :: Int# -> State# s -> (# State# s, MutableByteArray# s #) -newAlignedPinnedByteArray# :: Int# -> Int# -> State# s -> (# State# s, MutableByteArray# s #) -byteArrayContents# :: ByteArray# -> Addr# -sameMutableByteArray# :: MutableByteArray# s -> MutableByteArray# s -> Bool -unsafeFreezeByteArray# :: MutableByteArray# s -> State# s -> (# State# s, ByteArray# #) -sizeofByteArray# :: ByteArray# -> Int# -sizeofMutableByteArray# :: MutableByteArray# s -> Int# -indexCharArray# :: ByteArray# -> Int# -> Char# -indexWideCharArray# :: ByteArray# -> Int# -> Char# -indexIntArray# :: ByteArray# -> Int# -> Int# -indexWordArray# :: ByteArray# -> Int# -> Word# -indexAddrArray# :: ByteArray# -> Int# -> Addr# -indexFloatArray# :: ByteArray# -> Int# -> Float# -indexDoubleArray# :: ByteArray# -> Int# -> Double# -indexStablePtrArray# :: ByteArray# -> Int# -> StablePtr# a -indexInt8Array# :: ByteArray# -> Int# -> Int# -indexInt16Array# :: ByteArray# -> Int# -> Int# -indexInt32Array# :: ByteArray# -> Int# -> Int# -indexInt64Array# :: ByteArray# -> Int# -> Int# -indexWord8Array# :: ByteArray# -> Int# -> Word# -indexWord16Array# :: ByteArray# -> Int# -> Word# -indexWord32Array# :: ByteArray# -> Int# -> Word# -indexWord64Array# :: ByteArray# -> Int# -> Word# -readCharArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Char# #) -readWideCharArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Char# #) -readIntArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Int# #) -readWordArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Word# #) -readAddrArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Addr# #) -readFloatArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Float# #) -readDoubleArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Double# #) -readStablePtrArray# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, StablePtr# a #) -readInt8Array# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Int# #) -readInt16Array# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Int# #) -readInt32Array# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Int# #) -readInt64Array# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Int# #) -readWord8Array# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Word# #) -readWord16Array# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Word# #) -readWord32Array# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Word# #) -readWord64Array# :: MutableByteArray# s -> Int# -> State# s -> (# State# s, Word# #) -writeCharArray# :: MutableByteArray# s -> Int# -> Char# -> State# s -> State# s -writeWideCharArray# :: MutableByteArray# s -> Int# -> Char# -> State# s -> State# s -writeIntArray# :: MutableByteArray# s -> Int# -> Int# -> State# s -> State# s -writeWordArray# :: MutableByteArray# s -> Int# -> Word# -> State# s -> State# s -writeAddrArray# :: MutableByteArray# s -> Int# -> Addr# -> State# s -> State# s -writeFloatArray# :: MutableByteArray# s -> Int# -> Float# -> State# s -> State# s -writeDoubleArray# :: MutableByteArray# s -> Int# -> Double# -> State# s -> State# s -writeStablePtrArray# :: MutableByteArray# s -> Int# -> StablePtr# a -> State# s -> State# s -writeInt8Array# :: MutableByteArray# s -> Int# -> Int# -> State# s -> State# s -writeInt16Array# :: MutableByteArray# s -> Int# -> Int# -> State# s -> State# s -writeInt32Array# :: MutableByteArray# s -> Int# -> Int# -> State# s -> State# s -writeInt64Array# :: MutableByteArray# s -> Int# -> Int# -> State# s -> State# s -writeWord8Array# :: MutableByteArray# s -> Int# -> Word# -> State# s -> State# s -writeWord16Array# :: MutableByteArray# s -> Int# -> Word# -> State# s -> State# s -writeWord32Array# :: MutableByteArray# s -> Int# -> Word# -> State# s -> State# s -writeWord64Array# :: MutableByteArray# s -> Int# -> Word# -> State# s -> State# s -plusAddr# :: Addr# -> Int# -> Addr# -minusAddr# :: Addr# -> Addr# -> Int# -remAddr# :: Addr# -> Int# -> Int# -addr2Int# :: Addr# -> Int# -int2Addr# :: Int# -> Addr# -gtAddr# :: Addr# -> Addr# -> Bool -geAddr# :: Addr# -> Addr# -> Bool -eqAddr# :: Addr# -> Addr# -> Bool -neAddr# :: Addr# -> Addr# -> Bool -ltAddr# :: Addr# -> Addr# -> Bool -leAddr# :: Addr# -> Addr# -> Bool -indexCharOffAddr# :: Addr# -> Int# -> Char# -indexWideCharOffAddr# :: Addr# -> Int# -> Char# -indexIntOffAddr# :: Addr# -> Int# -> Int# -indexWordOffAddr# :: Addr# -> Int# -> Word# -indexAddrOffAddr# :: Addr# -> Int# -> Addr# -indexFloatOffAddr# :: Addr# -> Int# -> Float# -indexDoubleOffAddr# :: Addr# -> Int# -> Double# -indexStablePtrOffAddr# :: Addr# -> Int# -> StablePtr# a -indexInt8OffAddr# :: Addr# -> Int# -> Int# -indexInt16OffAddr# :: Addr# -> Int# -> Int# -indexInt32OffAddr# :: Addr# -> Int# -> Int# -indexInt64OffAddr# :: Addr# -> Int# -> Int# -indexWord8OffAddr# :: Addr# -> Int# -> Word# -indexWord16OffAddr# :: Addr# -> Int# -> Word# -indexWord32OffAddr# :: Addr# -> Int# -> Word# -indexWord64OffAddr# :: Addr# -> Int# -> Word# -readCharOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Char# #) -readWideCharOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Char# #) -readIntOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Int# #) -readWordOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Word# #) -readAddrOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Addr# #) -readFloatOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Float# #) -readDoubleOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Double# #) -readStablePtrOffAddr# :: Addr# -> Int# -> State# s -> (# State# s, StablePtr# a #) -readInt8OffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Int# #) -readInt16OffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Int# #) -readInt32OffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Int# #) -readInt64OffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Int# #) -readWord8OffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Word# #) -readWord16OffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Word# #) -readWord32OffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Word# #) -readWord64OffAddr# :: Addr# -> Int# -> State# s -> (# State# s, Word# #) -writeCharOffAddr# :: Addr# -> Int# -> Char# -> State# s -> State# s -writeWideCharOffAddr# :: Addr# -> Int# -> Char# -> State# s -> State# s -writeIntOffAddr# :: Addr# -> Int# -> Int# -> State# s -> State# s -writeWordOffAddr# :: Addr# -> Int# -> Word# -> State# s -> State# s -writeAddrOffAddr# :: Addr# -> Int# -> Addr# -> State# s -> State# s -writeFloatOffAddr# :: Addr# -> Int# -> Float# -> State# s -> State# s -writeDoubleOffAddr# :: Addr# -> Int# -> Double# -> State# s -> State# s -writeStablePtrOffAddr# :: Addr# -> Int# -> StablePtr# a -> State# s -> State# s -writeInt8OffAddr# :: Addr# -> Int# -> Int# -> State# s -> State# s -writeInt16OffAddr# :: Addr# -> Int# -> Int# -> State# s -> State# s -writeInt32OffAddr# :: Addr# -> Int# -> Int# -> State# s -> State# s -writeInt64OffAddr# :: Addr# -> Int# -> Int# -> State# s -> State# s -writeWord8OffAddr# :: Addr# -> Int# -> Word# -> State# s -> State# s -writeWord16OffAddr# :: Addr# -> Int# -> Word# -> State# s -> State# s -writeWord32OffAddr# :: Addr# -> Int# -> Word# -> State# s -> State# s -writeWord64OffAddr# :: Addr# -> Int# -> Word# -> State# s -> State# s -newMutVar# :: a -> State# s -> (# State# s, MutVar# s a #) -readMutVar# :: MutVar# s a -> State# s -> (# State# s, a #) -writeMutVar# :: MutVar# s a -> a -> State# s -> State# s -sameMutVar# :: MutVar# s a -> MutVar# s a -> Bool -atomicModifyMutVar# :: MutVar# s a -> (a -> b) -> State# s -> (# State# s, c #) -catch# :: (State# (RealWorld) -> (# State# (RealWorld), a #)) -> (b -> State# (RealWorld) -> (# State# (RealWorld), a #)) -> State# (RealWorld) -> (# State# (RealWorld), a #) -raise# :: a -> b -raiseIO# :: a -> State# (RealWorld) -> (# State# (RealWorld), b #) -maskAsyncExceptions# :: (State# (RealWorld) -> (# State# (RealWorld), a #)) -> State# (RealWorld) -> (# State# (RealWorld), a #) -maskUninterruptible# :: (State# (RealWorld) -> (# State# (RealWorld), a #)) -> State# (RealWorld) -> (# State# (RealWorld), a #) -unmaskAsyncExceptions# :: (State# (RealWorld) -> (# State# (RealWorld), a #)) -> State# (RealWorld) -> (# State# (RealWorld), a #) -getMaskingState# :: State# (RealWorld) -> (# State# (RealWorld), Int# #) -atomically# :: (State# (RealWorld) -> (# State# (RealWorld), a #)) -> State# (RealWorld) -> (# State# (RealWorld), a #) -retry# :: State# (RealWorld) -> (# State# (RealWorld), a #) -catchRetry# :: (State# (RealWorld) -> (# State# (RealWorld), a #)) -> (State# (RealWorld) -> (# State# (RealWorld), a #)) -> State# (RealWorld) -> (# State# (RealWorld), a #) -catchSTM# :: (State# (RealWorld) -> (# State# (RealWorld), a #)) -> (b -> State# (RealWorld) -> (# State# (RealWorld), a #)) -> State# (RealWorld) -> (# State# (RealWorld), a #) -check# :: (State# (RealWorld) -> (# State# (RealWorld), a #)) -> State# (RealWorld) -> (# State# (RealWorld), () #) -newTVar# :: a -> State# s -> (# State# s, TVar# s a #) -readTVar# :: TVar# s a -> State# s -> (# State# s, a #) -readTVarIO# :: TVar# s a -> State# s -> (# State# s, a #) -writeTVar# :: TVar# s a -> a -> State# s -> State# s -sameTVar# :: TVar# s a -> TVar# s a -> Bool -newMVar# :: State# s -> (# State# s, MVar# s a #) -takeMVar# :: MVar# s a -> State# s -> (# State# s, a #) -tryTakeMVar# :: MVar# s a -> State# s -> (# State# s, Int#, a #) -putMVar# :: MVar# s a -> a -> State# s -> State# s -tryPutMVar# :: MVar# s a -> a -> State# s -> (# State# s, Int# #) -sameMVar# :: MVar# s a -> MVar# s a -> Bool -isEmptyMVar# :: MVar# s a -> State# s -> (# State# s, Int# #) -delay# :: Int# -> State# s -> State# s -waitRead# :: Int# -> State# s -> State# s -waitWrite# :: Int# -> State# s -> State# s -fork# :: a -> State# (RealWorld) -> (# State# (RealWorld), ThreadId# #) -forkOn# :: Int# -> a -> State# (RealWorld) -> (# State# (RealWorld), ThreadId# #) -killThread# :: ThreadId# -> a -> State# (RealWorld) -> State# (RealWorld) -yield# :: State# (RealWorld) -> State# (RealWorld) -myThreadId# :: State# (RealWorld) -> (# State# (RealWorld), ThreadId# #) -labelThread# :: ThreadId# -> Addr# -> State# (RealWorld) -> State# (RealWorld) -isCurrentThreadBound# :: State# (RealWorld) -> (# State# (RealWorld), Int# #) -noDuplicate# :: State# (RealWorld) -> State# (RealWorld) -threadStatus# :: ThreadId# -> State# (RealWorld) -> (# State# (RealWorld), Int# #) -mkWeak# :: o -> b -> c -> State# (RealWorld) -> (# State# (RealWorld), Weak# b #) -mkWeakForeignEnv# :: o -> b -> Addr# -> Addr# -> Int# -> Addr# -> State# (RealWorld) -> (# State# (RealWorld), Weak# b #) -deRefWeak# :: Weak# a -> State# (RealWorld) -> (# State# (RealWorld), Int#, a #) -finalizeWeak# :: Weak# a -> State# (RealWorld) -> (# State# (RealWorld), Int#, State# (RealWorld) -> (# State# (RealWorld), () #) #) -touch# :: o -> State# (RealWorld) -> State# (RealWorld) -makeStablePtr# :: a -> State# (RealWorld) -> (# State# (RealWorld), StablePtr# a #) -deRefStablePtr# :: StablePtr# a -> State# (RealWorld) -> (# State# (RealWorld), a #) -eqStablePtr# :: StablePtr# a -> StablePtr# a -> Int# -makeStableName# :: a -> State# (RealWorld) -> (# State# (RealWorld), StableName# a #) -eqStableName# :: StableName# a -> StableName# a -> Int# -stableNameToInt# :: StableName# a -> Int# -reallyUnsafePtrEquality# :: a -> a -> Int# -getSpark# :: State# s -> (# State# s, Int#, a #) -numSparks# :: State# s -> (# State# s, Int# #) -dataToTag# :: a -> Int# -addrToHValue# :: Addr# -> (# a #) -mkApUpd0# :: BCO# -> (# a #) -newBCO# :: ByteArray# -> ByteArray# -> Array# a -> Int# -> ByteArray# -> State# s -> (# State# s, BCO# #) -unpackClosure# :: a -> (# Addr#, Array# b, ByteArray# #) -getApStackVal# :: a -> Int# -> (# Int#, b #) -traceCcs# :: a -> b -> b -traceEvent# :: Addr# -> State# s -> State# s diff --git a/data/haskell2010.txt b/data/haskell2010.txt deleted file mode 100644 --- a/data/haskell2010.txt +++ /dev/null @@ -1,4715 +0,0 @@ --- Hoogle documentation, generated by Haddock --- See Hoogle, http://www.haskell.org/hoogle/ - - --- | Compatibility with Haskell 2010 --- --- This package provides exactly the library modules defined by the --- Haskell 2010 standard. -@package haskell2010 -@version 1.0.0.0 - - --- | The Haskell 2010 Prelude: a standard module imported by default into --- all Haskell modules. For more documentation, see the Haskell 2010 --- Report http://www.haskell.org/onlinereport/. -module Prelude -data Bool :: * -False :: Bool -True :: Bool - --- | Boolean "and" -(&&) :: Bool -> Bool -> Bool - --- | Boolean "or" -(||) :: Bool -> Bool -> Bool - --- | Boolean "not" -not :: Bool -> Bool - --- | otherwise is defined as the value True. It helps to make --- guards more readable. eg. --- --- 
---   f x | x < 0     = ...
---       | otherwise = ...
---
-otherwise :: Bool - --- | The Maybe type encapsulates an optional value. A value of type --- Maybe a either contains a value of type a --- (represented as Just a), or it is empty (represented --- as Nothing). Using Maybe is a good way to deal with --- errors or exceptional cases without resorting to drastic measures such --- as error. --- --- The Maybe type is also a monad. It is a simple kind of error --- monad, where all errors are represented by Nothing. A richer --- error monad can be built using the Data.Either.Either type. -data Maybe a :: * -> * -Nothing :: Maybe a -Just :: a -> Maybe a - --- | The maybe function takes a default value, a function, and a --- Maybe value. If the Maybe value is Nothing, the --- function returns the default value. Otherwise, it applies the function --- to the value inside the Just and returns the result. -maybe :: b -> (a -> b) -> Maybe a -> b - --- | The Either type represents values with two possibilities: a --- value of type Either a b is either Left --- a or Right b. --- --- The Either type is sometimes used to represent a value which is --- either correct or an error; by convention, the Left constructor --- is used to hold an error value and the Right constructor is --- used to hold a correct value (mnemonic: "right" also means "correct"). -data Either a b :: * -> * -> * -Left :: a -> Either a b -Right :: b -> Either a b - --- | Case analysis for the Either type. If the value is --- Left a, apply the first function to a; if it --- is Right b, apply the second function to b. -either :: (a -> c) -> (b -> c) -> Either a b -> c -data Ordering :: * -LT :: Ordering -EQ :: Ordering -GT :: Ordering - --- | The character type Char is an enumeration whose values --- represent Unicode (or equivalently ISO/IEC 10646) characters (see --- http://www.unicode.org/ for details). This set extends the ISO --- 8859-1 (Latin-1) character set (the first 256 charachers), which is --- itself an extension of the ASCII character set (the first 128 --- characters). A character literal in Haskell has type Char. --- --- To convert a Char to or from the corresponding Int value --- defined by Unicode, use Prelude.toEnum and --- Prelude.fromEnum from the Prelude.Enum class --- respectively (or equivalently ord and chr). -data Char :: * - --- | A String is a list of characters. String constants in Haskell --- are values of type String. -type String = [Char] - --- | Extract the first component of a pair. -fst :: (a, b) -> a - --- | Extract the second component of a pair. -snd :: (a, b) -> b - --- | curry converts an uncurried function to a curried function. -curry :: ((a, b) -> c) -> a -> b -> c - --- | uncurry converts a curried function to a function on pairs. -uncurry :: (a -> b -> c) -> (a, b) -> c - --- | The Eq class defines equality (==) and inequality --- (/=). All the basic datatypes exported by the Prelude --- are instances of Eq, and Eq may be derived for any --- datatype whose constituents are also instances of Eq. --- --- Minimal complete definition: either == or /=. -class Eq a -(==) :: Eq a => a -> a -> Bool -(/=) :: Eq a => a -> a -> Bool - --- | The Ord class is used for totally ordered datatypes. --- --- Instances of Ord can be derived for any user-defined datatype --- whose constituent types are in Ord. The declared order of the --- constructors in the data declaration determines the ordering in --- derived Ord instances. The Ordering datatype allows a --- single comparison to determine the precise ordering of two objects. --- --- Minimal complete definition: either compare or <=. --- Using compare can be more efficient for complex types. -class Eq a => Ord a -compare :: Ord a => a -> a -> Ordering -(<) :: Ord a => a -> a -> Bool -(>=) :: Ord a => a -> a -> Bool -(>) :: Ord a => a -> a -> Bool -(<=) :: Ord a => a -> a -> Bool -max :: Ord a => a -> a -> a -min :: Ord a => a -> a -> a - --- | Class Enum defines operations on sequentially ordered types. --- --- The enumFrom... methods are used in Haskell's translation of --- arithmetic sequences. --- --- Instances of Enum may be derived for any enumeration type --- (types whose constructors have no fields). The nullary constructors --- are assumed to be numbered left-to-right by fromEnum from --- 0 through n-1. See Chapter 10 of the Haskell --- Report for more details. --- --- For any type that is an instance of class Bounded as well as --- Enum, the following should hold: --- --- --- --- 
---   enumFrom     x   = enumFromTo     x maxBound
---   enumFromThen x y = enumFromThenTo x y bound
---     where
---       bound | fromEnum y >= fromEnum x = maxBound
---             | otherwise                = minBound
---
-class Enum a -succ :: Enum a => a -> a -pred :: Enum a => a -> a -toEnum :: Enum a => Int -> a -fromEnum :: Enum a => a -> Int -enumFrom :: Enum a => a -> [a] -enumFromThen :: Enum a => a -> a -> [a] -enumFromTo :: Enum a => a -> a -> [a] -enumFromThenTo :: Enum a => a -> a -> a -> [a] - --- | The Bounded class is used to name the upper and lower limits of --- a type. Ord is not a superclass of Bounded since types --- that are not totally ordered may also have upper and lower bounds. --- --- The Bounded class may be derived for any enumeration type; --- minBound is the first constructor listed in the data --- declaration and maxBound is the last. Bounded may also --- be derived for single-constructor datatypes whose constituent types --- are in Bounded. -class Bounded a -minBound :: Bounded a => a -maxBound :: Bounded a => a - --- | A fixed-precision integer type with at least the range [-2^29 .. --- 2^29-1]. The exact range for a given implementation can be --- determined by using Prelude.minBound and --- Prelude.maxBound from the Prelude.Bounded class. -data Int :: * - --- | Arbitrary-precision integers. -data Integer :: * - --- | Single-precision floating point numbers. It is desirable that this --- type be at least equal in range and precision to the IEEE --- single-precision type. -data Float :: * - --- | Double-precision floating point numbers. It is desirable that this --- type be at least equal in range and precision to the IEEE --- double-precision type. -data Double :: * - --- | Arbitrary-precision rational numbers, represented as a ratio of two --- Integer values. A rational number may be constructed using the --- % operator. -type Rational = Ratio Integer - --- | Basic numeric class. --- --- Minimal complete definition: all except negate or (-) -class (Eq a, Show a) => Num a -(+) :: Num a => a -> a -> a -(*) :: Num a => a -> a -> a -(-) :: Num a => a -> a -> a -negate :: Num a => a -> a -abs :: Num a => a -> a -signum :: Num a => a -> a -fromInteger :: Num a => Integer -> a -class (Num a, Ord a) => Real a -toRational :: Real a => a -> Rational - --- | Integral numbers, supporting integer division. --- --- Minimal complete definition: quotRem and toInteger -class (Real a, Enum a) => Integral a -quot :: Integral a => a -> a -> a -rem :: Integral a => a -> a -> a -div :: Integral a => a -> a -> a -mod :: Integral a => a -> a -> a -quotRem :: Integral a => a -> a -> (a, a) -divMod :: Integral a => a -> a -> (a, a) -toInteger :: Integral a => a -> Integer - --- | Fractional numbers, supporting real division. --- --- Minimal complete definition: fromRational and (recip or --- (/)) -class Num a => Fractional a -(/) :: Fractional a => a -> a -> a -recip :: Fractional a => a -> a -fromRational :: Fractional a => Rational -> a - --- | Trigonometric and hyperbolic functions and related functions. --- --- Minimal complete definition: pi, exp, log, --- sin, cos, sinh, cosh, asin, --- acos, atan, asinh, acosh and atanh -class Fractional a => Floating a -pi :: Floating a => a -exp :: Floating a => a -> a -sqrt :: Floating a => a -> a -log :: Floating a => a -> a -(**) :: Floating a => a -> a -> a -logBase :: Floating a => a -> a -> a -sin :: Floating a => a -> a -tan :: Floating a => a -> a -cos :: Floating a => a -> a -asin :: Floating a => a -> a -atan :: Floating a => a -> a -acos :: Floating a => a -> a -sinh :: Floating a => a -> a -tanh :: Floating a => a -> a -cosh :: Floating a => a -> a -asinh :: Floating a => a -> a -atanh :: Floating a => a -> a -acosh :: Floating a => a -> a - --- | Extracting components of fractions. --- --- Minimal complete definition: properFraction -class (Real a, Fractional a) => RealFrac a -properFraction :: (RealFrac a, Integral b) => a -> (b, a) -truncate :: (RealFrac a, Integral b) => a -> b -round :: (RealFrac a, Integral b) => a -> b -ceiling :: (RealFrac a, Integral b) => a -> b -floor :: (RealFrac a, Integral b) => a -> b - --- | Efficient, machine-independent access to the components of a --- floating-point number. --- --- Minimal complete definition: all except exponent, --- significand, scaleFloat and atan2 -class (RealFrac a, Floating a) => RealFloat a -floatRadix :: RealFloat a => a -> Integer -floatDigits :: RealFloat a => a -> Int -floatRange :: RealFloat a => a -> (Int, Int) -decodeFloat :: RealFloat a => a -> (Integer, Int) -encodeFloat :: RealFloat a => Integer -> Int -> a -exponent :: RealFloat a => a -> Int -significand :: RealFloat a => a -> a -scaleFloat :: RealFloat a => Int -> a -> a -isNaN :: RealFloat a => a -> Bool -isInfinite :: RealFloat a => a -> Bool -isDenormalized :: RealFloat a => a -> Bool -isNegativeZero :: RealFloat a => a -> Bool -isIEEE :: RealFloat a => a -> Bool -atan2 :: RealFloat a => a -> a -> a - --- | the same as flip (-). --- --- Because - is treated specially in the Haskell grammar, --- (- e) is not a section, but an application of --- prefix negation. However, (subtract --- exp) is equivalent to the disallowed section. -subtract :: Num a => a -> a -> a -even :: Integral a => a -> Bool -odd :: Integral a => a -> Bool - --- | gcd x y is the greatest (positive) integer that --- divides both x and y; for example gcd --- (-3) 6 = 3, gcd (-3) (-6) = 3, --- gcd 0 4 = 4. gcd 0 0 raises a --- runtime error. -gcd :: Integral a => a -> a -> a - --- | lcm x y is the smallest positive integer that both --- x and y divide. -lcm :: Integral a => a -> a -> a - --- | raise a number to a non-negative integral power -(^) :: (Num a, Integral b) => a -> b -> a - --- | raise a number to an integral power -(^^) :: (Fractional a, Integral b) => a -> b -> a - --- | general coercion from integral types -fromIntegral :: (Integral a, Num b) => a -> b - --- | general coercion to fractional types -realToFrac :: (Real a, Fractional b) => a -> b - --- | The Monad class defines the basic operations over a --- monad, a concept from a branch of mathematics known as --- category theory. From the perspective of a Haskell programmer, --- however, it is best to think of a monad as an abstract datatype --- of actions. Haskell's do expressions provide a convenient --- syntax for writing monadic expressions. --- --- Minimal complete definition: >>= and return. --- --- Instances of Monad should satisfy the following laws: --- --- 
---   return a >>= k  ==  k a
---   m >>= return  ==  m
---   m >>= (\x -> k x >>= h)  ==  (m >>= k) >>= h
---
--- --- Instances of both Monad and Functor should additionally --- satisfy the law: --- --- 
---   fmap f xs  ==  xs >>= return . f
---
--- --- The instances of Monad for lists, Data.Maybe.Maybe and --- System.IO.IO defined in the Prelude satisfy these --- laws. -class Monad m :: (* -> *) -(>>=) :: Monad m => m a -> (a -> m b) -> m b -(>>) :: Monad m => m a -> m b -> m b -return :: Monad m => a -> m a -fail :: Monad m => String -> m a - --- | The Functor class is used for types that can be mapped over. --- Instances of Functor should satisfy the following laws: --- --- 
---   fmap id  ==  id
---   fmap (f . g)  ==  fmap f . fmap g
---
--- --- The instances of Functor for lists, Data.Maybe.Maybe --- and System.IO.IO satisfy these laws. -class Functor f :: (* -> *) -fmap :: Functor f => (a -> b) -> f a -> f b - --- | mapM f is equivalent to sequence . --- map f. -mapM :: Monad m => (a -> m b) -> [a] -> m [b] - --- | mapM_ f is equivalent to sequence_ . --- map f. -mapM_ :: Monad m => (a -> m b) -> [a] -> m () - --- | Evaluate each action in the sequence from left to right, and collect --- the results. -sequence :: Monad m => [m a] -> m [a] - --- | Evaluate each action in the sequence from left to right, and ignore --- the results. -sequence_ :: Monad m => [m a] -> m () - --- | Same as >>=, but with the arguments interchanged. -(=<<) :: Monad m => (a -> m b) -> m a -> m b - --- | Identity function. -id :: a -> a - --- | Constant function. -const :: a -> b -> a - --- | Function composition. -(.) :: (b -> c) -> (a -> b) -> a -> c - --- | flip f takes its (first) two arguments in the reverse --- order of f. -flip :: (a -> b -> c) -> b -> a -> c - --- | Application operator. This operator is redundant, since ordinary --- application (f x) means the same as (f $ x). --- However, $ has low, right-associative binding precedence, so it --- sometimes allows parentheses to be omitted; for example: --- --- 
---   f $ g $ h x  =  f (g (h x))
---
--- --- It is also useful in higher-order situations, such as map --- ($ 0) xs, or Data.List.zipWith ($) fs --- xs. -($) :: (a -> b) -> a -> b - --- | until p f yields the result of applying f --- until p holds. -until :: (a -> Bool) -> (a -> a) -> a -> a - --- | asTypeOf is a type-restricted version of const. It is --- usually used as an infix operator, and its typing forces its first --- argument (which is usually overloaded) to have the same type as the --- second. -asTypeOf :: a -> a -> a - --- | error stops execution and displays an error message. -error :: [Char] -> a - --- | A special case of error. It is expected that compilers will --- recognize this and insert error messages which are more appropriate to --- the context in which undefined appears. -undefined :: a - --- | Evaluates its first argument to head normal form, and then returns its --- second argument as the result. -seq :: a -> b -> b - --- | Strict (call-by-value) application, defined in terms of seq. -($!) :: (a -> b) -> a -> b - --- | map f xs is the list obtained by applying f --- to each element of xs, i.e., --- --- 
---   map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn]
---   map f [x1, x2, ...] == [f x1, f x2, ...]
---
-map :: (a -> b) -> [a] -> [b] - --- | Append two lists, i.e., --- --- 
---   [x1, ..., xm] ++ [y1, ..., yn] == [x1, ..., xm, y1, ..., yn]
---   [x1, ..., xm] ++ [y1, ...] == [x1, ..., xm, y1, ...]
---
--- --- If the first list is not finite, the result is the first list. -(++) :: [a] -> [a] -> [a] - --- | filter, applied to a predicate and a list, returns the list of --- those elements that satisfy the predicate; i.e., --- --- 
---   filter p xs = [ x | x <- xs, p x]
---
-filter :: (a -> Bool) -> [a] -> [a] - --- | Extract the first element of a list, which must be non-empty. -head :: [a] -> a - --- | Extract the last element of a list, which must be finite and --- non-empty. -last :: [a] -> a - --- | Extract the elements after the head of a list, which must be --- non-empty. -tail :: [a] -> [a] - --- | Return all the elements of a list except the last one. The list must --- be non-empty. -init :: [a] -> [a] - --- | Test whether a list is empty. -null :: [a] -> Bool - --- | O(n). length returns the length of a finite list as an --- Int. It is an instance of the more general --- Data.List.genericLength, the result type of which may be any --- kind of number. -length :: [a] -> Int - --- | List index (subscript) operator, starting from 0. It is an instance of --- the more general Data.List.genericIndex, which takes an index --- of any integral type. -(!!) :: [a] -> Int -> a - --- | reverse xs returns the elements of xs in --- reverse order. xs must be finite. -reverse :: [a] -> [a] - --- | foldl, applied to a binary operator, a starting value --- (typically the left-identity of the operator), and a list, reduces the --- list using the binary operator, from left to right: --- --- 
---   foldl f z [x1, x2, ..., xn] == (...((z `f` x1) `f` x2) `f`...) `f` xn
---
--- --- The list must be finite. -foldl :: (a -> b -> a) -> a -> [b] -> a - --- | foldl1 is a variant of foldl that has no starting value --- argument, and thus must be applied to non-empty lists. -foldl1 :: (a -> a -> a) -> [a] -> a - --- | foldr, applied to a binary operator, a starting value --- (typically the right-identity of the operator), and a list, reduces --- the list using the binary operator, from right to left: --- --- 
---   foldr f z [x1, x2, ..., xn] == x1 `f` (x2 `f` ... (xn `f` z)...)
---
-foldr :: (a -> b -> b) -> b -> [a] -> b - --- | foldr1 is a variant of foldr that has no starting value --- argument, and thus must be applied to non-empty lists. -foldr1 :: (a -> a -> a) -> [a] -> a - --- | and returns the conjunction of a Boolean list. For the result --- to be True, the list must be finite; False, however, --- results from a False value at a finite index of a finite or --- infinite list. -and :: [Bool] -> Bool - --- | or returns the disjunction of a Boolean list. For the result to --- be False, the list must be finite; True, however, --- results from a True value at a finite index of a finite or --- infinite list. -or :: [Bool] -> Bool - --- | Applied to a predicate and a list, any determines if any --- element of the list satisfies the predicate. For the result to be --- False, the list must be finite; True, however, results --- from a True value for the predicate applied to an element at a --- finite index of a finite or infinite list. -any :: (a -> Bool) -> [a] -> Bool - --- | Applied to a predicate and a list, all determines if all --- elements of the list satisfy the predicate. For the result to be --- True, the list must be finite; False, however, results --- from a False value for the predicate applied to an element at a --- finite index of a finite or infinite list. -all :: (a -> Bool) -> [a] -> Bool - --- | The sum function computes the sum of a finite list of numbers. -sum :: Num a => [a] -> a - --- | The product function computes the product of a finite list of --- numbers. -product :: Num a => [a] -> a - --- | Concatenate a list of lists. -concat :: [[a]] -> [a] - --- | Map a function over a list and concatenate the results. -concatMap :: (a -> [b]) -> [a] -> [b] - --- | maximum returns the maximum value from a list, which must be --- non-empty, finite, and of an ordered type. It is a special case of --- maximumBy, which allows the programmer to supply their own --- comparison function. -maximum :: Ord a => [a] -> a - --- | minimum returns the minimum value from a list, which must be --- non-empty, finite, and of an ordered type. It is a special case of --- minimumBy, which allows the programmer to supply their own --- comparison function. -minimum :: Ord a => [a] -> a - --- | scanl is similar to foldl, but returns a list of --- successive reduced values from the left: --- --- 
---   scanl f z [x1, x2, ...] == [z, z `f` x1, (z `f` x1) `f` x2, ...]
---
--- --- Note that --- --- 
---   last (scanl f z xs) == foldl f z xs.
---
-scanl :: (a -> b -> a) -> a -> [b] -> [a] - --- | scanl1 is a variant of scanl that has no starting value --- argument: --- --- 
---   scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...]
---
-scanl1 :: (a -> a -> a) -> [a] -> [a] - --- | scanr is the right-to-left dual of scanl. Note that --- --- 
---   head (scanr f z xs) == foldr f z xs.
---
-scanr :: (a -> b -> b) -> b -> [a] -> [b] - --- | scanr1 is a variant of scanr that has no starting value --- argument. -scanr1 :: (a -> a -> a) -> [a] -> [a] - --- | iterate f x returns an infinite list of repeated --- applications of f to x: --- --- 
---   iterate f x == [x, f x, f (f x), ...]
---
-iterate :: (a -> a) -> a -> [a] - --- | repeat x is an infinite list, with x the --- value of every element. -repeat :: a -> [a] - --- | replicate n x is a list of length n with --- x the value of every element. It is an instance of the more --- general Data.List.genericReplicate, in which n may --- be of any integral type. -replicate :: Int -> a -> [a] - --- | cycle ties a finite list into a circular one, or equivalently, --- the infinite repetition of the original list. It is the identity on --- infinite lists. -cycle :: [a] -> [a] - --- | take n, applied to a list xs, returns the --- prefix of xs of length n, or xs itself if --- n > length xs: --- --- 
---   take 5 "Hello World!" == "Hello"
---   take 3 [1,2,3,4,5] == [1,2,3]
---   take 3 [1,2] == [1,2]
---   take 3 [] == []
---   take (-1) [1,2] == []
---   take 0 [1,2] == []
---
--- --- It is an instance of the more general Data.List.genericTake, --- in which n may be of any integral type. -take :: Int -> [a] -> [a] - --- | drop n xs returns the suffix of xs after the --- first n elements, or [] if n > length --- xs: --- --- 
---   drop 6 "Hello World!" == "World!"
---   drop 3 [1,2,3,4,5] == [4,5]
---   drop 3 [1,2] == []
---   drop 3 [] == []
---   drop (-1) [1,2] == [1,2]
---   drop 0 [1,2] == [1,2]
---
--- --- It is an instance of the more general Data.List.genericDrop, --- in which n may be of any integral type. -drop :: Int -> [a] -> [a] - --- | splitAt n xs returns a tuple where first element is --- xs prefix of length n and second element is the --- remainder of the list: --- --- 
---   splitAt 6 "Hello World!" == ("Hello ","World!")
---   splitAt 3 [1,2,3,4,5] == ([1,2,3],[4,5])
---   splitAt 1 [1,2,3] == ([1],[2,3])
---   splitAt 3 [1,2,3] == ([1,2,3],[])
---   splitAt 4 [1,2,3] == ([1,2,3],[])
---   splitAt 0 [1,2,3] == ([],[1,2,3])
---   splitAt (-1) [1,2,3] == ([],[1,2,3])
---
--- --- It is equivalent to (take n xs, drop n xs). --- splitAt is an instance of the more general --- Data.List.genericSplitAt, in which n may be of any --- integral type. -splitAt :: Int -> [a] -> ([a], [a]) - --- | takeWhile, applied to a predicate p and a list --- xs, returns the longest prefix (possibly empty) of --- xs of elements that satisfy p: --- --- 
---   takeWhile (< 3) [1,2,3,4,1,2,3,4] == [1,2]
---   takeWhile (< 9) [1,2,3] == [1,2,3]
---   takeWhile (< 0) [1,2,3] == []
---
-takeWhile :: (a -> Bool) -> [a] -> [a] - --- | dropWhile p xs returns the suffix remaining after --- takeWhile p xs: --- --- 
---   dropWhile (< 3) [1,2,3,4,5,1,2,3] == [3,4,5,1,2,3]
---   dropWhile (< 9) [1,2,3] == []
---   dropWhile (< 0) [1,2,3] == [1,2,3]
---
-dropWhile :: (a -> Bool) -> [a] -> [a] - --- | span, applied to a predicate p and a list xs, --- returns a tuple where first element is longest prefix (possibly empty) --- of xs of elements that satisfy p and second element --- is the remainder of the list: --- --- 
---   span (< 3) [1,2,3,4,1,2,3,4] == ([1,2],[3,4,1,2,3,4])
---   span (< 9) [1,2,3] == ([1,2,3],[])
---   span (< 0) [1,2,3] == ([],[1,2,3])
---
--- --- span p xs is equivalent to (takeWhile p xs, --- dropWhile p xs) -span :: (a -> Bool) -> [a] -> ([a], [a]) - --- | break, applied to a predicate p and a list --- xs, returns a tuple where first element is longest prefix --- (possibly empty) of xs of elements that do not satisfy --- p and second element is the remainder of the list: --- --- 
---   break (> 3) [1,2,3,4,1,2,3,4] == ([1,2,3],[4,1,2,3,4])
---   break (< 9) [1,2,3] == ([],[1,2,3])
---   break (> 9) [1,2,3] == ([1,2,3],[])
---
--- --- break p is equivalent to span (not . --- p). -break :: (a -> Bool) -> [a] -> ([a], [a]) - --- | elem is the list membership predicate, usually written in infix --- form, e.g., x `elem` xs. For the result to be False, --- the list must be finite; True, however, results from an element --- equal to x found at a finite index of a finite or infinite --- list. -elem :: Eq a => a -> [a] -> Bool - --- | notElem is the negation of elem. -notElem :: Eq a => a -> [a] -> Bool - --- | lookup key assocs looks up a key in an association --- list. -lookup :: Eq a => a -> [(a, b)] -> Maybe b - --- | zip takes two lists and returns a list of corresponding pairs. --- If one input list is short, excess elements of the longer list are --- discarded. -zip :: [a] -> [b] -> [(a, b)] - --- | zip3 takes three lists and returns a list of triples, analogous --- to zip. -zip3 :: [a] -> [b] -> [c] -> [(a, b, c)] - --- | zipWith generalises zip by zipping with the function --- given as the first argument, instead of a tupling function. For --- example, zipWith (+) is applied to two lists to --- produce the list of corresponding sums. -zipWith :: (a -> b -> c) -> [a] -> [b] -> [c] - --- | The zipWith3 function takes a function which combines three --- elements, as well as three lists and returns a list of their --- point-wise combination, analogous to zipWith. -zipWith3 :: (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d] - --- | unzip transforms a list of pairs into a list of first --- components and a list of second components. -unzip :: [(a, b)] -> ([a], [b]) - --- | The unzip3 function takes a list of triples and returns three --- lists, analogous to unzip. -unzip3 :: [(a, b, c)] -> ([a], [b], [c]) - --- | lines breaks a string up into a list of strings at newline --- characters. The resulting strings do not contain newlines. -lines :: String -> [String] - --- | words breaks a string up into a list of words, which were --- delimited by white space. -words :: String -> [String] - --- | unlines is an inverse operation to lines. It joins --- lines, after appending a terminating newline to each. -unlines :: [String] -> String - --- | unwords is an inverse operation to words. It joins words --- with separating spaces. -unwords :: [String] -> String - --- | The shows functions return a function that prepends the --- output String to an existing String. This allows --- constant-time concatenation of results using function composition. -type ShowS = String -> String - --- | Conversion of values to readable Strings. --- --- Minimal complete definition: showsPrec or show. --- --- Derived instances of Show have the following properties, which --- are compatible with derived instances of Text.Read.Read: --- --- --- --- For example, given the declarations --- --- 
---   infixr 5 :^:
---   data Tree a =  Leaf a  |  Tree a :^: Tree a
---
--- --- the derived instance of Show is equivalent to --- --- 
---   instance (Show a) => Show (Tree a) where
---   
---          showsPrec d (Leaf m) = showParen (d > app_prec) $
---               showString "Leaf " . showsPrec (app_prec+1) m
---            where app_prec = 10
---   
---          showsPrec d (u :^: v) = showParen (d > up_prec) $
---               showsPrec (up_prec+1) u . 
---               showString " :^: "      .
---               showsPrec (up_prec+1) v
---            where up_prec = 5
---
--- --- Note that right-associativity of :^: is ignored. For example, --- --- -class Show a -showsPrec :: Show a => Int -> a -> ShowS -show :: Show a => a -> String -showList :: Show a => [a] -> ShowS - --- | equivalent to showsPrec with a precedence of 0. -shows :: Show a => a -> ShowS - --- | utility function converting a Char to a show function that --- simply prepends the character unchanged. -showChar :: Char -> ShowS - --- | utility function converting a String to a show function that --- simply prepends the string unchanged. -showString :: String -> ShowS - --- | utility function that surrounds the inner show function with --- parentheses when the Bool parameter is True. -showParen :: Bool -> ShowS -> ShowS - --- | A parser for a type a, represented as a function that takes a --- String and returns a list of possible parses as --- (a,String) pairs. --- --- Note that this kind of backtracking parser is very inefficient; --- reading a large structure may be quite slow (cf ReadP). -type ReadS a = String -> [(a, String)] - --- | Parsing of Strings, producing values. --- --- Minimal complete definition: readsPrec (or, for GHC only, --- readPrec) --- --- Derived instances of Read make the following assumptions, which --- derived instances of Text.Show.Show obey: --- --- --- --- For example, given the declarations --- --- 
---   infixr 5 :^:
---   data Tree a =  Leaf a  |  Tree a :^: Tree a
---
--- --- the derived instance of Read in Haskell 98 is equivalent to --- --- 
---   instance (Read a) => Read (Tree a) where
---   
---           readsPrec d r =  readParen (d > app_prec)
---                            (\r -> [(Leaf m,t) |
---                                    ("Leaf",s) <- lex r,
---                                    (m,t) <- readsPrec (app_prec+1) s]) r
---   
---                         ++ readParen (d > up_prec)
---                            (\r -> [(u:^:v,w) |
---                                    (u,s) <- readsPrec (up_prec+1) r,
---                                    (":^:",t) <- lex s,
---                                    (v,w) <- readsPrec (up_prec+1) t]) r
---   
---             where app_prec = 10
---                   up_prec = 5
---
--- --- Note that right-associativity of :^: is unused. --- --- The derived instance in GHC is equivalent to --- --- 
---   instance (Read a) => Read (Tree a) where
---   
---           readPrec = parens $ (prec app_prec $ do
---                                    Ident "Leaf" <- lexP
---                                    m <- step readPrec
---                                    return (Leaf m))
---   
---                        +++ (prec up_prec $ do
---                                    u <- step readPrec
---                                    Symbol ":^:" <- lexP
---                                    v <- step readPrec
---                                    return (u :^: v))
---   
---             where app_prec = 10
---                   up_prec = 5
---   
---           readListPrec = readListPrecDefault
---
-class Read a -readsPrec :: Read a => Int -> ReadS a -readList :: Read a => ReadS [a] - --- | equivalent to readsPrec with a precedence of 0. -reads :: Read a => ReadS a - --- | readParen True p parses what p parses, --- but surrounded with parentheses. --- --- readParen False p parses what p --- parses, but optionally surrounded with parentheses. -readParen :: Bool -> ReadS a -> ReadS a - --- | The read function reads input from a string, which must be --- completely consumed by the input process. -read :: Read a => String -> a - --- | The lex function reads a single lexeme from the input, --- discarding initial white space, and returning the characters that --- constitute the lexeme. If the input string contains only white space, --- lex returns a single successful `lexeme' consisting of the --- empty string. (Thus lex "" = [("","")].) If there is --- no legal lexeme at the beginning of the input string, lex fails --- (i.e. returns []). --- --- This lexer is not completely faithful to the Haskell lexical syntax in --- the following respects: --- --- -lex :: ReadS String - --- | A value of type IO a is a computation which, when --- performed, does some I/O before returning a value of type a. --- --- There is really only one way to "perform" an I/O action: bind it to --- Main.main in your program. When your program is run, the I/O --- will be performed. It isn't possible to perform I/O from an arbitrary --- function, unless that function is itself in the IO monad and --- called at some point, directly or indirectly, from Main.main. --- --- IO is a monad, so IO actions can be combined using --- either the do-notation or the >> and >>= --- operations from the Monad class. -data IO a :: * -> * - --- | Write a character to the standard output device (same as --- hPutChar stdout). -putChar :: Char -> IO () - --- | Write a string to the standard output device (same as hPutStr --- stdout). -putStr :: String -> IO () - --- | The same as putStr, but adds a newline character. -putStrLn :: String -> IO () - --- | The print function outputs a value of any printable type to the --- standard output device. Printable types are those that are instances --- of class Show; print converts values to strings for --- output using the show operation and adds a newline. --- --- For example, a program to print the first 20 integers and their powers --- of 2 could be written as: --- --- 
---   main = print ([(n, 2^n) | n <- [0..19]])
---
-print :: Show a => a -> IO () - --- | Read a character from the standard input device (same as --- hGetChar stdin). -getChar :: IO Char - --- | Read a line from the standard input device (same as hGetLine --- stdin). -getLine :: IO String - --- | The getContents operation returns all user input as a single --- string, which is read lazily as it is needed (same as --- hGetContents stdin). -getContents :: IO String - --- | The interact function takes a function of type --- String->String as its argument. The entire input from the --- standard input device is passed to this function as its argument, and --- the resulting string is output on the standard output device. -interact :: (String -> String) -> IO () - --- | File and directory names are values of type String, whose --- precise meaning is operating system dependent. Files can be opened, --- yielding a handle which can then be used to operate on the contents of --- that file. -type FilePath = String - --- | The readFile function reads a file and returns the contents of --- the file as a string. The file is read lazily, on demand, as with --- getContents. -readFile :: FilePath -> IO String - --- | The computation writeFile file str function writes the --- string str, to the file file. -writeFile :: FilePath -> String -> IO () - --- | The computation appendFile file str function appends --- the string str, to the file file. --- --- Note that writeFile and appendFile write a literal --- string to a file. To write a value of any printable type, as with --- print, use the show function to convert the value to a --- string first. --- --- 
---   main = appendFile "squares" (show [(x,x*x) | x <- [0,0.1..2]])
---
-appendFile :: FilePath -> String -> IO () - --- | The readIO function is similar to read except that it --- signals parse failure to the IO monad instead of terminating --- the program. -readIO :: Read a => String -> IO a - --- | The readLn function combines getLine and readIO. -readLn :: Read a => IO a - --- | The Haskell 98 type for exceptions in the IO monad. Any I/O --- operation may raise an IOError instead of returning a result. --- For a more general type of exception, including also those that arise --- in pure code, see Control.Exception.Exception. --- --- In Haskell 98, this is an opaque type. -type IOError = IOException - --- | Raise an IOError in the IO monad. -ioError :: IOError -> IO a - --- | Construct an IOError value with a string describing the error. --- The fail method of the IO instance of the Monad --- class raises a userError, thus: --- --- 
---   instance Monad IO where 
---     ...
---     fail s = ioError (userError s)
---
-userError :: String -> IOError - --- | The catch function establishes a handler that receives any --- IOError raised in the action protected by catch. An --- IOError is caught by the most recent handler established by --- catch. These handlers are not selective: all IOErrors --- are caught. Exception propagation must be explicitly provided in a --- handler by re-raising any unwanted exceptions. For example, in --- --- 
---   f = catch g (\e -> if IO.isEOFError e then return [] else ioError e)
---
--- --- the function f returns [] when an end-of-file --- exception (cf. isEOFError) occurs in g; otherwise, the --- exception is propagated to the next outer handler. --- --- When an exception propagates outside the main program, the Haskell --- system prints the associated IOError value and exits the --- program. --- --- Non-I/O exceptions are not caught by this variant; to catch all --- exceptions, use Control.Exception.catch from --- Control.Exception. -catch :: IO a -> (IOError -> IO a) -> IO a - -module Foreign.StablePtr - --- | A stable pointer is a reference to a Haskell expression that is --- guaranteed not to be affected by garbage collection, i.e., it will --- neither be deallocated nor will the value of the stable pointer itself --- change during garbage collection (ordinary references may be relocated --- during garbage collection). Consequently, stable pointers can be --- passed to foreign code, which can treat it as an opaque reference to a --- Haskell value. --- --- A value of type StablePtr a is a stable pointer to a Haskell --- expression of type a. -data StablePtr a :: * -> * - --- | Create a stable pointer referring to the given Haskell value. -newStablePtr :: a -> IO (StablePtr a) - --- | Obtain the Haskell value referenced by a stable pointer, i.e., the --- same value that was passed to the corresponding call to --- makeStablePtr. If the argument to deRefStablePtr has --- already been freed using freeStablePtr, the behaviour of --- deRefStablePtr is undefined. -deRefStablePtr :: StablePtr a -> IO a - --- | Dissolve the association between the stable pointer and the Haskell --- value. Afterwards, if the stable pointer is passed to --- deRefStablePtr or freeStablePtr, the behaviour is --- undefined. However, the stable pointer may still be passed to --- castStablePtrToPtr, but the Foreign.Ptr.Ptr --- () value returned by castStablePtrToPtr, in this case, is --- undefined (in particular, it may be Foreign.Ptr.nullPtr). --- Nevertheless, the call to castStablePtrToPtr is guaranteed not --- to diverge. -freeStablePtr :: StablePtr a -> IO () - --- | Coerce a stable pointer to an address. No guarantees are made about --- the resulting value, except that the original stable pointer can be --- recovered by castPtrToStablePtr. In particular, the address may --- not refer to an accessible memory location and any attempt to pass it --- to the member functions of the class --- Foreign.Storable.Storable leads to undefined behaviour. -castStablePtrToPtr :: StablePtr a -> Ptr () - --- | The inverse of castStablePtrToPtr, i.e., we have the identity --- --- 
---   sp == castPtrToStablePtr (castStablePtrToPtr sp)
---
--- --- for any stable pointer sp on which freeStablePtr has --- not been executed yet. Moreover, castPtrToStablePtr may only be --- applied to pointers that have been produced by --- castStablePtrToPtr. -castPtrToStablePtr :: Ptr () -> StablePtr a - -module Data.Ix - --- | The Ix class is used to map a contiguous subrange of values in --- a type onto integers. It is used primarily for array indexing (see the --- array package). --- --- The first argument (l,u) of each of these operations is a --- pair specifying the lower and upper bounds of a contiguous subrange of --- values. --- --- An implementation is entitled to assume the following laws about these --- operations: --- --- --- --- Minimal complete instance: range, index and --- inRange. -class Ord a => Ix a -range :: Ix a => (a, a) -> [a] -index :: Ix a => (a, a) -> a -> Int -inRange :: Ix a => (a, a) -> a -> Bool -rangeSize :: Ix a => (a, a) -> Int - -module Data.Char - --- | The character type Char is an enumeration whose values --- represent Unicode (or equivalently ISO/IEC 10646) characters (see --- http://www.unicode.org/ for details). This set extends the ISO --- 8859-1 (Latin-1) character set (the first 256 charachers), which is --- itself an extension of the ASCII character set (the first 128 --- characters). A character literal in Haskell has type Char. --- --- To convert a Char to or from the corresponding Int value --- defined by Unicode, use Prelude.toEnum and --- Prelude.fromEnum from the Prelude.Enum class --- respectively (or equivalently ord and chr). -data Char :: * - --- | A String is a list of characters. String constants in Haskell --- are values of type String. -type String = [Char] - --- | Selects control characters, which are the non-printing characters of --- the Latin-1 subset of Unicode. -isControl :: Char -> Bool - --- | Returns True for any Unicode space character, and the control --- characters \t, \n, \r, \f, --- \v. -isSpace :: Char -> Bool - --- | Selects lower-case alphabetic Unicode characters (letters). -isLower :: Char -> Bool - --- | Selects upper-case or title-case alphabetic Unicode characters --- (letters). Title case is used by a small number of letter ligatures --- like the single-character form of Lj. -isUpper :: Char -> Bool - --- | Selects alphabetic Unicode characters (lower-case, upper-case and --- title-case letters, plus letters of caseless scripts and modifiers --- letters). This function is equivalent to Data.Char.isLetter. -isAlpha :: Char -> Bool - --- | Selects alphabetic or numeric digit Unicode characters. --- --- Note that numeric digits outside the ASCII range are selected by this --- function but not by isDigit. Such digits may be part of --- identifiers but are not used by the printer and reader to represent --- numbers. -isAlphaNum :: Char -> Bool - --- | Selects printable Unicode characters (letters, numbers, marks, --- punctuation, symbols and spaces). -isPrint :: Char -> Bool - --- | Selects ASCII digits, i.e. '0'..'9'. -isDigit :: Char -> Bool - --- | Selects ASCII octal digits, i.e. '0'..'7'. -isOctDigit :: Char -> Bool - --- | Selects ASCII hexadecimal digits, i.e. '0'..'9', --- 'a'..'f', 'A'..'F'. -isHexDigit :: Char -> Bool - --- | Selects alphabetic Unicode characters (lower-case, upper-case and --- title-case letters, plus letters of caseless scripts and modifiers --- letters). This function is equivalent to Data.Char.isAlpha. -isLetter :: Char -> Bool - --- | Selects Unicode mark characters, e.g. accents and the like, which --- combine with preceding letters. -isMark :: Char -> Bool - --- | Selects Unicode numeric characters, including digits from various --- scripts, Roman numerals, etc. -isNumber :: Char -> Bool - --- | Selects Unicode punctuation characters, including various kinds of --- connectors, brackets and quotes. -isPunctuation :: Char -> Bool - --- | Selects Unicode symbol characters, including mathematical and currency --- symbols. -isSymbol :: Char -> Bool - --- | Selects Unicode space and separator characters. -isSeparator :: Char -> Bool - --- | Selects the first 128 characters of the Unicode character set, --- corresponding to the ASCII character set. -isAscii :: Char -> Bool - --- | Selects the first 256 characters of the Unicode character set, --- corresponding to the ISO 8859-1 (Latin-1) character set. -isLatin1 :: Char -> Bool - --- | Selects ASCII upper-case letters, i.e. characters satisfying both --- isAscii and isUpper. -isAsciiUpper :: Char -> Bool - --- | Selects ASCII lower-case letters, i.e. characters satisfying both --- isAscii and isLower. -isAsciiLower :: Char -> Bool - --- | Unicode General Categories (column 2 of the UnicodeData table) in the --- order they are listed in the Unicode standard. -data GeneralCategory :: * - --- | Lu: Letter, Uppercase -UppercaseLetter :: GeneralCategory - --- | Ll: Letter, Lowercase -LowercaseLetter :: GeneralCategory - --- | Lt: Letter, Titlecase -TitlecaseLetter :: GeneralCategory - --- | Lm: Letter, Modifier -ModifierLetter :: GeneralCategory - --- | Lo: Letter, Other -OtherLetter :: GeneralCategory - --- | Mn: Mark, Non-Spacing -NonSpacingMark :: GeneralCategory - --- | Mc: Mark, Spacing Combining -SpacingCombiningMark :: GeneralCategory - --- | Me: Mark, Enclosing -EnclosingMark :: GeneralCategory - --- | Nd: Number, Decimal -DecimalNumber :: GeneralCategory - --- | Nl: Number, Letter -LetterNumber :: GeneralCategory - --- | No: Number, Other -OtherNumber :: GeneralCategory - --- | Pc: Punctuation, Connector -ConnectorPunctuation :: GeneralCategory - --- | Pd: Punctuation, Dash -DashPunctuation :: GeneralCategory - --- | Ps: Punctuation, Open -OpenPunctuation :: GeneralCategory - --- | Pe: Punctuation, Close -ClosePunctuation :: GeneralCategory - --- | Pi: Punctuation, Initial quote -InitialQuote :: GeneralCategory - --- | Pf: Punctuation, Final quote -FinalQuote :: GeneralCategory - --- | Po: Punctuation, Other -OtherPunctuation :: GeneralCategory - --- | Sm: Symbol, Math -MathSymbol :: GeneralCategory - --- | Sc: Symbol, Currency -CurrencySymbol :: GeneralCategory - --- | Sk: Symbol, Modifier -ModifierSymbol :: GeneralCategory - --- | So: Symbol, Other -OtherSymbol :: GeneralCategory - --- | Zs: Separator, Space -Space :: GeneralCategory - --- | Zl: Separator, Line -LineSeparator :: GeneralCategory - --- | Zp: Separator, Paragraph -ParagraphSeparator :: GeneralCategory - --- | Cc: Other, Control -Control :: GeneralCategory - --- | Cf: Other, Format -Format :: GeneralCategory - --- | Cs: Other, Surrogate -Surrogate :: GeneralCategory - --- | Co: Other, Private Use -PrivateUse :: GeneralCategory - --- | Cn: Other, Not Assigned -NotAssigned :: GeneralCategory - --- | The Unicode general category of the character. -generalCategory :: Char -> GeneralCategory - --- | Convert a letter to the corresponding upper-case letter, if any. Any --- other character is returned unchanged. -toUpper :: Char -> Char - --- | Convert a letter to the corresponding lower-case letter, if any. Any --- other character is returned unchanged. -toLower :: Char -> Char - --- | Convert a letter to the corresponding title-case or upper-case letter, --- if any. (Title case differs from upper case only for a small number of --- ligature letters.) Any other character is returned unchanged. -toTitle :: Char -> Char - --- | Convert a single digit Char to the corresponding Int. --- This function fails unless its argument satisfies isHexDigit, --- but recognises both upper and lower-case hexadecimal digits (i.e. --- '0'..'9', 'a'..'f', --- 'A'..'F'). -digitToInt :: Char -> Int - --- | Convert an Int in the range 0..15 to the --- corresponding single digit Char. This function fails on other --- inputs, and generates lower-case hexadecimal digits. -intToDigit :: Int -> Char - --- | The Prelude.fromEnum method restricted to the type --- Data.Char.Char. -ord :: Char -> Int - --- | The Prelude.toEnum method restricted to the type --- Data.Char.Char. -chr :: Int -> Char - --- | Convert a character to a string using only printable characters, using --- Haskell source-language escape conventions. For example: --- --- 
---   showLitChar '\n' s  =  "\\n" ++ s
---
-showLitChar :: Char -> ShowS - --- | Read a string representation of a character, using Haskell --- source-language escape conventions. For example: --- --- 
---   lexLitChar  "\\nHello"  =  [("\\n", "Hello")]
---
-lexLitChar :: ReadS String - --- | Read a string representation of a character, using Haskell --- source-language escape conventions, and convert it to the character --- that it encodes. For example: --- --- 
---   readLitChar "\\nHello"  =  [('\n', "Hello")]
---
-readLitChar :: ReadS Char - -module Data.Int - --- | A fixed-precision integer type with at least the range [-2^29 .. --- 2^29-1]. The exact range for a given implementation can be --- determined by using Prelude.minBound and --- Prelude.maxBound from the Prelude.Bounded class. -data Int :: * - --- | 8-bit signed integer type -data Int8 :: * - --- | 16-bit signed integer type -data Int16 :: * - --- | 32-bit signed integer type -data Int32 :: * - --- | 64-bit signed integer type -data Int64 :: * - -module Data.Ratio - --- | Rational numbers, with numerator and denominator of some --- Integral type. -data Integral a => Ratio a :: * -> * - --- | Arbitrary-precision rational numbers, represented as a ratio of two --- Integer values. A rational number may be constructed using the --- % operator. -type Rational = Ratio Integer - --- | Forms the ratio of two integral numbers. -(%) :: Integral a => a -> a -> Ratio a - --- | Extract the numerator of the ratio in reduced form: the numerator and --- denominator have no common factor and the denominator is positive. -numerator :: Integral a => Ratio a -> a - --- | Extract the denominator of the ratio in reduced form: the numerator --- and denominator have no common factor and the denominator is positive. -denominator :: Integral a => Ratio a -> a - --- | approxRational, applied to two real fractional numbers --- x and epsilon, returns the simplest rational number --- within epsilon of x. A rational number y is --- said to be simpler than another y' if --- --- --- --- Any real interval contains a unique simplest rational; in particular, --- note that 0/1 is the simplest rational of all. -approxRational :: RealFrac a => a -> a -> Rational - -module Data.Word - --- | A Word is an unsigned integral type, with the same size as --- Int. -data Word :: * - --- | 8-bit unsigned integer type -data Word8 :: * - --- | 16-bit unsigned integer type -data Word16 :: * - --- | 32-bit unsigned integer type -data Word32 :: * - --- | 64-bit unsigned integer type -data Word64 :: * - - --- | The module Foreign.Ptr provides typed pointers to foreign --- entities. We distinguish two kinds of pointers: pointers to data and --- pointers to functions. It is understood that these two kinds of --- pointers may be represented differently as they may be references to --- data and text segments, respectively. -module Foreign.Ptr - --- | A value of type Ptr a represents a pointer to an --- object, or an array of objects, which may be marshalled to or from --- Haskell values of type a. --- --- The type a will often be an instance of class --- Foreign.Storable.Storable which provides the marshalling --- operations. However this is not essential, and you can provide your --- own operations to access the pointer. For example you might write --- small foreign functions to get or set the fields of a C --- struct. -data Ptr a :: * -> * - --- | The constant nullPtr contains a distinguished value of --- Ptr that is not associated with a valid memory location. -nullPtr :: Ptr a - --- | The castPtr function casts a pointer from one type to another. -castPtr :: Ptr a -> Ptr b - --- | Advances the given address by the given offset in bytes. -plusPtr :: Ptr a -> Int -> Ptr b - --- | Given an arbitrary address and an alignment constraint, --- alignPtr yields the next higher address that fulfills the --- alignment constraint. An alignment constraint x is fulfilled --- by any address divisible by x. This operation is idempotent. -alignPtr :: Ptr a -> Int -> Ptr a - --- | Computes the offset required to get from the second to the first --- argument. We have --- --- 
---   p2 == p1 `plusPtr` (p2 `minusPtr` p1)
---
-minusPtr :: Ptr a -> Ptr b -> Int - --- | A value of type FunPtr a is a pointer to a function --- callable from foreign code. The type a will normally be a --- foreign type, a function type with zero or more arguments where --- --- --- --- A value of type FunPtr a may be a pointer to a foreign --- function, either returned by another foreign function or imported with --- a a static address import like --- --- 
---   foreign import ccall "stdlib.h &free"
---     p_free :: FunPtr (Ptr a -> IO ())
---
--- --- or a pointer to a Haskell function created using a wrapper stub --- declared to produce a FunPtr of the correct type. For example: --- --- 
---   type Compare = Int -> Int -> Bool
---   foreign import ccall "wrapper"
---     mkCompare :: Compare -> IO (FunPtr Compare)
---
--- --- Calls to wrapper stubs like mkCompare allocate storage, which --- should be released with Foreign.Ptr.freeHaskellFunPtr when no --- longer required. --- --- To convert FunPtr values to corresponding Haskell functions, --- one can define a dynamic stub for the specific foreign type, --- e.g. --- --- 
---   type IntFunction = CInt -> IO ()
---   foreign import ccall "dynamic" 
---     mkFun :: FunPtr IntFunction -> IntFunction
---
-data FunPtr a :: * -> * - --- | The constant nullFunPtr contains a distinguished value of --- FunPtr that is not associated with a valid memory location. -nullFunPtr :: FunPtr a - --- | Casts a FunPtr to a FunPtr of a different type. -castFunPtr :: FunPtr a -> FunPtr b - --- | Casts a FunPtr to a Ptr. --- --- Note: this is valid only on architectures where data and --- function pointers range over the same set of addresses, and should --- only be used for bindings to external libraries whose interface --- already relies on this assumption. -castFunPtrToPtr :: FunPtr a -> Ptr b - --- | Casts a Ptr to a FunPtr. --- --- Note: this is valid only on architectures where data and --- function pointers range over the same set of addresses, and should --- only be used for bindings to external libraries whose interface --- already relies on this assumption. -castPtrToFunPtr :: Ptr a -> FunPtr b - --- | Release the storage associated with the given FunPtr, which --- must have been obtained from a wrapper stub. This should be called --- whenever the return value from a foreign import wrapper function is no --- longer required; otherwise, the storage it uses will leak. -freeHaskellFunPtr :: FunPtr a -> IO () - --- | A signed integral type that can be losslessly converted to and from --- Ptr. This type is also compatible with the C99 type --- intptr_t, and can be marshalled to and from that type safely. -data IntPtr :: * - --- | casts a Ptr to an IntPtr -ptrToIntPtr :: Ptr a -> IntPtr - --- | casts an IntPtr to a Ptr -intPtrToPtr :: IntPtr -> Ptr a - --- | An unsigned integral type that can be losslessly converted to and from --- Ptr. This type is also compatible with the C99 type --- uintptr_t, and can be marshalled to and from that type --- safely. -data WordPtr :: * - --- | casts a Ptr to a WordPtr -ptrToWordPtr :: Ptr a -> WordPtr - --- | casts a WordPtr to a Ptr -wordPtrToPtr :: WordPtr -> Ptr a - -module Data.Maybe - --- | The Maybe type encapsulates an optional value. A value of type --- Maybe a either contains a value of type a --- (represented as Just a), or it is empty (represented --- as Nothing). Using Maybe is a good way to deal with --- errors or exceptional cases without resorting to drastic measures such --- as error. --- --- The Maybe type is also a monad. It is a simple kind of error --- monad, where all errors are represented by Nothing. A richer --- error monad can be built using the Data.Either.Either type. -data Maybe a :: * -> * -Nothing :: Maybe a -Just :: a -> Maybe a - --- | The maybe function takes a default value, a function, and a --- Maybe value. If the Maybe value is Nothing, the --- function returns the default value. Otherwise, it applies the function --- to the value inside the Just and returns the result. -maybe :: b -> (a -> b) -> Maybe a -> b - --- | The isJust function returns True iff its argument is of --- the form Just _. -isJust :: Maybe a -> Bool - --- | The isNothing function returns True iff its argument is --- Nothing. -isNothing :: Maybe a -> Bool - --- | The fromJust function extracts the element out of a Just --- and throws an error if its argument is Nothing. -fromJust :: Maybe a -> a - --- | The fromMaybe function takes a default value and and --- Maybe value. If the Maybe is Nothing, it returns --- the default values; otherwise, it returns the value contained in the --- Maybe. -fromMaybe :: a -> Maybe a -> a - --- | The listToMaybe function returns Nothing on an empty --- list or Just a where a is the first element --- of the list. -listToMaybe :: [a] -> Maybe a - --- | The maybeToList function returns an empty list when given --- Nothing or a singleton list when not given Nothing. -maybeToList :: Maybe a -> [a] - --- | The catMaybes function takes a list of Maybes and --- returns a list of all the Just values. -catMaybes :: [Maybe a] -> [a] - --- | The mapMaybe function is a version of map which can --- throw out elements. In particular, the functional argument returns --- something of type Maybe b. If this is Nothing, --- no element is added on to the result list. If it just Just --- b, then b is included in the result list. -mapMaybe :: (a -> Maybe b) -> [a] -> [b] - -module Numeric - --- | Converts a possibly-negative Real value to a string. -showSigned :: Real a => (a -> ShowS) -> Int -> a -> ShowS - --- | Shows a non-negative Integral number using the base --- specified by the first argument, and the character representation --- specified by the second. -showIntAtBase :: Integral a => a -> (Int -> Char) -> a -> ShowS - --- | Show non-negative Integral numbers in base 10. -showInt :: Integral a => a -> ShowS - --- | Show non-negative Integral numbers in base 16. -showHex :: Integral a => a -> ShowS - --- | Show non-negative Integral numbers in base 8. -showOct :: Integral a => a -> ShowS - --- | Show a signed RealFloat value using scientific (exponential) --- notation (e.g. 2.45e2, 1.5e-3). --- --- In the call showEFloat digs val, if digs is --- Nothing, the value is shown to full precision; if digs --- is Just d, then at most d digits after the --- decimal point are shown. -showEFloat :: RealFloat a => Maybe Int -> a -> ShowS - --- | Show a signed RealFloat value using standard decimal notation --- (e.g. 245000, 0.0015). --- --- In the call showFFloat digs val, if digs is --- Nothing, the value is shown to full precision; if digs --- is Just d, then at most d digits after the --- decimal point are shown. -showFFloat :: RealFloat a => Maybe Int -> a -> ShowS - --- | Show a signed RealFloat value using standard decimal notation --- for arguments whose absolute value lies between 0.1 and --- 9,999,999, and scientific notation otherwise. --- --- In the call showGFloat digs val, if digs is --- Nothing, the value is shown to full precision; if digs --- is Just d, then at most d digits after the --- decimal point are shown. -showGFloat :: RealFloat a => Maybe Int -> a -> ShowS - --- | Show a signed RealFloat value to full precision using standard --- decimal notation for arguments whose absolute value lies between --- 0.1 and 9,999,999, and scientific notation --- otherwise. -showFloat :: RealFloat a => a -> ShowS - --- | floatToDigits takes a base and a non-negative RealFloat --- number, and returns a list of digits and an exponent. In particular, --- if x>=0, and --- --- 
---   floatToDigits base x = ([d1,d2,...,dn], e)
---
--- --- then --- ---
    --- 
  1. n >= 1
    2. --- 
  2. x = 0.d1d2...dn * (base**e)
    3. --- 
  3. 0 <= di <= base-1
    4. ---
-floatToDigits :: RealFloat a => Integer -> a -> ([Int], Int) - --- | Reads a signed Real value, given a reader for an --- unsigned value. -readSigned :: Real a => ReadS a -> ReadS a - --- | Reads an unsigned Integral value in an arbitrary base. -readInt :: Num a => a -> (Char -> Bool) -> (Char -> Int) -> ReadS a - --- | Read an unsigned number in decimal notation. -readDec :: Num a => ReadS a - --- | Read an unsigned number in octal notation. -readOct :: Num a => ReadS a - --- | Read an unsigned number in hexadecimal notation. Both upper or lower --- case letters are allowed. -readHex :: Num a => ReadS a - --- | Reads an unsigned RealFrac value, expressed in decimal --- scientific notation. -readFloat :: RealFrac a => ReadS a - --- | Reads a non-empty string of decimal digits. -lexDigits :: ReadS String - --- | Converts a Rational value into any type in class --- RealFloat. -fromRat :: RealFloat a => Rational -> a - -module System.IO.Error - --- | Errors of type IOError are used by the IO monad. This is --- an abstract type; the module System.IO.Error provides functions --- to interrogate and construct values of type IOError. -type IOError = IOError - --- | Construct an IOError value with a string describing the error. --- The fail method of the IO instance of the Monad --- class raises a userError, thus: --- --- 
---   instance Monad IO where 
---     ...
---     fail s = ioError (userError s)
---
-userError :: String -> IOError - --- | Construct an IOError of the given type where the second --- argument describes the error location and the third and fourth --- argument contain the file handle and file path of the file involved in --- the error if applicable. -mkIOError :: IOErrorType -> String -> Maybe Handle -> Maybe FilePath -> IOError - --- | Adds a location description and maybe a file path and file handle to --- an IOError. If any of the file handle or file path is not given --- the corresponding value in the IOError remains unaltered. -annotateIOError :: IOError -> String -> Maybe Handle -> Maybe FilePath -> IOError - --- | An error indicating that an IO operation failed because one of --- its arguments already exists. -isAlreadyExistsError :: IOError -> Bool - --- | An error indicating that an IO operation failed because one of --- its arguments does not exist. -isDoesNotExistError :: IOError -> Bool - --- | An error indicating that an IO operation failed because one of --- its arguments is a single-use resource, which is already being used --- (for example, opening the same file twice for writing might give this --- error). -isAlreadyInUseError :: IOError -> Bool - --- | An error indicating that an IO operation failed because the --- device is full. -isFullError :: IOError -> Bool - --- | An error indicating that an IO operation failed because the end --- of file has been reached. -isEOFError :: IOError -> Bool - --- | An error indicating that an IO operation failed because the --- operation was not possible. Any computation which returns an IO --- result may fail with isIllegalOperation. In some cases, an --- implementation will not be able to distinguish between the possible --- error causes. In this case it should fail with --- isIllegalOperation. -isIllegalOperation :: IOError -> Bool - --- | An error indicating that an IO operation failed because the --- user does not have sufficient operating system privilege to perform --- that operation. -isPermissionError :: IOError -> Bool - --- | A programmer-defined error value constructed using userError. -isUserError :: IOError -> Bool -ioeGetErrorString :: IOError -> String -ioeGetHandle :: IOError -> Maybe Handle -ioeGetFileName :: IOError -> Maybe FilePath - --- | An abstract type that contains a value for each variant of --- IOError. -data IOErrorType :: * - --- | I/O error where the operation failed because one of its arguments --- already exists. -alreadyExistsErrorType :: IOErrorType - --- | I/O error where the operation failed because one of its arguments does --- not exist. -doesNotExistErrorType :: IOErrorType - --- | I/O error where the operation failed because one of its arguments is a --- single-use resource, which is already being used. -alreadyInUseErrorType :: IOErrorType - --- | I/O error where the operation failed because the device is full. -fullErrorType :: IOErrorType - --- | I/O error where the operation failed because the end of file has been --- reached. -eofErrorType :: IOErrorType - --- | I/O error where the operation is not possible. -illegalOperationErrorType :: IOErrorType - --- | I/O error where the operation failed because the user does not have --- sufficient operating system privilege to perform that operation. -permissionErrorType :: IOErrorType - --- | I/O error that is programmer-defined. -userErrorType :: IOErrorType - --- | Raise an IOError in the IO monad. -ioError :: IOError -> IO a - --- | The catch function establishes a handler that receives any --- IOError raised in the action protected by catch. An --- IOError is caught by the most recent handler established by --- catch. These handlers are not selective: all IOErrors --- are caught. Exception propagation must be explicitly provided in a --- handler by re-raising any unwanted exceptions. For example, in --- --- 
---   f = catch g (\e -> if IO.isEOFError e then return [] else ioError e)
---
--- --- the function f returns [] when an end-of-file --- exception (cf. isEOFError) occurs in g; otherwise, the --- exception is propagated to the next outer handler. --- --- When an exception propagates outside the main program, the Haskell --- system prints the associated IOError value and exits the --- program. -catch :: IO a -> (IOError -> IO a) -> IO a - --- | The construct try comp exposes IO errors which occur --- within a computation, and which are not fully handled. -try :: IO a -> IO (Either IOError a) - - --- | This module defines bitwise operations for signed and unsigned --- integers. -module Data.Bits - --- | The Bits class defines bitwise operations over integral types. --- --- --- --- Minimal complete definition: .&., .|., xor, --- complement, (shift or (shiftL and --- shiftR)), (rotate or (rotateL and --- rotateR)), bitSize and isSigned. -class Num a => Bits a -(.&.) :: Bits a => a -> a -> a -(.|.) :: Bits a => a -> a -> a -xor :: Bits a => a -> a -> a -complement :: Bits a => a -> a -shift :: Bits a => a -> Int -> a -rotate :: Bits a => a -> Int -> a -bit :: Bits a => Int -> a -setBit :: Bits a => a -> Int -> a -clearBit :: Bits a => a -> Int -> a -complementBit :: Bits a => a -> Int -> a -testBit :: Bits a => a -> Int -> Bool -bitSize :: Bits a => a -> Int -isSigned :: Bits a => a -> Bool -shiftL :: Bits a => a -> Int -> a -shiftR :: Bits a => a -> Int -> a -rotateL :: Bits a => a -> Int -> a -rotateR :: Bits a => a -> Int -> a - -module Foreign.Storable - --- | The member functions of this class facilitate writing values of --- primitive types to raw memory (which may have been allocated with the --- above mentioned routines) and reading values from blocks of raw --- memory. The class, furthermore, includes support for computing the --- storage requirements and alignment restrictions of storable types. --- --- Memory addresses are represented as values of type Ptr --- a, for some a which is an instance of class --- Storable. The type argument to Ptr helps provide some --- valuable type safety in FFI code (you can't mix pointers of different --- types without an explicit cast), while helping the Haskell type system --- figure out which marshalling method is needed for a given pointer. --- --- All marshalling between Haskell and a foreign language ultimately --- boils down to translating Haskell data structures into the binary --- representation of a corresponding data structure of the foreign --- language and vice versa. To code this marshalling in Haskell, it is --- necessary to manipulate primitive data types stored in unstructured --- memory blocks. The class Storable facilitates this manipulation --- on all types for which it is instantiated, which are the standard --- basic types of Haskell, the fixed size Int types --- (Int8, Int16, Int32, Int64), the fixed --- size Word types (Word8, Word16, Word32, --- Word64), StablePtr, all types from --- Foreign.C.Types, as well as Ptr. --- --- Minimal complete definition: sizeOf, alignment, one of --- peek, peekElemOff and peekByteOff, and one of --- poke, pokeElemOff and pokeByteOff. -class Storable a -sizeOf :: Storable a => a -> Int -alignment :: Storable a => a -> Int -peekElemOff :: Storable a => Ptr a -> Int -> IO a -pokeElemOff :: Storable a => Ptr a -> Int -> a -> IO () -peekByteOff :: Storable a => Ptr b -> Int -> IO a -pokeByteOff :: Storable a => Ptr b -> Int -> a -> IO () -peek :: Storable a => Ptr a -> IO a -poke :: Storable a => Ptr a -> a -> IO () - -module Foreign.C.Types - --- | Haskell type representing the C char type. -data CChar :: * - --- | Haskell type representing the C signed char type. -data CSChar :: * - --- | Haskell type representing the C unsigned char type. -data CUChar :: * - --- | Haskell type representing the C short type. -data CShort :: * - --- | Haskell type representing the C unsigned short type. -data CUShort :: * - --- | Haskell type representing the C int type. -data CInt :: * - --- | Haskell type representing the C unsigned int type. -data CUInt :: * - --- | Haskell type representing the C long type. -data CLong :: * - --- | Haskell type representing the C unsigned long type. -data CULong :: * - --- | Haskell type representing the C ptrdiff_t type. -data CPtrdiff :: * - --- | Haskell type representing the C size_t type. -data CSize :: * - --- | Haskell type representing the C wchar_t type. -data CWchar :: * - --- | Haskell type representing the C sig_atomic_t type. -data CSigAtomic :: * - --- | Haskell type representing the C long long type. -data CLLong :: * - --- | Haskell type representing the C unsigned long long type. -data CULLong :: * -data CIntPtr :: * -data CUIntPtr :: * -data CIntMax :: * -data CUIntMax :: * - --- | Haskell type representing the C clock_t type. -data CClock :: * - --- | Haskell type representing the C time_t type. -data CTime :: * - --- | Haskell type representing the C float type. -data CFloat :: * - --- | Haskell type representing the C double type. -data CDouble :: * - --- | Haskell type representing the C FILE type. -data CFile :: * - --- | Haskell type representing the C fpos_t type. -data CFpos :: * - --- | Haskell type representing the C jmp_buf type. -data CJmpBuf :: * - -module Foreign.ForeignPtr - --- | The type ForeignPtr represents references to objects that are --- maintained in a foreign language, i.e., that are not part of the data --- structures usually managed by the Haskell storage manager. The --- essential difference between ForeignPtrs and vanilla memory --- references of type Ptr a is that the former may be associated --- with finalizers. A finalizer is a routine that is invoked when --- the Haskell storage manager detects that - within the Haskell heap and --- stack - there are no more references left that are pointing to the --- ForeignPtr. Typically, the finalizer will, then, invoke --- routines in the foreign language that free the resources bound by the --- foreign object. --- --- The ForeignPtr is parameterised in the same way as Ptr. --- The type argument of ForeignPtr should normally be an instance --- of class Storable. -data ForeignPtr a :: * -> * - --- | A finalizer is represented as a pointer to a foreign function that, at --- finalisation time, gets as an argument a plain pointer variant of the --- foreign pointer that the finalizer is associated with. -type FinalizerPtr a = FunPtr (Ptr a -> IO ()) -type FinalizerEnvPtr env a = FunPtr (Ptr env -> Ptr a -> IO ()) - --- | Turns a plain memory reference into a foreign pointer, and associates --- a finalizer with the reference. The finalizer will be executed after --- the last reference to the foreign object is dropped. There is no --- guarantee of promptness, however the finalizer will be executed before --- the program exits. -newForeignPtr :: FinalizerPtr a -> Ptr a -> IO (ForeignPtr a) - --- | Turns a plain memory reference into a foreign pointer that may be --- associated with finalizers by using addForeignPtrFinalizer. -newForeignPtr_ :: Ptr a -> IO (ForeignPtr a) - --- | This function adds a finalizer to the given foreign object. The --- finalizer will run before all other finalizers for the same --- object which have already been registered. -addForeignPtrFinalizer :: FinalizerPtr a -> ForeignPtr a -> IO () - --- | This variant of newForeignPtr adds a finalizer that expects an --- environment in addition to the finalized pointer. The environment that --- will be passed to the finalizer is fixed by the second argument to --- newForeignPtrEnv. -newForeignPtrEnv :: FinalizerEnvPtr env a -> Ptr env -> Ptr a -> IO (ForeignPtr a) - --- | Like addForeignPtrFinalizerEnv but allows the finalizer to be --- passed an additional environment parameter to be passed to the --- finalizer. The environment passed to the finalizer is fixed by the --- second argument to addForeignPtrFinalizerEnv -addForeignPtrFinalizerEnv :: FinalizerEnvPtr env a -> Ptr env -> ForeignPtr a -> IO () - --- | This is a way to look at the pointer living inside a foreign object. --- This function takes a function which is applied to that pointer. The --- resulting IO action is then executed. The foreign object is --- kept alive at least during the whole action, even if it is not used --- directly inside. Note that it is not safe to return the pointer from --- the action and use it after the action completes. All uses of the --- pointer should be inside the withForeignPtr bracket. The reason --- for this unsafeness is the same as for unsafeForeignPtrToPtr --- below: the finalizer may run earlier than expected, because the --- compiler can only track usage of the ForeignPtr object, not a --- Ptr object made from it. --- --- This function is normally used for marshalling data to or from the --- object pointed to by the ForeignPtr, using the operations from --- the Storable class. -withForeignPtr :: ForeignPtr a -> (Ptr a -> IO b) -> IO b - --- | Causes the finalizers associated with a foreign pointer to be run --- immediately. -finalizeForeignPtr :: ForeignPtr a -> IO () - --- | This function extracts the pointer component of a foreign pointer. --- This is a potentially dangerous operations, as if the argument to --- unsafeForeignPtrToPtr is the last usage occurrence of the given --- foreign pointer, then its finalizer(s) will be run, which potentially --- invalidates the plain pointer just obtained. Hence, --- touchForeignPtr must be used wherever it has to be guaranteed --- that the pointer lives on - i.e., has another usage occurrence. --- --- To avoid subtle coding errors, hand written marshalling code should --- preferably use Foreign.ForeignPtr.withForeignPtr rather than --- combinations of unsafeForeignPtrToPtr and --- touchForeignPtr. However, the latter routines are occasionally --- preferred in tool generated marshalling code. -unsafeForeignPtrToPtr :: ForeignPtr a -> Ptr a - --- | This function ensures that the foreign object in question is alive at --- the given place in the sequence of IO actions. In particular --- withForeignPtr does a touchForeignPtr after it executes --- the user action. --- --- Note that this function should not be used to express dependencies --- between finalizers on ForeignPtrs. For example, if the --- finalizer for a ForeignPtr F1 calls --- touchForeignPtr on a second ForeignPtr F2, then --- the only guarantee is that the finalizer for F2 is never --- started before the finalizer for F1. They might be started --- together if for example both F1 and F2 are otherwise --- unreachable. --- --- In general, it is not recommended to use finalizers on separate --- objects with ordering constraints between them. To express the --- ordering robustly requires explicit synchronisation between --- finalizers. -touchForeignPtr :: ForeignPtr a -> IO () - --- | This function casts a ForeignPtr parameterised by one type into --- another type. -castForeignPtr :: ForeignPtr a -> ForeignPtr b - --- | Allocate some memory and return a ForeignPtr to it. The memory --- will be released automatically when the ForeignPtr is --- discarded. --- --- mallocForeignPtr is equivalent to --- --- 
---   do { p <- malloc; newForeignPtr finalizerFree p }
---
--- --- although it may be implemented differently internally: you may not --- assume that the memory returned by mallocForeignPtr has been --- allocated with Foreign.Marshal.Alloc.malloc. -mallocForeignPtr :: Storable a => IO (ForeignPtr a) - --- | This function is similar to mallocForeignPtr, except that the --- size of the memory required is given explicitly as a number of bytes. -mallocForeignPtrBytes :: Int -> IO (ForeignPtr a) - --- | This function is similar to --- Foreign.Marshal.Array.mallocArray, but yields a memory area --- that has a finalizer attached that releases the memory area. As with --- mallocForeignPtr, it is not guaranteed that the block of memory --- was allocated by Foreign.Marshal.Alloc.malloc. -mallocForeignPtrArray :: Storable a => Int -> IO (ForeignPtr a) - --- | This function is similar to --- Foreign.Marshal.Array.mallocArray0, but yields a memory area --- that has a finalizer attached that releases the memory area. As with --- mallocForeignPtr, it is not guaranteed that the block of memory --- was allocated by Foreign.Marshal.Alloc.malloc. -mallocForeignPtrArray0 :: Storable a => Int -> IO (ForeignPtr a) - -module System.Exit - --- | Defines the exit codes that a program can return. -data ExitCode :: * - --- | indicates successful termination; -ExitSuccess :: ExitCode - --- | indicates program failure with an exit code. The exact interpretation --- of the code is operating-system dependent. In particular, some values --- may be prohibited (e.g. 0 on a POSIX-compliant system). -ExitFailure :: Int -> ExitCode - --- | Computation exitWith code terminates the program, --- returning code to the program's caller. The caller may --- interpret the return code as it wishes, but the program should return --- ExitSuccess to mean normal completion, and --- ExitFailure n to mean that the program encountered a --- problem from which it could not recover. The value exitFailure --- is equal to exitWith (ExitFailure exitfail), --- where exitfail is implementation-dependent. exitWith --- bypasses the error handling in the I/O monad and cannot be intercepted --- by catch from the Prelude. -exitWith :: ExitCode -> IO a - --- | The computation exitFailure is equivalent to exitWith --- (ExitFailure exitfail), where --- exitfail is implementation-dependent. -exitFailure :: IO a - --- | The computation exitSuccess is equivalent to exitWith --- ExitSuccess, It terminates the program successfully. -exitSuccess :: IO a - -module Foreign.Marshal.Error - --- | Execute an IO action, throwing a userError if the --- predicate yields True when applied to the result returned by --- the IO action. If no exception is raised, return the result of --- the computation. -throwIf :: (a -> Bool) -> (a -> String) -> IO a -> IO a - --- | Like throwIf, but discarding the result -throwIf_ :: (a -> Bool) -> (a -> String) -> IO a -> IO () - --- | Guards against negative result values -throwIfNeg :: (Ord a, Num a) => (a -> String) -> IO a -> IO a - --- | Like throwIfNeg, but discarding the result -throwIfNeg_ :: (Ord a, Num a) => (a -> String) -> IO a -> IO () - --- | Guards against null pointers -throwIfNull :: String -> IO (Ptr a) -> IO (Ptr a) - --- | Discard the return value of an IO action -void :: IO a -> IO () - - --- | The module Foreign.Marshal.Alloc provides operations to --- allocate and deallocate blocks of raw memory (i.e., unstructured --- chunks of memory outside of the area maintained by the Haskell storage --- manager). These memory blocks are commonly used to pass compound data --- structures to foreign functions or to provide space in which compound --- result values are obtained from foreign functions. --- --- If any of the allocation functions fails, a value of nullPtr --- is produced. If free or reallocBytes is applied to a --- memory area that has been allocated with alloca or --- allocaBytes, the behaviour is undefined. Any further access to --- memory areas allocated with alloca or allocaBytes, after --- the computation that was passed to the allocation function has --- terminated, leads to undefined behaviour. Any further access to the --- memory area referenced by a pointer passed to realloc, --- reallocBytes, or free entails undefined behaviour. --- --- All storage allocated by functions that allocate based on a size in --- bytes must be sufficiently aligned for any of the basic foreign --- types that fits into the newly allocated storage. All storage --- allocated by functions that allocate based on a specific type must be --- sufficiently aligned for that type. Array allocation routines need to --- obey the same alignment constraints for each array element. -module Foreign.Marshal.Alloc - --- | alloca f executes the computation f, passing --- as argument a pointer to a temporarily allocated block of memory --- sufficient to hold values of type a. --- --- The memory is freed when f terminates (either normally or via --- an exception), so the pointer passed to f must not be --- used after this. -alloca :: Storable a => (Ptr a -> IO b) -> IO b - --- | allocaBytes n f executes the computation f, --- passing as argument a pointer to a temporarily allocated block of --- memory of n bytes. The block of memory is sufficiently --- aligned for any of the basic foreign types that fits into a memory --- block of the allocated size. --- --- The memory is freed when f terminates (either normally or via --- an exception), so the pointer passed to f must not be --- used after this. -allocaBytes :: Int -> (Ptr a -> IO b) -> IO b - --- | Allocate a block of memory that is sufficient to hold values of type --- a. The size of the area allocated is determined by the --- sizeOf method from the instance of Storable for the --- appropriate type. --- --- The memory may be deallocated using free or --- finalizerFree when no longer required. -malloc :: Storable a => IO (Ptr a) - --- | Allocate a block of memory of the given number of bytes. The block of --- memory is sufficiently aligned for any of the basic foreign types that --- fits into a memory block of the allocated size. --- --- The memory may be deallocated using free or --- finalizerFree when no longer required. -mallocBytes :: Int -> IO (Ptr a) - --- | Resize a memory area that was allocated with malloc or --- mallocBytes to the size needed to store values of type --- b. The returned pointer may refer to an entirely different --- memory area, but will be suitably aligned to hold values of type --- b. The contents of the referenced memory area will be the --- same as of the original pointer up to the minimum of the original size --- and the size of values of type b. --- --- If the argument to realloc is nullPtr, realloc --- behaves like malloc. -realloc :: Storable b => Ptr a -> IO (Ptr b) - --- | Resize a memory area that was allocated with malloc or --- mallocBytes to the given size. The returned pointer may refer --- to an entirely different memory area, but will be sufficiently aligned --- for any of the basic foreign types that fits into a memory block of --- the given size. The contents of the referenced memory area will be the --- same as of the original pointer up to the minimum of the original size --- and the given size. --- --- If the pointer argument to reallocBytes is nullPtr, --- reallocBytes behaves like malloc. If the requested size --- is 0, reallocBytes behaves like free. -reallocBytes :: Ptr a -> Int -> IO (Ptr a) - --- | Free a block of memory that was allocated with malloc, --- mallocBytes, realloc, reallocBytes, --- Foreign.Marshal.Utils.new or any of the newX --- functions in Foreign.Marshal.Array or Foreign.C.String. -free :: Ptr a -> IO () - --- | A pointer to a foreign function equivalent to free, which may --- be used as a finalizer (cf Foreign.ForeignPtr.ForeignPtr) for --- storage allocated with malloc, mallocBytes, --- realloc or reallocBytes. -finalizerFree :: FinalizerPtr a - -module Foreign.Marshal.Utils - --- | with val f executes the computation f, --- passing as argument a pointer to a temporarily allocated block of --- memory into which val has been marshalled (the combination of --- alloca and poke). --- --- The memory is freed when f terminates (either normally or via --- an exception), so the pointer passed to f must not be --- used after this. -with :: Storable a => a -> (Ptr a -> IO b) -> IO b - --- | Allocate a block of memory and marshal a value into it (the --- combination of malloc and poke). The size of the area --- allocated is determined by the Foreign.Storable.sizeOf method --- from the instance of Storable for the appropriate type. --- --- The memory may be deallocated using --- Foreign.Marshal.Alloc.free or --- Foreign.Marshal.Alloc.finalizerFree when no longer required. -new :: Storable a => a -> IO (Ptr a) - --- | Convert a Haskell Bool to its numeric representation -fromBool :: Num a => Bool -> a - --- | Convert a Boolean in numeric representation to a Haskell value -toBool :: Num a => a -> Bool - --- | Allocate storage and marshal a storable value wrapped into a --- Maybe --- --- -maybeNew :: (a -> IO (Ptr a)) -> Maybe a -> IO (Ptr a) - --- | Converts a withXXX combinator into one marshalling a value --- wrapped into a Maybe, using nullPtr to represent --- Nothing. -maybeWith :: (a -> (Ptr b -> IO c) -> IO c) -> Maybe a -> (Ptr b -> IO c) -> IO c - --- | Convert a peek combinator into a one returning Nothing if --- applied to a nullPtr -maybePeek :: (Ptr a -> IO b) -> Ptr a -> IO (Maybe b) - --- | Replicates a withXXX combinator over a list of objects, --- yielding a list of marshalled objects -withMany :: (a -> (b -> res) -> res) -> [a] -> ([b] -> res) -> res - --- | Copies the given number of bytes from the second area (source) into --- the first (destination); the copied areas may not overlap -copyBytes :: Ptr a -> Ptr a -> Int -> IO () - --- | Copies the given number of bytes from the second area (source) into --- the first (destination); the copied areas may overlap -moveBytes :: Ptr a -> Ptr a -> Int -> IO () - - --- | The module Foreign.Marshal.Array provides operations for --- marshalling Haskell lists into monolithic arrays and vice versa. Most --- functions come in two flavours: one for arrays terminated by a special --- termination element and one where an explicit length parameter is used --- to determine the extent of an array. The typical example for the --- former case are C's NUL terminated strings. However, please note that --- C strings should usually be marshalled using the functions provided by --- Foreign.C.String as the Unicode encoding has to be taken into --- account. All functions specifically operating on arrays that are --- terminated by a special termination element have a name ending on --- 0---e.g., mallocArray allocates space for an array of --- the given size, whereas mallocArray0 allocates space for one --- more element to ensure that there is room for the terminator. -module Foreign.Marshal.Array - --- | Allocate storage for the given number of elements of a storable type --- (like Foreign.Marshal.Alloc.malloc, but for multiple --- elements). -mallocArray :: Storable a => Int -> IO (Ptr a) - --- | Like mallocArray, but add an extra position to hold a special --- termination element. -mallocArray0 :: Storable a => Int -> IO (Ptr a) - --- | Temporarily allocate space for the given number of elements (like --- Foreign.Marshal.Alloc.alloca, but for multiple elements). -allocaArray :: Storable a => Int -> (Ptr a -> IO b) -> IO b - --- | Like allocaArray, but add an extra position to hold a special --- termination element. -allocaArray0 :: Storable a => Int -> (Ptr a -> IO b) -> IO b - --- | Adjust the size of an array -reallocArray :: Storable a => Ptr a -> Int -> IO (Ptr a) - --- | Adjust the size of an array including an extra position for the end --- marker. -reallocArray0 :: Storable a => Ptr a -> Int -> IO (Ptr a) - --- | Convert an array of given length into a Haskell list. -peekArray :: Storable a => Int -> Ptr a -> IO [a] - --- | Convert an array terminated by the given end marker into a Haskell --- list -peekArray0 :: (Storable a, Eq a) => a -> Ptr a -> IO [a] - --- | Write the list elements consecutive into memory -pokeArray :: Storable a => Ptr a -> [a] -> IO () - --- | Write the list elements consecutive into memory and terminate them --- with the given marker element -pokeArray0 :: Storable a => a -> Ptr a -> [a] -> IO () - --- | Write a list of storable elements into a newly allocated, consecutive --- sequence of storable values (like Foreign.Marshal.Utils.new, --- but for multiple elements). -newArray :: Storable a => [a] -> IO (Ptr a) - --- | Write a list of storable elements into a newly allocated, consecutive --- sequence of storable values, where the end is fixed by the given end --- marker -newArray0 :: Storable a => a -> [a] -> IO (Ptr a) - --- | Temporarily store a list of storable values in memory (like --- Foreign.Marshal.Utils.with, but for multiple elements). -withArray :: Storable a => [a] -> (Ptr a -> IO b) -> IO b - --- | Like withArray, but a terminator indicates where the array ends -withArray0 :: Storable a => a -> [a] -> (Ptr a -> IO b) -> IO b - --- | Like withArray, but the action gets the number of values as an --- additional parameter -withArrayLen :: Storable a => [a] -> (Int -> Ptr a -> IO b) -> IO b - --- | Like withArrayLen, but a terminator indicates where the array --- ends -withArrayLen0 :: Storable a => a -> [a] -> (Int -> Ptr a -> IO b) -> IO b - --- | Copy the given number of elements from the second array (source) into --- the first array (destination); the copied areas may not overlap -copyArray :: Storable a => Ptr a -> Ptr a -> Int -> IO () - --- | Copy the given number of elements from the second array (source) into --- the first array (destination); the copied areas may overlap -moveArray :: Storable a => Ptr a -> Ptr a -> Int -> IO () - --- | Return the number of elements in an array, excluding the terminator -lengthArray0 :: (Storable a, Eq a) => a -> Ptr a -> IO Int - --- | Advance a pointer into an array by the given number of elements -advancePtr :: Storable a => Ptr a -> Int -> Ptr a - - --- | Utilities for primitive marshalling of C strings. --- --- The marshalling converts each Haskell character, representing a --- Unicode code point, to one or more bytes in a manner that, by default, --- is determined by the current locale. As a consequence, no guarantees --- can be made about the relative length of a Haskell string and its --- corresponding C string, and therefore all the marshalling routines --- include memory allocation. The translation between Unicode and the --- encoding of the current locale may be lossy. -module Foreign.C.String - --- | A C string is a reference to an array of C characters terminated by --- NUL. -type CString = Ptr CChar - --- | A string with explicit length information in bytes instead of a --- terminating NUL (allowing NUL characters in the middle of the string). -type CStringLen = (Ptr CChar, Int) - --- | Marshal a NUL terminated C string into a Haskell string. -peekCString :: CString -> IO String - --- | Marshal a C string with explicit length into a Haskell string. -peekCStringLen :: CStringLen -> IO String - --- | Marshal a Haskell string into a NUL terminated C string. --- --- -newCString :: String -> IO CString - --- | Marshal a Haskell string into a C string (ie, character array) with --- explicit length information. --- --- -newCStringLen :: String -> IO CStringLen - --- | Marshal a Haskell string into a NUL terminated C string using --- temporary storage. --- --- -withCString :: String -> (CString -> IO a) -> IO a - --- | Marshal a Haskell string into a C string (ie, character array) in --- temporary storage, with explicit length information. --- --- -withCStringLen :: String -> (CStringLen -> IO a) -> IO a - --- | Determines whether a character can be accurately encoded in a --- CString. Unrepresentable characters are converted to --- '?'. --- --- Currently only Latin-1 characters are representable. -charIsRepresentable :: Char -> IO Bool - --- | Convert a Haskell character to a C character. This function is only --- safe on the first 256 characters. -castCharToCChar :: Char -> CChar - --- | Convert a C byte, representing a Latin-1 character, to the --- corresponding Haskell character. -castCCharToChar :: CChar -> Char - --- | Convert a Haskell character to a C unsigned char. This --- function is only safe on the first 256 characters. -castCharToCUChar :: Char -> CUChar - --- | Convert a C unsigned char, representing a Latin-1 character, --- to the corresponding Haskell character. -castCUCharToChar :: CUChar -> Char - --- | Convert a Haskell character to a C signed char. This function --- is only safe on the first 256 characters. -castCharToCSChar :: Char -> CSChar - --- | Convert a C signed char, representing a Latin-1 character, to --- the corresponding Haskell character. -castCSCharToChar :: CSChar -> Char - --- | Marshal a NUL terminated C string into a Haskell string. -peekCAString :: CString -> IO String - --- | Marshal a C string with explicit length into a Haskell string. -peekCAStringLen :: CStringLen -> IO String - --- | Marshal a Haskell string into a NUL terminated C string. --- --- -newCAString :: String -> IO CString - --- | Marshal a Haskell string into a C string (ie, character array) with --- explicit length information. --- --- -newCAStringLen :: String -> IO CStringLen - --- | Marshal a Haskell string into a NUL terminated C string using --- temporary storage. --- --- -withCAString :: String -> (CString -> IO a) -> IO a - --- | Marshal a Haskell string into a C string (ie, character array) in --- temporary storage, with explicit length information. --- --- -withCAStringLen :: String -> (CStringLen -> IO a) -> IO a - --- | A C wide string is a reference to an array of C wide characters --- terminated by NUL. -type CWString = Ptr CWchar - --- | A wide character string with explicit length information in --- CWchars instead of a terminating NUL (allowing NUL characters --- in the middle of the string). -type CWStringLen = (Ptr CWchar, Int) - --- | Marshal a NUL terminated C wide string into a Haskell string. -peekCWString :: CWString -> IO String - --- | Marshal a C wide string with explicit length into a Haskell string. -peekCWStringLen :: CWStringLen -> IO String - --- | Marshal a Haskell string into a NUL terminated C wide string. --- --- -newCWString :: String -> IO CWString - --- | Marshal a Haskell string into a C wide string (ie, wide character --- array) with explicit length information. --- --- -newCWStringLen :: String -> IO CWStringLen - --- | Marshal a Haskell string into a NUL terminated C wide string using --- temporary storage. --- --- -withCWString :: String -> (CWString -> IO a) -> IO a - --- | Marshal a Haskell string into a NUL terminated C wide string using --- temporary storage. --- --- -withCWStringLen :: String -> (CWStringLen -> IO a) -> IO a - - --- | The module Foreign.C.Error facilitates C-specific error --- handling of errno. -module Foreign.C.Error - --- | Haskell representation for errno values. The implementation --- is deliberately exposed, to allow users to add their own definitions --- of Errno values. -newtype Errno :: * -Errno :: CInt -> Errno -eOK :: Errno -e2BIG :: Errno -eACCES :: Errno -eADDRINUSE :: Errno -eADDRNOTAVAIL :: Errno -eADV :: Errno -eAFNOSUPPORT :: Errno -eAGAIN :: Errno -eALREADY :: Errno -eBADF :: Errno -eBADMSG :: Errno -eBADRPC :: Errno -eBUSY :: Errno -eCHILD :: Errno -eCOMM :: Errno -eCONNABORTED :: Errno -eCONNREFUSED :: Errno -eCONNRESET :: Errno -eDEADLK :: Errno -eDESTADDRREQ :: Errno -eDIRTY :: Errno -eDOM :: Errno -eDQUOT :: Errno -eEXIST :: Errno -eFAULT :: Errno -eFBIG :: Errno -eFTYPE :: Errno -eHOSTDOWN :: Errno -eHOSTUNREACH :: Errno -eIDRM :: Errno -eILSEQ :: Errno -eINPROGRESS :: Errno -eINTR :: Errno -eINVAL :: Errno -eIO :: Errno -eISCONN :: Errno -eISDIR :: Errno -eLOOP :: Errno -eMFILE :: Errno -eMLINK :: Errno -eMSGSIZE :: Errno -eMULTIHOP :: Errno -eNAMETOOLONG :: Errno -eNETDOWN :: Errno -eNETRESET :: Errno -eNETUNREACH :: Errno -eNFILE :: Errno -eNOBUFS :: Errno -eNODATA :: Errno -eNODEV :: Errno -eNOENT :: Errno -eNOEXEC :: Errno -eNOLCK :: Errno -eNOLINK :: Errno -eNOMEM :: Errno -eNOMSG :: Errno -eNONET :: Errno -eNOPROTOOPT :: Errno -eNOSPC :: Errno -eNOSR :: Errno -eNOSTR :: Errno -eNOSYS :: Errno -eNOTBLK :: Errno -eNOTCONN :: Errno -eNOTDIR :: Errno -eNOTEMPTY :: Errno -eNOTSOCK :: Errno -eNOTTY :: Errno -eNXIO :: Errno -eOPNOTSUPP :: Errno -ePERM :: Errno -ePFNOSUPPORT :: Errno -ePIPE :: Errno -ePROCLIM :: Errno -ePROCUNAVAIL :: Errno -ePROGMISMATCH :: Errno -ePROGUNAVAIL :: Errno -ePROTO :: Errno -ePROTONOSUPPORT :: Errno -ePROTOTYPE :: Errno -eRANGE :: Errno -eREMCHG :: Errno -eREMOTE :: Errno -eROFS :: Errno -eRPCMISMATCH :: Errno -eRREMOTE :: Errno -eSHUTDOWN :: Errno -eSOCKTNOSUPPORT :: Errno -eSPIPE :: Errno -eSRCH :: Errno -eSRMNT :: Errno -eSTALE :: Errno -eTIME :: Errno -eTIMEDOUT :: Errno -eTOOMANYREFS :: Errno -eTXTBSY :: Errno -eUSERS :: Errno -eWOULDBLOCK :: Errno -eXDEV :: Errno - --- | Yield True if the given Errno value is valid on the --- system. This implies that the Eq instance of Errno is --- also system dependent as it is only defined for valid values of --- Errno. -isValidErrno :: Errno -> Bool - --- | Get the current value of errno in the current thread. -getErrno :: IO Errno - --- | Reset the current thread's errno value to eOK. -resetErrno :: IO () - --- | Construct an IOError based on the given Errno value. The --- optional information can be used to improve the accuracy of error --- messages. -errnoToIOError :: String -> Errno -> Maybe Handle -> Maybe String -> IOError - --- | Throw an IOError corresponding to the current value of --- getErrno. -throwErrno :: String -> IO a - --- | Throw an IOError corresponding to the current value of --- getErrno if the result value of the IO action meets the --- given predicate. -throwErrnoIf :: (a -> Bool) -> String -> IO a -> IO a - --- | as throwErrnoIf, but discards the result of the IO --- action after error handling. -throwErrnoIf_ :: (a -> Bool) -> String -> IO a -> IO () - --- | as throwErrnoIf, but retry the IO action when it yields --- the error code eINTR - this amounts to the standard retry loop --- for interrupted POSIX system calls. -throwErrnoIfRetry :: (a -> Bool) -> String -> IO a -> IO a - --- | as throwErrnoIfRetry, but discards the result. -throwErrnoIfRetry_ :: (a -> Bool) -> String -> IO a -> IO () - --- | Throw an IOError corresponding to the current value of --- getErrno if the IO action returns a result of --- -1. -throwErrnoIfMinus1 :: Num a => String -> IO a -> IO a - --- | as throwErrnoIfMinus1, but discards the result. -throwErrnoIfMinus1_ :: Num a => String -> IO a -> IO () - --- | Throw an IOError corresponding to the current value of --- getErrno if the IO action returns a result of --- -1, but retries in case of an interrupted operation. -throwErrnoIfMinus1Retry :: Num a => String -> IO a -> IO a - --- | as throwErrnoIfMinus1, but discards the result. -throwErrnoIfMinus1Retry_ :: Num a => String -> IO a -> IO () - --- | Throw an IOError corresponding to the current value of --- getErrno if the IO action returns nullPtr. -throwErrnoIfNull :: String -> IO (Ptr a) -> IO (Ptr a) - --- | Throw an IOError corresponding to the current value of --- getErrno if the IO action returns nullPtr, but --- retry in case of an interrupted operation. -throwErrnoIfNullRetry :: String -> IO (Ptr a) -> IO (Ptr a) - --- | as throwErrnoIfRetry, but additionally if the operation yields --- the error code eAGAIN or eWOULDBLOCK, an alternative --- action is executed before retrying. -throwErrnoIfRetryMayBlock :: (a -> Bool) -> String -> IO a -> IO b -> IO a - --- | as throwErrnoIfRetryMayBlock, but discards the result. -throwErrnoIfRetryMayBlock_ :: (a -> Bool) -> String -> IO a -> IO b -> IO () - --- | as throwErrnoIfMinus1Retry, but checks for operations that --- would block. -throwErrnoIfMinus1RetryMayBlock :: Num a => String -> IO a -> IO b -> IO a - --- | as throwErrnoIfMinus1RetryMayBlock, but discards the result. -throwErrnoIfMinus1RetryMayBlock_ :: Num a => String -> IO a -> IO b -> IO () - --- | as throwErrnoIfNullRetry, but checks for operations that would --- block. -throwErrnoIfNullRetryMayBlock :: String -> IO (Ptr a) -> IO b -> IO (Ptr a) - --- | as throwErrno, but exceptions include the given path when --- appropriate. -throwErrnoPath :: String -> FilePath -> IO a - --- | as throwErrnoIf, but exceptions include the given path when --- appropriate. -throwErrnoPathIf :: (a -> Bool) -> String -> FilePath -> IO a -> IO a - --- | as throwErrnoIf_, but exceptions include the given path when --- appropriate. -throwErrnoPathIf_ :: (a -> Bool) -> String -> FilePath -> IO a -> IO () - --- | as throwErrnoIfNull, but exceptions include the given path when --- appropriate. -throwErrnoPathIfNull :: String -> FilePath -> IO (Ptr a) -> IO (Ptr a) - --- | as throwErrnoIfMinus1, but exceptions include the given path --- when appropriate. -throwErrnoPathIfMinus1 :: Num a => String -> FilePath -> IO a -> IO a - --- | as throwErrnoIfMinus1_, but exceptions include the given path --- when appropriate. -throwErrnoPathIfMinus1_ :: Num a => String -> FilePath -> IO a -> IO () - -module Foreign.Marshal - --- | Sometimes an external entity is a pure function, except that it passes --- arguments and/or results via pointers. The function --- unsafeLocalState permits the packaging of such entities as --- pure functions. --- --- The only IO operations allowed in the IO action passed to --- unsafeLocalState are (a) local allocation (alloca, --- allocaBytes and derived operations such as withArray --- and withCString), and (b) pointer operations --- (Foreign.Storable and Foreign.Ptr) on the pointers --- to local storage, and (c) foreign functions whose only observable --- effect is to read and/or write the locally allocated memory. Passing --- an IO operation that does not obey these rules results in undefined --- behaviour. --- --- It is expected that this operation will be replaced in a future --- revision of Haskell. -unsafeLocalState :: IO a -> a - -module Data.Complex - --- | Complex numbers are an algebraic type. --- --- For a complex number z, abs z is a number --- with the magnitude of z, but oriented in the positive real --- direction, whereas signum z has the phase of --- z, but unit magnitude. -data RealFloat a => Complex a :: * -> * - --- | forms a complex number from its real and imaginary rectangular --- components. -(:+) :: !a -> !a -> Complex a - --- | Extracts the real part of a complex number. -realPart :: RealFloat a => Complex a -> a - --- | Extracts the imaginary part of a complex number. -imagPart :: RealFloat a => Complex a -> a - --- | Form a complex number from polar components of magnitude and phase. -mkPolar :: RealFloat a => a -> a -> Complex a - --- | cis t is a complex value with magnitude 1 and --- phase t (modulo 2*pi). -cis :: RealFloat a => a -> Complex a - --- | The function polar takes a complex number and returns a --- (magnitude, phase) pair in canonical form: the magnitude is --- nonnegative, and the phase in the range (-pi, --- pi]; if the magnitude is zero, then so is the phase. -polar :: RealFloat a => Complex a -> (a, a) - --- | The nonnegative magnitude of a complex number. -magnitude :: RealFloat a => Complex a -> a - --- | The phase of a complex number, in the range (-pi, --- pi]. If the magnitude is zero, then so is the phase. -phase :: RealFloat a => Complex a -> a - --- | The conjugate of a complex number. -conjugate :: RealFloat a => Complex a -> Complex a - -module System.Environment - --- | Computation getArgs returns a list of the program's command --- line arguments (not including the program name). -getArgs :: IO [String] - --- | Computation getProgName returns the name of the program as it --- was invoked. --- --- However, this is hard-to-impossible to implement on some non-Unix --- OSes, so instead, for maximum portability, we just return the leafname --- of the program as invoked. Even then there are some differences --- between platforms: on Windows, for example, a program invoked as foo --- is probably really FOO.EXE, and that is what --- getProgName will return. -getProgName :: IO String - --- | Computation getEnv var returns the value of the --- environment variable var. --- --- This computation may fail with: --- --- -getEnv :: String -> IO String - -module Foreign.C - -module Foreign - -module Data.List - --- | Append two lists, i.e., --- --- 
---   [x1, ..., xm] ++ [y1, ..., yn] == [x1, ..., xm, y1, ..., yn]
---   [x1, ..., xm] ++ [y1, ...] == [x1, ..., xm, y1, ...]
---
--- --- If the first list is not finite, the result is the first list. -(++) :: [a] -> [a] -> [a] - --- | Extract the first element of a list, which must be non-empty. -head :: [a] -> a - --- | Extract the last element of a list, which must be finite and --- non-empty. -last :: [a] -> a - --- | Extract the elements after the head of a list, which must be --- non-empty. -tail :: [a] -> [a] - --- | Return all the elements of a list except the last one. The list must --- be non-empty. -init :: [a] -> [a] - --- | Test whether a list is empty. -null :: [a] -> Bool - --- | O(n). length returns the length of a finite list as an --- Int. It is an instance of the more general --- Data.List.genericLength, the result type of which may be any --- kind of number. -length :: [a] -> Int - --- | map f xs is the list obtained by applying f --- to each element of xs, i.e., --- --- 
---   map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn]
---   map f [x1, x2, ...] == [f x1, f x2, ...]
---
-map :: (a -> b) -> [a] -> [b] - --- | reverse xs returns the elements of xs in --- reverse order. xs must be finite. -reverse :: [a] -> [a] - --- | The intersperse function takes an element and a list and --- `intersperses' that element between the elements of the list. For --- example, --- --- 
---   intersperse ',' "abcde" == "a,b,c,d,e"
---
-intersperse :: a -> [a] -> [a] - --- | intercalate xs xss is equivalent to (concat --- (intersperse xs xss)). It inserts the list xs in --- between the lists in xss and concatenates the result. -intercalate :: [a] -> [[a]] -> [a] - --- | The transpose function transposes the rows and columns of its --- argument. For example, --- --- 
---   transpose [[1,2,3],[4,5,6]] == [[1,4],[2,5],[3,6]]
---
-transpose :: [[a]] -> [[a]] - --- | The subsequences function returns the list of all subsequences --- of the argument. --- --- 
---   subsequences "abc" == ["","a","b","ab","c","ac","bc","abc"]
---
-subsequences :: [a] -> [[a]] - --- | The permutations function returns the list of all permutations --- of the argument. --- --- 
---   permutations "abc" == ["abc","bac","cba","bca","cab","acb"]
---
-permutations :: [a] -> [[a]] - --- | foldl, applied to a binary operator, a starting value --- (typically the left-identity of the operator), and a list, reduces the --- list using the binary operator, from left to right: --- --- 
---   foldl f z [x1, x2, ..., xn] == (...((z `f` x1) `f` x2) `f`...) `f` xn
---
--- --- The list must be finite. -foldl :: (a -> b -> a) -> a -> [b] -> a - --- | A strict version of foldl. -foldl' :: (a -> b -> a) -> a -> [b] -> a - --- | foldl1 is a variant of foldl that has no starting value --- argument, and thus must be applied to non-empty lists. -foldl1 :: (a -> a -> a) -> [a] -> a - --- | A strict version of foldl1 -foldl1' :: (a -> a -> a) -> [a] -> a - --- | foldr, applied to a binary operator, a starting value --- (typically the right-identity of the operator), and a list, reduces --- the list using the binary operator, from right to left: --- --- 
---   foldr f z [x1, x2, ..., xn] == x1 `f` (x2 `f` ... (xn `f` z)...)
---
-foldr :: (a -> b -> b) -> b -> [a] -> b - --- | foldr1 is a variant of foldr that has no starting value --- argument, and thus must be applied to non-empty lists. -foldr1 :: (a -> a -> a) -> [a] -> a - --- | Concatenate a list of lists. -concat :: [[a]] -> [a] - --- | Map a function over a list and concatenate the results. -concatMap :: (a -> [b]) -> [a] -> [b] - --- | and returns the conjunction of a Boolean list. For the result --- to be True, the list must be finite; False, however, --- results from a False value at a finite index of a finite or --- infinite list. -and :: [Bool] -> Bool - --- | or returns the disjunction of a Boolean list. For the result to --- be False, the list must be finite; True, however, --- results from a True value at a finite index of a finite or --- infinite list. -or :: [Bool] -> Bool - --- | Applied to a predicate and a list, any determines if any --- element of the list satisfies the predicate. For the result to be --- False, the list must be finite; True, however, results --- from a True value for the predicate applied to an element at a --- finite index of a finite or infinite list. -any :: (a -> Bool) -> [a] -> Bool - --- | Applied to a predicate and a list, all determines if all --- elements of the list satisfy the predicate. For the result to be --- True, the list must be finite; False, however, results --- from a False value for the predicate applied to an element at a --- finite index of a finite or infinite list. -all :: (a -> Bool) -> [a] -> Bool - --- | The sum function computes the sum of a finite list of numbers. -sum :: Num a => [a] -> a - --- | The product function computes the product of a finite list of --- numbers. -product :: Num a => [a] -> a - --- | maximum returns the maximum value from a list, which must be --- non-empty, finite, and of an ordered type. It is a special case of --- maximumBy, which allows the programmer to supply their own --- comparison function. -maximum :: Ord a => [a] -> a - --- | minimum returns the minimum value from a list, which must be --- non-empty, finite, and of an ordered type. It is a special case of --- minimumBy, which allows the programmer to supply their own --- comparison function. -minimum :: Ord a => [a] -> a - --- | scanl is similar to foldl, but returns a list of --- successive reduced values from the left: --- --- 
---   scanl f z [x1, x2, ...] == [z, z `f` x1, (z `f` x1) `f` x2, ...]
---
--- --- Note that --- --- 
---   last (scanl f z xs) == foldl f z xs.
---
-scanl :: (a -> b -> a) -> a -> [b] -> [a] - --- | scanl1 is a variant of scanl that has no starting value --- argument: --- --- 
---   scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...]
---
-scanl1 :: (a -> a -> a) -> [a] -> [a] - --- | scanr is the right-to-left dual of scanl. Note that --- --- 
---   head (scanr f z xs) == foldr f z xs.
---
-scanr :: (a -> b -> b) -> b -> [a] -> [b] - --- | scanr1 is a variant of scanr that has no starting value --- argument. -scanr1 :: (a -> a -> a) -> [a] -> [a] - --- | The mapAccumL function behaves like a combination of map --- and foldl; it applies a function to each element of a list, --- passing an accumulating parameter from left to right, and returning a --- final value of this accumulator together with the new list. -mapAccumL :: (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y]) - --- | The mapAccumR function behaves like a combination of map --- and foldr; it applies a function to each element of a list, --- passing an accumulating parameter from right to left, and returning a --- final value of this accumulator together with the new list. -mapAccumR :: (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y]) - --- | iterate f x returns an infinite list of repeated --- applications of f to x: --- --- 
---   iterate f x == [x, f x, f (f x), ...]
---
-iterate :: (a -> a) -> a -> [a] - --- | repeat x is an infinite list, with x the --- value of every element. -repeat :: a -> [a] - --- | replicate n x is a list of length n with --- x the value of every element. It is an instance of the more --- general Data.List.genericReplicate, in which n may --- be of any integral type. -replicate :: Int -> a -> [a] - --- | cycle ties a finite list into a circular one, or equivalently, --- the infinite repetition of the original list. It is the identity on --- infinite lists. -cycle :: [a] -> [a] - --- | The unfoldr function is a `dual' to foldr: while --- foldr reduces a list to a summary value, unfoldr builds --- a list from a seed value. The function takes the element and returns --- Nothing if it is done producing the list or returns Just --- (a,b), in which case, a is a prepended to the list --- and b is used as the next element in a recursive call. For --- example, --- --- 
---   iterate f == unfoldr (\x -> Just (x, f x))
---
--- --- In some cases, unfoldr can undo a foldr operation: --- --- 
---   unfoldr f' (foldr f z xs) == xs
---
--- --- if the following holds: --- --- 
---   f' (f x y) = Just (x,y)
---   f' z       = Nothing
---
--- --- A simple use of unfoldr: --- --- 
---   unfoldr (\b -> if b == 0 then Nothing else Just (b, b-1)) 10
---    [10,9,8,7,6,5,4,3,2,1]
---
-unfoldr :: (b -> Maybe (a, b)) -> b -> [a] - --- | take n, applied to a list xs, returns the --- prefix of xs of length n, or xs itself if --- n > length xs: --- --- 
---   take 5 "Hello World!" == "Hello"
---   take 3 [1,2,3,4,5] == [1,2,3]
---   take 3 [1,2] == [1,2]
---   take 3 [] == []
---   take (-1) [1,2] == []
---   take 0 [1,2] == []
---
--- --- It is an instance of the more general Data.List.genericTake, --- in which n may be of any integral type. -take :: Int -> [a] -> [a] - --- | drop n xs returns the suffix of xs after the --- first n elements, or [] if n > length --- xs: --- --- 
---   drop 6 "Hello World!" == "World!"
---   drop 3 [1,2,3,4,5] == [4,5]
---   drop 3 [1,2] == []
---   drop 3 [] == []
---   drop (-1) [1,2] == [1,2]
---   drop 0 [1,2] == [1,2]
---
--- --- It is an instance of the more general Data.List.genericDrop, --- in which n may be of any integral type. -drop :: Int -> [a] -> [a] - --- | splitAt n xs returns a tuple where first element is --- xs prefix of length n and second element is the --- remainder of the list: --- --- 
---   splitAt 6 "Hello World!" == ("Hello ","World!")
---   splitAt 3 [1,2,3,4,5] == ([1,2,3],[4,5])
---   splitAt 1 [1,2,3] == ([1],[2,3])
---   splitAt 3 [1,2,3] == ([1,2,3],[])
---   splitAt 4 [1,2,3] == ([1,2,3],[])
---   splitAt 0 [1,2,3] == ([],[1,2,3])
---   splitAt (-1) [1,2,3] == ([],[1,2,3])
---
--- --- It is equivalent to (take n xs, drop n xs). --- splitAt is an instance of the more general --- Data.List.genericSplitAt, in which n may be of any --- integral type. -splitAt :: Int -> [a] -> ([a], [a]) - --- | takeWhile, applied to a predicate p and a list --- xs, returns the longest prefix (possibly empty) of --- xs of elements that satisfy p: --- --- 
---   takeWhile (< 3) [1,2,3,4,1,2,3,4] == [1,2]
---   takeWhile (< 9) [1,2,3] == [1,2,3]
---   takeWhile (< 0) [1,2,3] == []
---
-takeWhile :: (a -> Bool) -> [a] -> [a] - --- | dropWhile p xs returns the suffix remaining after --- takeWhile p xs: --- --- 
---   dropWhile (< 3) [1,2,3,4,5,1,2,3] == [3,4,5,1,2,3]
---   dropWhile (< 9) [1,2,3] == []
---   dropWhile (< 0) [1,2,3] == [1,2,3]
---
-dropWhile :: (a -> Bool) -> [a] -> [a] - --- | span, applied to a predicate p and a list xs, --- returns a tuple where first element is longest prefix (possibly empty) --- of xs of elements that satisfy p and second element --- is the remainder of the list: --- --- 
---   span (< 3) [1,2,3,4,1,2,3,4] == ([1,2],[3,4,1,2,3,4])
---   span (< 9) [1,2,3] == ([1,2,3],[])
---   span (< 0) [1,2,3] == ([],[1,2,3])
---
--- --- span p xs is equivalent to (takeWhile p xs, --- dropWhile p xs) -span :: (a -> Bool) -> [a] -> ([a], [a]) - --- | break, applied to a predicate p and a list --- xs, returns a tuple where first element is longest prefix --- (possibly empty) of xs of elements that do not satisfy --- p and second element is the remainder of the list: --- --- 
---   break (> 3) [1,2,3,4,1,2,3,4] == ([1,2,3],[4,1,2,3,4])
---   break (< 9) [1,2,3] == ([],[1,2,3])
---   break (> 9) [1,2,3] == ([1,2,3],[])
---
--- --- break p is equivalent to span (not . --- p). -break :: (a -> Bool) -> [a] -> ([a], [a]) - --- | The stripPrefix function drops the given prefix from a list. It --- returns Nothing if the list did not start with the prefix --- given, or Just the list after the prefix, if it does. --- --- 
---   stripPrefix "foo" "foobar" == Just "bar"
---   stripPrefix "foo" "foo" == Just ""
---   stripPrefix "foo" "barfoo" == Nothing
---   stripPrefix "foo" "barfoobaz" == Nothing
---
-stripPrefix :: Eq a => [a] -> [a] -> Maybe [a] - --- | The group function takes a list and returns a list of lists --- such that the concatenation of the result is equal to the argument. --- Moreover, each sublist in the result contains only equal elements. For --- example, --- --- 
---   group "Mississippi" = ["M","i","ss","i","ss","i","pp","i"]
---
--- --- It is a special case of groupBy, which allows the programmer to --- supply their own equality test. -group :: Eq a => [a] -> [[a]] - --- | The inits function returns all initial segments of the --- argument, shortest first. For example, --- --- 
---   inits "abc" == ["","a","ab","abc"]
---
-inits :: [a] -> [[a]] - --- | The tails function returns all final segments of the argument, --- longest first. For example, --- --- 
---   tails "abc" == ["abc", "bc", "c",""]
---
-tails :: [a] -> [[a]] - --- | The isPrefixOf function takes two lists and returns True --- iff the first list is a prefix of the second. -isPrefixOf :: Eq a => [a] -> [a] -> Bool - --- | The isSuffixOf function takes two lists and returns True --- iff the first list is a suffix of the second. Both lists must be --- finite. -isSuffixOf :: Eq a => [a] -> [a] -> Bool - --- | The isInfixOf function takes two lists and returns True --- iff the first list is contained, wholly and intact, anywhere within --- the second. --- --- Example: --- --- 
---   isInfixOf "Haskell" "I really like Haskell." == True
---   isInfixOf "Ial" "I really like Haskell." == False
---
-isInfixOf :: Eq a => [a] -> [a] -> Bool - --- | elem is the list membership predicate, usually written in infix --- form, e.g., x `elem` xs. For the result to be False, --- the list must be finite; True, however, results from an element --- equal to x found at a finite index of a finite or infinite --- list. -elem :: Eq a => a -> [a] -> Bool - --- | notElem is the negation of elem. -notElem :: Eq a => a -> [a] -> Bool - --- | lookup key assocs looks up a key in an association --- list. -lookup :: Eq a => a -> [(a, b)] -> Maybe b - --- | The find function takes a predicate and a list and returns the --- first element in the list matching the predicate, or Nothing if --- there is no such element. -find :: (a -> Bool) -> [a] -> Maybe a - --- | filter, applied to a predicate and a list, returns the list of --- those elements that satisfy the predicate; i.e., --- --- 
---   filter p xs = [ x | x <- xs, p x]
---
-filter :: (a -> Bool) -> [a] -> [a] - --- | The partition function takes a predicate a list and returns the --- pair of lists of elements which do and do not satisfy the predicate, --- respectively; i.e., --- --- 
---   partition p xs == (filter p xs, filter (not . p) xs)
---
-partition :: (a -> Bool) -> [a] -> ([a], [a]) - --- | List index (subscript) operator, starting from 0. It is an instance of --- the more general Data.List.genericIndex, which takes an index --- of any integral type. -(!!) :: [a] -> Int -> a - --- | The elemIndex function returns the index of the first element --- in the given list which is equal (by ==) to the query element, --- or Nothing if there is no such element. -elemIndex :: Eq a => a -> [a] -> Maybe Int - --- | The elemIndices function extends elemIndex, by returning --- the indices of all elements equal to the query element, in ascending --- order. -elemIndices :: Eq a => a -> [a] -> [Int] - --- | The findIndex function takes a predicate and a list and returns --- the index of the first element in the list satisfying the predicate, --- or Nothing if there is no such element. -findIndex :: (a -> Bool) -> [a] -> Maybe Int - --- | The findIndices function extends findIndex, by returning --- the indices of all elements satisfying the predicate, in ascending --- order. -findIndices :: (a -> Bool) -> [a] -> [Int] - --- | zip takes two lists and returns a list of corresponding pairs. --- If one input list is short, excess elements of the longer list are --- discarded. -zip :: [a] -> [b] -> [(a, b)] - --- | zip3 takes three lists and returns a list of triples, analogous --- to zip. -zip3 :: [a] -> [b] -> [c] -> [(a, b, c)] - --- | The zip4 function takes four lists and returns a list of --- quadruples, analogous to zip. -zip4 :: [a] -> [b] -> [c] -> [d] -> [(a, b, c, d)] - --- | The zip5 function takes five lists and returns a list of --- five-tuples, analogous to zip. -zip5 :: [a] -> [b] -> [c] -> [d] -> [e] -> [(a, b, c, d, e)] - --- | The zip6 function takes six lists and returns a list of --- six-tuples, analogous to zip. -zip6 :: [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [(a, b, c, d, e, f)] - --- | The zip7 function takes seven lists and returns a list of --- seven-tuples, analogous to zip. -zip7 :: [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g] -> [(a, b, c, d, e, f, g)] - --- | zipWith generalises zip by zipping with the function --- given as the first argument, instead of a tupling function. For --- example, zipWith (+) is applied to two lists to --- produce the list of corresponding sums. -zipWith :: (a -> b -> c) -> [a] -> [b] -> [c] - --- | The zipWith3 function takes a function which combines three --- elements, as well as three lists and returns a list of their --- point-wise combination, analogous to zipWith. -zipWith3 :: (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d] - --- | The zipWith4 function takes a function which combines four --- elements, as well as four lists and returns a list of their point-wise --- combination, analogous to zipWith. -zipWith4 :: (a -> b -> c -> d -> e) -> [a] -> [b] -> [c] -> [d] -> [e] - --- | The zipWith5 function takes a function which combines five --- elements, as well as five lists and returns a list of their point-wise --- combination, analogous to zipWith. -zipWith5 :: (a -> b -> c -> d -> e -> f) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] - --- | The zipWith6 function takes a function which combines six --- elements, as well as six lists and returns a list of their point-wise --- combination, analogous to zipWith. -zipWith6 :: (a -> b -> c -> d -> e -> f -> g) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g] - --- | The zipWith7 function takes a function which combines seven --- elements, as well as seven lists and returns a list of their --- point-wise combination, analogous to zipWith. -zipWith7 :: (a -> b -> c -> d -> e -> f -> g -> h) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g] -> [h] - --- | unzip transforms a list of pairs into a list of first --- components and a list of second components. -unzip :: [(a, b)] -> ([a], [b]) - --- | The unzip3 function takes a list of triples and returns three --- lists, analogous to unzip. -unzip3 :: [(a, b, c)] -> ([a], [b], [c]) - --- | The unzip4 function takes a list of quadruples and returns four --- lists, analogous to unzip. -unzip4 :: [(a, b, c, d)] -> ([a], [b], [c], [d]) - --- | The unzip5 function takes a list of five-tuples and returns --- five lists, analogous to unzip. -unzip5 :: [(a, b, c, d, e)] -> ([a], [b], [c], [d], [e]) - --- | The unzip6 function takes a list of six-tuples and returns six --- lists, analogous to unzip. -unzip6 :: [(a, b, c, d, e, f)] -> ([a], [b], [c], [d], [e], [f]) - --- | The unzip7 function takes a list of seven-tuples and returns --- seven lists, analogous to unzip. -unzip7 :: [(a, b, c, d, e, f, g)] -> ([a], [b], [c], [d], [e], [f], [g]) - --- | lines breaks a string up into a list of strings at newline --- characters. The resulting strings do not contain newlines. -lines :: String -> [String] - --- | words breaks a string up into a list of words, which were --- delimited by white space. -words :: String -> [String] - --- | unlines is an inverse operation to lines. It joins --- lines, after appending a terminating newline to each. -unlines :: [String] -> String - --- | unwords is an inverse operation to words. It joins words --- with separating spaces. -unwords :: [String] -> String - --- | O(n^2). The nub function removes duplicate elements from --- a list. In particular, it keeps only the first occurrence of each --- element. (The name nub means `essence'.) It is a special case --- of nubBy, which allows the programmer to supply their own --- equality test. -nub :: Eq a => [a] -> [a] - --- | delete x removes the first occurrence of x --- from its list argument. For example, --- --- 
---   delete 'a' "banana" == "bnana"
---
--- --- It is a special case of deleteBy, which allows the programmer --- to supply their own equality test. -delete :: Eq a => a -> [a] -> [a] - --- | The \\ function is list difference ((non-associative). In the --- result of xs \\ ys, the first occurrence of --- each element of ys in turn (if any) has been removed from --- xs. Thus --- --- 
---   (xs ++ ys) \\ xs == ys.
---
--- --- It is a special case of deleteFirstsBy, which allows the --- programmer to supply their own equality test. -(\\) :: Eq a => [a] -> [a] -> [a] - --- | The union function returns the list union of the two lists. For --- example, --- --- 
---   "dog" `union` "cow" == "dogcw"
---
--- --- Duplicates, and elements of the first list, are removed from the the --- second list, but if the first list contains duplicates, so will the --- result. It is a special case of unionBy, which allows the --- programmer to supply their own equality test. -union :: Eq a => [a] -> [a] -> [a] - --- | The intersect function takes the list intersection of two --- lists. For example, --- --- 
---   [1,2,3,4] `intersect` [2,4,6,8] == [2,4]
---
--- --- If the first list contains duplicates, so will the result. --- --- 
---   [1,2,2,3,4] `intersect` [6,4,4,2] == [2,2,4]
---
--- --- It is a special case of intersectBy, which allows the --- programmer to supply their own equality test. -intersect :: Eq a => [a] -> [a] -> [a] - --- | The sort function implements a stable sorting algorithm. It is --- a special case of sortBy, which allows the programmer to supply --- their own comparison function. -sort :: Ord a => [a] -> [a] - --- | The insert function takes an element and a list and inserts the --- element into the list at the last position where it is still less than --- or equal to the next element. In particular, if the list is sorted --- before the call, the result will also be sorted. It is a special case --- of insertBy, which allows the programmer to supply their own --- comparison function. -insert :: Ord a => a -> [a] -> [a] - --- | The nubBy function behaves just like nub, except it uses --- a user-supplied equality predicate instead of the overloaded == --- function. -nubBy :: (a -> a -> Bool) -> [a] -> [a] - --- | The deleteBy function behaves like delete, but takes a --- user-supplied equality predicate. -deleteBy :: (a -> a -> Bool) -> a -> [a] -> [a] - --- | The deleteFirstsBy function takes a predicate and two lists and --- returns the first list with the first occurrence of each element of --- the second list removed. -deleteFirstsBy :: (a -> a -> Bool) -> [a] -> [a] -> [a] - --- | The unionBy function is the non-overloaded version of --- union. -unionBy :: (a -> a -> Bool) -> [a] -> [a] -> [a] - --- | The intersectBy function is the non-overloaded version of --- intersect. -intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a] - --- | The groupBy function is the non-overloaded version of --- group. -groupBy :: (a -> a -> Bool) -> [a] -> [[a]] - --- | The sortBy function is the non-overloaded version of --- sort. -sortBy :: (a -> a -> Ordering) -> [a] -> [a] - --- | The non-overloaded version of insert. -insertBy :: (a -> a -> Ordering) -> a -> [a] -> [a] - --- | The maximumBy function takes a comparison function and a list --- and returns the greatest element of the list by the comparison --- function. The list must be finite and non-empty. -maximumBy :: (a -> a -> Ordering) -> [a] -> a - --- | The minimumBy function takes a comparison function and a list --- and returns the least element of the list by the comparison function. --- The list must be finite and non-empty. -minimumBy :: (a -> a -> Ordering) -> [a] -> a - --- | The genericLength function is an overloaded version of --- length. In particular, instead of returning an Int, it --- returns any type which is an instance of Num. It is, however, --- less efficient than length. -genericLength :: Num i => [b] -> i - --- | The genericTake function is an overloaded version of --- take, which accepts any Integral value as the number of --- elements to take. -genericTake :: Integral i => i -> [a] -> [a] - --- | The genericDrop function is an overloaded version of --- drop, which accepts any Integral value as the number of --- elements to drop. -genericDrop :: Integral i => i -> [a] -> [a] - --- | The genericSplitAt function is an overloaded version of --- splitAt, which accepts any Integral value as the --- position at which to split. -genericSplitAt :: Integral i => i -> [b] -> ([b], [b]) - --- | The genericIndex function is an overloaded version of --- !!, which accepts any Integral value as the index. -genericIndex :: Integral a => [b] -> a -> b - --- | The genericReplicate function is an overloaded version of --- replicate, which accepts any Integral value as the --- number of repetitions to make. -genericReplicate :: Integral i => i -> a -> [a] - - --- | The Control.Monad module provides the Functor, --- Monad and MonadPlus classes, together with some useful --- operations on monads. -module Control.Monad - --- | The Functor class is used for types that can be mapped over. --- Instances of Functor should satisfy the following laws: --- --- 
---   fmap id  ==  id
---   fmap (f . g)  ==  fmap f . fmap g
---
--- --- The instances of Functor for lists, Data.Maybe.Maybe --- and System.IO.IO satisfy these laws. -class Functor f :: (* -> *) -fmap :: Functor f => (a -> b) -> f a -> f b - --- | The Monad class defines the basic operations over a --- monad, a concept from a branch of mathematics known as --- category theory. From the perspective of a Haskell programmer, --- however, it is best to think of a monad as an abstract datatype --- of actions. Haskell's do expressions provide a convenient --- syntax for writing monadic expressions. --- --- Minimal complete definition: >>= and return. --- --- Instances of Monad should satisfy the following laws: --- --- 
---   return a >>= k  ==  k a
---   m >>= return  ==  m
---   m >>= (\x -> k x >>= h)  ==  (m >>= k) >>= h
---
--- --- Instances of both Monad and Functor should additionally --- satisfy the law: --- --- 
---   fmap f xs  ==  xs >>= return . f
---
--- --- The instances of Monad for lists, Data.Maybe.Maybe and --- System.IO.IO defined in the Prelude satisfy these --- laws. -class Monad m :: (* -> *) -(>>=) :: Monad m => m a -> (a -> m b) -> m b -(>>) :: Monad m => m a -> m b -> m b -return :: Monad m => a -> m a -fail :: Monad m => String -> m a - --- | Monads that also support choice and failure. -class Monad m => MonadPlus m :: (* -> *) -mzero :: MonadPlus m => m a -mplus :: MonadPlus m => m a -> m a -> m a - --- | mapM f is equivalent to sequence . --- map f. -mapM :: Monad m => (a -> m b) -> [a] -> m [b] - --- | mapM_ f is equivalent to sequence_ . --- map f. -mapM_ :: Monad m => (a -> m b) -> [a] -> m () - --- | forM is mapM with its arguments flipped -forM :: Monad m => [a] -> (a -> m b) -> m [b] - --- | forM_ is mapM_ with its arguments flipped -forM_ :: Monad m => [a] -> (a -> m b) -> m () - --- | Evaluate each action in the sequence from left to right, and collect --- the results. -sequence :: Monad m => [m a] -> m [a] - --- | Evaluate each action in the sequence from left to right, and ignore --- the results. -sequence_ :: Monad m => [m a] -> m () - --- | Same as >>=, but with the arguments interchanged. -(=<<) :: Monad m => (a -> m b) -> m a -> m b - --- | Left-to-right Kleisli composition of monads. -(>=>) :: Monad m => (a -> m b) -> (b -> m c) -> a -> m c - --- | Right-to-left Kleisli composition of monads. --- (>=>), with the arguments flipped -(<=<) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c - --- | forever act repeats the action infinitely. -forever :: Monad m => m a -> m b - --- | void value discards or ignores the result of --- evaluation, such as the return value of an IO action. -void :: Functor f => f a -> f () - --- | The join function is the conventional monad join operator. It --- is used to remove one level of monadic structure, projecting its bound --- argument into the outer level. -join :: Monad m => m (m a) -> m a - --- | This generalizes the list-based concat function. -msum :: MonadPlus m => [m a] -> m a - --- | This generalizes the list-based filter function. -filterM :: Monad m => (a -> m Bool) -> [a] -> m [a] - --- | The mapAndUnzipM function maps its first argument over a list, --- returning the result as a pair of lists. This function is mainly used --- with complicated data structures or a state-transforming monad. -mapAndUnzipM :: Monad m => (a -> m (b, c)) -> [a] -> m ([b], [c]) - --- | The zipWithM function generalizes zipWith to arbitrary --- monads. -zipWithM :: Monad m => (a -> b -> m c) -> [a] -> [b] -> m [c] - --- | zipWithM_ is the extension of zipWithM which ignores the --- final result. -zipWithM_ :: Monad m => (a -> b -> m c) -> [a] -> [b] -> m () - --- | The foldM function is analogous to foldl, except that --- its result is encapsulated in a monad. Note that foldM works --- from left-to-right over the list arguments. This could be an issue --- where (>>) and the `folded function' are not --- commutative. --- --- 
---   foldM f a1 [x1, x2, ..., xm]
---
--- --- == --- --- 
---   do
---     a2 <- f a1 x1
---     a3 <- f a2 x2
---     ...
---     f am xm
---
--- --- If right-to-left evaluation is required, the input list should be --- reversed. -foldM :: Monad m => (a -> b -> m a) -> a -> [b] -> m a - --- | Like foldM, but discards the result. -foldM_ :: Monad m => (a -> b -> m a) -> a -> [b] -> m () - --- | replicateM n act performs the action n times, --- gathering the results. -replicateM :: Monad m => Int -> m a -> m [a] - --- | Like replicateM, but discards the result. -replicateM_ :: Monad m => Int -> m a -> m () - --- | guard b is return () if b is --- True, and mzero if b is False. -guard :: MonadPlus m => Bool -> m () - --- | Conditional execution of monadic expressions. For example, --- --- 
---   when debug (putStr "Debugging\n")
---
--- --- will output the string Debugging\n if the Boolean value --- debug is True, and otherwise do nothing. -when :: Monad m => Bool -> m () -> m () - --- | The reverse of when. -unless :: Monad m => Bool -> m () -> m () - --- | Promote a function to a monad. -liftM :: Monad m => (a1 -> r) -> m a1 -> m r - --- | Promote a function to a monad, scanning the monadic arguments from --- left to right. For example, --- --- 
---   liftM2 (+) [0,1] [0,2] = [0,2,1,3]
---   liftM2 (+) (Just 1) Nothing = Nothing
---
-liftM2 :: Monad m => (a1 -> a2 -> r) -> m a1 -> m a2 -> m r - --- | Promote a function to a monad, scanning the monadic arguments from --- left to right (cf. liftM2). -liftM3 :: Monad m => (a1 -> a2 -> a3 -> r) -> m a1 -> m a2 -> m a3 -> m r - --- | Promote a function to a monad, scanning the monadic arguments from --- left to right (cf. liftM2). -liftM4 :: Monad m => (a1 -> a2 -> a3 -> a4 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m r - --- | Promote a function to a monad, scanning the monadic arguments from --- left to right (cf. liftM2). -liftM5 :: Monad m => (a1 -> a2 -> a3 -> a4 -> a5 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m a5 -> m r - --- | In many situations, the liftM operations can be replaced by --- uses of ap, which promotes function application. --- --- 
---   return f `ap` x1 `ap` ... `ap` xn
---
--- --- is equivalent to --- --- 
---   liftMn f x1 x2 ... xn
---
-ap :: Monad m => m (a -> b) -> m a -> m b - -module System.IO - --- | A value of type IO a is a computation which, when --- performed, does some I/O before returning a value of type a. --- --- There is really only one way to "perform" an I/O action: bind it to --- Main.main in your program. When your program is run, the I/O --- will be performed. It isn't possible to perform I/O from an arbitrary --- function, unless that function is itself in the IO monad and --- called at some point, directly or indirectly, from Main.main. --- --- IO is a monad, so IO actions can be combined using --- either the do-notation or the >> and >>= --- operations from the Monad class. -data IO a :: * -> * -fixIO :: (a -> IO a) -> IO a - --- | File and directory names are values of type String, whose --- precise meaning is operating system dependent. Files can be opened, --- yielding a handle which can then be used to operate on the contents of --- that file. -type FilePath = String - --- | Haskell defines operations to read and write characters from and to --- files, represented by values of type Handle. Each value of --- this type is a handle: a record used by the Haskell run-time --- system to manage I/O with file system objects. A handle has at --- least the following properties: --- --- --- --- Most handles will also have a current I/O position indicating where --- the next input or output operation will occur. A handle is --- readable if it manages only input or both input and output; --- likewise, it is writable if it manages only output or both --- input and output. A handle is open when first allocated. Once --- it is closed it can no longer be used for either input or output, --- though an implementation cannot re-use its storage while references --- remain to it. Handles are in the Show and Eq classes. --- The string produced by showing a handle is system dependent; it should --- include enough information to identify the handle for debugging. A --- handle is equal according to == only to itself; no attempt is --- made to compare the internal state of different handles for equality. -data Handle :: * - --- | A handle managing input from the Haskell program's standard input --- channel. -stdin :: Handle - --- | A handle managing output to the Haskell program's standard output --- channel. -stdout :: Handle - --- | A handle managing output to the Haskell program's standard error --- channel. -stderr :: Handle - --- | withFile name mode act opens a file using --- openFile and passes the resulting handle to the computation --- act. The handle will be closed on exit from withFile, --- whether by normal termination or by raising an exception. If closing --- the handle raises an exception, then this exception will be raised by --- withFile rather than any exception raised by act. -withFile :: FilePath -> IOMode -> (Handle -> IO r) -> IO r - --- | Computation openFile file mode allocates and returns a --- new, open handle to manage the file file. It manages input if --- mode is ReadMode, output if mode is --- WriteMode or AppendMode, and both input and output if --- mode is ReadWriteMode. --- --- If the file does not exist and it is opened for output, it should be --- created as a new file. If mode is WriteMode and the --- file already exists, then it should be truncated to zero length. Some --- operating systems delete empty files, so there is no guarantee that --- the file will exist following an openFile with mode --- WriteMode unless it is subsequently written to successfully. --- The handle is positioned at the end of the file if mode is --- AppendMode, and otherwise at the beginning (in which case its --- internal position is 0). The initial buffer mode is --- implementation-dependent. --- --- This operation may fail with: --- --- -openFile :: FilePath -> IOMode -> IO Handle - --- | See System.IO.openFile -data IOMode :: * -ReadMode :: IOMode -WriteMode :: IOMode -AppendMode :: IOMode -ReadWriteMode :: IOMode - --- | Computation hClose hdl makes handle hdl --- closed. Before the computation finishes, if hdl is writable --- its buffer is flushed as for hFlush. Performing hClose --- on a handle that has already been closed has no effect; doing so is --- not an error. All other operations on a closed handle will fail. If --- hClose fails for any reason, any further operations (apart from --- hClose) on the handle will still fail as if hdl had --- been successfully closed. -hClose :: Handle -> IO () - --- | The readFile function reads a file and returns the contents of --- the file as a string. The file is read lazily, on demand, as with --- getContents. -readFile :: FilePath -> IO String - --- | The computation writeFile file str function writes the --- string str, to the file file. -writeFile :: FilePath -> String -> IO () - --- | The computation appendFile file str function appends --- the string str, to the file file. --- --- Note that writeFile and appendFile write a literal --- string to a file. To write a value of any printable type, as with --- print, use the show function to convert the value to a --- string first. --- --- 
---   main = appendFile "squares" (show [(x,x*x) | x <- [0,0.1..2]])
---
-appendFile :: FilePath -> String -> IO () - --- | For a handle hdl which attached to a physical file, --- hFileSize hdl returns the size of that file in 8-bit --- bytes. -hFileSize :: Handle -> IO Integer - --- | hSetFileSize hdl size truncates the physical --- file with handle hdl to size bytes. -hSetFileSize :: Handle -> Integer -> IO () - --- | For a readable handle hdl, hIsEOF hdl returns --- True if no further input can be taken from hdl or for --- a physical file, if the current I/O position is equal to the length of --- the file. Otherwise, it returns False. --- --- NOTE: hIsEOF may block, because it has to attempt to read from --- the stream to determine whether there is any more data to be read. -hIsEOF :: Handle -> IO Bool - --- | The computation isEOF is identical to hIsEOF, except --- that it works only on stdin. -isEOF :: IO Bool - --- | Three kinds of buffering are supported: line-buffering, --- block-buffering or no-buffering. These modes have the following --- effects. For output, items are written out, or flushed, from --- the internal buffer according to the buffer mode: --- --- --- --- An implementation is free to flush the buffer more frequently, but not --- less frequently, than specified above. The output buffer is emptied as --- soon as it has been written out. --- --- Similarly, input occurs according to the buffer mode for the handle: --- --- --- --- The default buffering mode when a handle is opened is --- implementation-dependent and may depend on the file system object --- which is attached to that handle. For most implementations, physical --- files will normally be block-buffered and terminals will normally be --- line-buffered. -data BufferMode :: * - --- | buffering is disabled if possible. -NoBuffering :: BufferMode - --- | line-buffering should be enabled if possible. -LineBuffering :: BufferMode - --- | block-buffering should be enabled if possible. The size of the buffer --- is n items if the argument is Just n and is --- otherwise implementation-dependent. -BlockBuffering :: Maybe Int -> BufferMode - --- | Computation hSetBuffering hdl mode sets the mode of --- buffering for handle hdl on subsequent reads and writes. --- --- If the buffer mode is changed from BlockBuffering or --- LineBuffering to NoBuffering, then --- --- --- --- This operation may fail with: --- --- -hSetBuffering :: Handle -> BufferMode -> IO () - --- | Computation hGetBuffering hdl returns the current --- buffering mode for hdl. -hGetBuffering :: Handle -> IO BufferMode - --- | The action hFlush hdl causes any items buffered for --- output in handle hdl to be sent immediately to the operating --- system. --- --- This operation may fail with: --- --- -hFlush :: Handle -> IO () - --- | Computation hGetPosn hdl returns the current I/O --- position of hdl as a value of the abstract type --- HandlePosn. -hGetPosn :: Handle -> IO HandlePosn - --- | If a call to hGetPosn hdl returns a position --- p, then computation hSetPosn p sets the --- position of hdl to the position it held at the time of the --- call to hGetPosn. --- --- This operation may fail with: --- --- -hSetPosn :: HandlePosn -> IO () -data HandlePosn :: * - --- | Computation hSeek hdl mode i sets the position of --- handle hdl depending on mode. The offset i --- is given in terms of 8-bit bytes. --- --- If hdl is block- or line-buffered, then seeking to a position --- which is not in the current buffer will first cause any items in the --- output buffer to be written to the device, and then cause the input --- buffer to be discarded. Some handles may not be seekable (see --- hIsSeekable), or only support a subset of the possible --- positioning operations (for instance, it may only be possible to seek --- to the end of a tape, or to a positive offset from the beginning or --- current position). It is not possible to set a negative I/O position, --- or for a physical file, an I/O position beyond the current --- end-of-file. --- --- This operation may fail with: --- --- -hSeek :: Handle -> SeekMode -> Integer -> IO () - --- | A mode that determines the effect of hSeek hdl mode --- i. -data SeekMode :: * - --- | the position of hdl is set to i. -AbsoluteSeek :: SeekMode - --- | the position of hdl is set to offset i from the --- current position. -RelativeSeek :: SeekMode - --- | the position of hdl is set to offset i from the end --- of the file. -SeekFromEnd :: SeekMode - --- | Computation hTell hdl returns the current position of --- the handle hdl, as the number of bytes from the beginning of --- the file. The value returned may be subsequently passed to --- hSeek to reposition the handle to the current position. --- --- This operation may fail with: --- --- -hTell :: Handle -> IO Integer -hIsOpen :: Handle -> IO Bool -hIsClosed :: Handle -> IO Bool -hIsReadable :: Handle -> IO Bool -hIsWritable :: Handle -> IO Bool -hIsSeekable :: Handle -> IO Bool - --- | Is the handle connected to a terminal? -hIsTerminalDevice :: Handle -> IO Bool - --- | Set the echoing status of a handle connected to a terminal. -hSetEcho :: Handle -> Bool -> IO () - --- | Get the echoing status of a handle connected to a terminal. -hGetEcho :: Handle -> IO Bool - --- | hShow is in the IO monad, and gives more comprehensive --- output than the (pure) instance of Show for Handle. -hShow :: Handle -> IO String - --- | Computation hWaitForInput hdl t waits until input is --- available on handle hdl. It returns True as soon as --- input is available on hdl, or False if no input is --- available within t milliseconds. Note that --- hWaitForInput waits until one or more full characters --- are available, which means that it needs to do decoding, and hence may --- fail with a decoding error. --- --- If t is less than zero, then hWaitForInput waits --- indefinitely. --- --- This operation may fail with: --- --- -hWaitForInput :: Handle -> Int -> IO Bool - --- | Computation hReady hdl indicates whether at least one --- item is available for input from handle hdl. --- --- This operation may fail with: --- --- -hReady :: Handle -> IO Bool - --- | Computation hGetChar hdl reads a character from the --- file or channel managed by hdl, blocking until a character is --- available. --- --- This operation may fail with: --- --- -hGetChar :: Handle -> IO Char - --- | Computation hGetLine hdl reads a line from the file or --- channel managed by hdl. --- --- This operation may fail with: --- --- --- --- If hGetLine encounters end-of-file at any other point while --- reading in a line, it is treated as a line terminator and the --- (partial) line is returned. -hGetLine :: Handle -> IO String - --- | Computation hLookAhead returns the next character from the --- handle without removing it from the input buffer, blocking until a --- character is available. --- --- This operation may fail with: --- --- -hLookAhead :: Handle -> IO Char - --- | Computation hGetContents hdl returns the list of --- characters corresponding to the unread portion of the channel or file --- managed by hdl, which is put into an intermediate state, --- semi-closed. In this state, hdl is effectively closed, --- but items are read from hdl on demand and accumulated in a --- special list returned by hGetContents hdl. --- --- Any operation that fails because a handle is closed, also fails if a --- handle is semi-closed. The only exception is hClose. A --- semi-closed handle becomes closed: --- --- --- --- Once a semi-closed handle becomes closed, the contents of the --- associated list becomes fixed. The contents of this final list is only --- partially specified: it will contain at least all the items of the --- stream that were evaluated prior to the handle becoming closed. --- --- Any I/O errors encountered while a handle is semi-closed are simply --- discarded. --- --- This operation may fail with: --- --- -hGetContents :: Handle -> IO String - --- | Computation hPutChar hdl ch writes the character --- ch to the file or channel managed by hdl. Characters --- may be buffered if buffering is enabled for hdl. --- --- This operation may fail with: --- --- -hPutChar :: Handle -> Char -> IO () - --- | Computation hPutStr hdl s writes the string s --- to the file or channel managed by hdl. --- --- This operation may fail with: --- --- -hPutStr :: Handle -> String -> IO () - --- | The same as hPutStr, but adds a newline character. -hPutStrLn :: Handle -> String -> IO () - --- | Computation hPrint hdl t writes the string --- representation of t given by the shows function to the --- file or channel managed by hdl and appends a newline. --- --- This operation may fail with: --- --- -hPrint :: Show a => Handle -> a -> IO () - --- | The interact function takes a function of type --- String->String as its argument. The entire input from the --- standard input device is passed to this function as its argument, and --- the resulting string is output on the standard output device. -interact :: (String -> String) -> IO () - --- | Write a character to the standard output device (same as --- hPutChar stdout). -putChar :: Char -> IO () - --- | Write a string to the standard output device (same as hPutStr --- stdout). -putStr :: String -> IO () - --- | The same as putStr, but adds a newline character. -putStrLn :: String -> IO () - --- | The print function outputs a value of any printable type to the --- standard output device. Printable types are those that are instances --- of class Show; print converts values to strings for --- output using the show operation and adds a newline. --- --- For example, a program to print the first 20 integers and their powers --- of 2 could be written as: --- --- 
---   main = print ([(n, 2^n) | n <- [0..19]])
---
-print :: Show a => a -> IO () - --- | Read a character from the standard input device (same as --- hGetChar stdin). -getChar :: IO Char - --- | Read a line from the standard input device (same as hGetLine --- stdin). -getLine :: IO String - --- | The getContents operation returns all user input as a single --- string, which is read lazily as it is needed (same as --- hGetContents stdin). -getContents :: IO String - --- | The readIO function is similar to read except that it --- signals parse failure to the IO monad instead of terminating --- the program. -readIO :: Read a => String -> IO a - --- | The readLn function combines getLine and readIO. -readLn :: Read a => IO a - -module Data.Array - --- | The type of immutable non-strict (boxed) arrays with indices in --- i and elements in e. -data Ix i => Array i e :: * -> * -> * - --- | Construct an array with the specified bounds and containing values for --- given indices within these bounds. --- --- The array is undefined (i.e. bottom) if any index in the list is out --- of bounds. If any two associations in the list have the same index, --- the value at that index is undefined (i.e. bottom). --- --- Because the indices must be checked for these errors, array is --- strict in the bounds argument and in the indices of the association --- list, but non-strict in the values. Thus, recurrences such as the --- following are possible: --- --- 
---   a = array (1,100) ((1,1) : [(i, i * a!(i-1)) | i <- [2..100]])
---
--- --- Not every index within the bounds of the array need appear in the --- association list, but the values associated with indices that do not --- appear will be undefined (i.e. bottom). --- --- If, in any dimension, the lower bound is greater than the upper bound, --- then the array is legal, but empty. Indexing an empty array always --- gives an array-bounds error, but bounds still yields the bounds --- with which the array was constructed. -array :: Ix i => (i, i) -> [(i, e)] -> Array i e - --- | Construct an array from a pair of bounds and a list of values in index --- order. -listArray :: Ix i => (i, i) -> [e] -> Array i e - --- | The accumArray function deals with repeated indices in the --- association list using an accumulating function which combines --- the values of associations with the same index. For example, given a --- list of values of some index type, hist produces a histogram --- of the number of occurrences of each index within a specified range: --- --- 
---   hist :: (Ix a, Num b) => (a,a) -> [a] -> Array a b
---   hist bnds is = accumArray (+) 0 bnds [(i, 1) | i<-is, inRange bnds i]
---
--- --- If the accumulating function is strict, then accumArray is --- strict in the values, as well as the indices, in the association list. --- Thus, unlike ordinary arrays built with array, accumulated --- arrays should not in general be recursive. -accumArray :: Ix i => (e -> a -> e) -> e -> (i, i) -> [(i, a)] -> Array i e - --- | The value at the given index in an array. -(!) :: Ix i => Array i e -> i -> e - --- | The bounds with which an array was constructed. -bounds :: Ix i => Array i e -> (i, i) - --- | The list of indices of an array in ascending order. -indices :: Ix i => Array i e -> [i] - --- | The list of elements of an array in index order. -elems :: Ix i => Array i e -> [e] - --- | The list of associations of an array in index order. -assocs :: Ix i => Array i e -> [(i, e)] - --- | Constructs an array identical to the first argument except that it has --- been updated by the associations in the right argument. For example, --- if m is a 1-origin, n by n matrix, then --- --- 
---   m//[((i,i), 0) | i <- [1..n]]
---
--- --- is the same matrix, except with the diagonal zeroed. --- --- Repeated indices in the association list are handled as for --- array: the resulting array is undefined (i.e. bottom), -(//) :: Ix i => Array i e -> [(i, e)] -> Array i e - --- | accum f takes an array and an association list and --- accumulates pairs from the list into the array with the accumulating --- function f. Thus accumArray can be defined using --- accum: --- --- 
---   accumArray f z b = accum f (array b [(i, z) | i <- range b])
---
-accum :: Ix i => (e -> a -> e) -> Array i e -> [(i, a)] -> Array i e - --- | ixmap allows for transformations on array indices. It may be --- thought of as providing function composition on the right with the --- mapping that the original array embodies. --- --- A similar transformation of array values may be achieved using --- fmap from the Array instance of the Functor --- class. -ixmap :: (Ix i, Ix j) => (i, i) -> (i -> j) -> Array j e -> Array i e diff --git a/data/haskell98.txt b/data/haskell98.txt deleted file mode 100644 --- a/data/haskell98.txt +++ /dev/null @@ -1,2532 +0,0 @@ --- Hoogle documentation, generated by Haddock --- See Hoogle, http://www.haskell.org/hoogle/ - - --- | Compatibility with Haskell 98 --- --- This package provides compatibility with the modules of Haskell 98 and --- the FFI addendum, by means of wrappers around modules from the base --- package (which in many cases have additional features). However --- Prelude, Numeric and Foreign are provided directly by the base --- package. -@package haskell98 -@version 1.1.0.1 - -module MarshalUtils - -module MarshalError - --- | An abstract type that contains a value for each variant of --- IOError. -data IOErrorType :: * - --- | Construct an IOError of the given type where the second --- argument describes the error location and the third and fourth --- argument contain the file handle and file path of the file involved in --- the error if applicable. -mkIOError :: IOErrorType -> String -> Maybe Handle -> Maybe FilePath -> IOError - --- | I/O error where the operation failed because one of its arguments --- already exists. -alreadyExistsErrorType :: IOErrorType - --- | I/O error where the operation failed because one of its arguments does --- not exist. -doesNotExistErrorType :: IOErrorType - --- | I/O error where the operation failed because one of its arguments is a --- single-use resource, which is already being used. -alreadyInUseErrorType :: IOErrorType - --- | I/O error where the operation failed because the device is full. -fullErrorType :: IOErrorType - --- | I/O error where the operation failed because the end of file has been --- reached. -eofErrorType :: IOErrorType - --- | I/O error where the operation is not possible. -illegalOperationErrorType :: IOErrorType - --- | I/O error where the operation failed because the user does not have --- sufficient operating system privilege to perform that operation. -permissionErrorType :: IOErrorType - --- | I/O error that is programmer-defined. -userErrorType :: IOErrorType - --- | Adds a location description and maybe a file path and file handle to --- an IOError. If any of the file handle or file path is not given --- the corresponding value in the IOError remains unaltered. -annotateIOError :: IOError -> String -> Maybe Handle -> Maybe FilePath -> IOError - -module MarshalArray - -module MarshalAlloc - -module CTypes - -module CForeign - -module CError - -module Time - --- | A representation of the internal clock time. Clock times may be --- compared, converted to strings, or converted to an external calendar --- time CalendarTime for I/O or other manipulations. -data ClockTime :: * - --- | A month of the year. -data Month :: * -January :: Month -February :: Month -March :: Month -April :: Month -May :: Month -June :: Month -July :: Month -August :: Month -September :: Month -October :: Month -November :: Month -December :: Month - --- | A day of the week. -data Day :: * -Sunday :: Day -Monday :: Day -Tuesday :: Day -Wednesday :: Day -Thursday :: Day -Friday :: Day -Saturday :: Day - --- | CalendarTime is a user-readable and manipulable representation --- of the internal ClockTime type. -data CalendarTime :: * -CalendarTime :: Int -> Month -> Int -> Int -> Int -> Int -> Integer -> Day -> Int -> String -> Int -> Bool -> CalendarTime - --- | Year (pre-Gregorian dates are inaccurate) -ctYear :: CalendarTime -> Int - --- | Month of the year -ctMonth :: CalendarTime -> Month - --- | Day of the month (1 to 31) -ctDay :: CalendarTime -> Int - --- | Hour of the day (0 to 23) -ctHour :: CalendarTime -> Int - --- | Minutes (0 to 59) -ctMin :: CalendarTime -> Int - --- | Seconds (0 to 61, allowing for up to two leap seconds) -ctSec :: CalendarTime -> Int - --- | Picoseconds -ctPicosec :: CalendarTime -> Integer - --- | Day of the week -ctWDay :: CalendarTime -> Day - --- | Day of the year (0 to 364, or 365 in leap years) -ctYDay :: CalendarTime -> Int - --- | Name of the time zone -ctTZName :: CalendarTime -> String - --- | Variation from UTC in seconds -ctTZ :: CalendarTime -> Int - --- | True if Daylight Savings Time would be in effect, and --- False otherwise -ctIsDST :: CalendarTime -> Bool - --- | records the difference between two clock times in a user-readable way. -data TimeDiff :: * -TimeDiff :: Int -> Int -> Int -> Int -> Int -> Int -> Integer -> TimeDiff -tdYear :: TimeDiff -> Int -tdMonth :: TimeDiff -> Int -tdDay :: TimeDiff -> Int -tdHour :: TimeDiff -> Int -tdMin :: TimeDiff -> Int -tdSec :: TimeDiff -> Int -tdPicosec :: TimeDiff -> Integer -getClockTime :: IO ClockTime - --- | addToClockTime d t adds a time difference d --- and a clock time t to yield a new clock time. The difference --- d may be either positive or negative. -addToClockTime :: TimeDiff -> ClockTime -> ClockTime - --- | diffClockTimes t1 t2 returns the difference between --- two clock times t1 and t2 as a TimeDiff. -diffClockTimes :: ClockTime -> ClockTime -> TimeDiff - --- | converts an internal clock time to a local time, modified by the --- timezone and daylight savings time settings in force at the time of --- conversion. Because of this dependence on the local environment, --- toCalendarTime is in the IO monad. -toCalendarTime :: ClockTime -> IO CalendarTime - --- | converts an internal clock time into a CalendarTime in standard --- UTC format. -toUTCTime :: ClockTime -> CalendarTime - --- | converts a CalendarTime into the corresponding internal --- ClockTime, ignoring the contents of the ctWDay, --- ctYDay, ctTZName and ctIsDST fields. -toClockTime :: CalendarTime -> ClockTime - --- | formats calendar times using local conventions. -calendarTimeToString :: CalendarTime -> String - --- | formats calendar times using local conventions and a formatting --- string. The formatting string is that understood by the ISO C --- strftime() function. -formatCalendarTime :: TimeLocale -> String -> CalendarTime -> String - -module Locale -data TimeLocale :: * -TimeLocale :: [(String, String)] -> [(String, String)] -> [(String, String)] -> (String, String) -> String -> String -> String -> String -> TimeLocale -defaultTimeLocale :: TimeLocale - -module List - --- | The elemIndex function returns the index of the first element --- in the given list which is equal (by ==) to the query element, --- or Nothing if there is no such element. -elemIndex :: Eq a => a -> [a] -> Maybe Int - --- | The elemIndices function extends elemIndex, by returning --- the indices of all elements equal to the query element, in ascending --- order. -elemIndices :: Eq a => a -> [a] -> [Int] - --- | The find function takes a predicate and a list and returns the --- first element in the list matching the predicate, or Nothing if --- there is no such element. -find :: (a -> Bool) -> [a] -> Maybe a - --- | The findIndex function takes a predicate and a list and returns --- the index of the first element in the list satisfying the predicate, --- or Nothing if there is no such element. -findIndex :: (a -> Bool) -> [a] -> Maybe Int - --- | The findIndices function extends findIndex, by returning --- the indices of all elements satisfying the predicate, in ascending --- order. -findIndices :: (a -> Bool) -> [a] -> [Int] - --- | O(n^2). The nub function removes duplicate elements from --- a list. In particular, it keeps only the first occurrence of each --- element. (The name nub means `essence'.) It is a special case --- of nubBy, which allows the programmer to supply their own --- equality test. -nub :: Eq a => [a] -> [a] - --- | The nubBy function behaves just like nub, except it uses --- a user-supplied equality predicate instead of the overloaded == --- function. -nubBy :: (a -> a -> Bool) -> [a] -> [a] - --- | delete x removes the first occurrence of x --- from its list argument. For example, --- --- 
---   delete 'a' "banana" == "bnana"
---
--- --- It is a special case of deleteBy, which allows the programmer --- to supply their own equality test. -delete :: Eq a => a -> [a] -> [a] - --- | The deleteBy function behaves like delete, but takes a --- user-supplied equality predicate. -deleteBy :: (a -> a -> Bool) -> a -> [a] -> [a] - --- | The \\ function is list difference ((non-associative). In the --- result of xs \\ ys, the first occurrence of --- each element of ys in turn (if any) has been removed from --- xs. Thus --- --- 
---   (xs ++ ys) \\ xs == ys.
---
--- --- It is a special case of deleteFirstsBy, which allows the --- programmer to supply their own equality test. -(\\) :: Eq a => [a] -> [a] -> [a] - --- | The deleteFirstsBy function takes a predicate and two lists and --- returns the first list with the first occurrence of each element of --- the second list removed. -deleteFirstsBy :: (a -> a -> Bool) -> [a] -> [a] -> [a] - --- | The union function returns the list union of the two lists. For --- example, --- --- 
---   "dog" `union` "cow" == "dogcw"
---
--- --- Duplicates, and elements of the first list, are removed from the the --- second list, but if the first list contains duplicates, so will the --- result. It is a special case of unionBy, which allows the --- programmer to supply their own equality test. -union :: Eq a => [a] -> [a] -> [a] - --- | The unionBy function is the non-overloaded version of --- union. -unionBy :: (a -> a -> Bool) -> [a] -> [a] -> [a] - --- | The intersect function takes the list intersection of two --- lists. For example, --- --- 
---   [1,2,3,4] `intersect` [2,4,6,8] == [2,4]
---
--- --- If the first list contains duplicates, so will the result. --- --- 
---   [1,2,2,3,4] `intersect` [6,4,4,2] == [2,2,4]
---
--- --- It is a special case of intersectBy, which allows the --- programmer to supply their own equality test. -intersect :: Eq a => [a] -> [a] -> [a] - --- | The intersectBy function is the non-overloaded version of --- intersect. -intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a] - --- | The intersperse function takes an element and a list and --- `intersperses' that element between the elements of the list. For --- example, --- --- 
---   intersperse ',' "abcde" == "a,b,c,d,e"
---
-intersperse :: a -> [a] -> [a] - --- | The transpose function transposes the rows and columns of its --- argument. For example, --- --- 
---   transpose [[1,2,3],[4,5,6]] == [[1,4],[2,5],[3,6]]
---
-transpose :: [[a]] -> [[a]] - --- | The partition function takes a predicate a list and returns the --- pair of lists of elements which do and do not satisfy the predicate, --- respectively; i.e., --- --- 
---   partition p xs == (filter p xs, filter (not . p) xs)
---
-partition :: (a -> Bool) -> [a] -> ([a], [a]) - --- | The group function takes a list and returns a list of lists --- such that the concatenation of the result is equal to the argument. --- Moreover, each sublist in the result contains only equal elements. For --- example, --- --- 
---   group "Mississippi" = ["M","i","ss","i","ss","i","pp","i"]
---
--- --- It is a special case of groupBy, which allows the programmer to --- supply their own equality test. -group :: Eq a => [a] -> [[a]] - --- | The groupBy function is the non-overloaded version of --- group. -groupBy :: (a -> a -> Bool) -> [a] -> [[a]] - --- | The inits function returns all initial segments of the --- argument, shortest first. For example, --- --- 
---   inits "abc" == ["","a","ab","abc"]
---
--- --- Note that inits has the following strictness property: --- inits _|_ = [] : _|_ -inits :: [a] -> [[a]] - --- | The tails function returns all final segments of the argument, --- longest first. For example, --- --- 
---   tails "abc" == ["abc", "bc", "c",""]
---
--- --- Note that tails has the following strictness property: --- tails _|_ = _|_ : _|_ -tails :: [a] -> [[a]] - --- | The isPrefixOf function takes two lists and returns True --- iff the first list is a prefix of the second. -isPrefixOf :: Eq a => [a] -> [a] -> Bool - --- | The isSuffixOf function takes two lists and returns True --- iff the first list is a suffix of the second. Both lists must be --- finite. -isSuffixOf :: Eq a => [a] -> [a] -> Bool - --- | The mapAccumL function behaves like a combination of map --- and foldl; it applies a function to each element of a list, --- passing an accumulating parameter from left to right, and returning a --- final value of this accumulator together with the new list. -mapAccumL :: (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y]) - --- | The mapAccumR function behaves like a combination of map --- and foldr; it applies a function to each element of a list, --- passing an accumulating parameter from right to left, and returning a --- final value of this accumulator together with the new list. -mapAccumR :: (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y]) - --- | The sort function implements a stable sorting algorithm. It is --- a special case of sortBy, which allows the programmer to supply --- their own comparison function. -sort :: Ord a => [a] -> [a] - --- | The sortBy function is the non-overloaded version of --- sort. -sortBy :: (a -> a -> Ordering) -> [a] -> [a] - --- | The insert function takes an element and a list and inserts the --- element into the list at the last position where it is still less than --- or equal to the next element. In particular, if the list is sorted --- before the call, the result will also be sorted. It is a special case --- of insertBy, which allows the programmer to supply their own --- comparison function. -insert :: Ord a => a -> [a] -> [a] - --- | The non-overloaded version of insert. -insertBy :: (a -> a -> Ordering) -> a -> [a] -> [a] - --- | The maximumBy function takes a comparison function and a list --- and returns the greatest element of the list by the comparison --- function. The list must be finite and non-empty. -maximumBy :: (a -> a -> Ordering) -> [a] -> a - --- | The minimumBy function takes a comparison function and a list --- and returns the least element of the list by the comparison function. --- The list must be finite and non-empty. -minimumBy :: (a -> a -> Ordering) -> [a] -> a - --- | The genericLength function is an overloaded version of --- length. In particular, instead of returning an Int, it --- returns any type which is an instance of Num. It is, however, --- less efficient than length. -genericLength :: Num i => [b] -> i - --- | The genericTake function is an overloaded version of --- take, which accepts any Integral value as the number of --- elements to take. -genericTake :: Integral i => i -> [a] -> [a] - --- | The genericDrop function is an overloaded version of --- drop, which accepts any Integral value as the number of --- elements to drop. -genericDrop :: Integral i => i -> [a] -> [a] - --- | The genericSplitAt function is an overloaded version of --- splitAt, which accepts any Integral value as the --- position at which to split. -genericSplitAt :: Integral i => i -> [b] -> ([b], [b]) - --- | The genericIndex function is an overloaded version of --- !!, which accepts any Integral value as the index. -genericIndex :: Integral a => [b] -> a -> b - --- | The genericReplicate function is an overloaded version of --- replicate, which accepts any Integral value as the --- number of repetitions to make. -genericReplicate :: Integral i => i -> a -> [a] - --- | The zip4 function takes four lists and returns a list of --- quadruples, analogous to zip. -zip4 :: [a] -> [b] -> [c] -> [d] -> [(a, b, c, d)] - --- | The zip5 function takes five lists and returns a list of --- five-tuples, analogous to zip. -zip5 :: [a] -> [b] -> [c] -> [d] -> [e] -> [(a, b, c, d, e)] - --- | The zip6 function takes six lists and returns a list of --- six-tuples, analogous to zip. -zip6 :: [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [(a, b, c, d, e, f)] - --- | The zip7 function takes seven lists and returns a list of --- seven-tuples, analogous to zip. -zip7 :: [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g] -> [(a, b, c, d, e, f, g)] - --- | The zipWith4 function takes a function which combines four --- elements, as well as four lists and returns a list of their point-wise --- combination, analogous to zipWith. -zipWith4 :: (a -> b -> c -> d -> e) -> [a] -> [b] -> [c] -> [d] -> [e] - --- | The zipWith5 function takes a function which combines five --- elements, as well as five lists and returns a list of their point-wise --- combination, analogous to zipWith. -zipWith5 :: (a -> b -> c -> d -> e -> f) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] - --- | The zipWith6 function takes a function which combines six --- elements, as well as six lists and returns a list of their point-wise --- combination, analogous to zipWith. -zipWith6 :: (a -> b -> c -> d -> e -> f -> g) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g] - --- | The zipWith7 function takes a function which combines seven --- elements, as well as seven lists and returns a list of their --- point-wise combination, analogous to zipWith. -zipWith7 :: (a -> b -> c -> d -> e -> f -> g -> h) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g] -> [h] - --- | The unzip4 function takes a list of quadruples and returns four --- lists, analogous to unzip. -unzip4 :: [(a, b, c, d)] -> ([a], [b], [c], [d]) - --- | The unzip5 function takes a list of five-tuples and returns --- five lists, analogous to unzip. -unzip5 :: [(a, b, c, d, e)] -> ([a], [b], [c], [d], [e]) - --- | The unzip6 function takes a list of six-tuples and returns six --- lists, analogous to unzip. -unzip6 :: [(a, b, c, d, e, f)] -> ([a], [b], [c], [d], [e], [f]) - --- | The unzip7 function takes a list of seven-tuples and returns --- seven lists, analogous to unzip. -unzip7 :: [(a, b, c, d, e, f, g)] -> ([a], [b], [c], [d], [e], [f], [g]) - --- | The unfoldr function is a `dual' to foldr: while --- foldr reduces a list to a summary value, unfoldr builds --- a list from a seed value. The function takes the element and returns --- Nothing if it is done producing the list or returns Just --- (a,b), in which case, a is a prepended to the list --- and b is used as the next element in a recursive call. For --- example, --- --- 
---   iterate f == unfoldr (\x -> Just (x, f x))
---
--- --- In some cases, unfoldr can undo a foldr operation: --- --- 
---   unfoldr f' (foldr f z xs) == xs
---
--- --- if the following holds: --- --- 
---   f' (f x y) = Just (x,y)
---   f' z       = Nothing
---
--- --- A simple use of unfoldr: --- --- 
---   unfoldr (\b -> if b == 0 then Nothing else Just (b, b-1)) 10
---    [10,9,8,7,6,5,4,3,2,1]
---
-unfoldr :: (b -> Maybe (a, b)) -> b -> [a] - --- | map f xs is the list obtained by applying f --- to each element of xs, i.e., --- --- 
---   map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn]
---   map f [x1, x2, ...] == [f x1, f x2, ...]
---
-map :: (a -> b) -> [a] -> [b] - --- | Append two lists, i.e., --- --- 
---   [x1, ..., xm] ++ [y1, ..., yn] == [x1, ..., xm, y1, ..., yn]
---   [x1, ..., xm] ++ [y1, ...] == [x1, ..., xm, y1, ...]
---
--- --- If the first list is not finite, the result is the first list. -(++) :: [a] -> [a] -> [a] - --- | Concatenate a list of lists. -concat :: [[a]] -> [a] - --- | filter, applied to a predicate and a list, returns the list of --- those elements that satisfy the predicate; i.e., --- --- 
---   filter p xs = [ x | x <- xs, p x]
---
-filter :: (a -> Bool) -> [a] -> [a] - --- | Extract the first element of a list, which must be non-empty. -head :: [a] -> a - --- | Extract the last element of a list, which must be finite and --- non-empty. -last :: [a] -> a - --- | Extract the elements after the head of a list, which must be --- non-empty. -tail :: [a] -> [a] - --- | Return all the elements of a list except the last one. The list must --- be non-empty. -init :: [a] -> [a] - --- | Test whether a list is empty. -null :: [a] -> Bool - --- | O(n). length returns the length of a finite list as an --- Int. It is an instance of the more general --- Data.List.genericLength, the result type of which may be any --- kind of number. -length :: [a] -> Int - --- | List index (subscript) operator, starting from 0. It is an instance of --- the more general Data.List.genericIndex, which takes an index --- of any integral type. -(!!) :: [a] -> Int -> a - --- | foldl, applied to a binary operator, a starting value --- (typically the left-identity of the operator), and a list, reduces the --- list using the binary operator, from left to right: --- --- 
---   foldl f z [x1, x2, ..., xn] == (...((z `f` x1) `f` x2) `f`...) `f` xn
---
--- --- The list must be finite. -foldl :: (a -> b -> a) -> a -> [b] -> a - --- | foldl1 is a variant of foldl that has no starting value --- argument, and thus must be applied to non-empty lists. -foldl1 :: (a -> a -> a) -> [a] -> a - --- | scanl is similar to foldl, but returns a list of --- successive reduced values from the left: --- --- 
---   scanl f z [x1, x2, ...] == [z, z `f` x1, (z `f` x1) `f` x2, ...]
---
--- --- Note that --- --- 
---   last (scanl f z xs) == foldl f z xs.
---
-scanl :: (a -> b -> a) -> a -> [b] -> [a] - --- | scanl1 is a variant of scanl that has no starting value --- argument: --- --- 
---   scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...]
---
-scanl1 :: (a -> a -> a) -> [a] -> [a] - --- | foldr, applied to a binary operator, a starting value --- (typically the right-identity of the operator), and a list, reduces --- the list using the binary operator, from right to left: --- --- 
---   foldr f z [x1, x2, ..., xn] == x1 `f` (x2 `f` ... (xn `f` z)...)
---
-foldr :: (a -> b -> b) -> b -> [a] -> b - --- | foldr1 is a variant of foldr that has no starting value --- argument, and thus must be applied to non-empty lists. -foldr1 :: (a -> a -> a) -> [a] -> a - --- | scanr is the right-to-left dual of scanl. Note that --- --- 
---   head (scanr f z xs) == foldr f z xs.
---
-scanr :: (a -> b -> b) -> b -> [a] -> [b] - --- | scanr1 is a variant of scanr that has no starting value --- argument. -scanr1 :: (a -> a -> a) -> [a] -> [a] - --- | iterate f x returns an infinite list of repeated --- applications of f to x: --- --- 
---   iterate f x == [x, f x, f (f x), ...]
---
-iterate :: (a -> a) -> a -> [a] - --- | repeat x is an infinite list, with x the --- value of every element. -repeat :: a -> [a] - --- | replicate n x is a list of length n with --- x the value of every element. It is an instance of the more --- general Data.List.genericReplicate, in which n may --- be of any integral type. -replicate :: Int -> a -> [a] - --- | cycle ties a finite list into a circular one, or equivalently, --- the infinite repetition of the original list. It is the identity on --- infinite lists. -cycle :: [a] -> [a] - --- | take n, applied to a list xs, returns the --- prefix of xs of length n, or xs itself if --- n > length xs: --- --- 
---   take 5 "Hello World!" == "Hello"
---   take 3 [1,2,3,4,5] == [1,2,3]
---   take 3 [1,2] == [1,2]
---   take 3 [] == []
---   take (-1) [1,2] == []
---   take 0 [1,2] == []
---
--- --- It is an instance of the more general Data.List.genericTake, --- in which n may be of any integral type. -take :: Int -> [a] -> [a] - --- | drop n xs returns the suffix of xs after the --- first n elements, or [] if n > length --- xs: --- --- 
---   drop 6 "Hello World!" == "World!"
---   drop 3 [1,2,3,4,5] == [4,5]
---   drop 3 [1,2] == []
---   drop 3 [] == []
---   drop (-1) [1,2] == [1,2]
---   drop 0 [1,2] == [1,2]
---
--- --- It is an instance of the more general Data.List.genericDrop, --- in which n may be of any integral type. -drop :: Int -> [a] -> [a] - --- | splitAt n xs returns a tuple where first element is --- xs prefix of length n and second element is the --- remainder of the list: --- --- 
---   splitAt 6 "Hello World!" == ("Hello ","World!")
---   splitAt 3 [1,2,3,4,5] == ([1,2,3],[4,5])
---   splitAt 1 [1,2,3] == ([1],[2,3])
---   splitAt 3 [1,2,3] == ([1,2,3],[])
---   splitAt 4 [1,2,3] == ([1,2,3],[])
---   splitAt 0 [1,2,3] == ([],[1,2,3])
---   splitAt (-1) [1,2,3] == ([],[1,2,3])
---
--- --- It is equivalent to (take n xs, drop n xs) when --- n is not _|_ (splitAt _|_ xs = _|_). --- splitAt is an instance of the more general --- Data.List.genericSplitAt, in which n may be of any --- integral type. -splitAt :: Int -> [a] -> ([a], [a]) - --- | takeWhile, applied to a predicate p and a list --- xs, returns the longest prefix (possibly empty) of --- xs of elements that satisfy p: --- --- 
---   takeWhile (< 3) [1,2,3,4,1,2,3,4] == [1,2]
---   takeWhile (< 9) [1,2,3] == [1,2,3]
---   takeWhile (< 0) [1,2,3] == []
---
-takeWhile :: (a -> Bool) -> [a] -> [a] - --- | dropWhile p xs returns the suffix remaining after --- takeWhile p xs: --- --- 
---   dropWhile (< 3) [1,2,3,4,5,1,2,3] == [3,4,5,1,2,3]
---   dropWhile (< 9) [1,2,3] == []
---   dropWhile (< 0) [1,2,3] == [1,2,3]
---
-dropWhile :: (a -> Bool) -> [a] -> [a] - --- | span, applied to a predicate p and a list xs, --- returns a tuple where first element is longest prefix (possibly empty) --- of xs of elements that satisfy p and second element --- is the remainder of the list: --- --- 
---   span (< 3) [1,2,3,4,1,2,3,4] == ([1,2],[3,4,1,2,3,4])
---   span (< 9) [1,2,3] == ([1,2,3],[])
---   span (< 0) [1,2,3] == ([],[1,2,3])
---
--- --- span p xs is equivalent to (takeWhile p xs, --- dropWhile p xs) -span :: (a -> Bool) -> [a] -> ([a], [a]) - --- | break, applied to a predicate p and a list --- xs, returns a tuple where first element is longest prefix --- (possibly empty) of xs of elements that do not satisfy --- p and second element is the remainder of the list: --- --- 
---   break (> 3) [1,2,3,4,1,2,3,4] == ([1,2,3],[4,1,2,3,4])
---   break (< 9) [1,2,3] == ([],[1,2,3])
---   break (> 9) [1,2,3] == ([1,2,3],[])
---
--- --- break p is equivalent to span (not . --- p). -break :: (a -> Bool) -> [a] -> ([a], [a]) - --- | lines breaks a string up into a list of strings at newline --- characters. The resulting strings do not contain newlines. -lines :: String -> [String] - --- | words breaks a string up into a list of words, which were --- delimited by white space. -words :: String -> [String] - --- | unlines is an inverse operation to lines. It joins --- lines, after appending a terminating newline to each. -unlines :: [String] -> String - --- | unwords is an inverse operation to words. It joins words --- with separating spaces. -unwords :: [String] -> String - --- | reverse xs returns the elements of xs in --- reverse order. xs must be finite. -reverse :: [a] -> [a] - --- | and returns the conjunction of a Boolean list. For the result --- to be True, the list must be finite; False, however, --- results from a False value at a finite index of a finite or --- infinite list. -and :: [Bool] -> Bool - --- | or returns the disjunction of a Boolean list. For the result to --- be False, the list must be finite; True, however, --- results from a True value at a finite index of a finite or --- infinite list. -or :: [Bool] -> Bool - --- | Applied to a predicate and a list, any determines if any --- element of the list satisfies the predicate. For the result to be --- False, the list must be finite; True, however, results --- from a True value for the predicate applied to an element at a --- finite index of a finite or infinite list. -any :: (a -> Bool) -> [a] -> Bool - --- | Applied to a predicate and a list, all determines if all --- elements of the list satisfy the predicate. For the result to be --- True, the list must be finite; False, however, results --- from a False value for the predicate applied to an element at a --- finite index of a finite or infinite list. -all :: (a -> Bool) -> [a] -> Bool - --- | elem is the list membership predicate, usually written in infix --- form, e.g., x `elem` xs. For the result to be False, --- the list must be finite; True, however, results from an element --- equal to x found at a finite index of a finite or infinite --- list. -elem :: Eq a => a -> [a] -> Bool - --- | notElem is the negation of elem. -notElem :: Eq a => a -> [a] -> Bool - --- | lookup key assocs looks up a key in an association --- list. -lookup :: Eq a => a -> [(a, b)] -> Maybe b - --- | The sum function computes the sum of a finite list of numbers. -sum :: Num a => [a] -> a - --- | The product function computes the product of a finite list of --- numbers. -product :: Num a => [a] -> a - --- | maximum returns the maximum value from a list, which must be --- non-empty, finite, and of an ordered type. It is a special case of --- maximumBy, which allows the programmer to supply their own --- comparison function. -maximum :: Ord a => [a] -> a - --- | minimum returns the minimum value from a list, which must be --- non-empty, finite, and of an ordered type. It is a special case of --- minimumBy, which allows the programmer to supply their own --- comparison function. -minimum :: Ord a => [a] -> a - --- | Map a function over a list and concatenate the results. -concatMap :: (a -> [b]) -> [a] -> [b] - --- | zip takes two lists and returns a list of corresponding pairs. --- If one input list is short, excess elements of the longer list are --- discarded. -zip :: [a] -> [b] -> [(a, b)] - --- | zip3 takes three lists and returns a list of triples, analogous --- to zip. -zip3 :: [a] -> [b] -> [c] -> [(a, b, c)] - --- | zipWith generalises zip by zipping with the function --- given as the first argument, instead of a tupling function. For --- example, zipWith (+) is applied to two lists to --- produce the list of corresponding sums. -zipWith :: (a -> b -> c) -> [a] -> [b] -> [c] - --- | The zipWith3 function takes a function which combines three --- elements, as well as three lists and returns a list of their --- point-wise combination, analogous to zipWith. -zipWith3 :: (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d] - --- | unzip transforms a list of pairs into a list of first --- components and a list of second components. -unzip :: [(a, b)] -> ([a], [b]) - --- | The unzip3 function takes a list of triples and returns three --- lists, analogous to unzip. -unzip3 :: [(a, b, c)] -> ([a], [b], [c]) - -module System - --- | Defines the exit codes that a program can return. -data ExitCode :: * - --- | indicates successful termination; -ExitSuccess :: ExitCode - --- | indicates program failure with an exit code. The exact interpretation --- of the code is operating-system dependent. In particular, some values --- may be prohibited (e.g. 0 on a POSIX-compliant system). -ExitFailure :: Int -> ExitCode - --- | Computation getArgs returns a list of the program's command --- line arguments (not including the program name). -getArgs :: IO [String] - --- | Computation getProgName returns the name of the program as it --- was invoked. --- --- However, this is hard-to-impossible to implement on some non-Unix --- OSes, so instead, for maximum portability, we just return the leafname --- of the program as invoked. Even then there are some differences --- between platforms: on Windows, for example, a program invoked as foo --- is probably really FOO.EXE, and that is what --- getProgName will return. -getProgName :: IO String - --- | Computation getEnv var returns the value of the --- environment variable var. --- --- This computation may fail with: --- --- -getEnv :: String -> IO String - --- | Computation system cmd returns the exit code produced when --- the operating system runs the shell command cmd. --- --- This computation may fail with --- --- --- --- On Windows, system passes the command to the Windows command --- interpreter (CMD.EXE or COMMAND.COM), hence Unixy --- shell tricks will not work. -system :: String -> IO ExitCode - --- | Computation exitWith code throws ExitCode --- code. Normally this terminates the program, returning --- code to the program's caller. --- --- On program termination, the standard Handles stdout --- and stderr are flushed automatically; any other buffered --- Handles need to be flushed manually, otherwise the buffered --- data will be discarded. --- --- A program that fails in any other way is treated as if it had called --- exitFailure. A program that terminates successfully without --- calling exitWith explicitly is treated as it it had called --- exitWith ExitSuccess. --- --- As an ExitCode is not an IOError, exitWith --- bypasses the error handling in the IO monad and cannot be --- intercepted by catch from the Prelude. However it is a --- SomeException, and can be caught using the functions of --- Control.Exception. This means that cleanup computations added --- with Control.Exception.bracket (from --- Control.Exception) are also executed properly on --- exitWith. --- --- Note: in GHC, exitWith should be called from the main program --- thread in order to exit the process. When called from another thread, --- exitWith will throw an ExitException as normal, but --- the exception will not cause the process itself to exit. -exitWith :: ExitCode -> IO a - --- | The computation exitFailure is equivalent to exitWith --- (ExitFailure exitfail), where --- exitfail is implementation-dependent. -exitFailure :: IO a - -module CPUTime - --- | Computation getCPUTime returns the number of picoseconds CPU --- time used by the current program. The precision of this result is --- implementation-dependent. -getCPUTime :: IO Integer - --- | The cpuTimePrecision constant is the smallest measurable --- difference in CPU time that the implementation can record, and is --- given as an integral number of picoseconds. -cpuTimePrecision :: Integer - -module Complex - --- | Complex numbers are an algebraic type. --- --- For a complex number z, abs z is a number --- with the magnitude of z, but oriented in the positive real --- direction, whereas signum z has the phase of --- z, but unit magnitude. -data Complex a :: * -> * - --- | forms a complex number from its real and imaginary rectangular --- components. -(:+) :: !a -> !a -> Complex a - --- | Extracts the real part of a complex number. -realPart :: RealFloat a => Complex a -> a - --- | Extracts the imaginary part of a complex number. -imagPart :: RealFloat a => Complex a -> a - --- | The conjugate of a complex number. -conjugate :: RealFloat a => Complex a -> Complex a - --- | Form a complex number from polar components of magnitude and phase. -mkPolar :: RealFloat a => a -> a -> Complex a - --- | cis t is a complex value with magnitude 1 and --- phase t (modulo 2*pi). -cis :: RealFloat a => a -> Complex a - --- | The function polar takes a complex number and returns a --- (magnitude, phase) pair in canonical form: the magnitude is --- nonnegative, and the phase in the range (-pi, --- pi]; if the magnitude is zero, then so is the phase. -polar :: RealFloat a => Complex a -> (a, a) - --- | The nonnegative magnitude of a complex number. -magnitude :: RealFloat a => Complex a -> a - --- | The phase of a complex number, in the range (-pi, --- pi]. If the magnitude is zero, then so is the phase. -phase :: RealFloat a => Complex a -> a - -module CString - -module Storable - -module Directory -data Permissions -Permissions :: Bool -> Bool -> Bool -> Bool -> Permissions -readable :: Permissions -> Bool -writable :: Permissions -> Bool -executable :: Permissions -> Bool -searchable :: Permissions -> Bool - --- | createDirectory dir creates a new directory --- dir which is initially empty, or as near to empty as the --- operating system allows. --- --- The operation may fail with: --- --- -createDirectory :: FilePath -> IO () - --- | removeDirectory dir removes an existing directory --- dir. The implementation may specify additional constraints --- which must be satisfied before a directory can be removed (e.g. the --- directory has to be empty, or may not be in use by other processes). --- It is not legal for an implementation to partially remove a directory --- unless the entire directory is removed. A conformant implementation --- need not support directory removal in all situations (e.g. removal of --- the root directory). --- --- The operation may fail with: --- --- -removeDirectory :: FilePath -> IO () - --- | removeFile file removes the directory entry for an --- existing file file, where file is not itself a --- directory. The implementation may specify additional constraints which --- must be satisfied before a file can be removed (e.g. the file may not --- be in use by other processes). --- --- The operation may fail with: --- --- -removeFile :: FilePath -> IO () - --- | renameDirectory old new changes the name of an --- existing directory from old to new. If the new --- directory already exists, it is atomically replaced by the old --- directory. If the new directory is neither the old --- directory nor an alias of the old directory, it is removed as --- if by removeDirectory. A conformant implementation need not --- support renaming directories in all situations (e.g. renaming to an --- existing directory, or across different physical devices), but the --- constraints must be documented. --- --- On Win32 platforms, renameDirectory fails if the new --- directory already exists. --- --- The operation may fail with: --- --- -renameDirectory :: FilePath -> FilePath -> IO () - --- | renameFile old new changes the name of an existing --- file system object from old to new. If the new --- object already exists, it is atomically replaced by the old --- object. Neither path may refer to an existing directory. A conformant --- implementation need not support renaming files in all situations (e.g. --- renaming across different physical devices), but the constraints must --- be documented. --- --- The operation may fail with: --- --- -renameFile :: FilePath -> FilePath -> IO () - --- | getDirectoryContents dir returns a list of all --- entries in dir. --- --- The operation may fail with: --- --- -getDirectoryContents :: FilePath -> IO [FilePath] - --- | If the operating system has a notion of current directories, --- getCurrentDirectory returns an absolute path to the current --- directory of the calling process. --- --- The operation may fail with: --- --- --- --- Note that in a concurrent program, the current directory is global --- state shared between all threads of the process. When using filesystem --- operations from multiple threads, it is therefore highly recommended --- to use absolute rather than relative FilePaths. -getCurrentDirectory :: IO FilePath - --- | If the operating system has a notion of current directories, --- setCurrentDirectory dir changes the current directory --- of the calling process to dir. --- --- The operation may fail with: --- --- --- --- Note that in a concurrent program, the current directory is global --- state shared between all threads of the process. When using filesystem --- operations from multiple threads, it is therefore highly recommended --- to use absolute rather than relative FilePaths. -setCurrentDirectory :: FilePath -> IO () - --- | The operation doesFileExist returns True if the argument --- file exists and is not a directory, and False otherwise. -doesFileExist :: FilePath -> IO Bool - --- | The operation doesDirectoryExist returns True if the --- argument file exists and is a directory, and False otherwise. -doesDirectoryExist :: FilePath -> IO Bool -getPermissions :: FilePath -> IO Permissions -setPermissions :: FilePath -> Permissions -> IO () - --- | The getModificationTime operation returns the clock time at --- which the file or directory was last modified. --- --- The operation may fail with: --- --- -getModificationTime :: FilePath -> IO ClockTime -instance Eq Permissions -instance Ord Permissions -instance Read Permissions -instance Show Permissions - -module Bits - -module Maybe - --- | The isJust function returns True iff its argument is of --- the form Just _. -isJust :: Maybe a -> Bool - --- | The isNothing function returns True iff its argument is --- Nothing. -isNothing :: Maybe a -> Bool - --- | The fromJust function extracts the element out of a Just --- and throws an error if its argument is Nothing. -fromJust :: Maybe a -> a - --- | The fromMaybe function takes a default value and and --- Maybe value. If the Maybe is Nothing, it returns --- the default values; otherwise, it returns the value contained in the --- Maybe. -fromMaybe :: a -> Maybe a -> a - --- | The listToMaybe function returns Nothing on an empty --- list or Just a where a is the first element --- of the list. -listToMaybe :: [a] -> Maybe a - --- | The maybeToList function returns an empty list when given --- Nothing or a singleton list when not given Nothing. -maybeToList :: Maybe a -> [a] - --- | The catMaybes function takes a list of Maybes and --- returns a list of all the Just values. -catMaybes :: [Maybe a] -> [a] - --- | The mapMaybe function is a version of map which can --- throw out elements. In particular, the functional argument returns --- something of type Maybe b. If this is Nothing, --- no element is added on to the result list. If it just Just --- b, then b is included in the result list. -mapMaybe :: (a -> Maybe b) -> [a] -> [b] - --- | The Maybe type encapsulates an optional value. A value of type --- Maybe a either contains a value of type a --- (represented as Just a), or it is empty (represented --- as Nothing). Using Maybe is a good way to deal with --- errors or exceptional cases without resorting to drastic measures such --- as error. --- --- The Maybe type is also a monad. It is a simple kind of error --- monad, where all errors are represented by Nothing. A richer --- error monad can be built using the Data.Either.Either type. -data Maybe a :: * -> * -Nothing :: Maybe a -Just :: a -> Maybe a - --- | The maybe function takes a default value, a function, and a --- Maybe value. If the Maybe value is Nothing, the --- function returns the default value. Otherwise, it applies the function --- to the value inside the Just and returns the result. -maybe :: b -> (a -> b) -> Maybe a -> b - -module Random - --- | The class RandomGen provides a common interface to random --- number generators. --- --- Minimal complete definition: next and split. -class RandomGen g -next :: RandomGen g => g -> (Int, g) -split :: RandomGen g => g -> (g, g) -genRange :: RandomGen g => g -> (Int, Int) - --- | The StdGen instance of RandomGen has a genRange --- of at least 30 bits. --- --- The result of repeatedly using next should be at least as --- statistically robust as the Minimal Standard Random Number --- Generator described by [System.Random#Park, --- System.Random#Carta]. Until more is known about implementations --- of split, all we require is that split deliver --- generators that are (a) not identical and (b) independently robust in --- the sense just given. --- --- The Show and Read instances of StdGen provide a --- primitive way to save the state of a random number generator. It is --- required that read (show g) == g. --- --- In addition, reads may be used to map an arbitrary string (not --- necessarily one produced by show) onto a value of type --- StdGen. In general, the Read instance of StdGen --- has the following properties: --- --- -data StdGen :: * - --- | The function mkStdGen provides an alternative way of producing --- an initial generator, by mapping an Int into a generator. --- Again, distinct arguments should be likely to produce distinct --- generators. -mkStdGen :: Int -> StdGen - --- | With a source of random number supply in hand, the Random class --- allows the programmer to extract random values of a variety of types. --- --- Minimal complete definition: randomR and random. -class Random a -randomR :: (Random a, RandomGen g) => (a, a) -> g -> (a, g) -random :: (Random a, RandomGen g) => g -> (a, g) -randomRs :: (Random a, RandomGen g) => (a, a) -> g -> [a] -randoms :: (Random a, RandomGen g) => g -> [a] -randomRIO :: Random a => (a, a) -> IO a -randomIO :: Random a => IO a - --- | Uses the supplied function to get a value from the current global --- random generator, and updates the global generator with the new --- generator returned by the function. For example, rollDice --- gets a random integer between 1 and 6: --- --- 
---   rollDice :: IO Int
---   rollDice = getStdRandom (randomR (1,6))
---
-getStdRandom :: (StdGen -> (a, StdGen)) -> IO a - --- | Gets the global random number generator. -getStdGen :: IO StdGen - --- | Sets the global random number generator. -setStdGen :: StdGen -> IO () - --- | Applies split to the current global random generator, updates --- it with one of the results, and returns the other. -newStdGen :: IO StdGen - -module Word - -module Ptr - -module StablePtr - -module Monad - --- | Monads that also support choice and failure. -class Monad m => MonadPlus m :: (* -> *) -mzero :: MonadPlus m => m a -mplus :: MonadPlus m => m a -> m a -> m a - --- | The join function is the conventional monad join operator. It --- is used to remove one level of monadic structure, projecting its bound --- argument into the outer level. -join :: Monad m => m (m a) -> m a - --- | guard b is return () if b is --- True, and mzero if b is False. -guard :: MonadPlus m => Bool -> m () - --- | Conditional execution of monadic expressions. For example, --- --- 
---   when debug (putStr "Debugging\n")
---
--- --- will output the string Debugging\n if the Boolean value --- debug is True, and otherwise do nothing. -when :: Monad m => Bool -> m () -> m () - --- | The reverse of when. -unless :: Monad m => Bool -> m () -> m () - --- | In many situations, the liftM operations can be replaced by --- uses of ap, which promotes function application. --- --- 
---   return f `ap` x1 `ap` ... `ap` xn
---
--- --- is equivalent to --- --- 
---   liftMn f x1 x2 ... xn
---
-ap :: Monad m => m (a -> b) -> m a -> m b - --- | This generalizes the list-based concat function. -msum :: MonadPlus m => [m a] -> m a - --- | This generalizes the list-based filter function. -filterM :: Monad m => (a -> m Bool) -> [a] -> m [a] - --- | The mapAndUnzipM function maps its first argument over a list, --- returning the result as a pair of lists. This function is mainly used --- with complicated data structures or a state-transforming monad. -mapAndUnzipM :: Monad m => (a -> m (b, c)) -> [a] -> m ([b], [c]) - --- | The zipWithM function generalizes zipWith to arbitrary --- monads. -zipWithM :: Monad m => (a -> b -> m c) -> [a] -> [b] -> m [c] - --- | zipWithM_ is the extension of zipWithM which ignores the --- final result. -zipWithM_ :: Monad m => (a -> b -> m c) -> [a] -> [b] -> m () - --- | The foldM function is analogous to foldl, except that --- its result is encapsulated in a monad. Note that foldM works --- from left-to-right over the list arguments. This could be an issue --- where (>>) and the `folded function' are not --- commutative. --- --- 
---   foldM f a1 [x1, x2, ..., xm]
---
--- --- == --- --- 
---   do
---     a2 <- f a1 x1
---     a3 <- f a2 x2
---     ...
---     f am xm
---
--- --- If right-to-left evaluation is required, the input list should be --- reversed. -foldM :: Monad m => (a -> b -> m a) -> a -> [b] -> m a - --- | Promote a function to a monad. -liftM :: Monad m => (a1 -> r) -> m a1 -> m r - --- | Promote a function to a monad, scanning the monadic arguments from --- left to right. For example, --- --- 
---   liftM2 (+) [0,1] [0,2] = [0,2,1,3]
---   liftM2 (+) (Just 1) Nothing = Nothing
---
-liftM2 :: Monad m => (a1 -> a2 -> r) -> m a1 -> m a2 -> m r - --- | Promote a function to a monad, scanning the monadic arguments from --- left to right (cf. liftM2). -liftM3 :: Monad m => (a1 -> a2 -> a3 -> r) -> m a1 -> m a2 -> m a3 -> m r - --- | Promote a function to a monad, scanning the monadic arguments from --- left to right (cf. liftM2). -liftM4 :: Monad m => (a1 -> a2 -> a3 -> a4 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m r - --- | Promote a function to a monad, scanning the monadic arguments from --- left to right (cf. liftM2). -liftM5 :: Monad m => (a1 -> a2 -> a3 -> a4 -> a5 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m a5 -> m r - --- | The Monad class defines the basic operations over a --- monad, a concept from a branch of mathematics known as --- category theory. From the perspective of a Haskell programmer, --- however, it is best to think of a monad as an abstract datatype --- of actions. Haskell's do expressions provide a convenient --- syntax for writing monadic expressions. --- --- Minimal complete definition: >>= and return. --- --- Instances of Monad should satisfy the following laws: --- --- 
---   return a >>= k  ==  k a
---   m >>= return  ==  m
---   m >>= (\x -> k x >>= h)  ==  (m >>= k) >>= h
---
--- --- Instances of both Monad and Functor should additionally --- satisfy the law: --- --- 
---   fmap f xs  ==  xs >>= return . f
---
--- --- The instances of Monad for lists, Data.Maybe.Maybe and --- System.IO.IO defined in the Prelude satisfy these --- laws. -class Monad m :: (* -> *) -(>>=) :: Monad m => m a -> (a -> m b) -> m b -(>>) :: Monad m => m a -> m b -> m b -return :: Monad m => a -> m a -fail :: Monad m => String -> m a - --- | The Functor class is used for types that can be mapped over. --- Instances of Functor should satisfy the following laws: --- --- 
---   fmap id  ==  id
---   fmap (f . g)  ==  fmap f . fmap g
---
--- --- The instances of Functor for lists, Data.Maybe.Maybe --- and System.IO.IO satisfy these laws. -class Functor f :: (* -> *) -fmap :: Functor f => (a -> b) -> f a -> f b - --- | mapM f is equivalent to sequence . --- map f. -mapM :: Monad m => (a -> m b) -> [a] -> m [b] - --- | mapM_ f is equivalent to sequence_ . --- map f. -mapM_ :: Monad m => (a -> m b) -> [a] -> m () - --- | Evaluate each action in the sequence from left to right, and collect --- the results. -sequence :: Monad m => [m a] -> m [a] - --- | Evaluate each action in the sequence from left to right, and ignore --- the results. -sequence_ :: Monad m => [m a] -> m () - --- | Same as >>=, but with the arguments interchanged. -(=<<) :: Monad m => (a -> m b) -> m a -> m b - -module Ratio - --- | Rational numbers, with numerator and denominator of some --- Integral type. -data Ratio a :: * -> * - --- | Arbitrary-precision rational numbers, represented as a ratio of two --- Integer values. A rational number may be constructed using the --- % operator. -type Rational = Ratio Integer - --- | Forms the ratio of two integral numbers. -(%) :: Integral a => a -> a -> Ratio a - --- | Extract the numerator of the ratio in reduced form: the numerator and --- denominator have no common factor and the denominator is positive. -numerator :: Integral a => Ratio a -> a - --- | Extract the denominator of the ratio in reduced form: the numerator --- and denominator have no common factor and the denominator is positive. -denominator :: Integral a => Ratio a -> a - --- | approxRational, applied to two real fractional numbers --- x and epsilon, returns the simplest rational number --- within epsilon of x. A rational number y is --- said to be simpler than another y' if --- --- --- --- Any real interval contains a unique simplest rational; in particular, --- note that 0/1 is the simplest rational of all. -approxRational :: RealFrac a => a -> a -> Rational - -module ForeignPtr - -module IO - --- | Haskell defines operations to read and write characters from and to --- files, represented by values of type Handle. Each value of --- this type is a handle: a record used by the Haskell run-time --- system to manage I/O with file system objects. A handle has at --- least the following properties: --- --- --- --- Most handles will also have a current I/O position indicating where --- the next input or output operation will occur. A handle is --- readable if it manages only input or both input and output; --- likewise, it is writable if it manages only output or both --- input and output. A handle is open when first allocated. Once --- it is closed it can no longer be used for either input or output, --- though an implementation cannot re-use its storage while references --- remain to it. Handles are in the Show and Eq classes. --- The string produced by showing a handle is system dependent; it should --- include enough information to identify the handle for debugging. A --- handle is equal according to == only to itself; no attempt is --- made to compare the internal state of different handles for equality. -data Handle :: * -data HandlePosn :: * - --- | See System.IO.openFile -data IOMode :: * -ReadMode :: IOMode -WriteMode :: IOMode -AppendMode :: IOMode -ReadWriteMode :: IOMode - --- | Three kinds of buffering are supported: line-buffering, --- block-buffering or no-buffering. These modes have the following --- effects. For output, items are written out, or flushed, from --- the internal buffer according to the buffer mode: --- --- --- --- An implementation is free to flush the buffer more frequently, but not --- less frequently, than specified above. The output buffer is emptied as --- soon as it has been written out. --- --- Similarly, input occurs according to the buffer mode for the handle: --- --- --- --- The default buffering mode when a handle is opened is --- implementation-dependent and may depend on the file system object --- which is attached to that handle. For most implementations, physical --- files will normally be block-buffered and terminals will normally be --- line-buffered. -data BufferMode :: * - --- | buffering is disabled if possible. -NoBuffering :: BufferMode - --- | line-buffering should be enabled if possible. -LineBuffering :: BufferMode - --- | block-buffering should be enabled if possible. The size of the buffer --- is n items if the argument is Just n and is --- otherwise implementation-dependent. -BlockBuffering :: Maybe Int -> BufferMode - --- | A mode that determines the effect of hSeek hdl mode --- i. -data SeekMode :: * - --- | the position of hdl is set to i. -AbsoluteSeek :: SeekMode - --- | the position of hdl is set to offset i from the --- current position. -RelativeSeek :: SeekMode - --- | the position of hdl is set to offset i from the end --- of the file. -SeekFromEnd :: SeekMode - --- | A handle managing input from the Haskell program's standard input --- channel. -stdin :: Handle - --- | A handle managing output to the Haskell program's standard output --- channel. -stdout :: Handle - --- | A handle managing output to the Haskell program's standard error --- channel. -stderr :: Handle - --- | Computation openFile file mode allocates and returns a --- new, open handle to manage the file file. It manages input if --- mode is ReadMode, output if mode is --- WriteMode or AppendMode, and both input and output if --- mode is ReadWriteMode. --- --- If the file does not exist and it is opened for output, it should be --- created as a new file. If mode is WriteMode and the --- file already exists, then it should be truncated to zero length. Some --- operating systems delete empty files, so there is no guarantee that --- the file will exist following an openFile with mode --- WriteMode unless it is subsequently written to successfully. --- The handle is positioned at the end of the file if mode is --- AppendMode, and otherwise at the beginning (in which case its --- internal position is 0). The initial buffer mode is --- implementation-dependent. --- --- This operation may fail with: --- --- --- --- Note: if you will be working with files containing binary data, you'll --- want to be using openBinaryFile. -openFile :: FilePath -> IOMode -> IO Handle - --- | Computation hClose hdl makes handle hdl --- closed. Before the computation finishes, if hdl is writable --- its buffer is flushed as for hFlush. Performing hClose --- on a handle that has already been closed has no effect; doing so is --- not an error. All other operations on a closed handle will fail. If --- hClose fails for any reason, any further operations (apart from --- hClose) on the handle will still fail as if hdl had --- been successfully closed. -hClose :: Handle -> IO () - --- | For a handle hdl which attached to a physical file, --- hFileSize hdl returns the size of that file in 8-bit --- bytes. -hFileSize :: Handle -> IO Integer - --- | For a readable handle hdl, hIsEOF hdl returns --- True if no further input can be taken from hdl or for --- a physical file, if the current I/O position is equal to the length of --- the file. Otherwise, it returns False. --- --- NOTE: hIsEOF may block, because it has to attempt to read from --- the stream to determine whether there is any more data to be read. -hIsEOF :: Handle -> IO Bool - --- | The computation isEOF is identical to hIsEOF, except --- that it works only on stdin. -isEOF :: IO Bool - --- | Computation hSetBuffering hdl mode sets the mode of --- buffering for handle hdl on subsequent reads and writes. --- --- If the buffer mode is changed from BlockBuffering or --- LineBuffering to NoBuffering, then --- --- --- --- This operation may fail with: --- --- -hSetBuffering :: Handle -> BufferMode -> IO () - --- | Computation hGetBuffering hdl returns the current --- buffering mode for hdl. -hGetBuffering :: Handle -> IO BufferMode - --- | The action hFlush hdl causes any items buffered for --- output in handle hdl to be sent immediately to the operating --- system. --- --- This operation may fail with: --- --- -hFlush :: Handle -> IO () - --- | Computation hGetPosn hdl returns the current I/O --- position of hdl as a value of the abstract type --- HandlePosn. -hGetPosn :: Handle -> IO HandlePosn - --- | If a call to hGetPosn hdl returns a position --- p, then computation hSetPosn p sets the --- position of hdl to the position it held at the time of the --- call to hGetPosn. --- --- This operation may fail with: --- --- -hSetPosn :: HandlePosn -> IO () - --- | Computation hSeek hdl mode i sets the position of --- handle hdl depending on mode. The offset i --- is given in terms of 8-bit bytes. --- --- If hdl is block- or line-buffered, then seeking to a position --- which is not in the current buffer will first cause any items in the --- output buffer to be written to the device, and then cause the input --- buffer to be discarded. Some handles may not be seekable (see --- hIsSeekable), or only support a subset of the possible --- positioning operations (for instance, it may only be possible to seek --- to the end of a tape, or to a positive offset from the beginning or --- current position). It is not possible to set a negative I/O position, --- or for a physical file, an I/O position beyond the current --- end-of-file. --- --- This operation may fail with: --- --- -hSeek :: Handle -> SeekMode -> Integer -> IO () - --- | Computation hWaitForInput hdl t waits until input is --- available on handle hdl. It returns True as soon as --- input is available on hdl, or False if no input is --- available within t milliseconds. Note that --- hWaitForInput waits until one or more full characters --- are available, which means that it needs to do decoding, and hence may --- fail with a decoding error. --- --- If t is less than zero, then hWaitForInput waits --- indefinitely. --- --- This operation may fail with: --- --- --- --- NOTE for GHC users: unless you use the -threaded flag, --- hWaitForInput t where t >= 0 will block all other --- Haskell threads for the duration of the call. It behaves like a --- safe foreign call in this respect. -hWaitForInput :: Handle -> Int -> IO Bool - --- | Computation hReady hdl indicates whether at least one --- item is available for input from handle hdl. --- --- This operation may fail with: --- --- -hReady :: Handle -> IO Bool - --- | Computation hGetChar hdl reads a character from the --- file or channel managed by hdl, blocking until a character is --- available. --- --- This operation may fail with: --- --- -hGetChar :: Handle -> IO Char - --- | Computation hGetLine hdl reads a line from the file or --- channel managed by hdl. --- --- This operation may fail with: --- --- --- --- If hGetLine encounters end-of-file at any other point while --- reading in a line, it is treated as a line terminator and the --- (partial) line is returned. -hGetLine :: Handle -> IO String - --- | Computation hLookAhead returns the next character from the --- handle without removing it from the input buffer, blocking until a --- character is available. --- --- This operation may fail with: --- --- -hLookAhead :: Handle -> IO Char - --- | Computation hGetContents hdl returns the list of --- characters corresponding to the unread portion of the channel or file --- managed by hdl, which is put into an intermediate state, --- semi-closed. In this state, hdl is effectively closed, --- but items are read from hdl on demand and accumulated in a --- special list returned by hGetContents hdl. --- --- Any operation that fails because a handle is closed, also fails if a --- handle is semi-closed. The only exception is hClose. A --- semi-closed handle becomes closed: --- --- --- --- Once a semi-closed handle becomes closed, the contents of the --- associated list becomes fixed. The contents of this final list is only --- partially specified: it will contain at least all the items of the --- stream that were evaluated prior to the handle becoming closed. --- --- Any I/O errors encountered while a handle is semi-closed are simply --- discarded. --- --- This operation may fail with: --- --- -hGetContents :: Handle -> IO String - --- | Computation hPutChar hdl ch writes the character --- ch to the file or channel managed by hdl. Characters --- may be buffered if buffering is enabled for hdl. --- --- This operation may fail with: --- --- -hPutChar :: Handle -> Char -> IO () - --- | Computation hPutStr hdl s writes the string s --- to the file or channel managed by hdl. --- --- This operation may fail with: --- --- -hPutStr :: Handle -> String -> IO () - --- | The same as hPutStr, but adds a newline character. -hPutStrLn :: Handle -> String -> IO () - --- | Computation hPrint hdl t writes the string --- representation of t given by the shows function to the --- file or channel managed by hdl and appends a newline. --- --- This operation may fail with: --- --- -hPrint :: Show a => Handle -> a -> IO () -hIsOpen :: Handle -> IO Bool -hIsClosed :: Handle -> IO Bool -hIsReadable :: Handle -> IO Bool -hIsWritable :: Handle -> IO Bool -hIsSeekable :: Handle -> IO Bool - --- | An error indicating that an IO operation failed because one of --- its arguments already exists. -isAlreadyExistsError :: IOError -> Bool - --- | An error indicating that an IO operation failed because one of --- its arguments does not exist. -isDoesNotExistError :: IOError -> Bool - --- | An error indicating that an IO operation failed because one of --- its arguments is a single-use resource, which is already being used --- (for example, opening the same file twice for writing might give this --- error). -isAlreadyInUseError :: IOError -> Bool - --- | An error indicating that an IO operation failed because the --- device is full. -isFullError :: IOError -> Bool - --- | An error indicating that an IO operation failed because the end --- of file has been reached. -isEOFError :: IOError -> Bool - --- | An error indicating that an IO operation failed because the --- operation was not possible. Any computation which returns an IO --- result may fail with isIllegalOperation. In some cases, an --- implementation will not be able to distinguish between the possible --- error causes. In this case it should fail with --- isIllegalOperation. -isIllegalOperation :: IOError -> Bool - --- | An error indicating that an IO operation failed because the --- user does not have sufficient operating system privilege to perform --- that operation. -isPermissionError :: IOError -> Bool - --- | A programmer-defined error value constructed using userError. -isUserError :: IOError -> Bool -ioeGetErrorString :: IOError -> String -ioeGetHandle :: IOError -> Maybe Handle -ioeGetFileName :: IOError -> Maybe FilePath - --- | The try function is deprecated. Please use the new exceptions --- variant, Control.Exception.try from Control.Exception, --- instead. -try :: IO a -> IO (Either IOError a) - --- | The bracket function captures a common allocate, compute, --- deallocate idiom in which the deallocation step must occur even in the --- case of an error during computation. This is similar to --- try-catch-finally in Java. --- --- This version handles only IO errors, as defined by Haskell 98. The --- version of bracket in Control.Exception handles all --- exceptions, and should be used instead. -bracket :: IO a -> (a -> IO b) -> (a -> IO c) -> IO c - --- | A variant of bracket where the middle computation doesn't want --- x. --- --- This version handles only IO errors, as defined by Haskell 98. The --- version of bracket_ in Control.Exception handles all --- exceptions, and should be used instead. -bracket_ :: IO a -> (a -> IO b) -> IO c -> IO c - --- | A value of type IO a is a computation which, when --- performed, does some I/O before returning a value of type a. --- --- There is really only one way to "perform" an I/O action: bind it to --- Main.main in your program. When your program is run, the I/O --- will be performed. It isn't possible to perform I/O from an arbitrary --- function, unless that function is itself in the IO monad and --- called at some point, directly or indirectly, from Main.main. --- --- IO is a monad, so IO actions can be combined using --- either the do-notation or the >> and >>= --- operations from the Monad class. -data IO a :: * -> * - --- | File and directory names are values of type String, whose --- precise meaning is operating system dependent. Files can be opened, --- yielding a handle which can then be used to operate on the contents of --- that file. -type FilePath = String - --- | The Haskell 98 type for exceptions in the IO monad. Any I/O --- operation may raise an IOError instead of returning a result. --- For a more general type of exception, including also those that arise --- in pure code, see Control.Exception.Exception. --- --- In Haskell 98, this is an opaque type. -type IOError = IOException - --- | Raise an IOError in the IO monad. -ioError :: IOError -> IO a - --- | Construct an IOError value with a string describing the error. --- The fail method of the IO instance of the Monad --- class raises a userError, thus: --- --- 
---   instance Monad IO where 
---     ...
---     fail s = ioError (userError s)
---
-userError :: String -> IOError - --- | The catch function is deprecated. Please use the new exceptions --- variant, Control.Exception.catch from --- Control.Exception, instead. -catch :: IO a -> (IOError -> IO a) -> IO a - --- | The interact function takes a function of type --- String->String as its argument. The entire input from the --- standard input device is passed to this function as its argument, and --- the resulting string is output on the standard output device. -interact :: (String -> String) -> IO () - --- | Write a character to the standard output device (same as --- hPutChar stdout). -putChar :: Char -> IO () - --- | Write a string to the standard output device (same as hPutStr --- stdout). -putStr :: String -> IO () - --- | The same as putStr, but adds a newline character. -putStrLn :: String -> IO () - --- | The print function outputs a value of any printable type to the --- standard output device. Printable types are those that are instances --- of class Show; print converts values to strings for --- output using the show operation and adds a newline. --- --- For example, a program to print the first 20 integers and their powers --- of 2 could be written as: --- --- 
---   main = print ([(n, 2^n) | n <- [0..19]])
---
-print :: Show a => a -> IO () - --- | Read a character from the standard input device (same as --- hGetChar stdin). -getChar :: IO Char - --- | Read a line from the standard input device (same as hGetLine --- stdin). -getLine :: IO String - --- | The getContents operation returns all user input as a single --- string, which is read lazily as it is needed (same as --- hGetContents stdin). -getContents :: IO String - --- | The readFile function reads a file and returns the contents of --- the file as a string. The file is read lazily, on demand, as with --- getContents. -readFile :: FilePath -> IO String - --- | The computation writeFile file str function writes the --- string str, to the file file. -writeFile :: FilePath -> String -> IO () - --- | The computation appendFile file str function appends --- the string str, to the file file. --- --- Note that writeFile and appendFile write a literal --- string to a file. To write a value of any printable type, as with --- print, use the show function to convert the value to a --- string first. --- --- 
---   main = appendFile "squares" (show [(x,x*x) | x <- [0,0.1..2]])
---
-appendFile :: FilePath -> String -> IO () - --- | The readIO function is similar to read except that it --- signals parse failure to the IO monad instead of terminating --- the program. -readIO :: Read a => String -> IO a - --- | The readLn function combines getLine and readIO. -readLn :: Read a => IO a - -module Char - --- | Selects the first 128 characters of the Unicode character set, --- corresponding to the ASCII character set. -isAscii :: Char -> Bool - --- | Selects the first 256 characters of the Unicode character set, --- corresponding to the ISO 8859-1 (Latin-1) character set. -isLatin1 :: Char -> Bool - --- | Selects control characters, which are the non-printing characters of --- the Latin-1 subset of Unicode. -isControl :: Char -> Bool - --- | Selects printable Unicode characters (letters, numbers, marks, --- punctuation, symbols and spaces). -isPrint :: Char -> Bool - --- | Returns True for any Unicode space character, and the control --- characters \t, \n, \r, \f, --- \v. -isSpace :: Char -> Bool - --- | Selects upper-case or title-case alphabetic Unicode characters --- (letters). Title case is used by a small number of letter ligatures --- like the single-character form of Lj. -isUpper :: Char -> Bool - --- | Selects lower-case alphabetic Unicode characters (letters). -isLower :: Char -> Bool - --- | Selects alphabetic Unicode characters (lower-case, upper-case and --- title-case letters, plus letters of caseless scripts and modifiers --- letters). This function is equivalent to Data.Char.isLetter. -isAlpha :: Char -> Bool - --- | Selects ASCII digits, i.e. '0'..'9'. -isDigit :: Char -> Bool - --- | Selects ASCII octal digits, i.e. '0'..'7'. -isOctDigit :: Char -> Bool - --- | Selects ASCII hexadecimal digits, i.e. '0'..'9', --- 'a'..'f', 'A'..'F'. -isHexDigit :: Char -> Bool - --- | Selects alphabetic or numeric digit Unicode characters. --- --- Note that numeric digits outside the ASCII range are selected by this --- function but not by isDigit. Such digits may be part of --- identifiers but are not used by the printer and reader to represent --- numbers. -isAlphaNum :: Char -> Bool - --- | Convert a single digit Char to the corresponding Int. --- This function fails unless its argument satisfies isHexDigit, --- but recognises both upper and lower-case hexadecimal digits (i.e. --- '0'..'9', 'a'..'f', --- 'A'..'F'). -digitToInt :: Char -> Int - --- | Convert an Int in the range 0..15 to the --- corresponding single digit Char. This function fails on other --- inputs, and generates lower-case hexadecimal digits. -intToDigit :: Int -> Char - --- | Convert a letter to the corresponding upper-case letter, if any. Any --- other character is returned unchanged. -toUpper :: Char -> Char - --- | Convert a letter to the corresponding lower-case letter, if any. Any --- other character is returned unchanged. -toLower :: Char -> Char - --- | The Prelude.fromEnum method restricted to the type --- Data.Char.Char. -ord :: Char -> Int - --- | The Prelude.toEnum method restricted to the type --- Data.Char.Char. -chr :: Int -> Char - --- | Read a string representation of a character, using Haskell --- source-language escape conventions, and convert it to the character --- that it encodes. For example: --- --- 
---   readLitChar "\\nHello"  =  [('\n', "Hello")]
---
-readLitChar :: ReadS Char - --- | Convert a character to a string using only printable characters, using --- Haskell source-language escape conventions. For example: --- --- 
---   showLitChar '\n' s  =  "\\n" ++ s
---
-showLitChar :: Char -> ShowS - --- | Read a string representation of a character, using Haskell --- source-language escape conventions. For example: --- --- 
---   lexLitChar  "\\nHello"  =  [("\\n", "Hello")]
---
-lexLitChar :: ReadS String - --- | The character type Char is an enumeration whose values --- represent Unicode (or equivalently ISO/IEC 10646) characters (see --- http://www.unicode.org/ for details). This set extends the ISO --- 8859-1 (Latin-1) character set (the first 256 charachers), which is --- itself an extension of the ASCII character set (the first 128 --- characters). A character literal in Haskell has type Char. --- --- To convert a Char to or from the corresponding Int value --- defined by Unicode, use Prelude.toEnum and --- Prelude.fromEnum from the Prelude.Enum class --- respectively (or equivalently ord and chr). -data Char :: * - --- | A String is a list of characters. String constants in Haskell --- are values of type String. -type String = [Char] - -module Int - -module Ix - --- | The Ix class is used to map a contiguous subrange of values in --- a type onto integers. It is used primarily for array indexing (see the --- array package). --- --- The first argument (l,u) of each of these operations is a --- pair specifying the lower and upper bounds of a contiguous subrange of --- values. --- --- An implementation is entitled to assume the following laws about these --- operations: --- --- --- --- Minimal complete instance: range, index and --- inRange. -class Ord a => Ix a -range :: Ix a => (a, a) -> [a] -index :: Ix a => (a, a) -> a -> Int -inRange :: Ix a => (a, a) -> a -> Bool -rangeSize :: Ix a => (a, a) -> Int - --- | The size of the subrange defined by a bounding pair. -rangeSize :: Ix a => (a, a) -> Int - -module Array - --- | The type of immutable non-strict (boxed) arrays with indices in --- i and elements in e. -data Array i e :: * -> * -> * - --- | Construct an array with the specified bounds and containing values for --- given indices within these bounds. --- --- The array is undefined (i.e. bottom) if any index in the list is out --- of bounds. The Haskell 98 Report further specifies that if any two --- associations in the list have the same index, the value at that index --- is undefined (i.e. bottom). However in GHC's implementation, the value --- at such an index is the value part of the last association with that --- index in the list. --- --- Because the indices must be checked for these errors, array is --- strict in the bounds argument and in the indices of the association --- list, but non-strict in the values. Thus, recurrences such as the --- following are possible: --- --- 
---   a = array (1,100) ((1,1) : [(i, i * a!(i-1)) | i <- [2..100]])
---
--- --- Not every index within the bounds of the array need appear in the --- association list, but the values associated with indices that do not --- appear will be undefined (i.e. bottom). --- --- If, in any dimension, the lower bound is greater than the upper bound, --- then the array is legal, but empty. Indexing an empty array always --- gives an array-bounds error, but bounds still yields the bounds --- with which the array was constructed. -array :: Ix i => (i, i) -> [(i, e)] -> Array i e - --- | Construct an array from a pair of bounds and a list of values in index --- order. -listArray :: Ix i => (i, i) -> [e] -> Array i e - --- | The value at the given index in an array. -(!) :: Ix i => Array i e -> i -> e - --- | The bounds with which an array was constructed. -bounds :: Ix i => Array i e -> (i, i) - --- | The list of indices of an array in ascending order. -indices :: Ix i => Array i e -> [i] - --- | The list of elements of an array in index order. -elems :: Ix i => Array i e -> [e] - --- | The list of associations of an array in index order. -assocs :: Ix i => Array i e -> [(i, e)] - --- | The accumArray function deals with repeated indices in the --- association list using an accumulating function which combines --- the values of associations with the same index. For example, given a --- list of values of some index type, hist produces a histogram --- of the number of occurrences of each index within a specified range: --- --- 
---   hist :: (Ix a, Num b) => (a,a) -> [a] -> Array a b
---   hist bnds is = accumArray (+) 0 bnds [(i, 1) | i<-is, inRange bnds i]
---
--- --- If the accumulating function is strict, then accumArray is --- strict in the values, as well as the indices, in the association list. --- Thus, unlike ordinary arrays built with array, accumulated --- arrays should not in general be recursive. -accumArray :: Ix i => (e -> a -> e) -> e -> (i, i) -> [(i, a)] -> Array i e - --- | Constructs an array identical to the first argument except that it has --- been updated by the associations in the right argument. For example, --- if m is a 1-origin, n by n matrix, then --- --- 
---   m//[((i,i), 0) | i <- [1..n]]
---
--- --- is the same matrix, except with the diagonal zeroed. --- --- Repeated indices in the association list are handled as for --- array: Haskell 98 specifies that the resulting array is --- undefined (i.e. bottom), but GHC's implementation uses the last --- association for each index. -(//) :: Ix i => Array i e -> [(i, e)] -> Array i e - --- | accum f takes an array and an association list and --- accumulates pairs from the list into the array with the accumulating --- function f. Thus accumArray can be defined using --- accum: --- --- 
---   accumArray f z b = accum f (array b [(i, z) | i <- range b])
---
-accum :: Ix i => (e -> a -> e) -> Array i e -> [(i, a)] -> Array i e - --- | ixmap allows for transformations on array indices. It may be --- thought of as providing function composition on the right with the --- mapping that the original array embodies. --- --- A similar transformation of array values may be achieved using --- fmap from the Array instance of the Functor --- class. -ixmap :: (Ix i, Ix j) => (i, i) -> (i -> j) -> Array j e -> Array i e diff --git a/data/html.txt b/data/html.txt deleted file mode 100644 --- a/data/html.txt +++ /dev/null @@ -1,272 +0,0 @@ --- Hoogle documentation, generated by Haddock --- See Hoogle, http://www.haskell.org/hoogle/ - - --- | HTML combinator library --- --- This package contains a combinator library for constructing HTML --- documents. -@package html -@version 1.0.1.2 - - --- | An Html combinator library -module Text.Html.BlockTable -data BlockTable a -single :: a -> BlockTable a -empty :: BlockTable a -above :: BlockTable a -> BlockTable a -> BlockTable a -beside :: BlockTable a -> BlockTable a -> BlockTable a -getMatrix :: BlockTable a -> [[(a, (Int, Int))]] -showsTable :: Show a => BlockTable a -> ShowS -showTable :: Show a => BlockTable a -> String -instance Show a => Show (BlockTable a) - - --- | An Html combinator library -module Text.Html -data HtmlElement -HtmlString :: String -> HtmlElement -HtmlTag :: String -> [HtmlAttr] -> Html -> HtmlElement -markupTag :: HtmlElement -> String -markupAttrs :: HtmlElement -> [HtmlAttr] -markupContent :: HtmlElement -> Html -data HtmlAttr -HtmlAttr :: String -> String -> HtmlAttr -newtype Html -Html :: [HtmlElement] -> Html -getHtmlElements :: Html -> [HtmlElement] -class HTML a -toHtml :: HTML a => a -> Html -toHtmlFromList :: HTML a => [a] -> Html -class ADDATTRS a -(!) :: ADDATTRS a => a -> [HtmlAttr] -> a -(<<) :: HTML a => (Html -> b) -> a -> b -concatHtml :: HTML a => [a] -> Html -(+++) :: (HTML a, HTML b) => a -> b -> Html -noHtml :: Html -tag :: String -> Html -> Html -itag :: String -> Html -emptyAttr :: String -> HtmlAttr -intAttr :: String -> Int -> HtmlAttr -strAttr :: String -> String -> HtmlAttr -stringToHtmlString :: String -> String -type URL = String -primHtml :: String -> Html -stringToHtml :: String -> Html -lineToHtml :: String -> Html -address :: Html -> Html -anchor :: Html -> Html -applet :: Html -> Html -area :: Html -basefont :: Html -big :: Html -> Html -blockquote :: Html -> Html -body :: Html -> Html -bold :: Html -> Html -br :: Html -caption :: Html -> Html -center :: Html -> Html -cite :: Html -> Html -ddef :: Html -> Html -define :: Html -> Html -dlist :: Html -> Html -dterm :: Html -> Html -emphasize :: Html -> Html -fieldset :: Html -> Html -font :: Html -> Html -form :: Html -> Html -frame :: Html -> Html -frameset :: Html -> Html -h1 :: Html -> Html -h2 :: Html -> Html -h3 :: Html -> Html -h4 :: Html -> Html -h5 :: Html -> Html -h6 :: Html -> Html -header :: Html -> Html -hr :: Html -image :: Html -input :: Html -italics :: Html -> Html -keyboard :: Html -> Html -legend :: Html -> Html -li :: Html -> Html -meta :: Html -noframes :: Html -> Html -olist :: Html -> Html -option :: Html -> Html -paragraph :: Html -> Html -param :: Html -pre :: Html -> Html -sample :: Html -> Html -select :: Html -> Html -small :: Html -> Html -strong :: Html -> Html -style :: Html -> Html -sub :: Html -> Html -sup :: Html -> Html -table :: Html -> Html -td :: Html -> Html -textarea :: Html -> Html -th :: Html -> Html -thebase :: Html -thecode :: Html -> Html -thediv :: Html -> Html -thehtml :: Html -> Html -thelink :: Html -> Html -themap :: Html -> Html -thespan :: Html -> Html -thetitle :: Html -> Html -tr :: Html -> Html -tt :: Html -> Html -ulist :: Html -> Html -underline :: Html -> Html -variable :: Html -> Html -action :: String -> HtmlAttr -align :: String -> HtmlAttr -alink :: String -> HtmlAttr -alt :: String -> HtmlAttr -altcode :: String -> HtmlAttr -archive :: String -> HtmlAttr -background :: String -> HtmlAttr -base :: String -> HtmlAttr -bgcolor :: String -> HtmlAttr -border :: Int -> HtmlAttr -bordercolor :: String -> HtmlAttr -cellpadding :: Int -> HtmlAttr -cellspacing :: Int -> HtmlAttr -checked :: HtmlAttr -clear :: String -> HtmlAttr -code :: String -> HtmlAttr -codebase :: String -> HtmlAttr -color :: String -> HtmlAttr -cols :: String -> HtmlAttr -colspan :: Int -> HtmlAttr -compact :: HtmlAttr -content :: String -> HtmlAttr -coords :: String -> HtmlAttr -enctype :: String -> HtmlAttr -face :: String -> HtmlAttr -frameborder :: Int -> HtmlAttr -height :: Int -> HtmlAttr -href :: String -> HtmlAttr -hspace :: Int -> HtmlAttr -httpequiv :: String -> HtmlAttr -identifier :: String -> HtmlAttr -ismap :: HtmlAttr -lang :: String -> HtmlAttr -link :: String -> HtmlAttr -marginheight :: Int -> HtmlAttr -marginwidth :: Int -> HtmlAttr -maxlength :: Int -> HtmlAttr -method :: String -> HtmlAttr -multiple :: HtmlAttr -name :: String -> HtmlAttr -nohref :: HtmlAttr -noresize :: HtmlAttr -noshade :: HtmlAttr -nowrap :: HtmlAttr -rel :: String -> HtmlAttr -rev :: String -> HtmlAttr -rows :: String -> HtmlAttr -rowspan :: Int -> HtmlAttr -rules :: String -> HtmlAttr -scrolling :: String -> HtmlAttr -selected :: HtmlAttr -shape :: String -> HtmlAttr -size :: String -> HtmlAttr -src :: String -> HtmlAttr -start :: Int -> HtmlAttr -target :: String -> HtmlAttr -text :: String -> HtmlAttr -theclass :: String -> HtmlAttr -thestyle :: String -> HtmlAttr -thetype :: String -> HtmlAttr -title :: String -> HtmlAttr -usemap :: String -> HtmlAttr -valign :: String -> HtmlAttr -value :: String -> HtmlAttr -version :: String -> HtmlAttr -vlink :: String -> HtmlAttr -vspace :: Int -> HtmlAttr -width :: String -> HtmlAttr -validHtmlTags :: [String] -validHtmlITags :: [String] -validHtmlAttrs :: [String] -aqua :: String -black :: String -blue :: String -fuchsia :: String -gray :: String -green :: String -lime :: String -maroon :: String -navy :: String -olive :: String -purple :: String -red :: String -silver :: String -teal :: String -yellow :: String -white :: String -linesToHtml :: [String] -> Html -primHtmlChar :: String -> Html -copyright :: Html -spaceHtml :: Html -bullet :: Html -p :: Html -> Html -class HTMLTABLE ht -cell :: HTMLTABLE ht => ht -> HtmlTable -newtype HtmlTable -HtmlTable :: (BlockTable (Int -> Int -> Html)) -> HtmlTable -(, beside, <->, above) :: (HTMLTABLE ht1, HTMLTABLE ht2) => ht1 -> ht2 -> HtmlTable -aboves, besides :: HTMLTABLE ht => [ht] -> HtmlTable -simpleTable :: [HtmlAttr] -> [HtmlAttr] -> [[Html]] -> Html -mkHtmlTable :: BlockTable (Int -> Int -> Html) -> HtmlTable -renderTable :: BlockTable (Int -> Int -> Html) -> Html -data HtmlTree -HtmlLeaf :: Html -> HtmlTree -HtmlNode :: Html -> [HtmlTree] -> Html -> HtmlTree -treeHtml :: [String] -> HtmlTree -> Html -debugHtml :: HTML a => a -> Html -data HotLink -HotLink :: URL -> [Html] -> [HtmlAttr] -> HotLink -hotLinkURL :: HotLink -> URL -hotLinkContents :: HotLink -> [Html] -hotLinkAttributes :: HotLink -> [HtmlAttr] -hotlink :: URL -> [Html] -> HotLink -ordList :: HTML a => [a] -> Html -unordList :: HTML a => [a] -> Html -defList :: (HTML a, HTML b) => [(a, b)] -> Html -widget :: String -> String -> [HtmlAttr] -> Html -checkbox :: String -> String -> Html -hidden :: String -> String -> Html -radio :: String -> String -> Html -reset :: String -> String -> Html -submit :: String -> String -> Html -password :: String -> Html -textfield :: String -> Html -afile :: String -> Html -clickmap :: String -> Html -menu :: String -> [Html] -> Html -gui :: String -> Html -> Html -renderHtml :: HTML html => html -> String -prettyHtml :: HTML html => html -> String -renderHtml' :: Int -> HtmlElement -> ShowS -prettyHtml' :: HtmlElement -> [String] -renderTag :: Bool -> String -> [HtmlAttr] -> Int -> ShowS -instance Show HotLink -instance HTML HotLink -instance HTML HtmlTree -instance Show HtmlTable -instance HTML HtmlTable -instance HTMLTABLE Html -instance HTMLTABLE HtmlTable -instance Show HtmlAttr -instance Show Html -instance ADDATTRS Html -instance ADDATTRS b => ADDATTRS (a -> b) -instance HTML a => HTML [a] -instance HTML Char -instance HTML Html diff --git a/data/vector.txt b/data/vector.txt deleted file mode 100644 --- a/data/vector.txt +++ /dev/null @@ -1,8948 +0,0 @@ --- Hoogle documentation, generated by Haddock --- See Hoogle, http://www.haskell.org/hoogle/ - - --- | Efficient Arrays --- --- An efficient implementation of Int-indexed arrays (both mutable and --- immutable), with a powerful loop optimisation framework . --- --- It is structured as follows: --- --- --- --- Each module has a Safe version with is marked as --- Trustworthy (see --- http://hackage.haskell.org/trac/ghc/wiki/SafeHaskell). --- --- There is also a (draft) tutorial on common uses of vector. --- --- --- --- Please use the project trac to submit bug reports and feature --- requests. --- --- --- --- Changes in version 0.9 --- --- --- --- Changes in version 0.8 --- --- -@package vector -@version 0.9 - - --- | Ugly internal utility functions for implementing Storable-based --- vectors. -module Data.Vector.Storable.Internal -getPtr :: ForeignPtr a -> Ptr a -setPtr :: ForeignPtr a -> Ptr a -> ForeignPtr a -updPtr :: (Ptr a -> Ptr a) -> ForeignPtr a -> ForeignPtr a - - --- | Fusion-related utility types -module Data.Vector.Fusion.Util - --- | Identity monad -newtype Id a -Id :: a -> Id a -unId :: Id a -> a - --- | Box monad -data Box a -Box :: a -> Box a -unBox :: Box a -> a - --- | Delay inlining a function until late in the game (simplifier phase 0). -delay_inline :: (a -> b) -> a -> b - --- | min inlined in phase 0 -delayed_min :: Int -> Int -> Int -instance Monad Box -instance Functor Box -instance Monad Id -instance Functor Id - - --- | Size hints for streams. -module Data.Vector.Fusion.Stream.Size - --- | Size hint -data Size - --- | Exact size -Exact :: Int -> Size - --- | Upper bound on the size -Max :: Int -> Size - --- | Unknown size -Unknown :: Size - --- | Minimum of two size hints -smaller :: Size -> Size -> Size - --- | Maximum of two size hints -larger :: Size -> Size -> Size - --- | Convert a size hint to an upper bound -toMax :: Size -> Size - --- | Compute the maximum size from a size hint if possible -upperBound :: Size -> Maybe Int -instance Eq Size -instance Show Size -instance Num Size - - --- | Bounds checking infrastructure -module Data.Vector.Internal.Check -data Checks -Bounds :: Checks -Unsafe :: Checks -Internal :: Checks -doChecks :: Checks -> Bool -error :: String -> Int -> Checks -> String -> String -> a -emptyStream :: String -> Int -> Checks -> String -> a -check :: String -> Int -> Checks -> String -> String -> Bool -> a -> a -assert :: String -> Int -> Checks -> String -> Bool -> a -> a -checkIndex :: String -> Int -> Checks -> String -> Int -> Int -> a -> a -checkLength :: String -> Int -> Checks -> String -> Int -> a -> a -checkSlice :: String -> Int -> Checks -> String -> Int -> Int -> Int -> a -> a -instance Eq Checks - - --- | Monadic stream combinators. -module Data.Vector.Fusion.Stream.Monadic - --- | Monadic streams -data Stream m a -Stream :: (s -> m (Step s a)) -> s -> Size -> Stream m a - --- | Result of taking a single step in a stream -data Step s a - --- | a new element and a new seed -Yield :: a -> s -> Step s a - --- | just a new seed -Skip :: s -> Step s a - --- | end of stream -Done :: Step s a - --- | Size hint of a Stream -size :: Stream m a -> Size - --- | Attach a Size hint to a Stream -sized :: Stream m a -> Size -> Stream m a - --- | Length of a Stream -length :: Monad m => Stream m a -> m Int - --- | Check if a Stream is empty -null :: Monad m => Stream m a -> m Bool - --- | Empty Stream -empty :: Monad m => Stream m a - --- | Singleton Stream -singleton :: Monad m => a -> Stream m a - --- | Prepend an element -cons :: Monad m => a -> Stream m a -> Stream m a - --- | Append an element -snoc :: Monad m => Stream m a -> a -> Stream m a - --- | Replicate a value to a given length -replicate :: Monad m => Int -> a -> Stream m a - --- | Yield a Stream of values obtained by performing the monadic --- action the given number of times -replicateM :: Monad m => Int -> m a -> Stream m a -generate :: Monad m => Int -> (Int -> a) -> Stream m a - --- | Generate a stream from its indices -generateM :: Monad m => Int -> (Int -> m a) -> Stream m a - --- | Concatenate two Streams -(++) :: Monad m => Stream m a -> Stream m a -> Stream m a - --- | First element of the Stream or error if empty -head :: Monad m => Stream m a -> m a - --- | Last element of the Stream or error if empty -last :: Monad m => Stream m a -> m a - --- | Element at the given position -(!!) :: Monad m => Stream m a -> Int -> m a - --- | Element at the given position or Nothing if out of bounds -(!?) :: Monad m => Stream m a -> Int -> m (Maybe a) - --- | Extract a substream of the given length starting at the given --- position. -slice :: Monad m => Int -> Int -> Stream m a -> Stream m a - --- | All but the last element -init :: Monad m => Stream m a -> Stream m a - --- | All but the first element -tail :: Monad m => Stream m a -> Stream m a - --- | The first n elements -take :: Monad m => Int -> Stream m a -> Stream m a - --- | All but the first n elements -drop :: Monad m => Int -> Stream m a -> Stream m a - --- | Map a function over a Stream -map :: Monad m => (a -> b) -> Stream m a -> Stream m b - --- | Map a monadic function over a Stream -mapM :: Monad m => (a -> m b) -> Stream m a -> Stream m b - --- | Execute a monadic action for each element of the Stream -mapM_ :: Monad m => (a -> m b) -> Stream m a -> m () - --- | Transform a Stream to use a different monad -trans :: (Monad m, Monad m') => (forall a. m a -> m' a) -> Stream m a -> Stream m' a -unbox :: Monad m => Stream m (Box a) -> Stream m a -concatMap :: Monad m => (a -> Stream m b) -> Stream m a -> Stream m b - --- | Create a Stream of values from a Stream of streamable --- things -flatten :: Monad m => (a -> m s) -> (s -> m (Step s b)) -> Size -> Stream m a -> Stream m b - --- | Pair each element in a Stream with its index -indexed :: Monad m => Stream m a -> Stream m (Int, a) - --- | Pair each element in a Stream with its index, starting from the --- right and counting down -indexedR :: Monad m => Int -> Stream m a -> Stream m (Int, a) -zipWithM_ :: Monad m => (a -> b -> m c) -> Stream m a -> Stream m b -> m () - --- | Zip two Streams with the given monadic function -zipWithM :: Monad m => (a -> b -> m c) -> Stream m a -> Stream m b -> Stream m c -zipWith3M :: Monad m => (a -> b -> c -> m d) -> Stream m a -> Stream m b -> Stream m c -> Stream m d -zipWith4M :: Monad m => (a -> b -> c -> d -> m e) -> Stream m a -> Stream m b -> Stream m c -> Stream m d -> Stream m e -zipWith5M :: Monad m => (a -> b -> c -> d -> e -> m f) -> Stream m a -> Stream m b -> Stream m c -> Stream m d -> Stream m e -> Stream m f -zipWith6M :: Monad m => (a -> b -> c -> d -> e -> f -> m g) -> Stream m a -> Stream m b -> Stream m c -> Stream m d -> Stream m e -> Stream m f -> Stream m g -zipWith :: Monad m => (a -> b -> c) -> Stream m a -> Stream m b -> Stream m c -zipWith3 :: Monad m => (a -> b -> c -> d) -> Stream m a -> Stream m b -> Stream m c -> Stream m d -zipWith4 :: Monad m => (a -> b -> c -> d -> e) -> Stream m a -> Stream m b -> Stream m c -> Stream m d -> Stream m e -zipWith5 :: Monad m => (a -> b -> c -> d -> e -> f) -> Stream m a -> Stream m b -> Stream m c -> Stream m d -> Stream m e -> Stream m f -zipWith6 :: Monad m => (a -> b -> c -> d -> e -> f -> g) -> Stream m a -> Stream m b -> Stream m c -> Stream m d -> Stream m e -> Stream m f -> Stream m g -zip :: Monad m => Stream m a -> Stream m b -> Stream m (a, b) -zip3 :: Monad m => Stream m a -> Stream m b -> Stream m c -> Stream m (a, b, c) -zip4 :: Monad m => Stream m a -> Stream m b -> Stream m c -> Stream m d -> Stream m (a, b, c, d) -zip5 :: Monad m => Stream m a -> Stream m b -> Stream m c -> Stream m d -> Stream m e -> Stream m (a, b, c, d, e) -zip6 :: Monad m => Stream m a -> Stream m b -> Stream m c -> Stream m d -> Stream m e -> Stream m f -> Stream m (a, b, c, d, e, f) - --- | Drop elements which do not satisfy the predicate -filter :: Monad m => (a -> Bool) -> Stream m a -> Stream m a - --- | Drop elements which do not satisfy the monadic predicate -filterM :: Monad m => (a -> m Bool) -> Stream m a -> Stream m a - --- | Longest prefix of elements that satisfy the predicate -takeWhile :: Monad m => (a -> Bool) -> Stream m a -> Stream m a - --- | Longest prefix of elements that satisfy the monadic predicate -takeWhileM :: Monad m => (a -> m Bool) -> Stream m a -> Stream m a - --- | Drop the longest prefix of elements that satisfy the predicate -dropWhile :: Monad m => (a -> Bool) -> Stream m a -> Stream m a - --- | Drop the longest prefix of elements that satisfy the monadic predicate -dropWhileM :: Monad m => (a -> m Bool) -> Stream m a -> Stream m a - --- | Check whether the Stream contains an element -elem :: (Monad m, Eq a) => a -> Stream m a -> m Bool - --- | Inverse of elem -notElem :: (Monad m, Eq a) => a -> Stream m a -> m Bool - --- | Yield Just the first element that satisfies the predicate or --- Nothing if no such element exists. -find :: Monad m => (a -> Bool) -> Stream m a -> m (Maybe a) - --- | Yield Just the first element that satisfies the monadic --- predicate or Nothing if no such element exists. -findM :: Monad m => (a -> m Bool) -> Stream m a -> m (Maybe a) - --- | Yield Just the index of the first element that satisfies the --- predicate or Nothing if no such element exists. -findIndex :: Monad m => (a -> Bool) -> Stream m a -> m (Maybe Int) - --- | Yield Just the index of the first element that satisfies the --- monadic predicate or Nothing if no such element exists. -findIndexM :: Monad m => (a -> m Bool) -> Stream m a -> m (Maybe Int) - --- | Left fold -foldl :: Monad m => (a -> b -> a) -> a -> Stream m b -> m a - --- | Left fold with a monadic operator -foldlM :: Monad m => (a -> b -> m a) -> a -> Stream m b -> m a - --- | Left fold over a non-empty Stream -foldl1 :: Monad m => (a -> a -> a) -> Stream m a -> m a - --- | Left fold over a non-empty Stream with a monadic operator -foldl1M :: Monad m => (a -> a -> m a) -> Stream m a -> m a - --- | Same as foldlM -foldM :: Monad m => (a -> b -> m a) -> a -> Stream m b -> m a - --- | Same as foldl1M -fold1M :: Monad m => (a -> a -> m a) -> Stream m a -> m a - --- | Left fold with a strict accumulator -foldl' :: Monad m => (a -> b -> a) -> a -> Stream m b -> m a - --- | Left fold with a strict accumulator and a monadic operator -foldlM' :: Monad m => (a -> b -> m a) -> a -> Stream m b -> m a - --- | Left fold over a non-empty Stream with a strict accumulator -foldl1' :: Monad m => (a -> a -> a) -> Stream m a -> m a - --- | Left fold over a non-empty Stream with a strict accumulator and --- a monadic operator -foldl1M' :: Monad m => (a -> a -> m a) -> Stream m a -> m a - --- | Same as foldlM' -foldM' :: Monad m => (a -> b -> m a) -> a -> Stream m b -> m a - --- | Same as foldl1M' -fold1M' :: Monad m => (a -> a -> m a) -> Stream m a -> m a - --- | Right fold -foldr :: Monad m => (a -> b -> b) -> b -> Stream m a -> m b - --- | Right fold with a monadic operator -foldrM :: Monad m => (a -> b -> m b) -> b -> Stream m a -> m b - --- | Right fold over a non-empty stream -foldr1 :: Monad m => (a -> a -> a) -> Stream m a -> m a - --- | Right fold over a non-empty stream with a monadic operator -foldr1M :: Monad m => (a -> a -> m a) -> Stream m a -> m a -and :: Monad m => Stream m Bool -> m Bool -or :: Monad m => Stream m Bool -> m Bool -concatMapM :: Monad m => (a -> m (Stream m b)) -> Stream m a -> Stream m b - --- | Unfold -unfoldr :: Monad m => (s -> Maybe (a, s)) -> s -> Stream m a - --- | Unfold with a monadic function -unfoldrM :: Monad m => (s -> m (Maybe (a, s))) -> s -> Stream m a - --- | Unfold at most n elements -unfoldrN :: Monad m => Int -> (s -> Maybe (a, s)) -> s -> Stream m a - --- | Unfold at most n elements with a monadic functions -unfoldrNM :: Monad m => Int -> (s -> m (Maybe (a, s))) -> s -> Stream m a - --- | Apply function n times to value. Zeroth element is original value. -iterateN :: Monad m => Int -> (a -> a) -> a -> Stream m a - --- | Apply monadic function n times to value. Zeroth element is original --- value. -iterateNM :: Monad m => Int -> (a -> m a) -> a -> Stream m a - --- | Prefix scan -prescanl :: Monad m => (a -> b -> a) -> a -> Stream m b -> Stream m a - --- | Prefix scan with a monadic operator -prescanlM :: Monad m => (a -> b -> m a) -> a -> Stream m b -> Stream m a - --- | Prefix scan with strict accumulator -prescanl' :: Monad m => (a -> b -> a) -> a -> Stream m b -> Stream m a - --- | Prefix scan with strict accumulator and a monadic operator -prescanlM' :: Monad m => (a -> b -> m a) -> a -> Stream m b -> Stream m a - --- | Suffix scan -postscanl :: Monad m => (a -> b -> a) -> a -> Stream m b -> Stream m a - --- | Suffix scan with a monadic operator -postscanlM :: Monad m => (a -> b -> m a) -> a -> Stream m b -> Stream m a - --- | Suffix scan with strict accumulator -postscanl' :: Monad m => (a -> b -> a) -> a -> Stream m b -> Stream m a - --- | Suffix scan with strict acccumulator and a monadic operator -postscanlM' :: Monad m => (a -> b -> m a) -> a -> Stream m b -> Stream m a - --- | Haskell-style scan -scanl :: Monad m => (a -> b -> a) -> a -> Stream m b -> Stream m a - --- | Haskell-style scan with a monadic operator -scanlM :: Monad m => (a -> b -> m a) -> a -> Stream m b -> Stream m a - --- | Haskell-style scan with strict accumulator -scanl' :: Monad m => (a -> b -> a) -> a -> Stream m b -> Stream m a - --- | Haskell-style scan with strict accumulator and a monadic operator -scanlM' :: Monad m => (a -> b -> m a) -> a -> Stream m b -> Stream m a - --- | Scan over a non-empty Stream -scanl1 :: Monad m => (a -> a -> a) -> Stream m a -> Stream m a - --- | Scan over a non-empty Stream with a monadic operator -scanl1M :: Monad m => (a -> a -> m a) -> Stream m a -> Stream m a - --- | Scan over a non-empty Stream with a strict accumulator -scanl1' :: Monad m => (a -> a -> a) -> Stream m a -> Stream m a - --- | Scan over a non-empty Stream with a strict accumulator and a --- monadic operator -scanl1M' :: Monad m => (a -> a -> m a) -> Stream m a -> Stream m a - --- | Yield a Stream of the given length containing the values --- x, x+y, x+y+y etc. -enumFromStepN :: (Num a, Monad m) => a -> a -> Int -> Stream m a - --- | Enumerate values --- --- WARNING: This operation can be very inefficient. If at all --- possible, use enumFromStepN instead. -enumFromTo :: (Enum a, Monad m) => a -> a -> Stream m a - --- | Enumerate values with a given step. --- --- WARNING: This operation is very inefficient. If at all --- possible, use enumFromStepN instead. -enumFromThenTo :: (Enum a, Monad m) => a -> a -> a -> Stream m a - --- | Convert a Stream to a list -toList :: Monad m => Stream m a -> m [a] - --- | Convert a list to a Stream -fromList :: Monad m => [a] -> Stream m a - --- | Convert the first n elements of a list to a Stream -fromListN :: Monad m => Int -> [a] -> Stream m a - --- | Convert a list to a Stream with the given Size hint. -unsafeFromList :: Monad m => Size -> [a] -> Stream m a -instance Monad m => Functor (Stream m) - - --- | Streams for stream fusion -module Data.Vector.Fusion.Stream - --- | Result of taking a single step in a stream -data Step s a - --- | a new element and a new seed -Yield :: a -> s -> Step s a - --- | just a new seed -Skip :: s -> Step s a - --- | end of stream -Done :: Step s a - --- | The type of pure streams -type Stream = Stream Id - --- | Alternative name for monadic streams -type MStream = Stream -inplace :: (forall m. Monad m => Stream m a -> Stream m b) -> Stream a -> Stream b - --- | Size hint of a Stream -size :: Stream a -> Size - --- | Attach a Size hint to a Stream -sized :: Stream a -> Size -> Stream a - --- | Length of a Stream -length :: Stream a -> Int - --- | Check if a Stream is empty -null :: Stream a -> Bool - --- | Empty Stream -empty :: Stream a - --- | Singleton Stream -singleton :: a -> Stream a - --- | Prepend an element -cons :: a -> Stream a -> Stream a - --- | Append an element -snoc :: Stream a -> a -> Stream a - --- | Replicate a value to a given length -replicate :: Int -> a -> Stream a - --- | Generate a stream from its indices -generate :: Int -> (Int -> a) -> Stream a - --- | Concatenate two Streams -(++) :: Stream a -> Stream a -> Stream a - --- | First element of the Stream or error if empty -head :: Stream a -> a - --- | Last element of the Stream or error if empty -last :: Stream a -> a - --- | Element at the given position -(!!) :: Stream a -> Int -> a - --- | Element at the given position or Nothing if out of bounds -(!?) :: Stream a -> Int -> Maybe a - --- | Extract a substream of the given length starting at the given --- position. -slice :: Int -> Int -> Stream a -> Stream a - --- | All but the last element -init :: Stream a -> Stream a - --- | All but the first element -tail :: Stream a -> Stream a - --- | The first n elements -take :: Int -> Stream a -> Stream a - --- | All but the first n elements -drop :: Int -> Stream a -> Stream a - --- | Map a function over a Stream -map :: (a -> b) -> Stream a -> Stream b -concatMap :: (a -> Stream b) -> Stream a -> Stream b - --- | Create a Stream of values from a Stream of streamable --- things -flatten :: (a -> s) -> (s -> Step s b) -> Size -> Stream a -> Stream b -unbox :: Stream (Box a) -> Stream a - --- | Pair each element in a Stream with its index -indexed :: Stream a -> Stream (Int, a) - --- | Pair each element in a Stream with its index, starting from the --- right and counting down -indexedR :: Int -> Stream a -> Stream (Int, a) - --- | Zip two Streams with the given function -zipWith :: (a -> b -> c) -> Stream a -> Stream b -> Stream c - --- | Zip three Streams with the given function -zipWith3 :: (a -> b -> c -> d) -> Stream a -> Stream b -> Stream c -> Stream d -zipWith4 :: (a -> b -> c -> d -> e) -> Stream a -> Stream b -> Stream c -> Stream d -> Stream e -zipWith5 :: (a -> b -> c -> d -> e -> f) -> Stream a -> Stream b -> Stream c -> Stream d -> Stream e -> Stream f -zipWith6 :: (a -> b -> c -> d -> e -> f -> g) -> Stream a -> Stream b -> Stream c -> Stream d -> Stream e -> Stream f -> Stream g -zip :: Stream a -> Stream b -> Stream (a, b) -zip3 :: Stream a -> Stream b -> Stream c -> Stream (a, b, c) -zip4 :: Stream a -> Stream b -> Stream c -> Stream d -> Stream (a, b, c, d) -zip5 :: Stream a -> Stream b -> Stream c -> Stream d -> Stream e -> Stream (a, b, c, d, e) -zip6 :: Stream a -> Stream b -> Stream c -> Stream d -> Stream e -> Stream f -> Stream (a, b, c, d, e, f) - --- | Drop elements which do not satisfy the predicate -filter :: (a -> Bool) -> Stream a -> Stream a - --- | Longest prefix of elements that satisfy the predicate -takeWhile :: (a -> Bool) -> Stream a -> Stream a - --- | Drop the longest prefix of elements that satisfy the predicate -dropWhile :: (a -> Bool) -> Stream a -> Stream a - --- | Check whether the Stream contains an element -elem :: Eq a => a -> Stream a -> Bool - --- | Inverse of elem -notElem :: Eq a => a -> Stream a -> Bool - --- | Yield Just the first element matching the predicate or --- Nothing if no such element exists. -find :: (a -> Bool) -> Stream a -> Maybe a - --- | Yield Just the index of the first element matching the --- predicate or Nothing if no such element exists. -findIndex :: (a -> Bool) -> Stream a -> Maybe Int - --- | Left fold -foldl :: (a -> b -> a) -> a -> Stream b -> a - --- | Left fold on non-empty Streams -foldl1 :: (a -> a -> a) -> Stream a -> a - --- | Left fold with strict accumulator -foldl' :: (a -> b -> a) -> a -> Stream b -> a - --- | Left fold on non-empty Streams with strict accumulator -foldl1' :: (a -> a -> a) -> Stream a -> a - --- | Right fold -foldr :: (a -> b -> b) -> b -> Stream a -> b - --- | Right fold on non-empty Streams -foldr1 :: (a -> a -> a) -> Stream a -> a -and :: Stream Bool -> Bool -or :: Stream Bool -> Bool - --- | Unfold -unfoldr :: (s -> Maybe (a, s)) -> s -> Stream a - --- | Unfold at most n elements -unfoldrN :: Int -> (s -> Maybe (a, s)) -> s -> Stream a - --- | Apply function n-1 times to value. Zeroth element is original value. -iterateN :: Int -> (a -> a) -> a -> Stream a - --- | Prefix scan -prescanl :: (a -> b -> a) -> a -> Stream b -> Stream a - --- | Prefix scan with strict accumulator -prescanl' :: (a -> b -> a) -> a -> Stream b -> Stream a - --- | Suffix scan -postscanl :: (a -> b -> a) -> a -> Stream b -> Stream a - --- | Suffix scan with strict accumulator -postscanl' :: (a -> b -> a) -> a -> Stream b -> Stream a - --- | Haskell-style scan -scanl :: (a -> b -> a) -> a -> Stream b -> Stream a - --- | Haskell-style scan with strict accumulator -scanl' :: (a -> b -> a) -> a -> Stream b -> Stream a - --- | Scan over a non-empty Stream -scanl1 :: (a -> a -> a) -> Stream a -> Stream a - --- | Scan over a non-empty Stream with a strict accumulator -scanl1' :: (a -> a -> a) -> Stream a -> Stream a - --- | Yield a Stream of the given length containing the values --- x, x+y, x+y+y etc. -enumFromStepN :: Num a => a -> a -> Int -> Stream a - --- | Enumerate values --- --- WARNING: This operations can be very inefficient. If at all --- possible, use enumFromStepN instead. -enumFromTo :: Enum a => a -> a -> Stream a - --- | Enumerate values with a given step. --- --- WARNING: This operations is very inefficient. If at all --- possible, use enumFromStepN instead. -enumFromThenTo :: Enum a => a -> a -> a -> Stream a - --- | Convert a Stream to a list -toList :: Stream a -> [a] - --- | Create a Stream from a list -fromList :: [a] -> Stream a - --- | Create a Stream from the first n elements of a list --- --- 
---   fromListN n xs = fromList (take n xs)
---
-fromListN :: Int -> [a] -> Stream a -unsafeFromList :: Size -> [a] -> Stream a - --- | Convert a pure stream to a monadic stream -liftStream :: Monad m => Stream a -> Stream m a - --- | Apply a monadic action to each element of the stream, producing a --- monadic stream of results -mapM :: Monad m => (a -> m b) -> Stream a -> Stream m b - --- | Apply a monadic action to each element of the stream -mapM_ :: Monad m => (a -> m b) -> Stream a -> m () -zipWithM :: Monad m => (a -> b -> m c) -> Stream a -> Stream b -> Stream m c -zipWithM_ :: Monad m => (a -> b -> m c) -> Stream a -> Stream b -> m () - --- | Yield a monadic stream of elements that satisfy the monadic predicate -filterM :: Monad m => (a -> m Bool) -> Stream a -> Stream m a - --- | Monadic fold -foldM :: Monad m => (a -> b -> m a) -> a -> Stream b -> m a - --- | Monadic fold over non-empty stream -fold1M :: Monad m => (a -> a -> m a) -> Stream a -> m a - --- | Monadic fold with strict accumulator -foldM' :: Monad m => (a -> b -> m a) -> a -> Stream b -> m a - --- | Monad fold over non-empty stream with strict accumulator -fold1M' :: Monad m => (a -> a -> m a) -> Stream a -> m a - --- | Check if two Streams are equal -eq :: Eq a => Stream a -> Stream a -> Bool - --- | Lexicographically compare two Streams -cmp :: Ord a => Stream a -> Stream a -> Ordering -instance Ord a => Ord (Stream Id a) -instance Eq a => Eq (Stream Id a) - - --- | Safe interface to Data.Vector.Fusion.Stream -module Data.Vector.Fusion.Stream.Safe - --- | Result of taking a single step in a stream -data Step s a - --- | a new element and a new seed -Yield :: a -> s -> Step s a - --- | just a new seed -Skip :: s -> Step s a - --- | end of stream -Done :: Step s a - --- | The type of pure streams -type Stream = Stream Id - --- | Alternative name for monadic streams -type MStream = Stream -inplace :: (forall m. Monad m => Stream m a -> Stream m b) -> Stream a -> Stream b - --- | Size hint of a Stream -size :: Stream a -> Size - --- | Attach a Size hint to a Stream -sized :: Stream a -> Size -> Stream a - --- | Length of a Stream -length :: Stream a -> Int - --- | Check if a Stream is empty -null :: Stream a -> Bool - --- | Empty Stream -empty :: Stream a - --- | Singleton Stream -singleton :: a -> Stream a - --- | Prepend an element -cons :: a -> Stream a -> Stream a - --- | Append an element -snoc :: Stream a -> a -> Stream a - --- | Replicate a value to a given length -replicate :: Int -> a -> Stream a - --- | Generate a stream from its indices -generate :: Int -> (Int -> a) -> Stream a - --- | Concatenate two Streams -(++) :: Stream a -> Stream a -> Stream a - --- | First element of the Stream or error if empty -head :: Stream a -> a - --- | Last element of the Stream or error if empty -last :: Stream a -> a - --- | Element at the given position -(!!) :: Stream a -> Int -> a - --- | Extract a substream of the given length starting at the given --- position. -slice :: Int -> Int -> Stream a -> Stream a - --- | All but the last element -init :: Stream a -> Stream a - --- | All but the first element -tail :: Stream a -> Stream a - --- | The first n elements -take :: Int -> Stream a -> Stream a - --- | All but the first n elements -drop :: Int -> Stream a -> Stream a - --- | Map a function over a Stream -map :: (a -> b) -> Stream a -> Stream b -concatMap :: (a -> Stream b) -> Stream a -> Stream b - --- | Create a Stream of values from a Stream of streamable --- things -flatten :: (a -> s) -> (s -> Step s b) -> Size -> Stream a -> Stream b -unbox :: Stream (Box a) -> Stream a - --- | Pair each element in a Stream with its index -indexed :: Stream a -> Stream (Int, a) - --- | Pair each element in a Stream with its index, starting from the --- right and counting down -indexedR :: Int -> Stream a -> Stream (Int, a) - --- | Zip two Streams with the given function -zipWith :: (a -> b -> c) -> Stream a -> Stream b -> Stream c - --- | Zip three Streams with the given function -zipWith3 :: (a -> b -> c -> d) -> Stream a -> Stream b -> Stream c -> Stream d -zipWith4 :: (a -> b -> c -> d -> e) -> Stream a -> Stream b -> Stream c -> Stream d -> Stream e -zipWith5 :: (a -> b -> c -> d -> e -> f) -> Stream a -> Stream b -> Stream c -> Stream d -> Stream e -> Stream f -zipWith6 :: (a -> b -> c -> d -> e -> f -> g) -> Stream a -> Stream b -> Stream c -> Stream d -> Stream e -> Stream f -> Stream g -zip :: Stream a -> Stream b -> Stream (a, b) -zip3 :: Stream a -> Stream b -> Stream c -> Stream (a, b, c) -zip4 :: Stream a -> Stream b -> Stream c -> Stream d -> Stream (a, b, c, d) -zip5 :: Stream a -> Stream b -> Stream c -> Stream d -> Stream e -> Stream (a, b, c, d, e) -zip6 :: Stream a -> Stream b -> Stream c -> Stream d -> Stream e -> Stream f -> Stream (a, b, c, d, e, f) - --- | Drop elements which do not satisfy the predicate -filter :: (a -> Bool) -> Stream a -> Stream a - --- | Longest prefix of elements that satisfy the predicate -takeWhile :: (a -> Bool) -> Stream a -> Stream a - --- | Drop the longest prefix of elements that satisfy the predicate -dropWhile :: (a -> Bool) -> Stream a -> Stream a - --- | Check whether the Stream contains an element -elem :: Eq a => a -> Stream a -> Bool - --- | Inverse of elem -notElem :: Eq a => a -> Stream a -> Bool - --- | Yield Just the first element matching the predicate or --- Nothing if no such element exists. -find :: (a -> Bool) -> Stream a -> Maybe a - --- | Yield Just the index of the first element matching the --- predicate or Nothing if no such element exists. -findIndex :: (a -> Bool) -> Stream a -> Maybe Int - --- | Left fold -foldl :: (a -> b -> a) -> a -> Stream b -> a - --- | Left fold on non-empty Streams -foldl1 :: (a -> a -> a) -> Stream a -> a - --- | Left fold with strict accumulator -foldl' :: (a -> b -> a) -> a -> Stream b -> a - --- | Left fold on non-empty Streams with strict accumulator -foldl1' :: (a -> a -> a) -> Stream a -> a - --- | Right fold -foldr :: (a -> b -> b) -> b -> Stream a -> b - --- | Right fold on non-empty Streams -foldr1 :: (a -> a -> a) -> Stream a -> a -and :: Stream Bool -> Bool -or :: Stream Bool -> Bool - --- | Unfold -unfoldr :: (s -> Maybe (a, s)) -> s -> Stream a - --- | Unfold at most n elements -unfoldrN :: Int -> (s -> Maybe (a, s)) -> s -> Stream a - --- | Apply function n-1 times to value. Zeroth element is original value. -iterateN :: Int -> (a -> a) -> a -> Stream a - --- | Prefix scan -prescanl :: (a -> b -> a) -> a -> Stream b -> Stream a - --- | Prefix scan with strict accumulator -prescanl' :: (a -> b -> a) -> a -> Stream b -> Stream a - --- | Suffix scan -postscanl :: (a -> b -> a) -> a -> Stream b -> Stream a - --- | Suffix scan with strict accumulator -postscanl' :: (a -> b -> a) -> a -> Stream b -> Stream a - --- | Haskell-style scan -scanl :: (a -> b -> a) -> a -> Stream b -> Stream a - --- | Haskell-style scan with strict accumulator -scanl' :: (a -> b -> a) -> a -> Stream b -> Stream a - --- | Scan over a non-empty Stream -scanl1 :: (a -> a -> a) -> Stream a -> Stream a - --- | Scan over a non-empty Stream with a strict accumulator -scanl1' :: (a -> a -> a) -> Stream a -> Stream a - --- | Yield a Stream of the given length containing the values --- x, x+y, x+y+y etc. -enumFromStepN :: Num a => a -> a -> Int -> Stream a - --- | Enumerate values --- --- WARNING: This operations can be very inefficient. If at all --- possible, use enumFromStepN instead. -enumFromTo :: Enum a => a -> a -> Stream a - --- | Enumerate values with a given step. --- --- WARNING: This operations is very inefficient. If at all --- possible, use enumFromStepN instead. -enumFromThenTo :: Enum a => a -> a -> a -> Stream a - --- | Convert a Stream to a list -toList :: Stream a -> [a] - --- | Create a Stream from a list -fromList :: [a] -> Stream a - --- | Create a Stream from the first n elements of a list --- --- 
---   fromListN n xs = fromList (take n xs)
---
-fromListN :: Int -> [a] -> Stream a - --- | Convert a pure stream to a monadic stream -liftStream :: Monad m => Stream a -> Stream m a - --- | Apply a monadic action to each element of the stream, producing a --- monadic stream of results -mapM :: Monad m => (a -> m b) -> Stream a -> Stream m b - --- | Apply a monadic action to each element of the stream -mapM_ :: Monad m => (a -> m b) -> Stream a -> m () -zipWithM :: Monad m => (a -> b -> m c) -> Stream a -> Stream b -> Stream m c -zipWithM_ :: Monad m => (a -> b -> m c) -> Stream a -> Stream b -> m () - --- | Yield a monadic stream of elements that satisfy the monadic predicate -filterM :: Monad m => (a -> m Bool) -> Stream a -> Stream m a - --- | Monadic fold -foldM :: Monad m => (a -> b -> m a) -> a -> Stream b -> m a - --- | Monadic fold over non-empty stream -fold1M :: Monad m => (a -> a -> m a) -> Stream a -> m a - --- | Monadic fold with strict accumulator -foldM' :: Monad m => (a -> b -> m a) -> a -> Stream b -> m a - --- | Monad fold over non-empty stream with strict accumulator -fold1M' :: Monad m => (a -> a -> m a) -> Stream a -> m a - --- | Check if two Streams are equal -eq :: Eq a => Stream a -> Stream a -> Bool - --- | Lexicographically compare two Streams -cmp :: Ord a => Stream a -> Stream a -> Ordering - - --- | Safe interface to Data.Vector.Fusion.Stream.Monadic -module Data.Vector.Fusion.Stream.Monadic.Safe - --- | Monadic streams -data Stream m a -Stream :: (s -> m (Step s a)) -> s -> Size -> Stream m a - --- | Result of taking a single step in a stream -data Step s a - --- | a new element and a new seed -Yield :: a -> s -> Step s a - --- | just a new seed -Skip :: s -> Step s a - --- | end of stream -Done :: Step s a - --- | Size hint of a Stream -size :: Stream m a -> Size - --- | Attach a Size hint to a Stream -sized :: Stream m a -> Size -> Stream m a - --- | Length of a Stream -length :: Monad m => Stream m a -> m Int - --- | Check if a Stream is empty -null :: Monad m => Stream m a -> m Bool - --- | Empty Stream -empty :: Monad m => Stream m a - --- | Singleton Stream -singleton :: Monad m => a -> Stream m a - --- | Prepend an element -cons :: Monad m => a -> Stream m a -> Stream m a - --- | Append an element -snoc :: Monad m => Stream m a -> a -> Stream m a - --- | Replicate a value to a given length -replicate :: Monad m => Int -> a -> Stream m a - --- | Yield a Stream of values obtained by performing the monadic --- action the given number of times -replicateM :: Monad m => Int -> m a -> Stream m a -generate :: Monad m => Int -> (Int -> a) -> Stream m a - --- | Generate a stream from its indices -generateM :: Monad m => Int -> (Int -> m a) -> Stream m a - --- | Concatenate two Streams -(++) :: Monad m => Stream m a -> Stream m a -> Stream m a - --- | First element of the Stream or error if empty -head :: Monad m => Stream m a -> m a - --- | Last element of the Stream or error if empty -last :: Monad m => Stream m a -> m a - --- | Element at the given position -(!!) :: Monad m => Stream m a -> Int -> m a - --- | Extract a substream of the given length starting at the given --- position. -slice :: Monad m => Int -> Int -> Stream m a -> Stream m a - --- | All but the last element -init :: Monad m => Stream m a -> Stream m a - --- | All but the first element -tail :: Monad m => Stream m a -> Stream m a - --- | The first n elements -take :: Monad m => Int -> Stream m a -> Stream m a - --- | All but the first n elements -drop :: Monad m => Int -> Stream m a -> Stream m a - --- | Map a function over a Stream -map :: Monad m => (a -> b) -> Stream m a -> Stream m b - --- | Map a monadic function over a Stream -mapM :: Monad m => (a -> m b) -> Stream m a -> Stream m b - --- | Execute a monadic action for each element of the Stream -mapM_ :: Monad m => (a -> m b) -> Stream m a -> m () - --- | Transform a Stream to use a different monad -trans :: (Monad m, Monad m') => (forall a. m a -> m' a) -> Stream m a -> Stream m' a -unbox :: Monad m => Stream m (Box a) -> Stream m a -concatMap :: Monad m => (a -> Stream m b) -> Stream m a -> Stream m b - --- | Create a Stream of values from a Stream of streamable --- things -flatten :: Monad m => (a -> m s) -> (s -> m (Step s b)) -> Size -> Stream m a -> Stream m b - --- | Pair each element in a Stream with its index -indexed :: Monad m => Stream m a -> Stream m (Int, a) - --- | Pair each element in a Stream with its index, starting from the --- right and counting down -indexedR :: Monad m => Int -> Stream m a -> Stream m (Int, a) -zipWithM_ :: Monad m => (a -> b -> m c) -> Stream m a -> Stream m b -> m () - --- | Zip two Streams with the given monadic function -zipWithM :: Monad m => (a -> b -> m c) -> Stream m a -> Stream m b -> Stream m c -zipWith3M :: Monad m => (a -> b -> c -> m d) -> Stream m a -> Stream m b -> Stream m c -> Stream m d -zipWith4M :: Monad m => (a -> b -> c -> d -> m e) -> Stream m a -> Stream m b -> Stream m c -> Stream m d -> Stream m e -zipWith5M :: Monad m => (a -> b -> c -> d -> e -> m f) -> Stream m a -> Stream m b -> Stream m c -> Stream m d -> Stream m e -> Stream m f -zipWith6M :: Monad m => (a -> b -> c -> d -> e -> f -> m g) -> Stream m a -> Stream m b -> Stream m c -> Stream m d -> Stream m e -> Stream m f -> Stream m g -zipWith :: Monad m => (a -> b -> c) -> Stream m a -> Stream m b -> Stream m c -zipWith3 :: Monad m => (a -> b -> c -> d) -> Stream m a -> Stream m b -> Stream m c -> Stream m d -zipWith4 :: Monad m => (a -> b -> c -> d -> e) -> Stream m a -> Stream m b -> Stream m c -> Stream m d -> Stream m e -zipWith5 :: Monad m => (a -> b -> c -> d -> e -> f) -> Stream m a -> Stream m b -> Stream m c -> Stream m d -> Stream m e -> Stream m f -zipWith6 :: Monad m => (a -> b -> c -> d -> e -> f -> g) -> Stream m a -> Stream m b -> Stream m c -> Stream m d -> Stream m e -> Stream m f -> Stream m g -zip :: Monad m => Stream m a -> Stream m b -> Stream m (a, b) -zip3 :: Monad m => Stream m a -> Stream m b -> Stream m c -> Stream m (a, b, c) -zip4 :: Monad m => Stream m a -> Stream m b -> Stream m c -> Stream m d -> Stream m (a, b, c, d) -zip5 :: Monad m => Stream m a -> Stream m b -> Stream m c -> Stream m d -> Stream m e -> Stream m (a, b, c, d, e) -zip6 :: Monad m => Stream m a -> Stream m b -> Stream m c -> Stream m d -> Stream m e -> Stream m f -> Stream m (a, b, c, d, e, f) - --- | Drop elements which do not satisfy the predicate -filter :: Monad m => (a -> Bool) -> Stream m a -> Stream m a - --- | Drop elements which do not satisfy the monadic predicate -filterM :: Monad m => (a -> m Bool) -> Stream m a -> Stream m a - --- | Longest prefix of elements that satisfy the predicate -takeWhile :: Monad m => (a -> Bool) -> Stream m a -> Stream m a - --- | Longest prefix of elements that satisfy the monadic predicate -takeWhileM :: Monad m => (a -> m Bool) -> Stream m a -> Stream m a - --- | Drop the longest prefix of elements that satisfy the predicate -dropWhile :: Monad m => (a -> Bool) -> Stream m a -> Stream m a - --- | Drop the longest prefix of elements that satisfy the monadic predicate -dropWhileM :: Monad m => (a -> m Bool) -> Stream m a -> Stream m a - --- | Check whether the Stream contains an element -elem :: (Monad m, Eq a) => a -> Stream m a -> m Bool - --- | Inverse of elem -notElem :: (Monad m, Eq a) => a -> Stream m a -> m Bool - --- | Yield Just the first element that satisfies the predicate or --- Nothing if no such element exists. -find :: Monad m => (a -> Bool) -> Stream m a -> m (Maybe a) - --- | Yield Just the first element that satisfies the monadic --- predicate or Nothing if no such element exists. -findM :: Monad m => (a -> m Bool) -> Stream m a -> m (Maybe a) - --- | Yield Just the index of the first element that satisfies the --- predicate or Nothing if no such element exists. -findIndex :: Monad m => (a -> Bool) -> Stream m a -> m (Maybe Int) - --- | Yield Just the index of the first element that satisfies the --- monadic predicate or Nothing if no such element exists. -findIndexM :: Monad m => (a -> m Bool) -> Stream m a -> m (Maybe Int) - --- | Left fold -foldl :: Monad m => (a -> b -> a) -> a -> Stream m b -> m a - --- | Left fold with a monadic operator -foldlM :: Monad m => (a -> b -> m a) -> a -> Stream m b -> m a - --- | Left fold over a non-empty Stream -foldl1 :: Monad m => (a -> a -> a) -> Stream m a -> m a - --- | Left fold over a non-empty Stream with a monadic operator -foldl1M :: Monad m => (a -> a -> m a) -> Stream m a -> m a - --- | Same as foldlM -foldM :: Monad m => (a -> b -> m a) -> a -> Stream m b -> m a - --- | Same as foldl1M -fold1M :: Monad m => (a -> a -> m a) -> Stream m a -> m a - --- | Left fold with a strict accumulator -foldl' :: Monad m => (a -> b -> a) -> a -> Stream m b -> m a - --- | Left fold with a strict accumulator and a monadic operator -foldlM' :: Monad m => (a -> b -> m a) -> a -> Stream m b -> m a - --- | Left fold over a non-empty Stream with a strict accumulator -foldl1' :: Monad m => (a -> a -> a) -> Stream m a -> m a - --- | Left fold over a non-empty Stream with a strict accumulator and --- a monadic operator -foldl1M' :: Monad m => (a -> a -> m a) -> Stream m a -> m a - --- | Same as foldlM' -foldM' :: Monad m => (a -> b -> m a) -> a -> Stream m b -> m a - --- | Same as foldl1M' -fold1M' :: Monad m => (a -> a -> m a) -> Stream m a -> m a - --- | Right fold -foldr :: Monad m => (a -> b -> b) -> b -> Stream m a -> m b - --- | Right fold with a monadic operator -foldrM :: Monad m => (a -> b -> m b) -> b -> Stream m a -> m b - --- | Right fold over a non-empty stream -foldr1 :: Monad m => (a -> a -> a) -> Stream m a -> m a - --- | Right fold over a non-empty stream with a monadic operator -foldr1M :: Monad m => (a -> a -> m a) -> Stream m a -> m a -and :: Monad m => Stream m Bool -> m Bool -or :: Monad m => Stream m Bool -> m Bool -concatMapM :: Monad m => (a -> m (Stream m b)) -> Stream m a -> Stream m b - --- | Unfold -unfoldr :: Monad m => (s -> Maybe (a, s)) -> s -> Stream m a - --- | Unfold with a monadic function -unfoldrM :: Monad m => (s -> m (Maybe (a, s))) -> s -> Stream m a - --- | Unfold at most n elements -unfoldrN :: Monad m => Int -> (s -> Maybe (a, s)) -> s -> Stream m a - --- | Unfold at most n elements with a monadic functions -unfoldrNM :: Monad m => Int -> (s -> m (Maybe (a, s))) -> s -> Stream m a - --- | Apply function n times to value. Zeroth element is original value. -iterateN :: Monad m => Int -> (a -> a) -> a -> Stream m a - --- | Apply monadic function n times to value. Zeroth element is original --- value. -iterateNM :: Monad m => Int -> (a -> m a) -> a -> Stream m a - --- | Prefix scan -prescanl :: Monad m => (a -> b -> a) -> a -> Stream m b -> Stream m a - --- | Prefix scan with a monadic operator -prescanlM :: Monad m => (a -> b -> m a) -> a -> Stream m b -> Stream m a - --- | Prefix scan with strict accumulator -prescanl' :: Monad m => (a -> b -> a) -> a -> Stream m b -> Stream m a - --- | Prefix scan with strict accumulator and a monadic operator -prescanlM' :: Monad m => (a -> b -> m a) -> a -> Stream m b -> Stream m a - --- | Suffix scan -postscanl :: Monad m => (a -> b -> a) -> a -> Stream m b -> Stream m a - --- | Suffix scan with a monadic operator -postscanlM :: Monad m => (a -> b -> m a) -> a -> Stream m b -> Stream m a - --- | Suffix scan with strict accumulator -postscanl' :: Monad m => (a -> b -> a) -> a -> Stream m b -> Stream m a - --- | Suffix scan with strict acccumulator and a monadic operator -postscanlM' :: Monad m => (a -> b -> m a) -> a -> Stream m b -> Stream m a - --- | Haskell-style scan -scanl :: Monad m => (a -> b -> a) -> a -> Stream m b -> Stream m a - --- | Haskell-style scan with a monadic operator -scanlM :: Monad m => (a -> b -> m a) -> a -> Stream m b -> Stream m a - --- | Haskell-style scan with strict accumulator -scanl' :: Monad m => (a -> b -> a) -> a -> Stream m b -> Stream m a - --- | Haskell-style scan with strict accumulator and a monadic operator -scanlM' :: Monad m => (a -> b -> m a) -> a -> Stream m b -> Stream m a - --- | Scan over a non-empty Stream -scanl1 :: Monad m => (a -> a -> a) -> Stream m a -> Stream m a - --- | Scan over a non-empty Stream with a monadic operator -scanl1M :: Monad m => (a -> a -> m a) -> Stream m a -> Stream m a - --- | Scan over a non-empty Stream with a strict accumulator -scanl1' :: Monad m => (a -> a -> a) -> Stream m a -> Stream m a - --- | Scan over a non-empty Stream with a strict accumulator and a --- monadic operator -scanl1M' :: Monad m => (a -> a -> m a) -> Stream m a -> Stream m a - --- | Yield a Stream of the given length containing the values --- x, x+y, x+y+y etc. -enumFromStepN :: (Num a, Monad m) => a -> a -> Int -> Stream m a - --- | Enumerate values --- --- WARNING: This operation can be very inefficient. If at all --- possible, use enumFromStepN instead. -enumFromTo :: (Enum a, Monad m) => a -> a -> Stream m a - --- | Enumerate values with a given step. --- --- WARNING: This operation is very inefficient. If at all --- possible, use enumFromStepN instead. -enumFromThenTo :: (Enum a, Monad m) => a -> a -> a -> Stream m a - --- | Convert a Stream to a list -toList :: Monad m => Stream m a -> m [a] - --- | Convert a list to a Stream -fromList :: Monad m => [a] -> Stream m a - --- | Convert the first n elements of a list to a Stream -fromListN :: Monad m => Int -> [a] -> Stream m a - - --- | Generic interface to mutable vectors -module Data.Vector.Generic.Mutable - --- | Class of mutable vectors parametrised with a primitive state token. -class MVector v a -basicLength :: MVector v a => v s a -> Int -basicUnsafeSlice :: MVector v a => Int -> Int -> v s a -> v s a -basicOverlaps :: MVector v a => v s a -> v s a -> Bool -basicUnsafeNew :: (MVector v a, PrimMonad m) => Int -> m (v (PrimState m) a) -basicUnsafeReplicate :: (MVector v a, PrimMonad m) => Int -> a -> m (v (PrimState m) a) -basicUnsafeRead :: (MVector v a, PrimMonad m) => v (PrimState m) a -> Int -> m a -basicUnsafeWrite :: (MVector v a, PrimMonad m) => v (PrimState m) a -> Int -> a -> m () -basicClear :: (MVector v a, PrimMonad m) => v (PrimState m) a -> m () -basicSet :: (MVector v a, PrimMonad m) => v (PrimState m) a -> a -> m () -basicUnsafeCopy :: (MVector v a, PrimMonad m) => v (PrimState m) a -> v (PrimState m) a -> m () -basicUnsafeMove :: (MVector v a, PrimMonad m) => v (PrimState m) a -> v (PrimState m) a -> m () -basicUnsafeGrow :: (MVector v a, PrimMonad m) => v (PrimState m) a -> Int -> m (v (PrimState m) a) - --- | Length of the mutable vector. -length :: MVector v a => v s a -> Int - --- | Check whether the vector is empty -null :: MVector v a => v s a -> Bool - --- | Yield a part of the mutable vector without copying it. -slice :: MVector v a => Int -> Int -> v s a -> v s a -init :: MVector v a => v s a -> v s a -tail :: MVector v a => v s a -> v s a -take :: MVector v a => Int -> v s a -> v s a -drop :: MVector v a => Int -> v s a -> v s a -splitAt :: MVector v a => Int -> v s a -> (v s a, v s a) - --- | Yield a part of the mutable vector without copying it. No bounds --- checks are performed. -unsafeSlice :: MVector v a => Int -> Int -> v s a -> v s a -unsafeInit :: MVector v a => v s a -> v s a -unsafeTail :: MVector v a => v s a -> v s a -unsafeTake :: MVector v a => Int -> v s a -> v s a -unsafeDrop :: MVector v a => Int -> v s a -> v s a -overlaps :: MVector v a => v s a -> v s a -> Bool - --- | Create a mutable vector of the given length. -new :: (PrimMonad m, MVector v a) => Int -> m (v (PrimState m) a) - --- | Create a mutable vector of the given length. The length is not --- checked. -unsafeNew :: (PrimMonad m, MVector v a) => Int -> m (v (PrimState m) a) - --- | Create a mutable vector of the given length (0 if the length is --- negative) and fill it with an initial value. -replicate :: (PrimMonad m, MVector v a) => Int -> a -> m (v (PrimState m) a) - --- | Create a mutable vector of the given length (0 if the length is --- negative) and fill it with values produced by repeatedly executing the --- monadic action. -replicateM :: (PrimMonad m, MVector v a) => Int -> m a -> m (v (PrimState m) a) - --- | Create a copy of a mutable vector. -clone :: (PrimMonad m, MVector v a) => v (PrimState m) a -> m (v (PrimState m) a) - --- | Grow a vector by the given number of elements. The number must be --- positive. -grow :: (PrimMonad m, MVector v a) => v (PrimState m) a -> Int -> m (v (PrimState m) a) - --- | Grow a vector by the given number of elements. The number must be --- positive but this is not checked. -unsafeGrow :: (PrimMonad m, MVector v a) => v (PrimState m) a -> Int -> m (v (PrimState m) a) - --- | Reset all elements of the vector to some undefined value, clearing all --- references to external objects. This is usually a noop for unboxed --- vectors. -clear :: (PrimMonad m, MVector v a) => v (PrimState m) a -> m () - --- | Yield the element at the given position. -read :: (PrimMonad m, MVector v a) => v (PrimState m) a -> Int -> m a - --- | Replace the element at the given position. -write :: (PrimMonad m, MVector v a) => v (PrimState m) a -> Int -> a -> m () - --- | Swap the elements at the given positions. -swap :: (PrimMonad m, MVector v a) => v (PrimState m) a -> Int -> Int -> m () - --- | Yield the element at the given position. No bounds checks are --- performed. -unsafeRead :: (PrimMonad m, MVector v a) => v (PrimState m) a -> Int -> m a - --- | Replace the element at the given position. No bounds checks are --- performed. -unsafeWrite :: (PrimMonad m, MVector v a) => v (PrimState m) a -> Int -> a -> m () - --- | Swap the elements at the given positions. No bounds checks are --- performed. -unsafeSwap :: (PrimMonad m, MVector v a) => v (PrimState m) a -> Int -> Int -> m () - --- | Set all elements of the vector to the given value. -set :: (PrimMonad m, MVector v a) => v (PrimState m) a -> a -> m () - --- | Copy a vector. The two vectors must have the same length and may not --- overlap. -copy :: (PrimMonad m, MVector v a) => v (PrimState m) a -> v (PrimState m) a -> m () - --- | Move the contents of a vector. The two vectors must have the same --- length. --- --- If the vectors do not overlap, then this is equivalent to copy. --- Otherwise, the copying is performed as if the source vector were --- copied to a temporary vector and then the temporary vector was copied --- to the target vector. -move :: (PrimMonad m, MVector v a) => v (PrimState m) a -> v (PrimState m) a -> m () - --- | Copy a vector. The two vectors must have the same length and may not --- overlap. This is not checked. -unsafeCopy :: (PrimMonad m, MVector v a) => v (PrimState m) a -> v (PrimState m) a -> m () - --- | Move the contents of a vector. The two vectors must have the same --- length, but this is not checked. --- --- If the vectors do not overlap, then this is equivalent to --- unsafeCopy. Otherwise, the copying is performed as if the --- source vector were copied to a temporary vector and then the temporary --- vector was copied to the target vector. -unsafeMove :: (PrimMonad m, MVector v a) => v (PrimState m) a -> v (PrimState m) a -> m () -mstream :: (PrimMonad m, MVector v a) => v (PrimState m) a -> MStream m a -mstreamR :: (PrimMonad m, MVector v a) => v (PrimState m) a -> MStream m a - --- | Create a new mutable vector and fill it with elements from the --- Stream. The vector will grow exponentially if the maximum size --- of the Stream is unknown. -unstream :: (PrimMonad m, MVector v a) => Stream a -> m (v (PrimState m) a) - --- | Create a new mutable vector and fill it with elements from the --- Stream from right to left. The vector will grow exponentially --- if the maximum size of the Stream is unknown. -unstreamR :: (PrimMonad m, MVector v a) => Stream a -> m (v (PrimState m) a) - --- | Create a new mutable vector and fill it with elements from the monadic --- stream. The vector will grow exponentially if the maximum size of the --- stream is unknown. -munstream :: (PrimMonad m, MVector v a) => MStream m a -> m (v (PrimState m) a) - --- | Create a new mutable vector and fill it with elements from the monadic --- stream from right to left. The vector will grow exponentially if the --- maximum size of the stream is unknown. -munstreamR :: (PrimMonad m, MVector v a) => MStream m a -> m (v (PrimState m) a) -transform :: (PrimMonad m, MVector v a) => (MStream m a -> MStream m a) -> v (PrimState m) a -> m (v (PrimState m) a) -transformR :: (PrimMonad m, MVector v a) => (MStream m a -> MStream m a) -> v (PrimState m) a -> m (v (PrimState m) a) -fill :: (PrimMonad m, MVector v a) => v (PrimState m) a -> MStream m a -> m (v (PrimState m) a) -fillR :: (PrimMonad m, MVector v a) => v (PrimState m) a -> MStream m a -> m (v (PrimState m) a) -unsafeAccum :: (PrimMonad m, MVector v a) => (a -> b -> a) -> v (PrimState m) a -> Stream (Int, b) -> m () -accum :: (PrimMonad m, MVector v a) => (a -> b -> a) -> v (PrimState m) a -> Stream (Int, b) -> m () -unsafeUpdate :: (PrimMonad m, MVector v a) => v (PrimState m) a -> Stream (Int, a) -> m () -update :: (PrimMonad m, MVector v a) => v (PrimState m) a -> Stream (Int, a) -> m () -reverse :: (PrimMonad m, MVector v a) => v (PrimState m) a -> m () -unstablePartition :: (PrimMonad m, MVector v a) => (a -> Bool) -> v (PrimState m) a -> m Int -unstablePartitionStream :: (PrimMonad m, MVector v a) => (a -> Bool) -> Stream a -> m (v (PrimState m) a, v (PrimState m) a) -partitionStream :: (PrimMonad m, MVector v a) => (a -> Bool) -> Stream a -> m (v (PrimState m) a, v (PrimState m) a) - - --- | Safe interface to Data.Vector.Generic.Mutable -module Data.Vector.Generic.Mutable.Safe - --- | Class of mutable vectors parametrised with a primitive state token. -class MVector v a - --- | Length of the mutable vector. -length :: MVector v a => v s a -> Int - --- | Check whether the vector is empty -null :: MVector v a => v s a -> Bool - --- | Yield a part of the mutable vector without copying it. -slice :: MVector v a => Int -> Int -> v s a -> v s a -init :: MVector v a => v s a -> v s a -tail :: MVector v a => v s a -> v s a -take :: MVector v a => Int -> v s a -> v s a -drop :: MVector v a => Int -> v s a -> v s a -splitAt :: MVector v a => Int -> v s a -> (v s a, v s a) -overlaps :: MVector v a => v s a -> v s a -> Bool - --- | Create a mutable vector of the given length. -new :: (PrimMonad m, MVector v a) => Int -> m (v (PrimState m) a) - --- | Create a mutable vector of the given length (0 if the length is --- negative) and fill it with an initial value. -replicate :: (PrimMonad m, MVector v a) => Int -> a -> m (v (PrimState m) a) - --- | Create a mutable vector of the given length (0 if the length is --- negative) and fill it with values produced by repeatedly executing the --- monadic action. -replicateM :: (PrimMonad m, MVector v a) => Int -> m a -> m (v (PrimState m) a) - --- | Create a copy of a mutable vector. -clone :: (PrimMonad m, MVector v a) => v (PrimState m) a -> m (v (PrimState m) a) - --- | Grow a vector by the given number of elements. The number must be --- positive. -grow :: (PrimMonad m, MVector v a) => v (PrimState m) a -> Int -> m (v (PrimState m) a) - --- | Reset all elements of the vector to some undefined value, clearing all --- references to external objects. This is usually a noop for unboxed --- vectors. -clear :: (PrimMonad m, MVector v a) => v (PrimState m) a -> m () - --- | Yield the element at the given position. -read :: (PrimMonad m, MVector v a) => v (PrimState m) a -> Int -> m a - --- | Replace the element at the given position. -write :: (PrimMonad m, MVector v a) => v (PrimState m) a -> Int -> a -> m () - --- | Swap the elements at the given positions. -swap :: (PrimMonad m, MVector v a) => v (PrimState m) a -> Int -> Int -> m () - --- | Set all elements of the vector to the given value. -set :: (PrimMonad m, MVector v a) => v (PrimState m) a -> a -> m () - --- | Copy a vector. The two vectors must have the same length and may not --- overlap. -copy :: (PrimMonad m, MVector v a) => v (PrimState m) a -> v (PrimState m) a -> m () - --- | Move the contents of a vector. The two vectors must have the same --- length. --- --- If the vectors do not overlap, then this is equivalent to copy. --- Otherwise, the copying is performed as if the source vector were --- copied to a temporary vector and then the temporary vector was copied --- to the target vector. -move :: (PrimMonad m, MVector v a) => v (PrimState m) a -> v (PrimState m) a -> m () - --- | Create a new mutable vector and fill it with elements from the --- Stream. The vector will grow exponentially if the maximum size --- of the Stream is unknown. -unstream :: (PrimMonad m, MVector v a) => Stream a -> m (v (PrimState m) a) - --- | Create a new mutable vector and fill it with elements from the --- Stream from right to left. The vector will grow exponentially --- if the maximum size of the Stream is unknown. -unstreamR :: (PrimMonad m, MVector v a) => Stream a -> m (v (PrimState m) a) - --- | Create a new mutable vector and fill it with elements from the monadic --- stream. The vector will grow exponentially if the maximum size of the --- stream is unknown. -munstream :: (PrimMonad m, MVector v a) => MStream m a -> m (v (PrimState m) a) - --- | Create a new mutable vector and fill it with elements from the monadic --- stream from right to left. The vector will grow exponentially if the --- maximum size of the stream is unknown. -munstreamR :: (PrimMonad m, MVector v a) => MStream m a -> m (v (PrimState m) a) -transform :: (PrimMonad m, MVector v a) => (MStream m a -> MStream m a) -> v (PrimState m) a -> m (v (PrimState m) a) -transformR :: (PrimMonad m, MVector v a) => (MStream m a -> MStream m a) -> v (PrimState m) a -> m (v (PrimState m) a) -fill :: (PrimMonad m, MVector v a) => v (PrimState m) a -> MStream m a -> m (v (PrimState m) a) -fillR :: (PrimMonad m, MVector v a) => v (PrimState m) a -> MStream m a -> m (v (PrimState m) a) -accum :: (PrimMonad m, MVector v a) => (a -> b -> a) -> v (PrimState m) a -> Stream (Int, b) -> m () -update :: (PrimMonad m, MVector v a) => v (PrimState m) a -> Stream (Int, a) -> m () -reverse :: (PrimMonad m, MVector v a) => v (PrimState m) a -> m () -unstablePartition :: (PrimMonad m, MVector v a) => (a -> Bool) -> v (PrimState m) a -> m Int -unstablePartitionStream :: (PrimMonad m, MVector v a) => (a -> Bool) -> Stream a -> m (v (PrimState m) a, v (PrimState m) a) -partitionStream :: (PrimMonad m, MVector v a) => (a -> Bool) -> Stream a -> m (v (PrimState m) a, v (PrimState m) a) - - --- | Purely functional interface to initialisation of mutable vectors -module Data.Vector.Generic.New -data New v a -New :: (forall s. ST s (Mutable v s a)) -> New v a -create :: (forall s. ST s (Mutable v s a)) -> New v a -run :: New v a -> ST s (Mutable v s a) -runPrim :: PrimMonad m => New v a -> m (Mutable v (PrimState m) a) -apply :: (forall s. Mutable v s a -> Mutable v s a) -> New v a -> New v a -modify :: (forall s. Mutable v s a -> ST s ()) -> New v a -> New v a -modifyWithStream :: (forall s. Mutable v s a -> Stream b -> ST s ()) -> New v a -> Stream b -> New v a -unstream :: Vector v a => Stream a -> New v a -transform :: Vector v a => (forall m. Monad m => MStream m a -> MStream m a) -> New v a -> New v a -unstreamR :: Vector v a => Stream a -> New v a -transformR :: Vector v a => (forall m. Monad m => MStream m a -> MStream m a) -> New v a -> New v a -slice :: Vector v a => Int -> Int -> New v a -> New v a -init :: Vector v a => New v a -> New v a -tail :: Vector v a => New v a -> New v a -take :: Vector v a => Int -> New v a -> New v a -drop :: Vector v a => Int -> New v a -> New v a -unsafeSlice :: Vector v a => Int -> Int -> New v a -> New v a -unsafeInit :: Vector v a => New v a -> New v a -unsafeTail :: Vector v a => New v a -> New v a - - --- | Generic interface to pure vectors. -module Data.Vector.Generic - --- | Class of immutable vectors. Every immutable vector is associated with --- its mutable version through the Mutable type family. Methods of --- this class should not be used directly. Instead, --- Data.Vector.Generic and other Data.Vector modules provide safe --- and fusible wrappers. --- --- Minimum complete implementation: --- --- -class MVector (Mutable v) a => Vector v a -basicUnsafeFreeze :: (Vector v a, PrimMonad m) => Mutable v (PrimState m) a -> m (v a) -basicUnsafeThaw :: (Vector v a, PrimMonad m) => v a -> m (Mutable v (PrimState m) a) -basicLength :: Vector v a => v a -> Int -basicUnsafeSlice :: Vector v a => Int -> Int -> v a -> v a -basicUnsafeIndexM :: (Vector v a, Monad m) => v a -> Int -> m a -basicUnsafeCopy :: (Vector v a, PrimMonad m) => Mutable v (PrimState m) a -> v a -> m () -elemseq :: Vector v a => v a -> a -> b -> b - --- | Mutable v s a is the mutable version of the pure vector type --- v a with the state token s - --- | O(1) Yield the length of the vector. -length :: Vector v a => v a -> Int - --- | O(1) Test whether a vector if empty -null :: Vector v a => v a -> Bool - --- | O(1) Indexing -(!) :: Vector v a => v a -> Int -> a - --- | O(1) Safe indexing -(!?) :: Vector v a => v a -> Int -> Maybe a - --- | O(1) First element -head :: Vector v a => v a -> a - --- | O(1) Last element -last :: Vector v a => v a -> a - --- | O(1) Unsafe indexing without bounds checking -unsafeIndex :: Vector v a => v a -> Int -> a - --- | O(1) First element without checking if the vector is empty -unsafeHead :: Vector v a => v a -> a - --- | O(1) Last element without checking if the vector is empty -unsafeLast :: Vector v a => v a -> a - --- | O(1) Indexing in a monad. --- --- The monad allows operations to be strict in the vector when necessary. --- Suppose vector copying is implemented like this: --- --- 
---   copy mv v = ... write mv i (v ! i) ...
---
--- --- For lazy vectors, v ! i would not be evaluated which means --- that mv would unnecessarily retain a reference to v --- in each element written. --- --- With indexM, copying can be implemented like this instead: --- --- 
---   copy mv v = ... do
---                     x <- indexM v i
---                     write mv i x
---
--- --- Here, no references to v are retained because indexing (but --- not the elements) is evaluated eagerly. -indexM :: (Vector v a, Monad m) => v a -> Int -> m a - --- | O(1) First element of a vector in a monad. See indexM --- for an explanation of why this is useful. -headM :: (Vector v a, Monad m) => v a -> m a - --- | O(1) Last element of a vector in a monad. See indexM for --- an explanation of why this is useful. -lastM :: (Vector v a, Monad m) => v a -> m a - --- | O(1) Indexing in a monad without bounds checks. See --- indexM for an explanation of why this is useful. -unsafeIndexM :: (Vector v a, Monad m) => v a -> Int -> m a - --- | O(1) First element in a monad without checking for empty --- vectors. See indexM for an explanation of why this is useful. -unsafeHeadM :: (Vector v a, Monad m) => v a -> m a - --- | O(1) Last element in a monad without checking for empty --- vectors. See indexM for an explanation of why this is useful. -unsafeLastM :: (Vector v a, Monad m) => v a -> m a - --- | O(1) Yield a slice of the vector without copying it. The vector --- must contain at least i+n elements. -slice :: Vector v a => Int -> Int -> v a -> v a - --- | O(1) Yield all but the last element without copying. The vector --- may not be empty. -init :: Vector v a => v a -> v a - --- | O(1) Yield all but the first element without copying. The --- vector may not be empty. -tail :: Vector v a => v a -> v a - --- | O(1) Yield the first n elements without copying. The --- vector may contain less than n elements in which case it is --- returned unchanged. -take :: Vector v a => Int -> v a -> v a - --- | O(1) Yield all but the first n elements without --- copying. The vector may contain less than n elements in which --- case an empty vector is returned. -drop :: Vector v a => Int -> v a -> v a - --- | O(1) Yield the first n elements paired with the --- remainder without copying. --- --- Note that splitAt n v is equivalent to --- (take n v, drop n v) but slightly more --- efficient. -splitAt :: Vector v a => Int -> v a -> (v a, v a) - --- | O(1) Yield a slice of the vector without copying. The vector --- must contain at least i+n elements but this is not checked. -unsafeSlice :: Vector v a => Int -> Int -> v a -> v a - --- | O(1) Yield all but the last element without copying. The vector --- may not be empty but this is not checked. -unsafeInit :: Vector v a => v a -> v a - --- | O(1) Yield all but the first element without copying. The --- vector may not be empty but this is not checked. -unsafeTail :: Vector v a => v a -> v a - --- | O(1) Yield the first n elements without copying. The --- vector must contain at least n elements but this is not --- checked. -unsafeTake :: Vector v a => Int -> v a -> v a - --- | O(1) Yield all but the first n elements without --- copying. The vector must contain at least n elements but this --- is not checked. -unsafeDrop :: Vector v a => Int -> v a -> v a - --- | O(1) Empty vector -empty :: Vector v a => v a - --- | O(1) Vector with exactly one element -singleton :: Vector v a => a -> v a - --- | O(n) Vector of the given length with the same value in each --- position -replicate :: Vector v a => Int -> a -> v a - --- | O(n) Construct a vector of the given length by applying the --- function to each index -generate :: Vector v a => Int -> (Int -> a) -> v a - --- | O(n) Apply function n times to value. Zeroth element is --- original value. -iterateN :: Vector v a => Int -> (a -> a) -> a -> v a - --- | O(n) Execute the monadic action the given number of times and --- store the results in a vector. -replicateM :: (Monad m, Vector v a) => Int -> m a -> m (v a) - --- | O(n) Construct a vector of the given length by applying the --- monadic action to each index -generateM :: (Monad m, Vector v a) => Int -> (Int -> m a) -> m (v a) - --- | Execute the monadic action and freeze the resulting vector. --- --- 
---   create (do { v <- new 2; write v 0 'a'; write v 1 'b' }) = <a,b>
---
-create :: Vector v a => (forall s. ST s (Mutable v s a)) -> v a - --- | O(n) Construct a vector by repeatedly applying the generator --- function to a seed. The generator function yields Just the next --- element and the new seed or Nothing if there are no more --- elements. --- --- 
---   unfoldr (\n -> if n == 0 then Nothing else Just (n,n-1)) 10
---    = <10,9,8,7,6,5,4,3,2,1>
---
-unfoldr :: Vector v a => (b -> Maybe (a, b)) -> b -> v a - --- | O(n) Construct a vector with at most n by repeatedly --- applying the generator function to the a seed. The generator function --- yields Just the next element and the new seed or Nothing --- if there are no more elements. --- --- 
---   unfoldrN 3 (\n -> Just (n,n-1)) 10 = <10,9,8>
---
-unfoldrN :: Vector v a => Int -> (b -> Maybe (a, b)) -> b -> v a - --- | O(n) Construct a vector with n elements by repeatedly --- applying the generator function to the already constructed part of the --- vector. --- --- 
---   constructN 3 f = let a = f <> ; b = f <a> ; c = f <a,b> in f <a,b,c>
---
-constructN :: Vector v a => Int -> (v a -> a) -> v a - --- | O(n) Construct a vector with n elements from right to --- left by repeatedly applying the generator function to the already --- constructed part of the vector. --- --- 
---   constructrN 3 f = let a = f <> ; b = f<a> ; c = f <b,a> in f <c,b,a>
---
-constructrN :: Vector v a => Int -> (v a -> a) -> v a - --- | O(n) Yield a vector of the given length containing the values --- x, x+1 etc. This operation is usually more efficient --- than enumFromTo. --- --- 
---   enumFromN 5 3 = <5,6,7>
---
-enumFromN :: (Vector v a, Num a) => a -> Int -> v a - --- | O(n) Yield a vector of the given length containing the values --- x, x+y, x+y+y etc. This operations is --- usually more efficient than enumFromThenTo. --- --- 
---   enumFromStepN 1 0.1 5 = <1,1.1,1.2,1.3,1.4>
---
-enumFromStepN :: (Vector v a, Num a) => a -> a -> Int -> v a - --- | O(n) Enumerate values from x to y. --- --- WARNING: This operation can be very inefficient. If at all --- possible, use enumFromN instead. -enumFromTo :: (Vector v a, Enum a) => a -> a -> v a - --- | O(n) Enumerate values from x to y with a --- specific step z. --- --- WARNING: This operation can be very inefficient. If at all --- possible, use enumFromStepN instead. -enumFromThenTo :: (Vector v a, Enum a) => a -> a -> a -> v a - --- | O(n) Prepend an element -cons :: Vector v a => a -> v a -> v a - --- | O(n) Append an element -snoc :: Vector v a => v a -> a -> v a - --- | O(m+n) Concatenate two vectors -(++) :: Vector v a => v a -> v a -> v a - --- | O(n) Concatenate all vectors in the list -concat :: Vector v a => [v a] -> v a - --- | O(n) Yield the argument but force it not to retain any extra --- memory, possibly by copying it. --- --- This is especially useful when dealing with slices. For example: --- --- 
---   force (slice 0 2 <huge vector>)
---
--- --- Here, the slice retains a reference to the huge vector. Forcing it --- creates a copy of just the elements that belong to the slice and --- allows the huge vector to be garbage collected. -force :: Vector v a => v a -> v a - --- | O(m+n) For each pair (i,a) from the list, replace the --- vector element at position i by a. --- --- 
---   <5,9,2,7> // [(2,1),(0,3),(2,8)] = <3,9,8,7>
---
-(//) :: Vector v a => v a -> [(Int, a)] -> v a - --- | O(m+n) For each pair (i,a) from the vector of --- index/value pairs, replace the vector element at position i --- by a. --- --- 
---   update <5,9,2,7> <(2,1),(0,3),(2,8)> = <3,9,8,7>
---
-update :: (Vector v a, Vector v (Int, a)) => v a -> v (Int, a) -> v a - --- | O(m+min(n1,n2)) For each index i from the index vector --- and the corresponding value a from the value vector, replace --- the element of the initial vector at position i by --- a. --- --- 
---   update_ <5,9,2,7>  <2,0,2> <1,3,8> = <3,9,8,7>
---
--- --- This function is useful for instances of Vector that cannot --- store pairs. Otherwise, update is probably more convenient. --- --- 
---   update_ xs is ys = update xs (zip is ys)
---
-update_ :: (Vector v a, Vector v Int) => v a -> v Int -> v a -> v a - --- | Same as (//) but without bounds checking. -unsafeUpd :: Vector v a => v a -> [(Int, a)] -> v a - --- | Same as update but without bounds checking. -unsafeUpdate :: (Vector v a, Vector v (Int, a)) => v a -> v (Int, a) -> v a - --- | Same as update_ but without bounds checking. -unsafeUpdate_ :: (Vector v a, Vector v Int) => v a -> v Int -> v a -> v a - --- | O(m+n) For each pair (i,b) from the list, replace the --- vector element a at position i by f a b. --- --- 
---   accum (+) <5,9,2> [(2,4),(1,6),(0,3),(1,7)] = <5+3, 9+6+7, 2+4>
---
-accum :: Vector v a => (a -> b -> a) -> v a -> [(Int, b)] -> v a - --- | O(m+n) For each pair (i,b) from the vector of pairs, --- replace the vector element a at position i by f --- a b. --- --- 
---   accumulate (+) <5,9,2> <(2,4),(1,6),(0,3),(1,7)> = <5+3, 9+6+7, 2+4>
---
-accumulate :: (Vector v a, Vector v (Int, b)) => (a -> b -> a) -> v a -> v (Int, b) -> v a - --- | O(m+min(n1,n2)) For each index i from the index vector --- and the corresponding value b from the the value vector, --- replace the element of the initial vector at position i by --- f a b. --- --- 
---   accumulate_ (+) <5,9,2> <2,1,0,1> <4,6,3,7> = <5+3, 9+6+7, 2+4>
---
--- --- This function is useful for instances of Vector that cannot --- store pairs. Otherwise, accumulate is probably more convenient: --- --- 
---   accumulate_ f as is bs = accumulate f as (zip is bs)
---
-accumulate_ :: (Vector v a, Vector v Int, Vector v b) => (a -> b -> a) -> v a -> v Int -> v b -> v a - --- | Same as accum but without bounds checking. -unsafeAccum :: Vector v a => (a -> b -> a) -> v a -> [(Int, b)] -> v a - --- | Same as accumulate but without bounds checking. -unsafeAccumulate :: (Vector v a, Vector v (Int, b)) => (a -> b -> a) -> v a -> v (Int, b) -> v a - --- | Same as accumulate_ but without bounds checking. -unsafeAccumulate_ :: (Vector v a, Vector v Int, Vector v b) => (a -> b -> a) -> v a -> v Int -> v b -> v a - --- | O(n) Reverse a vector -reverse :: Vector v a => v a -> v a - --- | O(n) Yield the vector obtained by replacing each element --- i of the index vector by xs!i. This is --- equivalent to map (xs!) is but is often much --- more efficient. --- --- 
---   backpermute <a,b,c,d> <0,3,2,3,1,0> = <a,d,c,d,b,a>
---
-backpermute :: (Vector v a, Vector v Int) => v a -> v Int -> v a - --- | Same as backpermute but without bounds checking. -unsafeBackpermute :: (Vector v a, Vector v Int) => v a -> v Int -> v a - --- | Apply a destructive operation to a vector. The operation will be --- performed in place if it is safe to do so and will modify a copy of --- the vector otherwise. --- --- 
---   modify (\v -> write v 0 'x') (replicate 3 'a') = <'x','a','a'>
---
-modify :: Vector v a => (forall s. Mutable v s a -> ST s ()) -> v a -> v a - --- | O(n) Pair each element in a vector with its index -indexed :: (Vector v a, Vector v (Int, a)) => v a -> v (Int, a) - --- | O(n) Map a function over a vector -map :: (Vector v a, Vector v b) => (a -> b) -> v a -> v b - --- | O(n) Apply a function to every element of a vector and its --- index -imap :: (Vector v a, Vector v b) => (Int -> a -> b) -> v a -> v b - --- | Map a function over a vector and concatenate the results. -concatMap :: (Vector v a, Vector v b) => (a -> v b) -> v a -> v b - --- | O(n) Apply the monadic action to all elements of the vector, --- yielding a vector of results -mapM :: (Monad m, Vector v a, Vector v b) => (a -> m b) -> v a -> m (v b) - --- | O(n) Apply the monadic action to all elements of a vector and --- ignore the results -mapM_ :: (Monad m, Vector v a) => (a -> m b) -> v a -> m () - --- | O(n) Apply the monadic action to all elements of the vector, --- yielding a vector of results. Equvalent to flip mapM. -forM :: (Monad m, Vector v a, Vector v b) => v a -> (a -> m b) -> m (v b) - --- | O(n) Apply the monadic action to all elements of a vector and --- ignore the results. Equivalent to flip mapM_. -forM_ :: (Monad m, Vector v a) => v a -> (a -> m b) -> m () - --- | O(min(m,n)) Zip two vectors with the given function. -zipWith :: (Vector v a, Vector v b, Vector v c) => (a -> b -> c) -> v a -> v b -> v c - --- | Zip three vectors with the given function. -zipWith3 :: (Vector v a, Vector v b, Vector v c, Vector v d) => (a -> b -> c -> d) -> v a -> v b -> v c -> v d -zipWith4 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e) => (a -> b -> c -> d -> e) -> v a -> v b -> v c -> v d -> v e -zipWith5 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f) => (a -> b -> c -> d -> e -> f) -> v a -> v b -> v c -> v d -> v e -> v f -zipWith6 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f, Vector v g) => (a -> b -> c -> d -> e -> f -> g) -> v a -> v b -> v c -> v d -> v e -> v f -> v g - --- | O(min(m,n)) Zip two vectors with a function that also takes the --- elements' indices. -izipWith :: (Vector v a, Vector v b, Vector v c) => (Int -> a -> b -> c) -> v a -> v b -> v c -izipWith3 :: (Vector v a, Vector v b, Vector v c, Vector v d) => (Int -> a -> b -> c -> d) -> v a -> v b -> v c -> v d -izipWith4 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e) => (Int -> a -> b -> c -> d -> e) -> v a -> v b -> v c -> v d -> v e -izipWith5 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f) => (Int -> a -> b -> c -> d -> e -> f) -> v a -> v b -> v c -> v d -> v e -> v f -izipWith6 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f, Vector v g) => (Int -> a -> b -> c -> d -> e -> f -> g) -> v a -> v b -> v c -> v d -> v e -> v f -> v g - --- | O(min(m,n)) Zip two vectors -zip :: (Vector v a, Vector v b, Vector v (a, b)) => v a -> v b -> v (a, b) -zip3 :: (Vector v a, Vector v b, Vector v c, Vector v (a, b, c)) => v a -> v b -> v c -> v (a, b, c) -zip4 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v (a, b, c, d)) => v a -> v b -> v c -> v d -> v (a, b, c, d) -zip5 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v (a, b, c, d, e)) => v a -> v b -> v c -> v d -> v e -> v (a, b, c, d, e) -zip6 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f, Vector v (a, b, c, d, e, f)) => v a -> v b -> v c -> v d -> v e -> v f -> v (a, b, c, d, e, f) - --- | O(min(m,n)) Zip the two vectors with the monadic action and --- yield a vector of results -zipWithM :: (Monad m, Vector v a, Vector v b, Vector v c) => (a -> b -> m c) -> v a -> v b -> m (v c) - --- | O(min(m,n)) Zip the two vectors with the monadic action and --- ignore the results -zipWithM_ :: (Monad m, Vector v a, Vector v b) => (a -> b -> m c) -> v a -> v b -> m () - --- | O(min(m,n)) Unzip a vector of pairs. -unzip :: (Vector v a, Vector v b, Vector v (a, b)) => v (a, b) -> (v a, v b) -unzip3 :: (Vector v a, Vector v b, Vector v c, Vector v (a, b, c)) => v (a, b, c) -> (v a, v b, v c) -unzip4 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v (a, b, c, d)) => v (a, b, c, d) -> (v a, v b, v c, v d) -unzip5 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v (a, b, c, d, e)) => v (a, b, c, d, e) -> (v a, v b, v c, v d, v e) -unzip6 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f, Vector v (a, b, c, d, e, f)) => v (a, b, c, d, e, f) -> (v a, v b, v c, v d, v e, v f) - --- | O(n) Drop elements that do not satisfy the predicate -filter :: Vector v a => (a -> Bool) -> v a -> v a - --- | O(n) Drop elements that do not satisfy the predicate which is --- applied to values and their indices -ifilter :: Vector v a => (Int -> a -> Bool) -> v a -> v a - --- | O(n) Drop elements that do not satisfy the monadic predicate -filterM :: (Monad m, Vector v a) => (a -> m Bool) -> v a -> m (v a) - --- | O(n) Yield the longest prefix of elements satisfying the --- predicate without copying. -takeWhile :: Vector v a => (a -> Bool) -> v a -> v a - --- | O(n) Drop the longest prefix of elements that satisfy the --- predicate without copying. -dropWhile :: Vector v a => (a -> Bool) -> v a -> v a - --- | O(n) Split the vector in two parts, the first one containing --- those elements that satisfy the predicate and the second one those --- that don't. The relative order of the elements is preserved at the --- cost of a sometimes reduced performance compared to --- unstablePartition. -partition :: Vector v a => (a -> Bool) -> v a -> (v a, v a) - --- | O(n) Split the vector in two parts, the first one containing --- those elements that satisfy the predicate and the second one those --- that don't. The order of the elements is not preserved but the --- operation is often faster than partition. -unstablePartition :: Vector v a => (a -> Bool) -> v a -> (v a, v a) - --- | O(n) Split the vector into the longest prefix of elements that --- satisfy the predicate and the rest without copying. -span :: Vector v a => (a -> Bool) -> v a -> (v a, v a) - --- | O(n) Split the vector into the longest prefix of elements that --- do not satisfy the predicate and the rest without copying. -break :: Vector v a => (a -> Bool) -> v a -> (v a, v a) - --- | O(n) Check if the vector contains an element -elem :: (Vector v a, Eq a) => a -> v a -> Bool - --- | O(n) Check if the vector does not contain an element (inverse --- of elem) -notElem :: (Vector v a, Eq a) => a -> v a -> Bool - --- | O(n) Yield Just the first element matching the predicate --- or Nothing if no such element exists. -find :: Vector v a => (a -> Bool) -> v a -> Maybe a - --- | O(n) Yield Just the index of the first element matching --- the predicate or Nothing if no such element exists. -findIndex :: Vector v a => (a -> Bool) -> v a -> Maybe Int - --- | O(n) Yield the indices of elements satisfying the predicate in --- ascending order. -findIndices :: (Vector v a, Vector v Int) => (a -> Bool) -> v a -> v Int - --- | O(n) Yield Just the index of the first occurence of the --- given element or Nothing if the vector does not contain the --- element. This is a specialised version of findIndex. -elemIndex :: (Vector v a, Eq a) => a -> v a -> Maybe Int - --- | O(n) Yield the indices of all occurences of the given element --- in ascending order. This is a specialised version of --- findIndices. -elemIndices :: (Vector v a, Vector v Int, Eq a) => a -> v a -> v Int - --- | O(n) Left fold -foldl :: Vector v b => (a -> b -> a) -> a -> v b -> a - --- | O(n) Left fold on non-empty vectors -foldl1 :: Vector v a => (a -> a -> a) -> v a -> a - --- | O(n) Left fold with strict accumulator -foldl' :: Vector v b => (a -> b -> a) -> a -> v b -> a - --- | O(n) Left fold on non-empty vectors with strict accumulator -foldl1' :: Vector v a => (a -> a -> a) -> v a -> a - --- | O(n) Right fold -foldr :: Vector v a => (a -> b -> b) -> b -> v a -> b - --- | O(n) Right fold on non-empty vectors -foldr1 :: Vector v a => (a -> a -> a) -> v a -> a - --- | O(n) Right fold with a strict accumulator -foldr' :: Vector v a => (a -> b -> b) -> b -> v a -> b - --- | O(n) Right fold on non-empty vectors with strict accumulator -foldr1' :: Vector v a => (a -> a -> a) -> v a -> a - --- | O(n) Left fold (function applied to each element and its index) -ifoldl :: Vector v b => (a -> Int -> b -> a) -> a -> v b -> a - --- | O(n) Left fold with strict accumulator (function applied to --- each element and its index) -ifoldl' :: Vector v b => (a -> Int -> b -> a) -> a -> v b -> a - --- | O(n) Right fold (function applied to each element and its --- index) -ifoldr :: Vector v a => (Int -> a -> b -> b) -> b -> v a -> b - --- | O(n) Right fold with strict accumulator (function applied to --- each element and its index) -ifoldr' :: Vector v a => (Int -> a -> b -> b) -> b -> v a -> b - --- | O(n) Check if all elements satisfy the predicate. -all :: Vector v a => (a -> Bool) -> v a -> Bool - --- | O(n) Check if any element satisfies the predicate. -any :: Vector v a => (a -> Bool) -> v a -> Bool - --- | O(n) Check if all elements are True -and :: Vector v Bool => v Bool -> Bool - --- | O(n) Check if any element is True -or :: Vector v Bool => v Bool -> Bool - --- | O(n) Compute the sum of the elements -sum :: (Vector v a, Num a) => v a -> a - --- | O(n) Compute the produce of the elements -product :: (Vector v a, Num a) => v a -> a - --- | O(n) Yield the maximum element of the vector. The vector may --- not be empty. -maximum :: (Vector v a, Ord a) => v a -> a - --- | O(n) Yield the maximum element of the vector according to the --- given comparison function. The vector may not be empty. -maximumBy :: Vector v a => (a -> a -> Ordering) -> v a -> a - --- | O(n) Yield the minimum element of the vector. The vector may --- not be empty. -minimum :: (Vector v a, Ord a) => v a -> a - --- | O(n) Yield the minimum element of the vector according to the --- given comparison function. The vector may not be empty. -minimumBy :: Vector v a => (a -> a -> Ordering) -> v a -> a - --- | O(n) Yield the index of the minimum element of the vector. The --- vector may not be empty. -minIndex :: (Vector v a, Ord a) => v a -> Int - --- | O(n) Yield the index of the minimum element of the vector --- according to the given comparison function. The vector may not be --- empty. -minIndexBy :: Vector v a => (a -> a -> Ordering) -> v a -> Int - --- | O(n) Yield the index of the maximum element of the vector. The --- vector may not be empty. -maxIndex :: (Vector v a, Ord a) => v a -> Int - --- | O(n) Yield the index of the maximum element of the vector --- according to the given comparison function. The vector may not be --- empty. -maxIndexBy :: Vector v a => (a -> a -> Ordering) -> v a -> Int - --- | O(n) Monadic fold -foldM :: (Monad m, Vector v b) => (a -> b -> m a) -> a -> v b -> m a - --- | O(n) Monadic fold with strict accumulator -foldM' :: (Monad m, Vector v b) => (a -> b -> m a) -> a -> v b -> m a - --- | O(n) Monadic fold over non-empty vectors -fold1M :: (Monad m, Vector v a) => (a -> a -> m a) -> v a -> m a - --- | O(n) Monadic fold over non-empty vectors with strict --- accumulator -fold1M' :: (Monad m, Vector v a) => (a -> a -> m a) -> v a -> m a - --- | O(n) Monadic fold that discards the result -foldM_ :: (Monad m, Vector v b) => (a -> b -> m a) -> a -> v b -> m () - --- | O(n) Monadic fold with strict accumulator that discards the --- result -foldM'_ :: (Monad m, Vector v b) => (a -> b -> m a) -> a -> v b -> m () - --- | O(n) Monadic fold over non-empty vectors that discards the --- result -fold1M_ :: (Monad m, Vector v a) => (a -> a -> m a) -> v a -> m () - --- | O(n) Monad fold over non-empty vectors with strict accumulator --- that discards the result -fold1M'_ :: (Monad m, Vector v a) => (a -> a -> m a) -> v a -> m () - --- | Evaluate each action and collect the results -sequence :: (Monad m, Vector v a, Vector v (m a)) => v (m a) -> m (v a) - --- | Evaluate each action and discard the results -sequence_ :: (Monad m, Vector v (m a)) => v (m a) -> m () - --- | O(n) Prescan --- --- 
---   prescanl f z = init . scanl f z
---
--- --- Example: prescanl (+) 0 <1,2,3,4> = <0,1,3,6> -prescanl :: (Vector v a, Vector v b) => (a -> b -> a) -> a -> v b -> v a - --- | O(n) Prescan with strict accumulator -prescanl' :: (Vector v a, Vector v b) => (a -> b -> a) -> a -> v b -> v a - --- | O(n) Scan --- --- 
---   postscanl f z = tail . scanl f z
---
--- --- Example: postscanl (+) 0 <1,2,3,4> = <1,3,6,10> -postscanl :: (Vector v a, Vector v b) => (a -> b -> a) -> a -> v b -> v a - --- | O(n) Scan with strict accumulator -postscanl' :: (Vector v a, Vector v b) => (a -> b -> a) -> a -> v b -> v a - --- | O(n) Haskell-style scan --- --- 
---   scanl f z <x1,...,xn> = <y1,...,y(n+1)>
---     where y1 = z
---           yi = f y(i-1) x(i-1)
---
--- --- Example: scanl (+) 0 <1,2,3,4> = <0,1,3,6,10> -scanl :: (Vector v a, Vector v b) => (a -> b -> a) -> a -> v b -> v a - --- | O(n) Haskell-style scan with strict accumulator -scanl' :: (Vector v a, Vector v b) => (a -> b -> a) -> a -> v b -> v a - --- | O(n) Scan over a non-empty vector --- --- 
---   scanl f <x1,...,xn> = <y1,...,yn>
---     where y1 = x1
---           yi = f y(i-1) xi
---
-scanl1 :: Vector v a => (a -> a -> a) -> v a -> v a - --- | O(n) Scan over a non-empty vector with a strict accumulator -scanl1' :: Vector v a => (a -> a -> a) -> v a -> v a - --- | O(n) Right-to-left prescan --- --- 
---   prescanr f z = reverse . prescanl (flip f) z . reverse
---
-prescanr :: (Vector v a, Vector v b) => (a -> b -> b) -> b -> v a -> v b - --- | O(n) Right-to-left prescan with strict accumulator -prescanr' :: (Vector v a, Vector v b) => (a -> b -> b) -> b -> v a -> v b - --- | O(n) Right-to-left scan -postscanr :: (Vector v a, Vector v b) => (a -> b -> b) -> b -> v a -> v b - --- | O(n) Right-to-left scan with strict accumulator -postscanr' :: (Vector v a, Vector v b) => (a -> b -> b) -> b -> v a -> v b - --- | O(n) Right-to-left Haskell-style scan -scanr :: (Vector v a, Vector v b) => (a -> b -> b) -> b -> v a -> v b - --- | O(n) Right-to-left Haskell-style scan with strict accumulator -scanr' :: (Vector v a, Vector v b) => (a -> b -> b) -> b -> v a -> v b - --- | O(n) Right-to-left scan over a non-empty vector -scanr1 :: Vector v a => (a -> a -> a) -> v a -> v a - --- | O(n) Right-to-left scan over a non-empty vector with a strict --- accumulator -scanr1' :: Vector v a => (a -> a -> a) -> v a -> v a - --- | O(n) Convert a vector to a list -toList :: Vector v a => v a -> [a] - --- | O(n) Convert a list to a vector -fromList :: Vector v a => [a] -> v a - --- | O(n) Convert the first n elements of a list to a --- vector --- --- 
---   fromListN n xs = fromList (take n xs)
---
-fromListN :: Vector v a => Int -> [a] -> v a - --- | O(n) Convert different vector types -convert :: (Vector v a, Vector w a) => v a -> w a - --- | O(n) Yield an immutable copy of the mutable vector. -freeze :: (PrimMonad m, Vector v a) => Mutable v (PrimState m) a -> m (v a) - --- | O(n) Yield a mutable copy of the immutable vector. -thaw :: (PrimMonad m, Vector v a) => v a -> m (Mutable v (PrimState m) a) - --- | O(n) Copy an immutable vector into a mutable one. The two --- vectors must have the same length. -copy :: (PrimMonad m, Vector v a) => Mutable v (PrimState m) a -> v a -> m () - --- | O(1) Unsafe convert a mutable vector to an immutable one --- without copying. The mutable vector may not be used after this --- operation. -unsafeFreeze :: (PrimMonad m, Vector v a) => Mutable v (PrimState m) a -> m (v a) - --- | O(1) Unsafely convert an immutable vector to a mutable one --- without copying. The immutable vector may not be used after this --- operation. -unsafeThaw :: (PrimMonad m, Vector v a) => v a -> m (Mutable v (PrimState m) a) - --- | O(n) Copy an immutable vector into a mutable one. The two --- vectors must have the same length. This is not checked. -unsafeCopy :: (PrimMonad m, Vector v a) => Mutable v (PrimState m) a -> v a -> m () - --- | O(1) Convert a vector to a Stream -stream :: Vector v a => v a -> Stream a - --- | O(n) Construct a vector from a Stream -unstream :: Vector v a => Stream a -> v a - --- | O(1) Convert a vector to a Stream, proceeding from right --- to left -streamR :: Vector v a => v a -> Stream a - --- | O(n) Construct a vector from a Stream, proceeding from --- right to left -unstreamR :: Vector v a => Stream a -> v a - --- | Construct a vector from a monadic initialiser. -new :: Vector v a => New v a -> v a - --- | Convert a vector to an initialiser which, when run, produces a copy of --- the vector. -clone :: Vector v a => v a -> New v a - --- | O(n) Check if two vectors are equal. All Vector --- instances are also instances of Eq and it is usually more --- appropriate to use those. This function is primarily intended for --- implementing Eq instances for new vector types. -eq :: (Vector v a, Eq a) => v a -> v a -> Bool - --- | O(n) Compare two vectors lexicographically. All Vector --- instances are also instances of Ord and it is usually more --- appropriate to use those. This function is primarily intended for --- implementing Ord instances for new vector types. -cmp :: (Vector v a, Ord a) => v a -> v a -> Ordering - --- | Generic definition of Prelude.showsPrec -showsPrec :: (Vector v a, Show a) => Int -> v a -> ShowS - --- | Generic definition of Text.Read.readPrec -readPrec :: (Vector v a, Read a) => ReadPrec (v a) - --- | Generic definion of Data.Data.gfoldl that views a --- Vector as a list. -gfoldl :: (Vector v a, Data a) => (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> v a -> c (v a) -dataCast :: (Vector v a, Data a, Typeable1 v, Typeable1 t) => (forall d. Data d => c (t d)) -> Maybe (c (v a)) -mkType :: String -> DataType - - --- | Safe interface to Data.Vector.Generic -module Data.Vector.Generic.Safe - --- | Class of immutable vectors. Every immutable vector is associated with --- its mutable version through the Mutable type family. Methods of --- this class should not be used directly. Instead, --- Data.Vector.Generic and other Data.Vector modules provide safe --- and fusible wrappers. --- --- Minimum complete implementation: --- --- -class MVector (Mutable v) a => Vector v a - --- | Mutable v s a is the mutable version of the pure vector type --- v a with the state token s - --- | O(1) Yield the length of the vector. -length :: Vector v a => v a -> Int - --- | O(1) Test whether a vector if empty -null :: Vector v a => v a -> Bool - --- | O(1) Indexing -(!) :: Vector v a => v a -> Int -> a - --- | O(1) Safe indexing -(!?) :: Vector v a => v a -> Int -> Maybe a - --- | O(1) First element -head :: Vector v a => v a -> a - --- | O(1) Last element -last :: Vector v a => v a -> a - --- | O(1) Indexing in a monad. --- --- The monad allows operations to be strict in the vector when necessary. --- Suppose vector copying is implemented like this: --- --- 
---   copy mv v = ... write mv i (v ! i) ...
---
--- --- For lazy vectors, v ! i would not be evaluated which means --- that mv would unnecessarily retain a reference to v --- in each element written. --- --- With indexM, copying can be implemented like this instead: --- --- 
---   copy mv v = ... do
---                     x <- indexM v i
---                     write mv i x
---
--- --- Here, no references to v are retained because indexing (but --- not the elements) is evaluated eagerly. -indexM :: (Vector v a, Monad m) => v a -> Int -> m a - --- | O(1) First element of a vector in a monad. See indexM --- for an explanation of why this is useful. -headM :: (Vector v a, Monad m) => v a -> m a - --- | O(1) Last element of a vector in a monad. See indexM for --- an explanation of why this is useful. -lastM :: (Vector v a, Monad m) => v a -> m a - --- | O(1) Yield a slice of the vector without copying it. The vector --- must contain at least i+n elements. -slice :: Vector v a => Int -> Int -> v a -> v a - --- | O(1) Yield all but the last element without copying. The vector --- may not be empty. -init :: Vector v a => v a -> v a - --- | O(1) Yield all but the first element without copying. The --- vector may not be empty. -tail :: Vector v a => v a -> v a - --- | O(1) Yield the first n elements without copying. The --- vector may contain less than n elements in which case it is --- returned unchanged. -take :: Vector v a => Int -> v a -> v a - --- | O(1) Yield all but the first n elements without --- copying. The vector may contain less than n elements in which --- case an empty vector is returned. -drop :: Vector v a => Int -> v a -> v a - --- | O(1) Yield the first n elements paired with the --- remainder without copying. --- --- Note that splitAt n v is equivalent to --- (take n v, drop n v) but slightly more --- efficient. -splitAt :: Vector v a => Int -> v a -> (v a, v a) - --- | O(1) Empty vector -empty :: Vector v a => v a - --- | O(1) Vector with exactly one element -singleton :: Vector v a => a -> v a - --- | O(n) Vector of the given length with the same value in each --- position -replicate :: Vector v a => Int -> a -> v a - --- | O(n) Construct a vector of the given length by applying the --- function to each index -generate :: Vector v a => Int -> (Int -> a) -> v a - --- | O(n) Apply function n times to value. Zeroth element is --- original value. -iterateN :: Vector v a => Int -> (a -> a) -> a -> v a - --- | O(n) Execute the monadic action the given number of times and --- store the results in a vector. -replicateM :: (Monad m, Vector v a) => Int -> m a -> m (v a) - --- | O(n) Construct a vector of the given length by applying the --- monadic action to each index -generateM :: (Monad m, Vector v a) => Int -> (Int -> m a) -> m (v a) - --- | Execute the monadic action and freeze the resulting vector. --- --- 
---   create (do { v <- new 2; write v 0 'a'; write v 1 'b' }) = <a,b>
---
-create :: Vector v a => (forall s. ST s (Mutable v s a)) -> v a - --- | O(n) Construct a vector by repeatedly applying the generator --- function to a seed. The generator function yields Just the next --- element and the new seed or Nothing if there are no more --- elements. --- --- 
---   unfoldr (\n -> if n == 0 then Nothing else Just (n,n-1)) 10
---    = <10,9,8,7,6,5,4,3,2,1>
---
-unfoldr :: Vector v a => (b -> Maybe (a, b)) -> b -> v a - --- | O(n) Construct a vector with at most n by repeatedly --- applying the generator function to the a seed. The generator function --- yields Just the next element and the new seed or Nothing --- if there are no more elements. --- --- 
---   unfoldrN 3 (\n -> Just (n,n-1)) 10 = <10,9,8>
---
-unfoldrN :: Vector v a => Int -> (b -> Maybe (a, b)) -> b -> v a - --- | O(n) Yield a vector of the given length containing the values --- x, x+1 etc. This operation is usually more efficient --- than enumFromTo. --- --- 
---   enumFromN 5 3 = <5,6,7>
---
-enumFromN :: (Vector v a, Num a) => a -> Int -> v a - --- | O(n) Yield a vector of the given length containing the values --- x, x+y, x+y+y etc. This operations is --- usually more efficient than enumFromThenTo. --- --- 
---   enumFromStepN 1 0.1 5 = <1,1.1,1.2,1.3,1.4>
---
-enumFromStepN :: (Vector v a, Num a) => a -> a -> Int -> v a - --- | O(n) Enumerate values from x to y. --- --- WARNING: This operation can be very inefficient. If at all --- possible, use enumFromN instead. -enumFromTo :: (Vector v a, Enum a) => a -> a -> v a - --- | O(n) Enumerate values from x to y with a --- specific step z. --- --- WARNING: This operation can be very inefficient. If at all --- possible, use enumFromStepN instead. -enumFromThenTo :: (Vector v a, Enum a) => a -> a -> a -> v a - --- | O(n) Prepend an element -cons :: Vector v a => a -> v a -> v a - --- | O(n) Append an element -snoc :: Vector v a => v a -> a -> v a - --- | O(m+n) Concatenate two vectors -(++) :: Vector v a => v a -> v a -> v a - --- | O(n) Concatenate all vectors in the list -concat :: Vector v a => [v a] -> v a - --- | O(n) Yield the argument but force it not to retain any extra --- memory, possibly by copying it. --- --- This is especially useful when dealing with slices. For example: --- --- 
---   force (slice 0 2 <huge vector>)
---
--- --- Here, the slice retains a reference to the huge vector. Forcing it --- creates a copy of just the elements that belong to the slice and --- allows the huge vector to be garbage collected. -force :: Vector v a => v a -> v a - --- | O(m+n) For each pair (i,a) from the list, replace the --- vector element at position i by a. --- --- 
---   <5,9,2,7> // [(2,1),(0,3),(2,8)] = <3,9,8,7>
---
-(//) :: Vector v a => v a -> [(Int, a)] -> v a - --- | O(m+n) For each pair (i,a) from the vector of --- index/value pairs, replace the vector element at position i --- by a. --- --- 
---   update <5,9,2,7> <(2,1),(0,3),(2,8)> = <3,9,8,7>
---
-update :: (Vector v a, Vector v (Int, a)) => v a -> v (Int, a) -> v a - --- | O(m+min(n1,n2)) For each index i from the index vector --- and the corresponding value a from the value vector, replace --- the element of the initial vector at position i by --- a. --- --- 
---   update_ <5,9,2,7>  <2,0,2> <1,3,8> = <3,9,8,7>
---
--- --- This function is useful for instances of Vector that cannot --- store pairs. Otherwise, update is probably more convenient. --- --- 
---   update_ xs is ys = update xs (zip is ys)
---
-update_ :: (Vector v a, Vector v Int) => v a -> v Int -> v a -> v a - --- | O(m+n) For each pair (i,b) from the list, replace the --- vector element a at position i by f a b. --- --- 
---   accum (+) <5,9,2> [(2,4),(1,6),(0,3),(1,7)] = <5+3, 9+6+7, 2+4>
---
-accum :: Vector v a => (a -> b -> a) -> v a -> [(Int, b)] -> v a - --- | O(m+n) For each pair (i,b) from the vector of pairs, --- replace the vector element a at position i by f --- a b. --- --- 
---   accumulate (+) <5,9,2> <(2,4),(1,6),(0,3),(1,7)> = <5+3, 9+6+7, 2+4>
---
-accumulate :: (Vector v a, Vector v (Int, b)) => (a -> b -> a) -> v a -> v (Int, b) -> v a - --- | O(m+min(n1,n2)) For each index i from the index vector --- and the corresponding value b from the the value vector, --- replace the element of the initial vector at position i by --- f a b. --- --- 
---   accumulate_ (+) <5,9,2> <2,1,0,1> <4,6,3,7> = <5+3, 9+6+7, 2+4>
---
--- --- This function is useful for instances of Vector that cannot --- store pairs. Otherwise, accumulate is probably more convenient: --- --- 
---   accumulate_ f as is bs = accumulate f as (zip is bs)
---
-accumulate_ :: (Vector v a, Vector v Int, Vector v b) => (a -> b -> a) -> v a -> v Int -> v b -> v a - --- | O(n) Reverse a vector -reverse :: Vector v a => v a -> v a - --- | O(n) Yield the vector obtained by replacing each element --- i of the index vector by xs!i. This is --- equivalent to map (xs!) is but is often much --- more efficient. --- --- 
---   backpermute <a,b,c,d> <0,3,2,3,1,0> = <a,d,c,d,b,a>
---
-backpermute :: (Vector v a, Vector v Int) => v a -> v Int -> v a - --- | Apply a destructive operation to a vector. The operation will be --- performed in place if it is safe to do so and will modify a copy of --- the vector otherwise. --- --- 
---   modify (\v -> write v 0 'x') (replicate 3 'a') = <'x','a','a'>
---
-modify :: Vector v a => (forall s. Mutable v s a -> ST s ()) -> v a -> v a - --- | O(n) Pair each element in a vector with its index -indexed :: (Vector v a, Vector v (Int, a)) => v a -> v (Int, a) - --- | O(n) Map a function over a vector -map :: (Vector v a, Vector v b) => (a -> b) -> v a -> v b - --- | O(n) Apply a function to every element of a vector and its --- index -imap :: (Vector v a, Vector v b) => (Int -> a -> b) -> v a -> v b - --- | Map a function over a vector and concatenate the results. -concatMap :: (Vector v a, Vector v b) => (a -> v b) -> v a -> v b - --- | O(n) Apply the monadic action to all elements of the vector, --- yielding a vector of results -mapM :: (Monad m, Vector v a, Vector v b) => (a -> m b) -> v a -> m (v b) - --- | O(n) Apply the monadic action to all elements of a vector and --- ignore the results -mapM_ :: (Monad m, Vector v a) => (a -> m b) -> v a -> m () - --- | O(n) Apply the monadic action to all elements of the vector, --- yielding a vector of results. Equvalent to flip mapM. -forM :: (Monad m, Vector v a, Vector v b) => v a -> (a -> m b) -> m (v b) - --- | O(n) Apply the monadic action to all elements of a vector and --- ignore the results. Equivalent to flip mapM_. -forM_ :: (Monad m, Vector v a) => v a -> (a -> m b) -> m () - --- | O(min(m,n)) Zip two vectors with the given function. -zipWith :: (Vector v a, Vector v b, Vector v c) => (a -> b -> c) -> v a -> v b -> v c - --- | Zip three vectors with the given function. -zipWith3 :: (Vector v a, Vector v b, Vector v c, Vector v d) => (a -> b -> c -> d) -> v a -> v b -> v c -> v d -zipWith4 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e) => (a -> b -> c -> d -> e) -> v a -> v b -> v c -> v d -> v e -zipWith5 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f) => (a -> b -> c -> d -> e -> f) -> v a -> v b -> v c -> v d -> v e -> v f -zipWith6 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f, Vector v g) => (a -> b -> c -> d -> e -> f -> g) -> v a -> v b -> v c -> v d -> v e -> v f -> v g - --- | O(min(m,n)) Zip two vectors with a function that also takes the --- elements' indices. -izipWith :: (Vector v a, Vector v b, Vector v c) => (Int -> a -> b -> c) -> v a -> v b -> v c -izipWith3 :: (Vector v a, Vector v b, Vector v c, Vector v d) => (Int -> a -> b -> c -> d) -> v a -> v b -> v c -> v d -izipWith4 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e) => (Int -> a -> b -> c -> d -> e) -> v a -> v b -> v c -> v d -> v e -izipWith5 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f) => (Int -> a -> b -> c -> d -> e -> f) -> v a -> v b -> v c -> v d -> v e -> v f -izipWith6 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f, Vector v g) => (Int -> a -> b -> c -> d -> e -> f -> g) -> v a -> v b -> v c -> v d -> v e -> v f -> v g - --- | O(min(m,n)) Zip two vectors -zip :: (Vector v a, Vector v b, Vector v (a, b)) => v a -> v b -> v (a, b) -zip3 :: (Vector v a, Vector v b, Vector v c, Vector v (a, b, c)) => v a -> v b -> v c -> v (a, b, c) -zip4 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v (a, b, c, d)) => v a -> v b -> v c -> v d -> v (a, b, c, d) -zip5 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v (a, b, c, d, e)) => v a -> v b -> v c -> v d -> v e -> v (a, b, c, d, e) -zip6 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f, Vector v (a, b, c, d, e, f)) => v a -> v b -> v c -> v d -> v e -> v f -> v (a, b, c, d, e, f) - --- | O(min(m,n)) Zip the two vectors with the monadic action and --- yield a vector of results -zipWithM :: (Monad m, Vector v a, Vector v b, Vector v c) => (a -> b -> m c) -> v a -> v b -> m (v c) - --- | O(min(m,n)) Zip the two vectors with the monadic action and --- ignore the results -zipWithM_ :: (Monad m, Vector v a, Vector v b) => (a -> b -> m c) -> v a -> v b -> m () - --- | O(min(m,n)) Unzip a vector of pairs. -unzip :: (Vector v a, Vector v b, Vector v (a, b)) => v (a, b) -> (v a, v b) -unzip3 :: (Vector v a, Vector v b, Vector v c, Vector v (a, b, c)) => v (a, b, c) -> (v a, v b, v c) -unzip4 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v (a, b, c, d)) => v (a, b, c, d) -> (v a, v b, v c, v d) -unzip5 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v (a, b, c, d, e)) => v (a, b, c, d, e) -> (v a, v b, v c, v d, v e) -unzip6 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f, Vector v (a, b, c, d, e, f)) => v (a, b, c, d, e, f) -> (v a, v b, v c, v d, v e, v f) - --- | O(n) Drop elements that do not satisfy the predicate -filter :: Vector v a => (a -> Bool) -> v a -> v a - --- | O(n) Drop elements that do not satisfy the predicate which is --- applied to values and their indices -ifilter :: Vector v a => (Int -> a -> Bool) -> v a -> v a - --- | O(n) Drop elements that do not satisfy the monadic predicate -filterM :: (Monad m, Vector v a) => (a -> m Bool) -> v a -> m (v a) - --- | O(n) Yield the longest prefix of elements satisfying the --- predicate without copying. -takeWhile :: Vector v a => (a -> Bool) -> v a -> v a - --- | O(n) Drop the longest prefix of elements that satisfy the --- predicate without copying. -dropWhile :: Vector v a => (a -> Bool) -> v a -> v a - --- | O(n) Split the vector in two parts, the first one containing --- those elements that satisfy the predicate and the second one those --- that don't. The relative order of the elements is preserved at the --- cost of a sometimes reduced performance compared to --- unstablePartition. -partition :: Vector v a => (a -> Bool) -> v a -> (v a, v a) - --- | O(n) Split the vector in two parts, the first one containing --- those elements that satisfy the predicate and the second one those --- that don't. The order of the elements is not preserved but the --- operation is often faster than partition. -unstablePartition :: Vector v a => (a -> Bool) -> v a -> (v a, v a) - --- | O(n) Split the vector into the longest prefix of elements that --- satisfy the predicate and the rest without copying. -span :: Vector v a => (a -> Bool) -> v a -> (v a, v a) - --- | O(n) Split the vector into the longest prefix of elements that --- do not satisfy the predicate and the rest without copying. -break :: Vector v a => (a -> Bool) -> v a -> (v a, v a) - --- | O(n) Check if the vector contains an element -elem :: (Vector v a, Eq a) => a -> v a -> Bool - --- | O(n) Check if the vector does not contain an element (inverse --- of elem) -notElem :: (Vector v a, Eq a) => a -> v a -> Bool - --- | O(n) Yield Just the first element matching the predicate --- or Nothing if no such element exists. -find :: Vector v a => (a -> Bool) -> v a -> Maybe a - --- | O(n) Yield Just the index of the first element matching --- the predicate or Nothing if no such element exists. -findIndex :: Vector v a => (a -> Bool) -> v a -> Maybe Int - --- | O(n) Yield the indices of elements satisfying the predicate in --- ascending order. -findIndices :: (Vector v a, Vector v Int) => (a -> Bool) -> v a -> v Int - --- | O(n) Yield Just the index of the first occurence of the --- given element or Nothing if the vector does not contain the --- element. This is a specialised version of findIndex. -elemIndex :: (Vector v a, Eq a) => a -> v a -> Maybe Int - --- | O(n) Yield the indices of all occurences of the given element --- in ascending order. This is a specialised version of --- findIndices. -elemIndices :: (Vector v a, Vector v Int, Eq a) => a -> v a -> v Int - --- | O(n) Left fold -foldl :: Vector v b => (a -> b -> a) -> a -> v b -> a - --- | O(n) Left fold on non-empty vectors -foldl1 :: Vector v a => (a -> a -> a) -> v a -> a - --- | O(n) Left fold with strict accumulator -foldl' :: Vector v b => (a -> b -> a) -> a -> v b -> a - --- | O(n) Left fold on non-empty vectors with strict accumulator -foldl1' :: Vector v a => (a -> a -> a) -> v a -> a - --- | O(n) Right fold -foldr :: Vector v a => (a -> b -> b) -> b -> v a -> b - --- | O(n) Right fold on non-empty vectors -foldr1 :: Vector v a => (a -> a -> a) -> v a -> a - --- | O(n) Right fold with a strict accumulator -foldr' :: Vector v a => (a -> b -> b) -> b -> v a -> b - --- | O(n) Right fold on non-empty vectors with strict accumulator -foldr1' :: Vector v a => (a -> a -> a) -> v a -> a - --- | O(n) Left fold (function applied to each element and its index) -ifoldl :: Vector v b => (a -> Int -> b -> a) -> a -> v b -> a - --- | O(n) Left fold with strict accumulator (function applied to --- each element and its index) -ifoldl' :: Vector v b => (a -> Int -> b -> a) -> a -> v b -> a - --- | O(n) Right fold (function applied to each element and its --- index) -ifoldr :: Vector v a => (Int -> a -> b -> b) -> b -> v a -> b - --- | O(n) Right fold with strict accumulator (function applied to --- each element and its index) -ifoldr' :: Vector v a => (Int -> a -> b -> b) -> b -> v a -> b - --- | O(n) Check if all elements satisfy the predicate. -all :: Vector v a => (a -> Bool) -> v a -> Bool - --- | O(n) Check if any element satisfies the predicate. -any :: Vector v a => (a -> Bool) -> v a -> Bool - --- | O(n) Check if all elements are True -and :: Vector v Bool => v Bool -> Bool - --- | O(n) Check if any element is True -or :: Vector v Bool => v Bool -> Bool - --- | O(n) Compute the sum of the elements -sum :: (Vector v a, Num a) => v a -> a - --- | O(n) Compute the produce of the elements -product :: (Vector v a, Num a) => v a -> a - --- | O(n) Yield the maximum element of the vector. The vector may --- not be empty. -maximum :: (Vector v a, Ord a) => v a -> a - --- | O(n) Yield the maximum element of the vector according to the --- given comparison function. The vector may not be empty. -maximumBy :: Vector v a => (a -> a -> Ordering) -> v a -> a - --- | O(n) Yield the minimum element of the vector. The vector may --- not be empty. -minimum :: (Vector v a, Ord a) => v a -> a - --- | O(n) Yield the minimum element of the vector according to the --- given comparison function. The vector may not be empty. -minimumBy :: Vector v a => (a -> a -> Ordering) -> v a -> a - --- | O(n) Yield the index of the minimum element of the vector. The --- vector may not be empty. -minIndex :: (Vector v a, Ord a) => v a -> Int - --- | O(n) Yield the index of the minimum element of the vector --- according to the given comparison function. The vector may not be --- empty. -minIndexBy :: Vector v a => (a -> a -> Ordering) -> v a -> Int - --- | O(n) Yield the index of the maximum element of the vector. The --- vector may not be empty. -maxIndex :: (Vector v a, Ord a) => v a -> Int - --- | O(n) Yield the index of the maximum element of the vector --- according to the given comparison function. The vector may not be --- empty. -maxIndexBy :: Vector v a => (a -> a -> Ordering) -> v a -> Int - --- | O(n) Monadic fold -foldM :: (Monad m, Vector v b) => (a -> b -> m a) -> a -> v b -> m a - --- | O(n) Monadic fold with strict accumulator -foldM' :: (Monad m, Vector v b) => (a -> b -> m a) -> a -> v b -> m a - --- | O(n) Monadic fold over non-empty vectors -fold1M :: (Monad m, Vector v a) => (a -> a -> m a) -> v a -> m a - --- | O(n) Monadic fold over non-empty vectors with strict --- accumulator -fold1M' :: (Monad m, Vector v a) => (a -> a -> m a) -> v a -> m a - --- | O(n) Monadic fold that discards the result -foldM_ :: (Monad m, Vector v b) => (a -> b -> m a) -> a -> v b -> m () - --- | O(n) Monadic fold with strict accumulator that discards the --- result -foldM'_ :: (Monad m, Vector v b) => (a -> b -> m a) -> a -> v b -> m () - --- | O(n) Monadic fold over non-empty vectors that discards the --- result -fold1M_ :: (Monad m, Vector v a) => (a -> a -> m a) -> v a -> m () - --- | O(n) Monad fold over non-empty vectors with strict accumulator --- that discards the result -fold1M'_ :: (Monad m, Vector v a) => (a -> a -> m a) -> v a -> m () - --- | Evaluate each action and collect the results -sequence :: (Monad m, Vector v a, Vector v (m a)) => v (m a) -> m (v a) - --- | Evaluate each action and discard the results -sequence_ :: (Monad m, Vector v (m a)) => v (m a) -> m () - --- | O(n) Prescan --- --- 
---   prescanl f z = init . scanl f z
---
--- --- Example: prescanl (+) 0 <1,2,3,4> = <0,1,3,6> -prescanl :: (Vector v a, Vector v b) => (a -> b -> a) -> a -> v b -> v a - --- | O(n) Prescan with strict accumulator -prescanl' :: (Vector v a, Vector v b) => (a -> b -> a) -> a -> v b -> v a - --- | O(n) Scan --- --- 
---   postscanl f z = tail . scanl f z
---
--- --- Example: postscanl (+) 0 <1,2,3,4> = <1,3,6,10> -postscanl :: (Vector v a, Vector v b) => (a -> b -> a) -> a -> v b -> v a - --- | O(n) Scan with strict accumulator -postscanl' :: (Vector v a, Vector v b) => (a -> b -> a) -> a -> v b -> v a - --- | O(n) Haskell-style scan --- --- 
---   scanl f z <x1,...,xn> = <y1,...,y(n+1)>
---     where y1 = z
---           yi = f y(i-1) x(i-1)
---
--- --- Example: scanl (+) 0 <1,2,3,4> = <0,1,3,6,10> -scanl :: (Vector v a, Vector v b) => (a -> b -> a) -> a -> v b -> v a - --- | O(n) Haskell-style scan with strict accumulator -scanl' :: (Vector v a, Vector v b) => (a -> b -> a) -> a -> v b -> v a - --- | O(n) Scan over a non-empty vector --- --- 
---   scanl f <x1,...,xn> = <y1,...,yn>
---     where y1 = x1
---           yi = f y(i-1) xi
---
-scanl1 :: Vector v a => (a -> a -> a) -> v a -> v a - --- | O(n) Scan over a non-empty vector with a strict accumulator -scanl1' :: Vector v a => (a -> a -> a) -> v a -> v a - --- | O(n) Right-to-left prescan --- --- 
---   prescanr f z = reverse . prescanl (flip f) z . reverse
---
-prescanr :: (Vector v a, Vector v b) => (a -> b -> b) -> b -> v a -> v b - --- | O(n) Right-to-left prescan with strict accumulator -prescanr' :: (Vector v a, Vector v b) => (a -> b -> b) -> b -> v a -> v b - --- | O(n) Right-to-left scan -postscanr :: (Vector v a, Vector v b) => (a -> b -> b) -> b -> v a -> v b - --- | O(n) Right-to-left scan with strict accumulator -postscanr' :: (Vector v a, Vector v b) => (a -> b -> b) -> b -> v a -> v b - --- | O(n) Right-to-left Haskell-style scan -scanr :: (Vector v a, Vector v b) => (a -> b -> b) -> b -> v a -> v b - --- | O(n) Right-to-left Haskell-style scan with strict accumulator -scanr' :: (Vector v a, Vector v b) => (a -> b -> b) -> b -> v a -> v b - --- | O(n) Right-to-left scan over a non-empty vector -scanr1 :: Vector v a => (a -> a -> a) -> v a -> v a - --- | O(n) Right-to-left scan over a non-empty vector with a strict --- accumulator -scanr1' :: Vector v a => (a -> a -> a) -> v a -> v a - --- | O(n) Convert a vector to a list -toList :: Vector v a => v a -> [a] - --- | O(n) Convert a list to a vector -fromList :: Vector v a => [a] -> v a - --- | O(n) Convert the first n elements of a list to a --- vector --- --- 
---   fromListN n xs = fromList (take n xs)
---
-fromListN :: Vector v a => Int -> [a] -> v a - --- | O(n) Convert different vector types -convert :: (Vector v a, Vector w a) => v a -> w a - --- | O(n) Yield an immutable copy of the mutable vector. -freeze :: (PrimMonad m, Vector v a) => Mutable v (PrimState m) a -> m (v a) - --- | O(n) Yield a mutable copy of the immutable vector. -thaw :: (PrimMonad m, Vector v a) => v a -> m (Mutable v (PrimState m) a) - --- | O(n) Copy an immutable vector into a mutable one. The two --- vectors must have the same length. -copy :: (PrimMonad m, Vector v a) => Mutable v (PrimState m) a -> v a -> m () - --- | O(1) Convert a vector to a Stream -stream :: Vector v a => v a -> Stream a - --- | O(n) Construct a vector from a Stream -unstream :: Vector v a => Stream a -> v a - --- | O(1) Convert a vector to a Stream, proceeding from right --- to left -streamR :: Vector v a => v a -> Stream a - --- | O(n) Construct a vector from a Stream, proceeding from --- right to left -unstreamR :: Vector v a => Stream a -> v a - --- | Construct a vector from a monadic initialiser. -new :: Vector v a => New v a -> v a - --- | Convert a vector to an initialiser which, when run, produces a copy of --- the vector. -clone :: Vector v a => v a -> New v a - --- | O(n) Check if two vectors are equal. All Vector --- instances are also instances of Eq and it is usually more --- appropriate to use those. This function is primarily intended for --- implementing Eq instances for new vector types. -eq :: (Vector v a, Eq a) => v a -> v a -> Bool - --- | O(n) Compare two vectors lexicographically. All Vector --- instances are also instances of Ord and it is usually more --- appropriate to use those. This function is primarily intended for --- implementing Ord instances for new vector types. -cmp :: (Vector v a, Ord a) => v a -> v a -> Ordering - --- | Generic definion of Data.Data.gfoldl that views a --- Vector as a list. -gfoldl :: (Vector v a, Data a) => (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> v a -> c (v a) -dataCast :: (Vector v a, Data a, Typeable1 v, Typeable1 t) => (forall d. Data d => c (t d)) -> Maybe (c (v a)) -mkType :: String -> DataType - - --- | Safe interface to Data.Vector.Generic.New -module Data.Vector.Generic.New.Safe -data New v a -New :: (forall s. ST s (Mutable v s a)) -> New v a -create :: (forall s. ST s (Mutable v s a)) -> New v a -run :: New v a -> ST s (Mutable v s a) -apply :: (forall s. Mutable v s a -> Mutable v s a) -> New v a -> New v a -modify :: (forall s. Mutable v s a -> ST s ()) -> New v a -> New v a -modifyWithStream :: (forall s. Mutable v s a -> Stream b -> ST s ()) -> New v a -> Stream b -> New v a -unstream :: Vector v a => Stream a -> New v a -transform :: Vector v a => (forall m. Monad m => MStream m a -> MStream m a) -> New v a -> New v a -unstreamR :: Vector v a => Stream a -> New v a -transformR :: Vector v a => (forall m. Monad m => MStream m a -> MStream m a) -> New v a -> New v a -slice :: Vector v a => Int -> Int -> New v a -> New v a -init :: Vector v a => New v a -> New v a -tail :: Vector v a => New v a -> New v a -take :: Vector v a => Int -> New v a -> New v a -drop :: Vector v a => Int -> New v a -> New v a - - --- | Mutable primitive vectors. -module Data.Vector.Primitive.Mutable - --- | Mutable vectors of primitive types. -data MVector s a -MVector :: {-# UNPACK #-} !Int -> {-# UNPACK #-} !Int -> {-# UNPACK #-} !MutableByteArray s -> MVector s a -type IOVector = MVector RealWorld -type STVector s = MVector s - --- | Class of types supporting primitive array operations -class Prim a - --- | Length of the mutable vector. -length :: Prim a => MVector s a -> Int - --- | Check whether the vector is empty -null :: Prim a => MVector s a -> Bool - --- | Yield a part of the mutable vector without copying it. -slice :: Prim a => Int -> Int -> MVector s a -> MVector s a -init :: Prim a => MVector s a -> MVector s a -tail :: Prim a => MVector s a -> MVector s a -take :: Prim a => Int -> MVector s a -> MVector s a -drop :: Prim a => Int -> MVector s a -> MVector s a -splitAt :: Prim a => Int -> MVector s a -> (MVector s a, MVector s a) - --- | Yield a part of the mutable vector without copying it. No bounds --- checks are performed. -unsafeSlice :: Prim a => Int -> Int -> MVector s a -> MVector s a -unsafeInit :: Prim a => MVector s a -> MVector s a -unsafeTail :: Prim a => MVector s a -> MVector s a -unsafeTake :: Prim a => Int -> MVector s a -> MVector s a -unsafeDrop :: Prim a => Int -> MVector s a -> MVector s a -overlaps :: Prim a => MVector s a -> MVector s a -> Bool - --- | Create a mutable vector of the given length. -new :: (PrimMonad m, Prim a) => Int -> m (MVector (PrimState m) a) - --- | Create a mutable vector of the given length. The length is not --- checked. -unsafeNew :: (PrimMonad m, Prim a) => Int -> m (MVector (PrimState m) a) - --- | Create a mutable vector of the given length (0 if the length is --- negative) and fill it with an initial value. -replicate :: (PrimMonad m, Prim a) => Int -> a -> m (MVector (PrimState m) a) - --- | Create a mutable vector of the given length (0 if the length is --- negative) and fill it with values produced by repeatedly executing the --- monadic action. -replicateM :: (PrimMonad m, Prim a) => Int -> m a -> m (MVector (PrimState m) a) - --- | Create a copy of a mutable vector. -clone :: (PrimMonad m, Prim a) => MVector (PrimState m) a -> m (MVector (PrimState m) a) - --- | Grow a vector by the given number of elements. The number must be --- positive. -grow :: (PrimMonad m, Prim a) => MVector (PrimState m) a -> Int -> m (MVector (PrimState m) a) - --- | Grow a vector by the given number of elements. The number must be --- positive but this is not checked. -unsafeGrow :: (PrimMonad m, Prim a) => MVector (PrimState m) a -> Int -> m (MVector (PrimState m) a) - --- | Reset all elements of the vector to some undefined value, clearing all --- references to external objects. This is usually a noop for unboxed --- vectors. -clear :: (PrimMonad m, Prim a) => MVector (PrimState m) a -> m () - --- | Yield the element at the given position. -read :: (PrimMonad m, Prim a) => MVector (PrimState m) a -> Int -> m a - --- | Replace the element at the given position. -write :: (PrimMonad m, Prim a) => MVector (PrimState m) a -> Int -> a -> m () - --- | Swap the elements at the given positions. -swap :: (PrimMonad m, Prim a) => MVector (PrimState m) a -> Int -> Int -> m () - --- | Yield the element at the given position. No bounds checks are --- performed. -unsafeRead :: (PrimMonad m, Prim a) => MVector (PrimState m) a -> Int -> m a - --- | Replace the element at the given position. No bounds checks are --- performed. -unsafeWrite :: (PrimMonad m, Prim a) => MVector (PrimState m) a -> Int -> a -> m () - --- | Swap the elements at the given positions. No bounds checks are --- performed. -unsafeSwap :: (PrimMonad m, Prim a) => MVector (PrimState m) a -> Int -> Int -> m () - --- | Set all elements of the vector to the given value. -set :: (PrimMonad m, Prim a) => MVector (PrimState m) a -> a -> m () - --- | Copy a vector. The two vectors must have the same length and may not --- overlap. -copy :: (PrimMonad m, Prim a) => MVector (PrimState m) a -> MVector (PrimState m) a -> m () - --- | Move the contents of a vector. The two vectors must have the same --- length. --- --- If the vectors do not overlap, then this is equivalent to copy. --- Otherwise, the copying is performed as if the source vector were --- copied to a temporary vector and then the temporary vector was copied --- to the target vector. -move :: (PrimMonad m, Prim a) => MVector (PrimState m) a -> MVector (PrimState m) a -> m () - --- | Copy a vector. The two vectors must have the same length and may not --- overlap. This is not checked. -unsafeCopy :: (PrimMonad m, Prim a) => MVector (PrimState m) a -> MVector (PrimState m) a -> m () - --- | Move the contents of a vector. The two vectors must have the same --- length, but this is not checked. --- --- If the vectors do not overlap, then this is equivalent to --- unsafeCopy. Otherwise, the copying is performed as if the --- source vector were copied to a temporary vector and then the temporary --- vector was copied to the target vector. -unsafeMove :: (PrimMonad m, Prim a) => MVector (PrimState m) a -> MVector (PrimState m) a -> m () -instance Typeable2 MVector -instance Prim a => MVector MVector a - - --- | Unboxed vectors of primitive types. The use of this module is not --- recommended except in very special cases. Adaptive unboxed vectors --- defined in Data.Vector.Unboxed are significantly more flexible --- at no performance cost. -module Data.Vector.Primitive - --- | Unboxed vectors of primitive types -data Vector a - --- | Mutable vectors of primitive types. -data MVector s a -MVector :: {-# UNPACK #-} !Int -> {-# UNPACK #-} !Int -> {-# UNPACK #-} !MutableByteArray s -> MVector s a - --- | Class of types supporting primitive array operations -class Prim a - --- | O(1) Yield the length of the vector. -length :: Prim a => Vector a -> Int - --- | O(1) Test whether a vector if empty -null :: Prim a => Vector a -> Bool - --- | O(1) Indexing -(!) :: Prim a => Vector a -> Int -> a - --- | O(1) Safe indexing -(!?) :: Prim a => Vector a -> Int -> Maybe a - --- | O(1) First element -head :: Prim a => Vector a -> a - --- | O(1) Last element -last :: Prim a => Vector a -> a - --- | O(1) Unsafe indexing without bounds checking -unsafeIndex :: Prim a => Vector a -> Int -> a - --- | O(1) First element without checking if the vector is empty -unsafeHead :: Prim a => Vector a -> a - --- | O(1) Last element without checking if the vector is empty -unsafeLast :: Prim a => Vector a -> a - --- | O(1) Indexing in a monad. --- --- The monad allows operations to be strict in the vector when necessary. --- Suppose vector copying is implemented like this: --- --- 
---   copy mv v = ... write mv i (v ! i) ...
---
--- --- For lazy vectors, v ! i would not be evaluated which means --- that mv would unnecessarily retain a reference to v --- in each element written. --- --- With indexM, copying can be implemented like this instead: --- --- 
---   copy mv v = ... do
---                     x <- indexM v i
---                     write mv i x
---
--- --- Here, no references to v are retained because indexing (but --- not the elements) is evaluated eagerly. -indexM :: (Prim a, Monad m) => Vector a -> Int -> m a - --- | O(1) First element of a vector in a monad. See indexM --- for an explanation of why this is useful. -headM :: (Prim a, Monad m) => Vector a -> m a - --- | O(1) Last element of a vector in a monad. See indexM for --- an explanation of why this is useful. -lastM :: (Prim a, Monad m) => Vector a -> m a - --- | O(1) Indexing in a monad without bounds checks. See --- indexM for an explanation of why this is useful. -unsafeIndexM :: (Prim a, Monad m) => Vector a -> Int -> m a - --- | O(1) First element in a monad without checking for empty --- vectors. See indexM for an explanation of why this is useful. -unsafeHeadM :: (Prim a, Monad m) => Vector a -> m a - --- | O(1) Last element in a monad without checking for empty --- vectors. See indexM for an explanation of why this is useful. -unsafeLastM :: (Prim a, Monad m) => Vector a -> m a - --- | O(1) Yield a slice of the vector without copying it. The vector --- must contain at least i+n elements. -slice :: Prim a => Int -> Int -> Vector a -> Vector a - --- | O(1) Yield all but the last element without copying. The vector --- may not be empty. -init :: Prim a => Vector a -> Vector a - --- | O(1) Yield all but the first element without copying. The --- vector may not be empty. -tail :: Prim a => Vector a -> Vector a - --- | O(1) Yield at the first n elements without copying. --- The vector may contain less than n elements in which case it --- is returned unchanged. -take :: Prim a => Int -> Vector a -> Vector a - --- | O(1) Yield all but the first n elements without --- copying. The vector may contain less than n elements in which --- case an empty vector is returned. -drop :: Prim a => Int -> Vector a -> Vector a - --- | O(1) Yield the first n elements paired with the --- remainder without copying. --- --- Note that splitAt n v is equivalent to --- (take n v, drop n v) but slightly more --- efficient. -splitAt :: Prim a => Int -> Vector a -> (Vector a, Vector a) - --- | O(1) Yield a slice of the vector without copying. The vector --- must contain at least i+n elements but this is not checked. -unsafeSlice :: Prim a => Int -> Int -> Vector a -> Vector a - --- | O(1) Yield all but the last element without copying. The vector --- may not be empty but this is not checked. -unsafeInit :: Prim a => Vector a -> Vector a - --- | O(1) Yield all but the first element without copying. The --- vector may not be empty but this is not checked. -unsafeTail :: Prim a => Vector a -> Vector a - --- | O(1) Yield the first n elements without copying. The --- vector must contain at least n elements but this is not --- checked. -unsafeTake :: Prim a => Int -> Vector a -> Vector a - --- | O(1) Yield all but the first n elements without --- copying. The vector must contain at least n elements but this --- is not checked. -unsafeDrop :: Prim a => Int -> Vector a -> Vector a - --- | O(1) Empty vector -empty :: Prim a => Vector a - --- | O(1) Vector with exactly one element -singleton :: Prim a => a -> Vector a - --- | O(n) Vector of the given length with the same value in each --- position -replicate :: Prim a => Int -> a -> Vector a - --- | O(n) Construct a vector of the given length by applying the --- function to each index -generate :: Prim a => Int -> (Int -> a) -> Vector a - --- | O(n) Apply function n times to value. Zeroth element is --- original value. -iterateN :: Prim a => Int -> (a -> a) -> a -> Vector a - --- | O(n) Execute the monadic action the given number of times and --- store the results in a vector. -replicateM :: (Monad m, Prim a) => Int -> m a -> m (Vector a) - --- | O(n) Construct a vector of the given length by applying the --- monadic action to each index -generateM :: (Monad m, Prim a) => Int -> (Int -> m a) -> m (Vector a) - --- | Execute the monadic action and freeze the resulting vector. --- --- 
---   create (do { v <- new 2; write v 0 'a'; write v 1 'b' }) = <a,b>
---
-create :: Prim a => (forall s. ST s (MVector s a)) -> Vector a - --- | O(n) Construct a vector by repeatedly applying the generator --- function to a seed. The generator function yields Just the next --- element and the new seed or Nothing if there are no more --- elements. --- --- 
---   unfoldr (\n -> if n == 0 then Nothing else Just (n,n-1)) 10
---    = <10,9,8,7,6,5,4,3,2,1>
---
-unfoldr :: Prim a => (b -> Maybe (a, b)) -> b -> Vector a - --- | O(n) Construct a vector with at most n by repeatedly --- applying the generator function to the a seed. The generator function --- yields Just the next element and the new seed or Nothing --- if there are no more elements. --- --- 
---   unfoldrN 3 (\n -> Just (n,n-1)) 10 = <10,9,8>
---
-unfoldrN :: Prim a => Int -> (b -> Maybe (a, b)) -> b -> Vector a - --- | O(n) Construct a vector with n elements by repeatedly --- applying the generator function to the already constructed part of the --- vector. --- --- 
---   constructN 3 f = let a = f <> ; b = f <a> ; c = f <a,b> in f <a,b,c>
---
-constructN :: Prim a => Int -> (Vector a -> a) -> Vector a - --- | O(n) Construct a vector with n elements from right to --- left by repeatedly applying the generator function to the already --- constructed part of the vector. --- --- 
---   constructrN 3 f = let a = f <> ; b = f<a> ; c = f <b,a> in f <c,b,a>
---
-constructrN :: Prim a => Int -> (Vector a -> a) -> Vector a - --- | O(n) Yield a vector of the given length containing the values --- x, x+1 etc. This operation is usually more efficient --- than enumFromTo. --- --- 
---   enumFromN 5 3 = <5,6,7>
---
-enumFromN :: (Prim a, Num a) => a -> Int -> Vector a - --- | O(n) Yield a vector of the given length containing the values --- x, x+y, x+y+y etc. This operations is --- usually more efficient than enumFromThenTo. --- --- 
---   enumFromStepN 1 0.1 5 = <1,1.1,1.2,1.3,1.4>
---
-enumFromStepN :: (Prim a, Num a) => a -> a -> Int -> Vector a - --- | O(n) Enumerate values from x to y. --- --- WARNING: This operation can be very inefficient. If at all --- possible, use enumFromN instead. -enumFromTo :: (Prim a, Enum a) => a -> a -> Vector a - --- | O(n) Enumerate values from x to y with a --- specific step z. --- --- WARNING: This operation can be very inefficient. If at all --- possible, use enumFromStepN instead. -enumFromThenTo :: (Prim a, Enum a) => a -> a -> a -> Vector a - --- | O(n) Prepend an element -cons :: Prim a => a -> Vector a -> Vector a - --- | O(n) Append an element -snoc :: Prim a => Vector a -> a -> Vector a - --- | O(m+n) Concatenate two vectors -(++) :: Prim a => Vector a -> Vector a -> Vector a - --- | O(n) Concatenate all vectors in the list -concat :: Prim a => [Vector a] -> Vector a - --- | O(n) Yield the argument but force it not to retain any extra --- memory, possibly by copying it. --- --- This is especially useful when dealing with slices. For example: --- --- 
---   force (slice 0 2 <huge vector>)
---
--- --- Here, the slice retains a reference to the huge vector. Forcing it --- creates a copy of just the elements that belong to the slice and --- allows the huge vector to be garbage collected. -force :: Prim a => Vector a -> Vector a - --- | O(m+n) For each pair (i,a) from the list, replace the --- vector element at position i by a. --- --- 
---   <5,9,2,7> // [(2,1),(0,3),(2,8)] = <3,9,8,7>
---
-(//) :: Prim a => Vector a -> [(Int, a)] -> Vector a - --- | O(m+min(n1,n2)) For each index i from the index vector --- and the corresponding value a from the value vector, replace --- the element of the initial vector at position i by --- a. --- --- 
---   update_ <5,9,2,7>  <2,0,2> <1,3,8> = <3,9,8,7>
---
-update_ :: Prim a => Vector a -> Vector Int -> Vector a -> Vector a - --- | Same as (//) but without bounds checking. -unsafeUpd :: Prim a => Vector a -> [(Int, a)] -> Vector a - --- | Same as update_ but without bounds checking. -unsafeUpdate_ :: Prim a => Vector a -> Vector Int -> Vector a -> Vector a - --- | O(m+n) For each pair (i,b) from the list, replace the --- vector element a at position i by f a b. --- --- 
---   accum (+) <5,9,2> [(2,4),(1,6),(0,3),(1,7)] = <5+3, 9+6+7, 2+4>
---
-accum :: Prim a => (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a - --- | O(m+min(n1,n2)) For each index i from the index vector --- and the corresponding value b from the the value vector, --- replace the element of the initial vector at position i by --- f a b. --- --- 
---   accumulate_ (+) <5,9,2> <2,1,0,1> <4,6,3,7> = <5+3, 9+6+7, 2+4>
---
-accumulate_ :: (Prim a, Prim b) => (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a - --- | Same as accum but without bounds checking. -unsafeAccum :: Prim a => (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a - --- | Same as accumulate_ but without bounds checking. -unsafeAccumulate_ :: (Prim a, Prim b) => (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a - --- | O(n) Reverse a vector -reverse :: Prim a => Vector a -> Vector a - --- | O(n) Yield the vector obtained by replacing each element --- i of the index vector by xs!i. This is --- equivalent to map (xs!) is but is often much --- more efficient. --- --- 
---   backpermute <a,b,c,d> <0,3,2,3,1,0> = <a,d,c,d,b,a>
---
-backpermute :: Prim a => Vector a -> Vector Int -> Vector a - --- | Same as backpermute but without bounds checking. -unsafeBackpermute :: Prim a => Vector a -> Vector Int -> Vector a - --- | Apply a destructive operation to a vector. The operation will be --- performed in place if it is safe to do so and will modify a copy of --- the vector otherwise. --- --- 
---   modify (\v -> write v 0 'x') (replicate 3 'a') = <'x','a','a'>
---
-modify :: Prim a => (forall s. MVector s a -> ST s ()) -> Vector a -> Vector a - --- | O(n) Map a function over a vector -map :: (Prim a, Prim b) => (a -> b) -> Vector a -> Vector b - --- | O(n) Apply a function to every element of a vector and its --- index -imap :: (Prim a, Prim b) => (Int -> a -> b) -> Vector a -> Vector b - --- | Map a function over a vector and concatenate the results. -concatMap :: (Prim a, Prim b) => (a -> Vector b) -> Vector a -> Vector b - --- | O(n) Apply the monadic action to all elements of the vector, --- yielding a vector of results -mapM :: (Monad m, Prim a, Prim b) => (a -> m b) -> Vector a -> m (Vector b) - --- | O(n) Apply the monadic action to all elements of a vector and --- ignore the results -mapM_ :: (Monad m, Prim a) => (a -> m b) -> Vector a -> m () - --- | O(n) Apply the monadic action to all elements of the vector, --- yielding a vector of results. Equvalent to flip mapM. -forM :: (Monad m, Prim a, Prim b) => Vector a -> (a -> m b) -> m (Vector b) - --- | O(n) Apply the monadic action to all elements of a vector and --- ignore the results. Equivalent to flip mapM_. -forM_ :: (Monad m, Prim a) => Vector a -> (a -> m b) -> m () - --- | O(min(m,n)) Zip two vectors with the given function. -zipWith :: (Prim a, Prim b, Prim c) => (a -> b -> c) -> Vector a -> Vector b -> Vector c - --- | Zip three vectors with the given function. -zipWith3 :: (Prim a, Prim b, Prim c, Prim d) => (a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d -zipWith4 :: (Prim a, Prim b, Prim c, Prim d, Prim e) => (a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -zipWith5 :: (Prim a, Prim b, Prim c, Prim d, Prim e, Prim f) => (a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -zipWith6 :: (Prim a, Prim b, Prim c, Prim d, Prim e, Prim f, Prim g) => (a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g - --- | O(min(m,n)) Zip two vectors with a function that also takes the --- elements' indices. -izipWith :: (Prim a, Prim b, Prim c) => (Int -> a -> b -> c) -> Vector a -> Vector b -> Vector c - --- | Zip three vectors and their indices with the given function. -izipWith3 :: (Prim a, Prim b, Prim c, Prim d) => (Int -> a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d -izipWith4 :: (Prim a, Prim b, Prim c, Prim d, Prim e) => (Int -> a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -izipWith5 :: (Prim a, Prim b, Prim c, Prim d, Prim e, Prim f) => (Int -> a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -izipWith6 :: (Prim a, Prim b, Prim c, Prim d, Prim e, Prim f, Prim g) => (Int -> a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g - --- | O(min(m,n)) Zip the two vectors with the monadic action and --- yield a vector of results -zipWithM :: (Monad m, Prim a, Prim b, Prim c) => (a -> b -> m c) -> Vector a -> Vector b -> m (Vector c) - --- | O(min(m,n)) Zip the two vectors with the monadic action and --- ignore the results -zipWithM_ :: (Monad m, Prim a, Prim b) => (a -> b -> m c) -> Vector a -> Vector b -> m () - --- | O(n) Drop elements that do not satisfy the predicate -filter :: Prim a => (a -> Bool) -> Vector a -> Vector a - --- | O(n) Drop elements that do not satisfy the predicate which is --- applied to values and their indices -ifilter :: Prim a => (Int -> a -> Bool) -> Vector a -> Vector a - --- | O(n) Drop elements that do not satisfy the monadic predicate -filterM :: (Monad m, Prim a) => (a -> m Bool) -> Vector a -> m (Vector a) - --- | O(n) Yield the longest prefix of elements satisfying the --- predicate without copying. -takeWhile :: Prim a => (a -> Bool) -> Vector a -> Vector a - --- | O(n) Drop the longest prefix of elements that satisfy the --- predicate without copying. -dropWhile :: Prim a => (a -> Bool) -> Vector a -> Vector a - --- | O(n) Split the vector in two parts, the first one containing --- those elements that satisfy the predicate and the second one those --- that don't. The relative order of the elements is preserved at the --- cost of a sometimes reduced performance compared to --- unstablePartition. -partition :: Prim a => (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Split the vector in two parts, the first one containing --- those elements that satisfy the predicate and the second one those --- that don't. The order of the elements is not preserved but the --- operation is often faster than partition. -unstablePartition :: Prim a => (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Split the vector into the longest prefix of elements that --- satisfy the predicate and the rest without copying. -span :: Prim a => (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Split the vector into the longest prefix of elements that --- do not satisfy the predicate and the rest without copying. -break :: Prim a => (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Check if the vector contains an element -elem :: (Prim a, Eq a) => a -> Vector a -> Bool - --- | O(n) Check if the vector does not contain an element (inverse --- of elem) -notElem :: (Prim a, Eq a) => a -> Vector a -> Bool - --- | O(n) Yield Just the first element matching the predicate --- or Nothing if no such element exists. -find :: Prim a => (a -> Bool) -> Vector a -> Maybe a - --- | O(n) Yield Just the index of the first element matching --- the predicate or Nothing if no such element exists. -findIndex :: Prim a => (a -> Bool) -> Vector a -> Maybe Int - --- | O(n) Yield the indices of elements satisfying the predicate in --- ascending order. -findIndices :: Prim a => (a -> Bool) -> Vector a -> Vector Int - --- | O(n) Yield Just the index of the first occurence of the --- given element or Nothing if the vector does not contain the --- element. This is a specialised version of findIndex. -elemIndex :: (Prim a, Eq a) => a -> Vector a -> Maybe Int - --- | O(n) Yield the indices of all occurences of the given element --- in ascending order. This is a specialised version of --- findIndices. -elemIndices :: (Prim a, Eq a) => a -> Vector a -> Vector Int - --- | O(n) Left fold -foldl :: Prim b => (a -> b -> a) -> a -> Vector b -> a - --- | O(n) Left fold on non-empty vectors -foldl1 :: Prim a => (a -> a -> a) -> Vector a -> a - --- | O(n) Left fold with strict accumulator -foldl' :: Prim b => (a -> b -> a) -> a -> Vector b -> a - --- | O(n) Left fold on non-empty vectors with strict accumulator -foldl1' :: Prim a => (a -> a -> a) -> Vector a -> a - --- | O(n) Right fold -foldr :: Prim a => (a -> b -> b) -> b -> Vector a -> b - --- | O(n) Right fold on non-empty vectors -foldr1 :: Prim a => (a -> a -> a) -> Vector a -> a - --- | O(n) Right fold with a strict accumulator -foldr' :: Prim a => (a -> b -> b) -> b -> Vector a -> b - --- | O(n) Right fold on non-empty vectors with strict accumulator -foldr1' :: Prim a => (a -> a -> a) -> Vector a -> a - --- | O(n) Left fold (function applied to each element and its index) -ifoldl :: Prim b => (a -> Int -> b -> a) -> a -> Vector b -> a - --- | O(n) Left fold with strict accumulator (function applied to --- each element and its index) -ifoldl' :: Prim b => (a -> Int -> b -> a) -> a -> Vector b -> a - --- | O(n) Right fold (function applied to each element and its --- index) -ifoldr :: Prim a => (Int -> a -> b -> b) -> b -> Vector a -> b - --- | O(n) Right fold with strict accumulator (function applied to --- each element and its index) -ifoldr' :: Prim a => (Int -> a -> b -> b) -> b -> Vector a -> b - --- | O(n) Check if all elements satisfy the predicate. -all :: Prim a => (a -> Bool) -> Vector a -> Bool - --- | O(n) Check if any element satisfies the predicate. -any :: Prim a => (a -> Bool) -> Vector a -> Bool - --- | O(n) Compute the sum of the elements -sum :: (Prim a, Num a) => Vector a -> a - --- | O(n) Compute the produce of the elements -product :: (Prim a, Num a) => Vector a -> a - --- | O(n) Yield the maximum element of the vector. The vector may --- not be empty. -maximum :: (Prim a, Ord a) => Vector a -> a - --- | O(n) Yield the maximum element of the vector according to the --- given comparison function. The vector may not be empty. -maximumBy :: Prim a => (a -> a -> Ordering) -> Vector a -> a - --- | O(n) Yield the minimum element of the vector. The vector may --- not be empty. -minimum :: (Prim a, Ord a) => Vector a -> a - --- | O(n) Yield the minimum element of the vector according to the --- given comparison function. The vector may not be empty. -minimumBy :: Prim a => (a -> a -> Ordering) -> Vector a -> a - --- | O(n) Yield the index of the minimum element of the vector. The --- vector may not be empty. -minIndex :: (Prim a, Ord a) => Vector a -> Int - --- | O(n) Yield the index of the minimum element of the vector --- according to the given comparison function. The vector may not be --- empty. -minIndexBy :: Prim a => (a -> a -> Ordering) -> Vector a -> Int - --- | O(n) Yield the index of the maximum element of the vector. The --- vector may not be empty. -maxIndex :: (Prim a, Ord a) => Vector a -> Int - --- | O(n) Yield the index of the maximum element of the vector --- according to the given comparison function. The vector may not be --- empty. -maxIndexBy :: Prim a => (a -> a -> Ordering) -> Vector a -> Int - --- | O(n) Monadic fold -foldM :: (Monad m, Prim b) => (a -> b -> m a) -> a -> Vector b -> m a - --- | O(n) Monadic fold with strict accumulator -foldM' :: (Monad m, Prim b) => (a -> b -> m a) -> a -> Vector b -> m a - --- | O(n) Monadic fold over non-empty vectors -fold1M :: (Monad m, Prim a) => (a -> a -> m a) -> Vector a -> m a - --- | O(n) Monadic fold over non-empty vectors with strict --- accumulator -fold1M' :: (Monad m, Prim a) => (a -> a -> m a) -> Vector a -> m a - --- | O(n) Monadic fold that discards the result -foldM_ :: (Monad m, Prim b) => (a -> b -> m a) -> a -> Vector b -> m () - --- | O(n) Monadic fold with strict accumulator that discards the --- result -foldM'_ :: (Monad m, Prim b) => (a -> b -> m a) -> a -> Vector b -> m () - --- | O(n) Monadic fold over non-empty vectors that discards the --- result -fold1M_ :: (Monad m, Prim a) => (a -> a -> m a) -> Vector a -> m () - --- | O(n) Monadic fold over non-empty vectors with strict --- accumulator that discards the result -fold1M'_ :: (Monad m, Prim a) => (a -> a -> m a) -> Vector a -> m () - --- | O(n) Prescan --- --- 
---   prescanl f z = init . scanl f z
---
--- --- Example: prescanl (+) 0 <1,2,3,4> = <0,1,3,6> -prescanl :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Prescan with strict accumulator -prescanl' :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Scan --- --- 
---   postscanl f z = tail . scanl f z
---
--- --- Example: postscanl (+) 0 <1,2,3,4> = <1,3,6,10> -postscanl :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Scan with strict accumulator -postscanl' :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Haskell-style scan --- --- 
---   scanl f z <x1,...,xn> = <y1,...,y(n+1)>
---     where y1 = z
---           yi = f y(i-1) x(i-1)
---
--- --- Example: scanl (+) 0 <1,2,3,4> = <0,1,3,6,10> -scanl :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Haskell-style scan with strict accumulator -scanl' :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Scan over a non-empty vector --- --- 
---   scanl f <x1,...,xn> = <y1,...,yn>
---     where y1 = x1
---           yi = f y(i-1) xi
---
-scanl1 :: Prim a => (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Scan over a non-empty vector with a strict accumulator -scanl1' :: Prim a => (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Right-to-left prescan --- --- 
---   prescanr f z = reverse . prescanl (flip f) z . reverse
---
-prescanr :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left prescan with strict accumulator -prescanr' :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left scan -postscanr :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left scan with strict accumulator -postscanr' :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left Haskell-style scan -scanr :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left Haskell-style scan with strict accumulator -scanr' :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left scan over a non-empty vector -scanr1 :: Prim a => (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Right-to-left scan over a non-empty vector with a strict --- accumulator -scanr1' :: Prim a => (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Convert a vector to a list -toList :: Prim a => Vector a -> [a] - --- | O(n) Convert a list to a vector -fromList :: Prim a => [a] -> Vector a - --- | O(n) Convert the first n elements of a list to a --- vector --- --- 
---   fromListN n xs = fromList (take n xs)
---
-fromListN :: Prim a => Int -> [a] -> Vector a - --- | O(n) Convert different vector types -convert :: (Vector v a, Vector w a) => v a -> w a - --- | O(n) Yield an immutable copy of the mutable vector. -freeze :: (Prim a, PrimMonad m) => MVector (PrimState m) a -> m (Vector a) - --- | O(n) Yield a mutable copy of the immutable vector. -thaw :: (Prim a, PrimMonad m) => Vector a -> m (MVector (PrimState m) a) - --- | O(n) Copy an immutable vector into a mutable one. The two --- vectors must have the same length. -copy :: (Prim a, PrimMonad m) => MVector (PrimState m) a -> Vector a -> m () - --- | O(1) Unsafe convert a mutable vector to an immutable one --- without copying. The mutable vector may not be used after this --- operation. -unsafeFreeze :: (Prim a, PrimMonad m) => MVector (PrimState m) a -> m (Vector a) - --- | O(1) Unsafely convert an immutable vector to a mutable one --- without copying. The immutable vector may not be used after this --- operation. -unsafeThaw :: (Prim a, PrimMonad m) => Vector a -> m (MVector (PrimState m) a) - --- | O(n) Copy an immutable vector into a mutable one. The two --- vectors must have the same length. This is not checked. -unsafeCopy :: (Prim a, PrimMonad m) => MVector (PrimState m) a -> Vector a -> m () -instance Typeable1 Vector -instance Prim a => Monoid (Vector a) -instance (Prim a, Ord a) => Ord (Vector a) -instance (Prim a, Eq a) => Eq (Vector a) -instance Prim a => Vector Vector a -instance (Data a, Prim a) => Data (Vector a) -instance (Read a, Prim a) => Read (Vector a) -instance (Show a, Prim a) => Show (Vector a) - - --- | Safe interface to Data.Vector.Primitive -module Data.Vector.Primitive.Safe - --- | Unboxed vectors of primitive types -data Vector a - --- | Mutable vectors of primitive types. -data MVector s a - --- | Class of types supporting primitive array operations -class Prim a - --- | O(1) Yield the length of the vector. -length :: Prim a => Vector a -> Int - --- | O(1) Test whether a vector if empty -null :: Prim a => Vector a -> Bool - --- | O(1) Indexing -(!) :: Prim a => Vector a -> Int -> a - --- | O(1) Safe indexing -(!?) :: Prim a => Vector a -> Int -> Maybe a - --- | O(1) First element -head :: Prim a => Vector a -> a - --- | O(1) Last element -last :: Prim a => Vector a -> a - --- | O(1) Indexing in a monad. --- --- The monad allows operations to be strict in the vector when necessary. --- Suppose vector copying is implemented like this: --- --- 
---   copy mv v = ... write mv i (v ! i) ...
---
--- --- For lazy vectors, v ! i would not be evaluated which means --- that mv would unnecessarily retain a reference to v --- in each element written. --- --- With indexM, copying can be implemented like this instead: --- --- 
---   copy mv v = ... do
---                     x <- indexM v i
---                     write mv i x
---
--- --- Here, no references to v are retained because indexing (but --- not the elements) is evaluated eagerly. -indexM :: (Prim a, Monad m) => Vector a -> Int -> m a - --- | O(1) First element of a vector in a monad. See indexM --- for an explanation of why this is useful. -headM :: (Prim a, Monad m) => Vector a -> m a - --- | O(1) Last element of a vector in a monad. See indexM for --- an explanation of why this is useful. -lastM :: (Prim a, Monad m) => Vector a -> m a - --- | O(1) Yield a slice of the vector without copying it. The vector --- must contain at least i+n elements. -slice :: Prim a => Int -> Int -> Vector a -> Vector a - --- | O(1) Yield all but the last element without copying. The vector --- may not be empty. -init :: Prim a => Vector a -> Vector a - --- | O(1) Yield all but the first element without copying. The --- vector may not be empty. -tail :: Prim a => Vector a -> Vector a - --- | O(1) Yield at the first n elements without copying. --- The vector may contain less than n elements in which case it --- is returned unchanged. -take :: Prim a => Int -> Vector a -> Vector a - --- | O(1) Yield all but the first n elements without --- copying. The vector may contain less than n elements in which --- case an empty vector is returned. -drop :: Prim a => Int -> Vector a -> Vector a - --- | O(1) Yield the first n elements paired with the --- remainder without copying. --- --- Note that splitAt n v is equivalent to --- (take n v, drop n v) but slightly more --- efficient. -splitAt :: Prim a => Int -> Vector a -> (Vector a, Vector a) - --- | O(1) Empty vector -empty :: Prim a => Vector a - --- | O(1) Vector with exactly one element -singleton :: Prim a => a -> Vector a - --- | O(n) Vector of the given length with the same value in each --- position -replicate :: Prim a => Int -> a -> Vector a - --- | O(n) Construct a vector of the given length by applying the --- function to each index -generate :: Prim a => Int -> (Int -> a) -> Vector a - --- | O(n) Apply function n times to value. Zeroth element is --- original value. -iterateN :: Prim a => Int -> (a -> a) -> a -> Vector a - --- | O(n) Execute the monadic action the given number of times and --- store the results in a vector. -replicateM :: (Monad m, Prim a) => Int -> m a -> m (Vector a) - --- | O(n) Construct a vector of the given length by applying the --- monadic action to each index -generateM :: (Monad m, Prim a) => Int -> (Int -> m a) -> m (Vector a) - --- | Execute the monadic action and freeze the resulting vector. --- --- 
---   create (do { v <- new 2; write v 0 'a'; write v 1 'b' }) = <a,b>
---
-create :: Prim a => (forall s. ST s (MVector s a)) -> Vector a - --- | O(n) Construct a vector by repeatedly applying the generator --- function to a seed. The generator function yields Just the next --- element and the new seed or Nothing if there are no more --- elements. --- --- 
---   unfoldr (\n -> if n == 0 then Nothing else Just (n,n-1)) 10
---    = <10,9,8,7,6,5,4,3,2,1>
---
-unfoldr :: Prim a => (b -> Maybe (a, b)) -> b -> Vector a - --- | O(n) Construct a vector with at most n by repeatedly --- applying the generator function to the a seed. The generator function --- yields Just the next element and the new seed or Nothing --- if there are no more elements. --- --- 
---   unfoldrN 3 (\n -> Just (n,n-1)) 10 = <10,9,8>
---
-unfoldrN :: Prim a => Int -> (b -> Maybe (a, b)) -> b -> Vector a - --- | O(n) Construct a vector with n elements by repeatedly --- applying the generator function to the already constructed part of the --- vector. --- --- 
---   constructN 3 f = let a = f <> ; b = f <a> ; c = f <a,b> in f <a,b,c>
---
-constructN :: Prim a => Int -> (Vector a -> a) -> Vector a - --- | O(n) Construct a vector with n elements from right to --- left by repeatedly applying the generator function to the already --- constructed part of the vector. --- --- 
---   constructrN 3 f = let a = f <> ; b = f<a> ; c = f <b,a> in f <c,b,a>
---
-constructrN :: Prim a => Int -> (Vector a -> a) -> Vector a - --- | O(n) Yield a vector of the given length containing the values --- x, x+1 etc. This operation is usually more efficient --- than enumFromTo. --- --- 
---   enumFromN 5 3 = <5,6,7>
---
-enumFromN :: (Prim a, Num a) => a -> Int -> Vector a - --- | O(n) Yield a vector of the given length containing the values --- x, x+y, x+y+y etc. This operations is --- usually more efficient than enumFromThenTo. --- --- 
---   enumFromStepN 1 0.1 5 = <1,1.1,1.2,1.3,1.4>
---
-enumFromStepN :: (Prim a, Num a) => a -> a -> Int -> Vector a - --- | O(n) Enumerate values from x to y. --- --- WARNING: This operation can be very inefficient. If at all --- possible, use enumFromN instead. -enumFromTo :: (Prim a, Enum a) => a -> a -> Vector a - --- | O(n) Enumerate values from x to y with a --- specific step z. --- --- WARNING: This operation can be very inefficient. If at all --- possible, use enumFromStepN instead. -enumFromThenTo :: (Prim a, Enum a) => a -> a -> a -> Vector a - --- | O(n) Prepend an element -cons :: Prim a => a -> Vector a -> Vector a - --- | O(n) Append an element -snoc :: Prim a => Vector a -> a -> Vector a - --- | O(m+n) Concatenate two vectors -(++) :: Prim a => Vector a -> Vector a -> Vector a - --- | O(n) Concatenate all vectors in the list -concat :: Prim a => [Vector a] -> Vector a - --- | O(n) Yield the argument but force it not to retain any extra --- memory, possibly by copying it. --- --- This is especially useful when dealing with slices. For example: --- --- 
---   force (slice 0 2 <huge vector>)
---
--- --- Here, the slice retains a reference to the huge vector. Forcing it --- creates a copy of just the elements that belong to the slice and --- allows the huge vector to be garbage collected. -force :: Prim a => Vector a -> Vector a - --- | O(m+n) For each pair (i,a) from the list, replace the --- vector element at position i by a. --- --- 
---   <5,9,2,7> // [(2,1),(0,3),(2,8)] = <3,9,8,7>
---
-(//) :: Prim a => Vector a -> [(Int, a)] -> Vector a - --- | O(m+min(n1,n2)) For each index i from the index vector --- and the corresponding value a from the value vector, replace --- the element of the initial vector at position i by --- a. --- --- 
---   update_ <5,9,2,7>  <2,0,2> <1,3,8> = <3,9,8,7>
---
-update_ :: Prim a => Vector a -> Vector Int -> Vector a -> Vector a - --- | O(m+n) For each pair (i,b) from the list, replace the --- vector element a at position i by f a b. --- --- 
---   accum (+) <5,9,2> [(2,4),(1,6),(0,3),(1,7)] = <5+3, 9+6+7, 2+4>
---
-accum :: Prim a => (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a - --- | O(m+min(n1,n2)) For each index i from the index vector --- and the corresponding value b from the the value vector, --- replace the element of the initial vector at position i by --- f a b. --- --- 
---   accumulate_ (+) <5,9,2> <2,1,0,1> <4,6,3,7> = <5+3, 9+6+7, 2+4>
---
-accumulate_ :: (Prim a, Prim b) => (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a - --- | O(n) Reverse a vector -reverse :: Prim a => Vector a -> Vector a - --- | O(n) Yield the vector obtained by replacing each element --- i of the index vector by xs!i. This is --- equivalent to map (xs!) is but is often much --- more efficient. --- --- 
---   backpermute <a,b,c,d> <0,3,2,3,1,0> = <a,d,c,d,b,a>
---
-backpermute :: Prim a => Vector a -> Vector Int -> Vector a - --- | Apply a destructive operation to a vector. The operation will be --- performed in place if it is safe to do so and will modify a copy of --- the vector otherwise. --- --- 
---   modify (\v -> write v 0 'x') (replicate 3 'a') = <'x','a','a'>
---
-modify :: Prim a => (forall s. MVector s a -> ST s ()) -> Vector a -> Vector a - --- | O(n) Map a function over a vector -map :: (Prim a, Prim b) => (a -> b) -> Vector a -> Vector b - --- | O(n) Apply a function to every element of a vector and its --- index -imap :: (Prim a, Prim b) => (Int -> a -> b) -> Vector a -> Vector b - --- | Map a function over a vector and concatenate the results. -concatMap :: (Prim a, Prim b) => (a -> Vector b) -> Vector a -> Vector b - --- | O(n) Apply the monadic action to all elements of the vector, --- yielding a vector of results -mapM :: (Monad m, Prim a, Prim b) => (a -> m b) -> Vector a -> m (Vector b) - --- | O(n) Apply the monadic action to all elements of a vector and --- ignore the results -mapM_ :: (Monad m, Prim a) => (a -> m b) -> Vector a -> m () - --- | O(n) Apply the monadic action to all elements of the vector, --- yielding a vector of results. Equvalent to flip mapM. -forM :: (Monad m, Prim a, Prim b) => Vector a -> (a -> m b) -> m (Vector b) - --- | O(n) Apply the monadic action to all elements of a vector and --- ignore the results. Equivalent to flip mapM_. -forM_ :: (Monad m, Prim a) => Vector a -> (a -> m b) -> m () - --- | O(min(m,n)) Zip two vectors with the given function. -zipWith :: (Prim a, Prim b, Prim c) => (a -> b -> c) -> Vector a -> Vector b -> Vector c - --- | Zip three vectors with the given function. -zipWith3 :: (Prim a, Prim b, Prim c, Prim d) => (a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d -zipWith4 :: (Prim a, Prim b, Prim c, Prim d, Prim e) => (a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -zipWith5 :: (Prim a, Prim b, Prim c, Prim d, Prim e, Prim f) => (a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -zipWith6 :: (Prim a, Prim b, Prim c, Prim d, Prim e, Prim f, Prim g) => (a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g - --- | O(min(m,n)) Zip two vectors with a function that also takes the --- elements' indices. -izipWith :: (Prim a, Prim b, Prim c) => (Int -> a -> b -> c) -> Vector a -> Vector b -> Vector c - --- | Zip three vectors and their indices with the given function. -izipWith3 :: (Prim a, Prim b, Prim c, Prim d) => (Int -> a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d -izipWith4 :: (Prim a, Prim b, Prim c, Prim d, Prim e) => (Int -> a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -izipWith5 :: (Prim a, Prim b, Prim c, Prim d, Prim e, Prim f) => (Int -> a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -izipWith6 :: (Prim a, Prim b, Prim c, Prim d, Prim e, Prim f, Prim g) => (Int -> a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g - --- | O(min(m,n)) Zip the two vectors with the monadic action and --- yield a vector of results -zipWithM :: (Monad m, Prim a, Prim b, Prim c) => (a -> b -> m c) -> Vector a -> Vector b -> m (Vector c) - --- | O(min(m,n)) Zip the two vectors with the monadic action and --- ignore the results -zipWithM_ :: (Monad m, Prim a, Prim b) => (a -> b -> m c) -> Vector a -> Vector b -> m () - --- | O(n) Drop elements that do not satisfy the predicate -filter :: Prim a => (a -> Bool) -> Vector a -> Vector a - --- | O(n) Drop elements that do not satisfy the predicate which is --- applied to values and their indices -ifilter :: Prim a => (Int -> a -> Bool) -> Vector a -> Vector a - --- | O(n) Drop elements that do not satisfy the monadic predicate -filterM :: (Monad m, Prim a) => (a -> m Bool) -> Vector a -> m (Vector a) - --- | O(n) Yield the longest prefix of elements satisfying the --- predicate without copying. -takeWhile :: Prim a => (a -> Bool) -> Vector a -> Vector a - --- | O(n) Drop the longest prefix of elements that satisfy the --- predicate without copying. -dropWhile :: Prim a => (a -> Bool) -> Vector a -> Vector a - --- | O(n) Split the vector in two parts, the first one containing --- those elements that satisfy the predicate and the second one those --- that don't. The relative order of the elements is preserved at the --- cost of a sometimes reduced performance compared to --- unstablePartition. -partition :: Prim a => (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Split the vector in two parts, the first one containing --- those elements that satisfy the predicate and the second one those --- that don't. The order of the elements is not preserved but the --- operation is often faster than partition. -unstablePartition :: Prim a => (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Split the vector into the longest prefix of elements that --- satisfy the predicate and the rest without copying. -span :: Prim a => (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Split the vector into the longest prefix of elements that --- do not satisfy the predicate and the rest without copying. -break :: Prim a => (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Check if the vector contains an element -elem :: (Prim a, Eq a) => a -> Vector a -> Bool - --- | O(n) Check if the vector does not contain an element (inverse --- of elem) -notElem :: (Prim a, Eq a) => a -> Vector a -> Bool - --- | O(n) Yield Just the first element matching the predicate --- or Nothing if no such element exists. -find :: Prim a => (a -> Bool) -> Vector a -> Maybe a - --- | O(n) Yield Just the index of the first element matching --- the predicate or Nothing if no such element exists. -findIndex :: Prim a => (a -> Bool) -> Vector a -> Maybe Int - --- | O(n) Yield the indices of elements satisfying the predicate in --- ascending order. -findIndices :: Prim a => (a -> Bool) -> Vector a -> Vector Int - --- | O(n) Yield Just the index of the first occurence of the --- given element or Nothing if the vector does not contain the --- element. This is a specialised version of findIndex. -elemIndex :: (Prim a, Eq a) => a -> Vector a -> Maybe Int - --- | O(n) Yield the indices of all occurences of the given element --- in ascending order. This is a specialised version of --- findIndices. -elemIndices :: (Prim a, Eq a) => a -> Vector a -> Vector Int - --- | O(n) Left fold -foldl :: Prim b => (a -> b -> a) -> a -> Vector b -> a - --- | O(n) Left fold on non-empty vectors -foldl1 :: Prim a => (a -> a -> a) -> Vector a -> a - --- | O(n) Left fold with strict accumulator -foldl' :: Prim b => (a -> b -> a) -> a -> Vector b -> a - --- | O(n) Left fold on non-empty vectors with strict accumulator -foldl1' :: Prim a => (a -> a -> a) -> Vector a -> a - --- | O(n) Right fold -foldr :: Prim a => (a -> b -> b) -> b -> Vector a -> b - --- | O(n) Right fold on non-empty vectors -foldr1 :: Prim a => (a -> a -> a) -> Vector a -> a - --- | O(n) Right fold with a strict accumulator -foldr' :: Prim a => (a -> b -> b) -> b -> Vector a -> b - --- | O(n) Right fold on non-empty vectors with strict accumulator -foldr1' :: Prim a => (a -> a -> a) -> Vector a -> a - --- | O(n) Left fold (function applied to each element and its index) -ifoldl :: Prim b => (a -> Int -> b -> a) -> a -> Vector b -> a - --- | O(n) Left fold with strict accumulator (function applied to --- each element and its index) -ifoldl' :: Prim b => (a -> Int -> b -> a) -> a -> Vector b -> a - --- | O(n) Right fold (function applied to each element and its --- index) -ifoldr :: Prim a => (Int -> a -> b -> b) -> b -> Vector a -> b - --- | O(n) Right fold with strict accumulator (function applied to --- each element and its index) -ifoldr' :: Prim a => (Int -> a -> b -> b) -> b -> Vector a -> b - --- | O(n) Check if all elements satisfy the predicate. -all :: Prim a => (a -> Bool) -> Vector a -> Bool - --- | O(n) Check if any element satisfies the predicate. -any :: Prim a => (a -> Bool) -> Vector a -> Bool - --- | O(n) Compute the sum of the elements -sum :: (Prim a, Num a) => Vector a -> a - --- | O(n) Compute the produce of the elements -product :: (Prim a, Num a) => Vector a -> a - --- | O(n) Yield the maximum element of the vector. The vector may --- not be empty. -maximum :: (Prim a, Ord a) => Vector a -> a - --- | O(n) Yield the maximum element of the vector according to the --- given comparison function. The vector may not be empty. -maximumBy :: Prim a => (a -> a -> Ordering) -> Vector a -> a - --- | O(n) Yield the minimum element of the vector. The vector may --- not be empty. -minimum :: (Prim a, Ord a) => Vector a -> a - --- | O(n) Yield the minimum element of the vector according to the --- given comparison function. The vector may not be empty. -minimumBy :: Prim a => (a -> a -> Ordering) -> Vector a -> a - --- | O(n) Yield the index of the minimum element of the vector. The --- vector may not be empty. -minIndex :: (Prim a, Ord a) => Vector a -> Int - --- | O(n) Yield the index of the minimum element of the vector --- according to the given comparison function. The vector may not be --- empty. -minIndexBy :: Prim a => (a -> a -> Ordering) -> Vector a -> Int - --- | O(n) Yield the index of the maximum element of the vector. The --- vector may not be empty. -maxIndex :: (Prim a, Ord a) => Vector a -> Int - --- | O(n) Yield the index of the maximum element of the vector --- according to the given comparison function. The vector may not be --- empty. -maxIndexBy :: Prim a => (a -> a -> Ordering) -> Vector a -> Int - --- | O(n) Monadic fold -foldM :: (Monad m, Prim b) => (a -> b -> m a) -> a -> Vector b -> m a - --- | O(n) Monadic fold with strict accumulator -foldM' :: (Monad m, Prim b) => (a -> b -> m a) -> a -> Vector b -> m a - --- | O(n) Monadic fold over non-empty vectors -fold1M :: (Monad m, Prim a) => (a -> a -> m a) -> Vector a -> m a - --- | O(n) Monadic fold over non-empty vectors with strict --- accumulator -fold1M' :: (Monad m, Prim a) => (a -> a -> m a) -> Vector a -> m a - --- | O(n) Monadic fold that discards the result -foldM_ :: (Monad m, Prim b) => (a -> b -> m a) -> a -> Vector b -> m () - --- | O(n) Monadic fold with strict accumulator that discards the --- result -foldM'_ :: (Monad m, Prim b) => (a -> b -> m a) -> a -> Vector b -> m () - --- | O(n) Monadic fold over non-empty vectors that discards the --- result -fold1M_ :: (Monad m, Prim a) => (a -> a -> m a) -> Vector a -> m () - --- | O(n) Monadic fold over non-empty vectors with strict --- accumulator that discards the result -fold1M'_ :: (Monad m, Prim a) => (a -> a -> m a) -> Vector a -> m () - --- | O(n) Prescan --- --- 
---   prescanl f z = init . scanl f z
---
--- --- Example: prescanl (+) 0 <1,2,3,4> = <0,1,3,6> -prescanl :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Prescan with strict accumulator -prescanl' :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Scan --- --- 
---   postscanl f z = tail . scanl f z
---
--- --- Example: postscanl (+) 0 <1,2,3,4> = <1,3,6,10> -postscanl :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Scan with strict accumulator -postscanl' :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Haskell-style scan --- --- 
---   scanl f z <x1,...,xn> = <y1,...,y(n+1)>
---     where y1 = z
---           yi = f y(i-1) x(i-1)
---
--- --- Example: scanl (+) 0 <1,2,3,4> = <0,1,3,6,10> -scanl :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Haskell-style scan with strict accumulator -scanl' :: (Prim a, Prim b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Scan over a non-empty vector --- --- 
---   scanl f <x1,...,xn> = <y1,...,yn>
---     where y1 = x1
---           yi = f y(i-1) xi
---
-scanl1 :: Prim a => (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Scan over a non-empty vector with a strict accumulator -scanl1' :: Prim a => (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Right-to-left prescan --- --- 
---   prescanr f z = reverse . prescanl (flip f) z . reverse
---
-prescanr :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left prescan with strict accumulator -prescanr' :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left scan -postscanr :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left scan with strict accumulator -postscanr' :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left Haskell-style scan -scanr :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left Haskell-style scan with strict accumulator -scanr' :: (Prim a, Prim b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left scan over a non-empty vector -scanr1 :: Prim a => (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Right-to-left scan over a non-empty vector with a strict --- accumulator -scanr1' :: Prim a => (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Convert a vector to a list -toList :: Prim a => Vector a -> [a] - --- | O(n) Convert a list to a vector -fromList :: Prim a => [a] -> Vector a - --- | O(n) Convert the first n elements of a list to a --- vector --- --- 
---   fromListN n xs = fromList (take n xs)
---
-fromListN :: Prim a => Int -> [a] -> Vector a - --- | O(n) Convert different vector types -convert :: (Vector v a, Vector w a) => v a -> w a - --- | O(n) Yield an immutable copy of the mutable vector. -freeze :: (Prim a, PrimMonad m) => MVector (PrimState m) a -> m (Vector a) - --- | O(n) Yield a mutable copy of the immutable vector. -thaw :: (Prim a, PrimMonad m) => Vector a -> m (MVector (PrimState m) a) - --- | O(n) Copy an immutable vector into a mutable one. The two --- vectors must have the same length. -copy :: (Prim a, PrimMonad m) => MVector (PrimState m) a -> Vector a -> m () - - --- | Safe interface to Data.Vector.Primitive.Mutable -module Data.Vector.Primitive.Mutable.Safe - --- | Mutable vectors of primitive types. -data MVector s a -type IOVector = MVector RealWorld -type STVector s = MVector s - --- | Class of types supporting primitive array operations -class Prim a - --- | Length of the mutable vector. -length :: Prim a => MVector s a -> Int - --- | Check whether the vector is empty -null :: Prim a => MVector s a -> Bool - --- | Yield a part of the mutable vector without copying it. -slice :: Prim a => Int -> Int -> MVector s a -> MVector s a -init :: Prim a => MVector s a -> MVector s a -tail :: Prim a => MVector s a -> MVector s a -take :: Prim a => Int -> MVector s a -> MVector s a -drop :: Prim a => Int -> MVector s a -> MVector s a -splitAt :: Prim a => Int -> MVector s a -> (MVector s a, MVector s a) -overlaps :: Prim a => MVector s a -> MVector s a -> Bool - --- | Create a mutable vector of the given length. -new :: (PrimMonad m, Prim a) => Int -> m (MVector (PrimState m) a) - --- | Create a mutable vector of the given length (0 if the length is --- negative) and fill it with an initial value. -replicate :: (PrimMonad m, Prim a) => Int -> a -> m (MVector (PrimState m) a) - --- | Create a mutable vector of the given length (0 if the length is --- negative) and fill it with values produced by repeatedly executing the --- monadic action. -replicateM :: (PrimMonad m, Prim a) => Int -> m a -> m (MVector (PrimState m) a) - --- | Create a copy of a mutable vector. -clone :: (PrimMonad m, Prim a) => MVector (PrimState m) a -> m (MVector (PrimState m) a) - --- | Grow a vector by the given number of elements. The number must be --- positive. -grow :: (PrimMonad m, Prim a) => MVector (PrimState m) a -> Int -> m (MVector (PrimState m) a) - --- | Reset all elements of the vector to some undefined value, clearing all --- references to external objects. This is usually a noop for unboxed --- vectors. -clear :: (PrimMonad m, Prim a) => MVector (PrimState m) a -> m () - --- | Yield the element at the given position. -read :: (PrimMonad m, Prim a) => MVector (PrimState m) a -> Int -> m a - --- | Replace the element at the given position. -write :: (PrimMonad m, Prim a) => MVector (PrimState m) a -> Int -> a -> m () - --- | Swap the elements at the given positions. -swap :: (PrimMonad m, Prim a) => MVector (PrimState m) a -> Int -> Int -> m () - --- | Set all elements of the vector to the given value. -set :: (PrimMonad m, Prim a) => MVector (PrimState m) a -> a -> m () - --- | Copy a vector. The two vectors must have the same length and may not --- overlap. -copy :: (PrimMonad m, Prim a) => MVector (PrimState m) a -> MVector (PrimState m) a -> m () - --- | Move the contents of a vector. The two vectors must have the same --- length. --- --- If the vectors do not overlap, then this is equivalent to copy. --- Otherwise, the copying is performed as if the source vector were --- copied to a temporary vector and then the temporary vector was copied --- to the target vector. -move :: (PrimMonad m, Prim a) => MVector (PrimState m) a -> MVector (PrimState m) a -> m () - - --- | Mutable vectors based on Storable. -module Data.Vector.Storable.Mutable - --- | Mutable Storable-based vectors -data MVector s a -MVector :: {-# UNPACK #-} !Int -> {-# UNPACK #-} !ForeignPtr a -> MVector s a -type IOVector = MVector RealWorld -type STVector s = MVector s - --- | The member functions of this class facilitate writing values of --- primitive types to raw memory (which may have been allocated with the --- above mentioned routines) and reading values from blocks of raw --- memory. The class, furthermore, includes support for computing the --- storage requirements and alignment restrictions of storable types. --- --- Memory addresses are represented as values of type Ptr --- a, for some a which is an instance of class --- Storable. The type argument to Ptr helps provide some --- valuable type safety in FFI code (you can't mix pointers of different --- types without an explicit cast), while helping the Haskell type system --- figure out which marshalling method is needed for a given pointer. --- --- All marshalling between Haskell and a foreign language ultimately --- boils down to translating Haskell data structures into the binary --- representation of a corresponding data structure of the foreign --- language and vice versa. To code this marshalling in Haskell, it is --- necessary to manipulate primitive data types stored in unstructured --- memory blocks. The class Storable facilitates this manipulation --- on all types for which it is instantiated, which are the standard --- basic types of Haskell, the fixed size Int types --- (Int8, Int16, Int32, Int64), the fixed --- size Word types (Word8, Word16, Word32, --- Word64), StablePtr, all types from --- Foreign.C.Types, as well as Ptr. --- --- Minimal complete definition: sizeOf, alignment, one of --- peek, peekElemOff and peekByteOff, and one of --- poke, pokeElemOff and pokeByteOff. -class Storable a - --- | Length of the mutable vector. -length :: Storable a => MVector s a -> Int - --- | Check whether the vector is empty -null :: Storable a => MVector s a -> Bool - --- | Yield a part of the mutable vector without copying it. -slice :: Storable a => Int -> Int -> MVector s a -> MVector s a -init :: Storable a => MVector s a -> MVector s a -tail :: Storable a => MVector s a -> MVector s a -take :: Storable a => Int -> MVector s a -> MVector s a -drop :: Storable a => Int -> MVector s a -> MVector s a -splitAt :: Storable a => Int -> MVector s a -> (MVector s a, MVector s a) - --- | Yield a part of the mutable vector without copying it. No bounds --- checks are performed. -unsafeSlice :: Storable a => Int -> Int -> MVector s a -> MVector s a -unsafeInit :: Storable a => MVector s a -> MVector s a -unsafeTail :: Storable a => MVector s a -> MVector s a -unsafeTake :: Storable a => Int -> MVector s a -> MVector s a -unsafeDrop :: Storable a => Int -> MVector s a -> MVector s a -overlaps :: Storable a => MVector s a -> MVector s a -> Bool - --- | Create a mutable vector of the given length. -new :: (PrimMonad m, Storable a) => Int -> m (MVector (PrimState m) a) - --- | Create a mutable vector of the given length. The length is not --- checked. -unsafeNew :: (PrimMonad m, Storable a) => Int -> m (MVector (PrimState m) a) - --- | Create a mutable vector of the given length (0 if the length is --- negative) and fill it with an initial value. -replicate :: (PrimMonad m, Storable a) => Int -> a -> m (MVector (PrimState m) a) - --- | Create a mutable vector of the given length (0 if the length is --- negative) and fill it with values produced by repeatedly executing the --- monadic action. -replicateM :: (PrimMonad m, Storable a) => Int -> m a -> m (MVector (PrimState m) a) - --- | Create a copy of a mutable vector. -clone :: (PrimMonad m, Storable a) => MVector (PrimState m) a -> m (MVector (PrimState m) a) - --- | Grow a vector by the given number of elements. The number must be --- positive. -grow :: (PrimMonad m, Storable a) => MVector (PrimState m) a -> Int -> m (MVector (PrimState m) a) - --- | Grow a vector by the given number of elements. The number must be --- positive but this is not checked. -unsafeGrow :: (PrimMonad m, Storable a) => MVector (PrimState m) a -> Int -> m (MVector (PrimState m) a) - --- | Reset all elements of the vector to some undefined value, clearing all --- references to external objects. This is usually a noop for unboxed --- vectors. -clear :: (PrimMonad m, Storable a) => MVector (PrimState m) a -> m () - --- | Yield the element at the given position. -read :: (PrimMonad m, Storable a) => MVector (PrimState m) a -> Int -> m a - --- | Replace the element at the given position. -write :: (PrimMonad m, Storable a) => MVector (PrimState m) a -> Int -> a -> m () - --- | Swap the elements at the given positions. -swap :: (PrimMonad m, Storable a) => MVector (PrimState m) a -> Int -> Int -> m () - --- | Yield the element at the given position. No bounds checks are --- performed. -unsafeRead :: (PrimMonad m, Storable a) => MVector (PrimState m) a -> Int -> m a - --- | Replace the element at the given position. No bounds checks are --- performed. -unsafeWrite :: (PrimMonad m, Storable a) => MVector (PrimState m) a -> Int -> a -> m () - --- | Swap the elements at the given positions. No bounds checks are --- performed. -unsafeSwap :: (PrimMonad m, Storable a) => MVector (PrimState m) a -> Int -> Int -> m () - --- | Set all elements of the vector to the given value. -set :: (PrimMonad m, Storable a) => MVector (PrimState m) a -> a -> m () - --- | Copy a vector. The two vectors must have the same length and may not --- overlap. -copy :: (PrimMonad m, Storable a) => MVector (PrimState m) a -> MVector (PrimState m) a -> m () - --- | Move the contents of a vector. The two vectors must have the same --- length. --- --- If the vectors do not overlap, then this is equivalent to copy. --- Otherwise, the copying is performed as if the source vector were --- copied to a temporary vector and then the temporary vector was copied --- to the target vector. -move :: (PrimMonad m, Storable a) => MVector (PrimState m) a -> MVector (PrimState m) a -> m () - --- | Copy a vector. The two vectors must have the same length and may not --- overlap. This is not checked. -unsafeCopy :: (PrimMonad m, Storable a) => MVector (PrimState m) a -> MVector (PrimState m) a -> m () - --- | Move the contents of a vector. The two vectors must have the same --- length, but this is not checked. --- --- If the vectors do not overlap, then this is equivalent to --- unsafeCopy. Otherwise, the copying is performed as if the --- source vector were copied to a temporary vector and then the temporary --- vector was copied to the target vector. -unsafeMove :: (PrimMonad m, Storable a) => MVector (PrimState m) a -> MVector (PrimState m) a -> m () - --- | O(1) Unsafely cast a mutable vector from one element type to --- another. The operation just changes the type of the underlying pointer --- and does not modify the elements. --- --- The resulting vector contains as many elements as can fit into the --- underlying memory block. -unsafeCast :: (Storable a, Storable b) => MVector s a -> MVector s b - --- | Create a mutable vector from a ForeignPtr with an offset and a --- length. Modifying data through the ForeignPtr afterwards is --- unsafe if the vector could have been frozen before the modification. -unsafeFromForeignPtr :: Storable a => ForeignPtr a -> Int -> Int -> MVector s a - --- | Yield the underlying ForeignPtr together with the offset to the --- data and its length. Modifying the data through the ForeignPtr --- is unsafe if the vector could have frozen before the modification. -unsafeToForeignPtr :: Storable a => MVector s a -> (ForeignPtr a, Int, Int) - --- | Pass a pointer to the vector's data to the IO action. Modifying data --- through the pointer is unsafe if the vector could have been frozen --- before the modification. -unsafeWith :: Storable a => IOVector a -> (Ptr a -> IO b) -> IO b -instance Typeable2 MVector -instance Storable a => MVector MVector a - - --- | Storable-based vectors. -module Data.Vector.Storable - --- | Storable-based vectors -data Vector a - --- | Mutable Storable-based vectors -data MVector s a -MVector :: {-# UNPACK #-} !Int -> {-# UNPACK #-} !ForeignPtr a -> MVector s a - --- | The member functions of this class facilitate writing values of --- primitive types to raw memory (which may have been allocated with the --- above mentioned routines) and reading values from blocks of raw --- memory. The class, furthermore, includes support for computing the --- storage requirements and alignment restrictions of storable types. --- --- Memory addresses are represented as values of type Ptr --- a, for some a which is an instance of class --- Storable. The type argument to Ptr helps provide some --- valuable type safety in FFI code (you can't mix pointers of different --- types without an explicit cast), while helping the Haskell type system --- figure out which marshalling method is needed for a given pointer. --- --- All marshalling between Haskell and a foreign language ultimately --- boils down to translating Haskell data structures into the binary --- representation of a corresponding data structure of the foreign --- language and vice versa. To code this marshalling in Haskell, it is --- necessary to manipulate primitive data types stored in unstructured --- memory blocks. The class Storable facilitates this manipulation --- on all types for which it is instantiated, which are the standard --- basic types of Haskell, the fixed size Int types --- (Int8, Int16, Int32, Int64), the fixed --- size Word types (Word8, Word16, Word32, --- Word64), StablePtr, all types from --- Foreign.C.Types, as well as Ptr. --- --- Minimal complete definition: sizeOf, alignment, one of --- peek, peekElemOff and peekByteOff, and one of --- poke, pokeElemOff and pokeByteOff. -class Storable a - --- | O(1) Yield the length of the vector. -length :: Storable a => Vector a -> Int - --- | O(1) Test whether a vector if empty -null :: Storable a => Vector a -> Bool - --- | O(1) Indexing -(!) :: Storable a => Vector a -> Int -> a - --- | O(1) Safe indexing -(!?) :: Storable a => Vector a -> Int -> Maybe a - --- | O(1) First element -head :: Storable a => Vector a -> a - --- | O(1) Last element -last :: Storable a => Vector a -> a - --- | O(1) Unsafe indexing without bounds checking -unsafeIndex :: Storable a => Vector a -> Int -> a - --- | O(1) First element without checking if the vector is empty -unsafeHead :: Storable a => Vector a -> a - --- | O(1) Last element without checking if the vector is empty -unsafeLast :: Storable a => Vector a -> a - --- | O(1) Indexing in a monad. --- --- The monad allows operations to be strict in the vector when necessary. --- Suppose vector copying is implemented like this: --- --- 
---   copy mv v = ... write mv i (v ! i) ...
---
--- --- For lazy vectors, v ! i would not be evaluated which means --- that mv would unnecessarily retain a reference to v --- in each element written. --- --- With indexM, copying can be implemented like this instead: --- --- 
---   copy mv v = ... do
---                     x <- indexM v i
---                     write mv i x
---
--- --- Here, no references to v are retained because indexing (but --- not the elements) is evaluated eagerly. -indexM :: (Storable a, Monad m) => Vector a -> Int -> m a - --- | O(1) First element of a vector in a monad. See indexM --- for an explanation of why this is useful. -headM :: (Storable a, Monad m) => Vector a -> m a - --- | O(1) Last element of a vector in a monad. See indexM for --- an explanation of why this is useful. -lastM :: (Storable a, Monad m) => Vector a -> m a - --- | O(1) Indexing in a monad without bounds checks. See --- indexM for an explanation of why this is useful. -unsafeIndexM :: (Storable a, Monad m) => Vector a -> Int -> m a - --- | O(1) First element in a monad without checking for empty --- vectors. See indexM for an explanation of why this is useful. -unsafeHeadM :: (Storable a, Monad m) => Vector a -> m a - --- | O(1) Last element in a monad without checking for empty --- vectors. See indexM for an explanation of why this is useful. -unsafeLastM :: (Storable a, Monad m) => Vector a -> m a - --- | O(1) Yield a slice of the vector without copying it. The vector --- must contain at least i+n elements. -slice :: Storable a => Int -> Int -> Vector a -> Vector a - --- | O(1) Yield all but the last element without copying. The vector --- may not be empty. -init :: Storable a => Vector a -> Vector a - --- | O(1) Yield all but the first element without copying. The --- vector may not be empty. -tail :: Storable a => Vector a -> Vector a - --- | O(1) Yield at the first n elements without copying. --- The vector may contain less than n elements in which case it --- is returned unchanged. -take :: Storable a => Int -> Vector a -> Vector a - --- | O(1) Yield all but the first n elements without --- copying. The vector may contain less than n elements in which --- case an empty vector is returned. -drop :: Storable a => Int -> Vector a -> Vector a - --- | O(1) Yield the first n elements paired with the --- remainder without copying. --- --- Note that splitAt n v is equivalent to --- (take n v, drop n v) but slightly more --- efficient. -splitAt :: Storable a => Int -> Vector a -> (Vector a, Vector a) - --- | O(1) Yield a slice of the vector without copying. The vector --- must contain at least i+n elements but this is not checked. -unsafeSlice :: Storable a => Int -> Int -> Vector a -> Vector a - --- | O(1) Yield all but the last element without copying. The vector --- may not be empty but this is not checked. -unsafeInit :: Storable a => Vector a -> Vector a - --- | O(1) Yield all but the first element without copying. The --- vector may not be empty but this is not checked. -unsafeTail :: Storable a => Vector a -> Vector a - --- | O(1) Yield the first n elements without copying. The --- vector must contain at least n elements but this is not --- checked. -unsafeTake :: Storable a => Int -> Vector a -> Vector a - --- | O(1) Yield all but the first n elements without --- copying. The vector must contain at least n elements but this --- is not checked. -unsafeDrop :: Storable a => Int -> Vector a -> Vector a - --- | O(1) Empty vector -empty :: Storable a => Vector a - --- | O(1) Vector with exactly one element -singleton :: Storable a => a -> Vector a - --- | O(n) Vector of the given length with the same value in each --- position -replicate :: Storable a => Int -> a -> Vector a - --- | O(n) Construct a vector of the given length by applying the --- function to each index -generate :: Storable a => Int -> (Int -> a) -> Vector a - --- | O(n) Apply function n times to value. Zeroth element is --- original value. -iterateN :: Storable a => Int -> (a -> a) -> a -> Vector a - --- | O(n) Execute the monadic action the given number of times and --- store the results in a vector. -replicateM :: (Monad m, Storable a) => Int -> m a -> m (Vector a) - --- | O(n) Construct a vector of the given length by applying the --- monadic action to each index -generateM :: (Monad m, Storable a) => Int -> (Int -> m a) -> m (Vector a) - --- | Execute the monadic action and freeze the resulting vector. --- --- 
---   create (do { v <- new 2; write v 0 'a'; write v 1 'b' }) = <a,b>
---
-create :: Storable a => (forall s. ST s (MVector s a)) -> Vector a - --- | O(n) Construct a vector by repeatedly applying the generator --- function to a seed. The generator function yields Just the next --- element and the new seed or Nothing if there are no more --- elements. --- --- 
---   unfoldr (\n -> if n == 0 then Nothing else Just (n,n-1)) 10
---    = <10,9,8,7,6,5,4,3,2,1>
---
-unfoldr :: Storable a => (b -> Maybe (a, b)) -> b -> Vector a - --- | O(n) Construct a vector with at most n by repeatedly --- applying the generator function to the a seed. The generator function --- yields Just the next element and the new seed or Nothing --- if there are no more elements. --- --- 
---   unfoldrN 3 (\n -> Just (n,n-1)) 10 = <10,9,8>
---
-unfoldrN :: Storable a => Int -> (b -> Maybe (a, b)) -> b -> Vector a - --- | O(n) Construct a vector with n elements by repeatedly --- applying the generator function to the already constructed part of the --- vector. --- --- 
---   constructN 3 f = let a = f <> ; b = f <a> ; c = f <a,b> in f <a,b,c>
---
-constructN :: Storable a => Int -> (Vector a -> a) -> Vector a - --- | O(n) Construct a vector with n elements from right to --- left by repeatedly applying the generator function to the already --- constructed part of the vector. --- --- 
---   constructrN 3 f = let a = f <> ; b = f<a> ; c = f <b,a> in f <c,b,a>
---
-constructrN :: Storable a => Int -> (Vector a -> a) -> Vector a - --- | O(n) Yield a vector of the given length containing the values --- x, x+1 etc. This operation is usually more efficient --- than enumFromTo. --- --- 
---   enumFromN 5 3 = <5,6,7>
---
-enumFromN :: (Storable a, Num a) => a -> Int -> Vector a - --- | O(n) Yield a vector of the given length containing the values --- x, x+y, x+y+y etc. This operations is --- usually more efficient than enumFromThenTo. --- --- 
---   enumFromStepN 1 0.1 5 = <1,1.1,1.2,1.3,1.4>
---
-enumFromStepN :: (Storable a, Num a) => a -> a -> Int -> Vector a - --- | O(n) Enumerate values from x to y. --- --- WARNING: This operation can be very inefficient. If at all --- possible, use enumFromN instead. -enumFromTo :: (Storable a, Enum a) => a -> a -> Vector a - --- | O(n) Enumerate values from x to y with a --- specific step z. --- --- WARNING: This operation can be very inefficient. If at all --- possible, use enumFromStepN instead. -enumFromThenTo :: (Storable a, Enum a) => a -> a -> a -> Vector a - --- | O(n) Prepend an element -cons :: Storable a => a -> Vector a -> Vector a - --- | O(n) Append an element -snoc :: Storable a => Vector a -> a -> Vector a - --- | O(m+n) Concatenate two vectors -(++) :: Storable a => Vector a -> Vector a -> Vector a - --- | O(n) Concatenate all vectors in the list -concat :: Storable a => [Vector a] -> Vector a - --- | O(n) Yield the argument but force it not to retain any extra --- memory, possibly by copying it. --- --- This is especially useful when dealing with slices. For example: --- --- 
---   force (slice 0 2 <huge vector>)
---
--- --- Here, the slice retains a reference to the huge vector. Forcing it --- creates a copy of just the elements that belong to the slice and --- allows the huge vector to be garbage collected. -force :: Storable a => Vector a -> Vector a - --- | O(m+n) For each pair (i,a) from the list, replace the --- vector element at position i by a. --- --- 
---   <5,9,2,7> // [(2,1),(0,3),(2,8)] = <3,9,8,7>
---
-(//) :: Storable a => Vector a -> [(Int, a)] -> Vector a - --- | O(m+min(n1,n2)) For each index i from the index vector --- and the corresponding value a from the value vector, replace --- the element of the initial vector at position i by --- a. --- --- 
---   update_ <5,9,2,7>  <2,0,2> <1,3,8> = <3,9,8,7>
---
-update_ :: Storable a => Vector a -> Vector Int -> Vector a -> Vector a - --- | Same as (//) but without bounds checking. -unsafeUpd :: Storable a => Vector a -> [(Int, a)] -> Vector a - --- | Same as update_ but without bounds checking. -unsafeUpdate_ :: Storable a => Vector a -> Vector Int -> Vector a -> Vector a - --- | O(m+n) For each pair (i,b) from the list, replace the --- vector element a at position i by f a b. --- --- 
---   accum (+) <5,9,2> [(2,4),(1,6),(0,3),(1,7)] = <5+3, 9+6+7, 2+4>
---
-accum :: Storable a => (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a - --- | O(m+min(n1,n2)) For each index i from the index vector --- and the corresponding value b from the the value vector, --- replace the element of the initial vector at position i by --- f a b. --- --- 
---   accumulate_ (+) <5,9,2> <2,1,0,1> <4,6,3,7> = <5+3, 9+6+7, 2+4>
---
-accumulate_ :: (Storable a, Storable b) => (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a - --- | Same as accum but without bounds checking. -unsafeAccum :: Storable a => (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a - --- | Same as accumulate_ but without bounds checking. -unsafeAccumulate_ :: (Storable a, Storable b) => (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a - --- | O(n) Reverse a vector -reverse :: Storable a => Vector a -> Vector a - --- | O(n) Yield the vector obtained by replacing each element --- i of the index vector by xs!i. This is --- equivalent to map (xs!) is but is often much --- more efficient. --- --- 
---   backpermute <a,b,c,d> <0,3,2,3,1,0> = <a,d,c,d,b,a>
---
-backpermute :: Storable a => Vector a -> Vector Int -> Vector a - --- | Same as backpermute but without bounds checking. -unsafeBackpermute :: Storable a => Vector a -> Vector Int -> Vector a - --- | Apply a destructive operation to a vector. The operation will be --- performed in place if it is safe to do so and will modify a copy of --- the vector otherwise. --- --- 
---   modify (\v -> write v 0 'x') (replicate 3 'a') = <'x','a','a'>
---
-modify :: Storable a => (forall s. MVector s a -> ST s ()) -> Vector a -> Vector a - --- | O(n) Map a function over a vector -map :: (Storable a, Storable b) => (a -> b) -> Vector a -> Vector b - --- | O(n) Apply a function to every element of a vector and its --- index -imap :: (Storable a, Storable b) => (Int -> a -> b) -> Vector a -> Vector b - --- | Map a function over a vector and concatenate the results. -concatMap :: (Storable a, Storable b) => (a -> Vector b) -> Vector a -> Vector b - --- | O(n) Apply the monadic action to all elements of the vector, --- yielding a vector of results -mapM :: (Monad m, Storable a, Storable b) => (a -> m b) -> Vector a -> m (Vector b) - --- | O(n) Apply the monadic action to all elements of a vector and --- ignore the results -mapM_ :: (Monad m, Storable a) => (a -> m b) -> Vector a -> m () - --- | O(n) Apply the monadic action to all elements of the vector, --- yielding a vector of results. Equvalent to flip mapM. -forM :: (Monad m, Storable a, Storable b) => Vector a -> (a -> m b) -> m (Vector b) - --- | O(n) Apply the monadic action to all elements of a vector and --- ignore the results. Equivalent to flip mapM_. -forM_ :: (Monad m, Storable a) => Vector a -> (a -> m b) -> m () - --- | O(min(m,n)) Zip two vectors with the given function. -zipWith :: (Storable a, Storable b, Storable c) => (a -> b -> c) -> Vector a -> Vector b -> Vector c - --- | Zip three vectors with the given function. -zipWith3 :: (Storable a, Storable b, Storable c, Storable d) => (a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d -zipWith4 :: (Storable a, Storable b, Storable c, Storable d, Storable e) => (a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -zipWith5 :: (Storable a, Storable b, Storable c, Storable d, Storable e, Storable f) => (a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -zipWith6 :: (Storable a, Storable b, Storable c, Storable d, Storable e, Storable f, Storable g) => (a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g - --- | O(min(m,n)) Zip two vectors with a function that also takes the --- elements' indices. -izipWith :: (Storable a, Storable b, Storable c) => (Int -> a -> b -> c) -> Vector a -> Vector b -> Vector c - --- | Zip three vectors and their indices with the given function. -izipWith3 :: (Storable a, Storable b, Storable c, Storable d) => (Int -> a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d -izipWith4 :: (Storable a, Storable b, Storable c, Storable d, Storable e) => (Int -> a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -izipWith5 :: (Storable a, Storable b, Storable c, Storable d, Storable e, Storable f) => (Int -> a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -izipWith6 :: (Storable a, Storable b, Storable c, Storable d, Storable e, Storable f, Storable g) => (Int -> a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g - --- | O(min(m,n)) Zip the two vectors with the monadic action and --- yield a vector of results -zipWithM :: (Monad m, Storable a, Storable b, Storable c) => (a -> b -> m c) -> Vector a -> Vector b -> m (Vector c) - --- | O(min(m,n)) Zip the two vectors with the monadic action and --- ignore the results -zipWithM_ :: (Monad m, Storable a, Storable b) => (a -> b -> m c) -> Vector a -> Vector b -> m () - --- | O(n) Drop elements that do not satisfy the predicate -filter :: Storable a => (a -> Bool) -> Vector a -> Vector a - --- | O(n) Drop elements that do not satisfy the predicate which is --- applied to values and their indices -ifilter :: Storable a => (Int -> a -> Bool) -> Vector a -> Vector a - --- | O(n) Drop elements that do not satisfy the monadic predicate -filterM :: (Monad m, Storable a) => (a -> m Bool) -> Vector a -> m (Vector a) - --- | O(n) Yield the longest prefix of elements satisfying the --- predicate without copying. -takeWhile :: Storable a => (a -> Bool) -> Vector a -> Vector a - --- | O(n) Drop the longest prefix of elements that satisfy the --- predicate without copying. -dropWhile :: Storable a => (a -> Bool) -> Vector a -> Vector a - --- | O(n) Split the vector in two parts, the first one containing --- those elements that satisfy the predicate and the second one those --- that don't. The relative order of the elements is preserved at the --- cost of a sometimes reduced performance compared to --- unstablePartition. -partition :: Storable a => (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Split the vector in two parts, the first one containing --- those elements that satisfy the predicate and the second one those --- that don't. The order of the elements is not preserved but the --- operation is often faster than partition. -unstablePartition :: Storable a => (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Split the vector into the longest prefix of elements that --- satisfy the predicate and the rest without copying. -span :: Storable a => (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Split the vector into the longest prefix of elements that --- do not satisfy the predicate and the rest without copying. -break :: Storable a => (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Check if the vector contains an element -elem :: (Storable a, Eq a) => a -> Vector a -> Bool - --- | O(n) Check if the vector does not contain an element (inverse --- of elem) -notElem :: (Storable a, Eq a) => a -> Vector a -> Bool - --- | O(n) Yield Just the first element matching the predicate --- or Nothing if no such element exists. -find :: Storable a => (a -> Bool) -> Vector a -> Maybe a - --- | O(n) Yield Just the index of the first element matching --- the predicate or Nothing if no such element exists. -findIndex :: Storable a => (a -> Bool) -> Vector a -> Maybe Int - --- | O(n) Yield the indices of elements satisfying the predicate in --- ascending order. -findIndices :: Storable a => (a -> Bool) -> Vector a -> Vector Int - --- | O(n) Yield Just the index of the first occurence of the --- given element or Nothing if the vector does not contain the --- element. This is a specialised version of findIndex. -elemIndex :: (Storable a, Eq a) => a -> Vector a -> Maybe Int - --- | O(n) Yield the indices of all occurences of the given element --- in ascending order. This is a specialised version of --- findIndices. -elemIndices :: (Storable a, Eq a) => a -> Vector a -> Vector Int - --- | O(n) Left fold -foldl :: Storable b => (a -> b -> a) -> a -> Vector b -> a - --- | O(n) Left fold on non-empty vectors -foldl1 :: Storable a => (a -> a -> a) -> Vector a -> a - --- | O(n) Left fold with strict accumulator -foldl' :: Storable b => (a -> b -> a) -> a -> Vector b -> a - --- | O(n) Left fold on non-empty vectors with strict accumulator -foldl1' :: Storable a => (a -> a -> a) -> Vector a -> a - --- | O(n) Right fold -foldr :: Storable a => (a -> b -> b) -> b -> Vector a -> b - --- | O(n) Right fold on non-empty vectors -foldr1 :: Storable a => (a -> a -> a) -> Vector a -> a - --- | O(n) Right fold with a strict accumulator -foldr' :: Storable a => (a -> b -> b) -> b -> Vector a -> b - --- | O(n) Right fold on non-empty vectors with strict accumulator -foldr1' :: Storable a => (a -> a -> a) -> Vector a -> a - --- | O(n) Left fold (function applied to each element and its index) -ifoldl :: Storable b => (a -> Int -> b -> a) -> a -> Vector b -> a - --- | O(n) Left fold with strict accumulator (function applied to --- each element and its index) -ifoldl' :: Storable b => (a -> Int -> b -> a) -> a -> Vector b -> a - --- | O(n) Right fold (function applied to each element and its --- index) -ifoldr :: Storable a => (Int -> a -> b -> b) -> b -> Vector a -> b - --- | O(n) Right fold with strict accumulator (function applied to --- each element and its index) -ifoldr' :: Storable a => (Int -> a -> b -> b) -> b -> Vector a -> b - --- | O(n) Check if all elements satisfy the predicate. -all :: Storable a => (a -> Bool) -> Vector a -> Bool - --- | O(n) Check if any element satisfies the predicate. -any :: Storable a => (a -> Bool) -> Vector a -> Bool - --- | O(n) Check if all elements are True -and :: Vector Bool -> Bool - --- | O(n) Check if any element is True -or :: Vector Bool -> Bool - --- | O(n) Compute the sum of the elements -sum :: (Storable a, Num a) => Vector a -> a - --- | O(n) Compute the produce of the elements -product :: (Storable a, Num a) => Vector a -> a - --- | O(n) Yield the maximum element of the vector. The vector may --- not be empty. -maximum :: (Storable a, Ord a) => Vector a -> a - --- | O(n) Yield the maximum element of the vector according to the --- given comparison function. The vector may not be empty. -maximumBy :: Storable a => (a -> a -> Ordering) -> Vector a -> a - --- | O(n) Yield the minimum element of the vector. The vector may --- not be empty. -minimum :: (Storable a, Ord a) => Vector a -> a - --- | O(n) Yield the minimum element of the vector according to the --- given comparison function. The vector may not be empty. -minimumBy :: Storable a => (a -> a -> Ordering) -> Vector a -> a - --- | O(n) Yield the index of the minimum element of the vector. The --- vector may not be empty. -minIndex :: (Storable a, Ord a) => Vector a -> Int - --- | O(n) Yield the index of the minimum element of the vector --- according to the given comparison function. The vector may not be --- empty. -minIndexBy :: Storable a => (a -> a -> Ordering) -> Vector a -> Int - --- | O(n) Yield the index of the maximum element of the vector. The --- vector may not be empty. -maxIndex :: (Storable a, Ord a) => Vector a -> Int - --- | O(n) Yield the index of the maximum element of the vector --- according to the given comparison function. The vector may not be --- empty. -maxIndexBy :: Storable a => (a -> a -> Ordering) -> Vector a -> Int - --- | O(n) Monadic fold -foldM :: (Monad m, Storable b) => (a -> b -> m a) -> a -> Vector b -> m a - --- | O(n) Monadic fold with strict accumulator -foldM' :: (Monad m, Storable b) => (a -> b -> m a) -> a -> Vector b -> m a - --- | O(n) Monadic fold over non-empty vectors -fold1M :: (Monad m, Storable a) => (a -> a -> m a) -> Vector a -> m a - --- | O(n) Monadic fold over non-empty vectors with strict --- accumulator -fold1M' :: (Monad m, Storable a) => (a -> a -> m a) -> Vector a -> m a - --- | O(n) Monadic fold that discards the result -foldM_ :: (Monad m, Storable b) => (a -> b -> m a) -> a -> Vector b -> m () - --- | O(n) Monadic fold with strict accumulator that discards the --- result -foldM'_ :: (Monad m, Storable b) => (a -> b -> m a) -> a -> Vector b -> m () - --- | O(n) Monadic fold over non-empty vectors that discards the --- result -fold1M_ :: (Monad m, Storable a) => (a -> a -> m a) -> Vector a -> m () - --- | O(n) Monadic fold over non-empty vectors with strict --- accumulator that discards the result -fold1M'_ :: (Monad m, Storable a) => (a -> a -> m a) -> Vector a -> m () - --- | O(n) Prescan --- --- 
---   prescanl f z = init . scanl f z
---
--- --- Example: prescanl (+) 0 <1,2,3,4> = <0,1,3,6> -prescanl :: (Storable a, Storable b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Prescan with strict accumulator -prescanl' :: (Storable a, Storable b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Scan --- --- 
---   postscanl f z = tail . scanl f z
---
--- --- Example: postscanl (+) 0 <1,2,3,4> = <1,3,6,10> -postscanl :: (Storable a, Storable b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Scan with strict accumulator -postscanl' :: (Storable a, Storable b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Haskell-style scan --- --- 
---   scanl f z <x1,...,xn> = <y1,...,y(n+1)>
---     where y1 = z
---           yi = f y(i-1) x(i-1)
---
--- --- Example: scanl (+) 0 <1,2,3,4> = <0,1,3,6,10> -scanl :: (Storable a, Storable b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Haskell-style scan with strict accumulator -scanl' :: (Storable a, Storable b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Scan over a non-empty vector --- --- 
---   scanl f <x1,...,xn> = <y1,...,yn>
---     where y1 = x1
---           yi = f y(i-1) xi
---
-scanl1 :: Storable a => (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Scan over a non-empty vector with a strict accumulator -scanl1' :: Storable a => (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Right-to-left prescan --- --- 
---   prescanr f z = reverse . prescanl (flip f) z . reverse
---
-prescanr :: (Storable a, Storable b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left prescan with strict accumulator -prescanr' :: (Storable a, Storable b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left scan -postscanr :: (Storable a, Storable b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left scan with strict accumulator -postscanr' :: (Storable a, Storable b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left Haskell-style scan -scanr :: (Storable a, Storable b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left Haskell-style scan with strict accumulator -scanr' :: (Storable a, Storable b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left scan over a non-empty vector -scanr1 :: Storable a => (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Right-to-left scan over a non-empty vector with a strict --- accumulator -scanr1' :: Storable a => (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Convert a vector to a list -toList :: Storable a => Vector a -> [a] - --- | O(n) Convert a list to a vector -fromList :: Storable a => [a] -> Vector a - --- | O(n) Convert the first n elements of a list to a --- vector --- --- 
---   fromListN n xs = fromList (take n xs)
---
-fromListN :: Storable a => Int -> [a] -> Vector a - --- | O(n) Convert different vector types -convert :: (Vector v a, Vector w a) => v a -> w a - --- | O(1) Unsafely cast a vector from one element type to another. --- The operation just changes the type of the underlying pointer and does --- not modify the elements. --- --- The resulting vector contains as many elements as can fit into the --- underlying memory block. -unsafeCast :: (Storable a, Storable b) => Vector a -> Vector b - --- | O(n) Yield an immutable copy of the mutable vector. -freeze :: (Storable a, PrimMonad m) => MVector (PrimState m) a -> m (Vector a) - --- | O(n) Yield a mutable copy of the immutable vector. -thaw :: (Storable a, PrimMonad m) => Vector a -> m (MVector (PrimState m) a) - --- | O(n) Copy an immutable vector into a mutable one. The two --- vectors must have the same length. -copy :: (Storable a, PrimMonad m) => MVector (PrimState m) a -> Vector a -> m () - --- | O(1) Unsafe convert a mutable vector to an immutable one --- without copying. The mutable vector may not be used after this --- operation. -unsafeFreeze :: (Storable a, PrimMonad m) => MVector (PrimState m) a -> m (Vector a) - --- | O(1) Unsafely convert an immutable vector to a mutable one --- without copying. The immutable vector may not be used after this --- operation. -unsafeThaw :: (Storable a, PrimMonad m) => Vector a -> m (MVector (PrimState m) a) - --- | O(n) Copy an immutable vector into a mutable one. The two --- vectors must have the same length. This is not checked. -unsafeCopy :: (Storable a, PrimMonad m) => MVector (PrimState m) a -> Vector a -> m () - --- | O(1) Create a vector from a ForeignPtr with an offset --- and a length. The data may not be modified through the --- ForeignPtr afterwards. -unsafeFromForeignPtr :: Storable a => ForeignPtr a -> Int -> Int -> Vector a - --- | O(1) Yield the underlying ForeignPtr together with the --- offset to the data and its length. The data may not be modified --- through the ForeignPtr. -unsafeToForeignPtr :: Storable a => Vector a -> (ForeignPtr a, Int, Int) - --- | Pass a pointer to the vector's data to the IO action. The data may not --- be modified through the 'Ptr. -unsafeWith :: Storable a => Vector a -> (Ptr a -> IO b) -> IO b -instance Typeable1 Vector -instance Storable a => Monoid (Vector a) -instance (Storable a, Ord a) => Ord (Vector a) -instance (Storable a, Eq a) => Eq (Vector a) -instance Storable a => Vector Vector a -instance (Data a, Storable a) => Data (Vector a) -instance (Read a, Storable a) => Read (Vector a) -instance (Show a, Storable a) => Show (Vector a) - - --- | Adaptive unboxed vectors. The implementation is based on type families --- and picks an efficient, specialised representation for every element --- type. In particular, unboxed vectors of pairs are represented as pairs --- of unboxed vectors. --- --- Implementing unboxed vectors for new data types can be very easy. Here --- is how the library does this for Complex by simply wrapping --- vectors of pairs. --- --- 
---    newtype instance MVector s (Complex a) = MV_Complex (MVector s (a,a))
---    newtype instance Vector    (Complex a) = V_Complex  (Vector    (a,a))
---   
---   instance (RealFloat a, Unbox a) => Data.Vector.Generic.Mutable.MVector MVector (Complex a) where
---      {-# INLINE basicLength #-}
---      basicLength (MV_Complex v) = Data.Vector.Generic.Mutable.basicLength v
---      ...
---   
---   instance (RealFloat a, Unbox a) => Data.Vector.Generic.Vector Vector (Complex a) where
---      {-# INLINE basicLength #-}
---      basicLength (V_Complex v) = Data.Vector.Generic.basicLength v
---      ...
---   
---   instance (RealFloat a, Unbox a) => Unbox (Complex a)
---
-module Data.Vector.Unboxed -class (Vector Vector a, MVector MVector a) => Unbox a - --- | O(1) Yield the length of the vector. -length :: Unbox a => Vector a -> Int - --- | O(1) Test whether a vector if empty -null :: Unbox a => Vector a -> Bool - --- | O(1) Indexing -(!) :: Unbox a => Vector a -> Int -> a - --- | O(1) Safe indexing -(!?) :: Unbox a => Vector a -> Int -> Maybe a - --- | O(1) First element -head :: Unbox a => Vector a -> a - --- | O(1) Last element -last :: Unbox a => Vector a -> a - --- | O(1) Unsafe indexing without bounds checking -unsafeIndex :: Unbox a => Vector a -> Int -> a - --- | O(1) First element without checking if the vector is empty -unsafeHead :: Unbox a => Vector a -> a - --- | O(1) Last element without checking if the vector is empty -unsafeLast :: Unbox a => Vector a -> a - --- | O(1) Indexing in a monad. --- --- The monad allows operations to be strict in the vector when necessary. --- Suppose vector copying is implemented like this: --- --- 
---   copy mv v = ... write mv i (v ! i) ...
---
--- --- For lazy vectors, v ! i would not be evaluated which means --- that mv would unnecessarily retain a reference to v --- in each element written. --- --- With indexM, copying can be implemented like this instead: --- --- 
---   copy mv v = ... do
---                     x <- indexM v i
---                     write mv i x
---
--- --- Here, no references to v are retained because indexing (but --- not the elements) is evaluated eagerly. -indexM :: (Unbox a, Monad m) => Vector a -> Int -> m a - --- | O(1) First element of a vector in a monad. See indexM --- for an explanation of why this is useful. -headM :: (Unbox a, Monad m) => Vector a -> m a - --- | O(1) Last element of a vector in a monad. See indexM for --- an explanation of why this is useful. -lastM :: (Unbox a, Monad m) => Vector a -> m a - --- | O(1) Indexing in a monad without bounds checks. See --- indexM for an explanation of why this is useful. -unsafeIndexM :: (Unbox a, Monad m) => Vector a -> Int -> m a - --- | O(1) First element in a monad without checking for empty --- vectors. See indexM for an explanation of why this is useful. -unsafeHeadM :: (Unbox a, Monad m) => Vector a -> m a - --- | O(1) Last element in a monad without checking for empty --- vectors. See indexM for an explanation of why this is useful. -unsafeLastM :: (Unbox a, Monad m) => Vector a -> m a - --- | O(1) Yield a slice of the vector without copying it. The vector --- must contain at least i+n elements. -slice :: Unbox a => Int -> Int -> Vector a -> Vector a - --- | O(1) Yield all but the last element without copying. The vector --- may not be empty. -init :: Unbox a => Vector a -> Vector a - --- | O(1) Yield all but the first element without copying. The --- vector may not be empty. -tail :: Unbox a => Vector a -> Vector a - --- | O(1) Yield at the first n elements without copying. --- The vector may contain less than n elements in which case it --- is returned unchanged. -take :: Unbox a => Int -> Vector a -> Vector a - --- | O(1) Yield all but the first n elements without --- copying. The vector may contain less than n elements in which --- case an empty vector is returned. -drop :: Unbox a => Int -> Vector a -> Vector a - --- | O(1) Yield the first n elements paired with the --- remainder without copying. --- --- Note that splitAt n v is equivalent to --- (take n v, drop n v) but slightly more --- efficient. -splitAt :: Unbox a => Int -> Vector a -> (Vector a, Vector a) - --- | O(1) Yield a slice of the vector without copying. The vector --- must contain at least i+n elements but this is not checked. -unsafeSlice :: Unbox a => Int -> Int -> Vector a -> Vector a - --- | O(1) Yield all but the last element without copying. The vector --- may not be empty but this is not checked. -unsafeInit :: Unbox a => Vector a -> Vector a - --- | O(1) Yield all but the first element without copying. The --- vector may not be empty but this is not checked. -unsafeTail :: Unbox a => Vector a -> Vector a - --- | O(1) Yield the first n elements without copying. The --- vector must contain at least n elements but this is not --- checked. -unsafeTake :: Unbox a => Int -> Vector a -> Vector a - --- | O(1) Yield all but the first n elements without --- copying. The vector must contain at least n elements but this --- is not checked. -unsafeDrop :: Unbox a => Int -> Vector a -> Vector a - --- | O(1) Empty vector -empty :: Unbox a => Vector a - --- | O(1) Vector with exactly one element -singleton :: Unbox a => a -> Vector a - --- | O(n) Vector of the given length with the same value in each --- position -replicate :: Unbox a => Int -> a -> Vector a - --- | O(n) Construct a vector of the given length by applying the --- function to each index -generate :: Unbox a => Int -> (Int -> a) -> Vector a - --- | O(n) Apply function n times to value. Zeroth element is --- original value. -iterateN :: Unbox a => Int -> (a -> a) -> a -> Vector a - --- | O(n) Execute the monadic action the given number of times and --- store the results in a vector. -replicateM :: (Monad m, Unbox a) => Int -> m a -> m (Vector a) - --- | O(n) Construct a vector of the given length by applying the --- monadic action to each index -generateM :: (Monad m, Unbox a) => Int -> (Int -> m a) -> m (Vector a) - --- | Execute the monadic action and freeze the resulting vector. --- --- 
---   create (do { v <- new 2; write v 0 'a'; write v 1 'b' }) = <a,b>
---
-create :: Unbox a => (forall s. ST s (MVector s a)) -> Vector a - --- | O(n) Construct a vector by repeatedly applying the generator --- function to a seed. The generator function yields Just the next --- element and the new seed or Nothing if there are no more --- elements. --- --- 
---   unfoldr (\n -> if n == 0 then Nothing else Just (n,n-1)) 10
---    = <10,9,8,7,6,5,4,3,2,1>
---
-unfoldr :: Unbox a => (b -> Maybe (a, b)) -> b -> Vector a - --- | O(n) Construct a vector with at most n by repeatedly --- applying the generator function to the a seed. The generator function --- yields Just the next element and the new seed or Nothing --- if there are no more elements. --- --- 
---   unfoldrN 3 (\n -> Just (n,n-1)) 10 = <10,9,8>
---
-unfoldrN :: Unbox a => Int -> (b -> Maybe (a, b)) -> b -> Vector a - --- | O(n) Construct a vector with n elements by repeatedly --- applying the generator function to the already constructed part of the --- vector. --- --- 
---   constructN 3 f = let a = f <> ; b = f <a> ; c = f <a,b> in f <a,b,c>
---
-constructN :: Unbox a => Int -> (Vector a -> a) -> Vector a - --- | O(n) Construct a vector with n elements from right to --- left by repeatedly applying the generator function to the already --- constructed part of the vector. --- --- 
---   constructrN 3 f = let a = f <> ; b = f<a> ; c = f <b,a> in f <c,b,a>
---
-constructrN :: Unbox a => Int -> (Vector a -> a) -> Vector a - --- | O(n) Yield a vector of the given length containing the values --- x, x+1 etc. This operation is usually more efficient --- than enumFromTo. --- --- 
---   enumFromN 5 3 = <5,6,7>
---
-enumFromN :: (Unbox a, Num a) => a -> Int -> Vector a - --- | O(n) Yield a vector of the given length containing the values --- x, x+y, x+y+y etc. This operations is --- usually more efficient than enumFromThenTo. --- --- 
---   enumFromStepN 1 0.1 5 = <1,1.1,1.2,1.3,1.4>
---
-enumFromStepN :: (Unbox a, Num a) => a -> a -> Int -> Vector a - --- | O(n) Enumerate values from x to y. --- --- WARNING: This operation can be very inefficient. If at all --- possible, use enumFromN instead. -enumFromTo :: (Unbox a, Enum a) => a -> a -> Vector a - --- | O(n) Enumerate values from x to y with a --- specific step z. --- --- WARNING: This operation can be very inefficient. If at all --- possible, use enumFromStepN instead. -enumFromThenTo :: (Unbox a, Enum a) => a -> a -> a -> Vector a - --- | O(n) Prepend an element -cons :: Unbox a => a -> Vector a -> Vector a - --- | O(n) Append an element -snoc :: Unbox a => Vector a -> a -> Vector a - --- | O(m+n) Concatenate two vectors -(++) :: Unbox a => Vector a -> Vector a -> Vector a - --- | O(n) Concatenate all vectors in the list -concat :: Unbox a => [Vector a] -> Vector a - --- | O(n) Yield the argument but force it not to retain any extra --- memory, possibly by copying it. --- --- This is especially useful when dealing with slices. For example: --- --- 
---   force (slice 0 2 <huge vector>)
---
--- --- Here, the slice retains a reference to the huge vector. Forcing it --- creates a copy of just the elements that belong to the slice and --- allows the huge vector to be garbage collected. -force :: Unbox a => Vector a -> Vector a - --- | O(m+n) For each pair (i,a) from the list, replace the --- vector element at position i by a. --- --- 
---   <5,9,2,7> // [(2,1),(0,3),(2,8)] = <3,9,8,7>
---
-(//) :: Unbox a => Vector a -> [(Int, a)] -> Vector a - --- | O(m+n) For each pair (i,a) from the vector of --- index/value pairs, replace the vector element at position i --- by a. --- --- 
---   update <5,9,2,7> <(2,1),(0,3),(2,8)> = <3,9,8,7>
---
-update :: Unbox a => Vector a -> Vector (Int, a) -> Vector a - --- | O(m+min(n1,n2)) For each index i from the index vector --- and the corresponding value a from the value vector, replace --- the element of the initial vector at position i by --- a. --- --- 
---   update_ <5,9,2,7>  <2,0,2> <1,3,8> = <3,9,8,7>
---
--- --- The function update provides the same functionality and is --- usually more convenient. --- --- 
---   update_ xs is ys = update xs (zip is ys)
---
-update_ :: Unbox a => Vector a -> Vector Int -> Vector a -> Vector a - --- | Same as (//) but without bounds checking. -unsafeUpd :: Unbox a => Vector a -> [(Int, a)] -> Vector a - --- | Same as update but without bounds checking. -unsafeUpdate :: Unbox a => Vector a -> Vector (Int, a) -> Vector a - --- | Same as update_ but without bounds checking. -unsafeUpdate_ :: Unbox a => Vector a -> Vector Int -> Vector a -> Vector a - --- | O(m+n) For each pair (i,b) from the list, replace the --- vector element a at position i by f a b. --- --- 
---   accum (+) <5,9,2> [(2,4),(1,6),(0,3),(1,7)] = <5+3, 9+6+7, 2+4>
---
-accum :: Unbox a => (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a - --- | O(m+n) For each pair (i,b) from the vector of pairs, --- replace the vector element a at position i by f --- a b. --- --- 
---   accumulate (+) <5,9,2> <(2,4),(1,6),(0,3),(1,7)> = <5+3, 9+6+7, 2+4>
---
-accumulate :: (Unbox a, Unbox b) => (a -> b -> a) -> Vector a -> Vector (Int, b) -> Vector a - --- | O(m+min(n1,n2)) For each index i from the index vector --- and the corresponding value b from the the value vector, --- replace the element of the initial vector at position i by --- f a b. --- --- 
---   accumulate_ (+) <5,9,2> <2,1,0,1> <4,6,3,7> = <5+3, 9+6+7, 2+4>
---
--- --- The function accumulate provides the same functionality and is --- usually more convenient. --- --- 
---   accumulate_ f as is bs = accumulate f as (zip is bs)
---
-accumulate_ :: (Unbox a, Unbox b) => (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a - --- | Same as accum but without bounds checking. -unsafeAccum :: Unbox a => (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a - --- | Same as accumulate but without bounds checking. -unsafeAccumulate :: (Unbox a, Unbox b) => (a -> b -> a) -> Vector a -> Vector (Int, b) -> Vector a - --- | Same as accumulate_ but without bounds checking. -unsafeAccumulate_ :: (Unbox a, Unbox b) => (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a - --- | O(n) Reverse a vector -reverse :: Unbox a => Vector a -> Vector a - --- | O(n) Yield the vector obtained by replacing each element --- i of the index vector by xs!i. This is --- equivalent to map (xs!) is but is often much --- more efficient. --- --- 
---   backpermute <a,b,c,d> <0,3,2,3,1,0> = <a,d,c,d,b,a>
---
-backpermute :: Unbox a => Vector a -> Vector Int -> Vector a - --- | Same as backpermute but without bounds checking. -unsafeBackpermute :: Unbox a => Vector a -> Vector Int -> Vector a - --- | Apply a destructive operation to a vector. The operation will be --- performed in place if it is safe to do so and will modify a copy of --- the vector otherwise. --- --- 
---   modify (\v -> write v 0 'x') (replicate 3 'a') = <'x','a','a'>
---
-modify :: Unbox a => (forall s. MVector s a -> ST s ()) -> Vector a -> Vector a - --- | O(n) Pair each element in a vector with its index -indexed :: Unbox a => Vector a -> Vector (Int, a) - --- | O(n) Map a function over a vector -map :: (Unbox a, Unbox b) => (a -> b) -> Vector a -> Vector b - --- | O(n) Apply a function to every element of a vector and its --- index -imap :: (Unbox a, Unbox b) => (Int -> a -> b) -> Vector a -> Vector b - --- | Map a function over a vector and concatenate the results. -concatMap :: (Unbox a, Unbox b) => (a -> Vector b) -> Vector a -> Vector b - --- | O(n) Apply the monadic action to all elements of the vector, --- yielding a vector of results -mapM :: (Monad m, Unbox a, Unbox b) => (a -> m b) -> Vector a -> m (Vector b) - --- | O(n) Apply the monadic action to all elements of a vector and --- ignore the results -mapM_ :: (Monad m, Unbox a) => (a -> m b) -> Vector a -> m () - --- | O(n) Apply the monadic action to all elements of the vector, --- yielding a vector of results. Equvalent to flip mapM. -forM :: (Monad m, Unbox a, Unbox b) => Vector a -> (a -> m b) -> m (Vector b) - --- | O(n) Apply the monadic action to all elements of a vector and --- ignore the results. Equivalent to flip mapM_. -forM_ :: (Monad m, Unbox a) => Vector a -> (a -> m b) -> m () - --- | O(min(m,n)) Zip two vectors with the given function. -zipWith :: (Unbox a, Unbox b, Unbox c) => (a -> b -> c) -> Vector a -> Vector b -> Vector c - --- | Zip three vectors with the given function. -zipWith3 :: (Unbox a, Unbox b, Unbox c, Unbox d) => (a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d -zipWith4 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e) => (a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -zipWith5 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f) => (a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -zipWith6 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f, Unbox g) => (a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g - --- | O(min(m,n)) Zip two vectors with a function that also takes the --- elements' indices. -izipWith :: (Unbox a, Unbox b, Unbox c) => (Int -> a -> b -> c) -> Vector a -> Vector b -> Vector c - --- | Zip three vectors and their indices with the given function. -izipWith3 :: (Unbox a, Unbox b, Unbox c, Unbox d) => (Int -> a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d -izipWith4 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e) => (Int -> a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -izipWith5 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f) => (Int -> a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -izipWith6 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f, Unbox g) => (Int -> a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g - --- | O(1) Zip 2 vectors -zip :: (Unbox a, Unbox b) => Vector a -> Vector b -> Vector (a, b) - --- | O(1) Zip 3 vectors -zip3 :: (Unbox a, Unbox b, Unbox c) => Vector a -> Vector b -> Vector c -> Vector (a, b, c) - --- | O(1) Zip 4 vectors -zip4 :: (Unbox a, Unbox b, Unbox c, Unbox d) => Vector a -> Vector b -> Vector c -> Vector d -> Vector (a, b, c, d) - --- | O(1) Zip 5 vectors -zip5 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e) => Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector (a, b, c, d, e) - --- | O(1) Zip 6 vectors -zip6 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f) => Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector (a, b, c, d, e, f) - --- | O(min(m,n)) Zip the two vectors with the monadic action and --- yield a vector of results -zipWithM :: (Monad m, Unbox a, Unbox b, Unbox c) => (a -> b -> m c) -> Vector a -> Vector b -> m (Vector c) - --- | O(min(m,n)) Zip the two vectors with the monadic action and --- ignore the results -zipWithM_ :: (Monad m, Unbox a, Unbox b) => (a -> b -> m c) -> Vector a -> Vector b -> m () - --- | O(1) Unzip 2 vectors -unzip :: (Unbox a, Unbox b) => Vector (a, b) -> (Vector a, Vector b) - --- | O(1) Unzip 3 vectors -unzip3 :: (Unbox a, Unbox b, Unbox c) => Vector (a, b, c) -> (Vector a, Vector b, Vector c) - --- | O(1) Unzip 4 vectors -unzip4 :: (Unbox a, Unbox b, Unbox c, Unbox d) => Vector (a, b, c, d) -> (Vector a, Vector b, Vector c, Vector d) - --- | O(1) Unzip 5 vectors -unzip5 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e) => Vector (a, b, c, d, e) -> (Vector a, Vector b, Vector c, Vector d, Vector e) - --- | O(1) Unzip 6 vectors -unzip6 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f) => Vector (a, b, c, d, e, f) -> (Vector a, Vector b, Vector c, Vector d, Vector e, Vector f) - --- | O(n) Drop elements that do not satisfy the predicate -filter :: Unbox a => (a -> Bool) -> Vector a -> Vector a - --- | O(n) Drop elements that do not satisfy the predicate which is --- applied to values and their indices -ifilter :: Unbox a => (Int -> a -> Bool) -> Vector a -> Vector a - --- | O(n) Drop elements that do not satisfy the monadic predicate -filterM :: (Monad m, Unbox a) => (a -> m Bool) -> Vector a -> m (Vector a) - --- | O(n) Yield the longest prefix of elements satisfying the --- predicate without copying. -takeWhile :: Unbox a => (a -> Bool) -> Vector a -> Vector a - --- | O(n) Drop the longest prefix of elements that satisfy the --- predicate without copying. -dropWhile :: Unbox a => (a -> Bool) -> Vector a -> Vector a - --- | O(n) Split the vector in two parts, the first one containing --- those elements that satisfy the predicate and the second one those --- that don't. The relative order of the elements is preserved at the --- cost of a sometimes reduced performance compared to --- unstablePartition. -partition :: Unbox a => (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Split the vector in two parts, the first one containing --- those elements that satisfy the predicate and the second one those --- that don't. The order of the elements is not preserved but the --- operation is often faster than partition. -unstablePartition :: Unbox a => (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Split the vector into the longest prefix of elements that --- satisfy the predicate and the rest without copying. -span :: Unbox a => (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Split the vector into the longest prefix of elements that --- do not satisfy the predicate and the rest without copying. -break :: Unbox a => (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Check if the vector contains an element -elem :: (Unbox a, Eq a) => a -> Vector a -> Bool - --- | O(n) Check if the vector does not contain an element (inverse --- of elem) -notElem :: (Unbox a, Eq a) => a -> Vector a -> Bool - --- | O(n) Yield Just the first element matching the predicate --- or Nothing if no such element exists. -find :: Unbox a => (a -> Bool) -> Vector a -> Maybe a - --- | O(n) Yield Just the index of the first element matching --- the predicate or Nothing if no such element exists. -findIndex :: Unbox a => (a -> Bool) -> Vector a -> Maybe Int - --- | O(n) Yield the indices of elements satisfying the predicate in --- ascending order. -findIndices :: Unbox a => (a -> Bool) -> Vector a -> Vector Int - --- | O(n) Yield Just the index of the first occurence of the --- given element or Nothing if the vector does not contain the --- element. This is a specialised version of findIndex. -elemIndex :: (Unbox a, Eq a) => a -> Vector a -> Maybe Int - --- | O(n) Yield the indices of all occurences of the given element --- in ascending order. This is a specialised version of --- findIndices. -elemIndices :: (Unbox a, Eq a) => a -> Vector a -> Vector Int - --- | O(n) Left fold -foldl :: Unbox b => (a -> b -> a) -> a -> Vector b -> a - --- | O(n) Left fold on non-empty vectors -foldl1 :: Unbox a => (a -> a -> a) -> Vector a -> a - --- | O(n) Left fold with strict accumulator -foldl' :: Unbox b => (a -> b -> a) -> a -> Vector b -> a - --- | O(n) Left fold on non-empty vectors with strict accumulator -foldl1' :: Unbox a => (a -> a -> a) -> Vector a -> a - --- | O(n) Right fold -foldr :: Unbox a => (a -> b -> b) -> b -> Vector a -> b - --- | O(n) Right fold on non-empty vectors -foldr1 :: Unbox a => (a -> a -> a) -> Vector a -> a - --- | O(n) Right fold with a strict accumulator -foldr' :: Unbox a => (a -> b -> b) -> b -> Vector a -> b - --- | O(n) Right fold on non-empty vectors with strict accumulator -foldr1' :: Unbox a => (a -> a -> a) -> Vector a -> a - --- | O(n) Left fold (function applied to each element and its index) -ifoldl :: Unbox b => (a -> Int -> b -> a) -> a -> Vector b -> a - --- | O(n) Left fold with strict accumulator (function applied to --- each element and its index) -ifoldl' :: Unbox b => (a -> Int -> b -> a) -> a -> Vector b -> a - --- | O(n) Right fold (function applied to each element and its --- index) -ifoldr :: Unbox a => (Int -> a -> b -> b) -> b -> Vector a -> b - --- | O(n) Right fold with strict accumulator (function applied to --- each element and its index) -ifoldr' :: Unbox a => (Int -> a -> b -> b) -> b -> Vector a -> b - --- | O(n) Check if all elements satisfy the predicate. -all :: Unbox a => (a -> Bool) -> Vector a -> Bool - --- | O(n) Check if any element satisfies the predicate. -any :: Unbox a => (a -> Bool) -> Vector a -> Bool - --- | O(n) Check if all elements are True -and :: Vector Bool -> Bool - --- | O(n) Check if any element is True -or :: Vector Bool -> Bool - --- | O(n) Compute the sum of the elements -sum :: (Unbox a, Num a) => Vector a -> a - --- | O(n) Compute the produce of the elements -product :: (Unbox a, Num a) => Vector a -> a - --- | O(n) Yield the maximum element of the vector. The vector may --- not be empty. -maximum :: (Unbox a, Ord a) => Vector a -> a - --- | O(n) Yield the maximum element of the vector according to the --- given comparison function. The vector may not be empty. -maximumBy :: Unbox a => (a -> a -> Ordering) -> Vector a -> a - --- | O(n) Yield the minimum element of the vector. The vector may --- not be empty. -minimum :: (Unbox a, Ord a) => Vector a -> a - --- | O(n) Yield the minimum element of the vector according to the --- given comparison function. The vector may not be empty. -minimumBy :: Unbox a => (a -> a -> Ordering) -> Vector a -> a - --- | O(n) Yield the index of the minimum element of the vector. The --- vector may not be empty. -minIndex :: (Unbox a, Ord a) => Vector a -> Int - --- | O(n) Yield the index of the minimum element of the vector --- according to the given comparison function. The vector may not be --- empty. -minIndexBy :: Unbox a => (a -> a -> Ordering) -> Vector a -> Int - --- | O(n) Yield the index of the maximum element of the vector. The --- vector may not be empty. -maxIndex :: (Unbox a, Ord a) => Vector a -> Int - --- | O(n) Yield the index of the maximum element of the vector --- according to the given comparison function. The vector may not be --- empty. -maxIndexBy :: Unbox a => (a -> a -> Ordering) -> Vector a -> Int - --- | O(n) Monadic fold -foldM :: (Monad m, Unbox b) => (a -> b -> m a) -> a -> Vector b -> m a - --- | O(n) Monadic fold with strict accumulator -foldM' :: (Monad m, Unbox b) => (a -> b -> m a) -> a -> Vector b -> m a - --- | O(n) Monadic fold over non-empty vectors -fold1M :: (Monad m, Unbox a) => (a -> a -> m a) -> Vector a -> m a - --- | O(n) Monadic fold over non-empty vectors with strict --- accumulator -fold1M' :: (Monad m, Unbox a) => (a -> a -> m a) -> Vector a -> m a - --- | O(n) Monadic fold that discards the result -foldM_ :: (Monad m, Unbox b) => (a -> b -> m a) -> a -> Vector b -> m () - --- | O(n) Monadic fold with strict accumulator that discards the --- result -foldM'_ :: (Monad m, Unbox b) => (a -> b -> m a) -> a -> Vector b -> m () - --- | O(n) Monadic fold over non-empty vectors that discards the --- result -fold1M_ :: (Monad m, Unbox a) => (a -> a -> m a) -> Vector a -> m () - --- | O(n) Monadic fold over non-empty vectors with strict --- accumulator that discards the result -fold1M'_ :: (Monad m, Unbox a) => (a -> a -> m a) -> Vector a -> m () - --- | O(n) Prescan --- --- 
---   prescanl f z = init . scanl f z
---
--- --- Example: prescanl (+) 0 <1,2,3,4> = <0,1,3,6> -prescanl :: (Unbox a, Unbox b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Prescan with strict accumulator -prescanl' :: (Unbox a, Unbox b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Scan --- --- 
---   postscanl f z = tail . scanl f z
---
--- --- Example: postscanl (+) 0 <1,2,3,4> = <1,3,6,10> -postscanl :: (Unbox a, Unbox b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Scan with strict accumulator -postscanl' :: (Unbox a, Unbox b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Haskell-style scan --- --- 
---   scanl f z <x1,...,xn> = <y1,...,y(n+1)>
---     where y1 = z
---           yi = f y(i-1) x(i-1)
---
--- --- Example: scanl (+) 0 <1,2,3,4> = <0,1,3,6,10> -scanl :: (Unbox a, Unbox b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Haskell-style scan with strict accumulator -scanl' :: (Unbox a, Unbox b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Scan over a non-empty vector --- --- 
---   scanl f <x1,...,xn> = <y1,...,yn>
---     where y1 = x1
---           yi = f y(i-1) xi
---
-scanl1 :: Unbox a => (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Scan over a non-empty vector with a strict accumulator -scanl1' :: Unbox a => (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Right-to-left prescan --- --- 
---   prescanr f z = reverse . prescanl (flip f) z . reverse
---
-prescanr :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left prescan with strict accumulator -prescanr' :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left scan -postscanr :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left scan with strict accumulator -postscanr' :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left Haskell-style scan -scanr :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left Haskell-style scan with strict accumulator -scanr' :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left scan over a non-empty vector -scanr1 :: Unbox a => (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Right-to-left scan over a non-empty vector with a strict --- accumulator -scanr1' :: Unbox a => (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Convert a vector to a list -toList :: Unbox a => Vector a -> [a] - --- | O(n) Convert a list to a vector -fromList :: Unbox a => [a] -> Vector a - --- | O(n) Convert the first n elements of a list to a --- vector --- --- 
---   fromListN n xs = fromList (take n xs)
---
-fromListN :: Unbox a => Int -> [a] -> Vector a - --- | O(n) Convert different vector types -convert :: (Vector v a, Vector w a) => v a -> w a - --- | O(n) Yield an immutable copy of the mutable vector. -freeze :: (Unbox a, PrimMonad m) => MVector (PrimState m) a -> m (Vector a) - --- | O(n) Yield a mutable copy of the immutable vector. -thaw :: (Unbox a, PrimMonad m) => Vector a -> m (MVector (PrimState m) a) - --- | O(n) Copy an immutable vector into a mutable one. The two --- vectors must have the same length. -copy :: (Unbox a, PrimMonad m) => MVector (PrimState m) a -> Vector a -> m () - --- | O(1) Unsafe convert a mutable vector to an immutable one --- without copying. The mutable vector may not be used after this --- operation. -unsafeFreeze :: (Unbox a, PrimMonad m) => MVector (PrimState m) a -> m (Vector a) - --- | O(1) Unsafely convert an immutable vector to a mutable one --- without copying. The immutable vector may not be used after this --- operation. -unsafeThaw :: (Unbox a, PrimMonad m) => Vector a -> m (MVector (PrimState m) a) - --- | O(n) Copy an immutable vector into a mutable one. The two --- vectors must have the same length. This is not checked. -unsafeCopy :: (Unbox a, PrimMonad m) => MVector (PrimState m) a -> Vector a -> m () -instance (Read a, Unbox a) => Read (Vector a) -instance (Show a, Unbox a) => Show (Vector a) -instance Unbox a => Monoid (Vector a) -instance (Unbox a, Ord a) => Ord (Vector a) -instance (Unbox a, Eq a) => Eq (Vector a) - - --- | Safe interface to Data.Vector.Unboxed -module Data.Vector.Unboxed.Safe -class (Vector Vector a, MVector MVector a) => Unbox a - --- | O(1) Yield the length of the vector. -length :: Unbox a => Vector a -> Int - --- | O(1) Test whether a vector if empty -null :: Unbox a => Vector a -> Bool - --- | O(1) Indexing -(!) :: Unbox a => Vector a -> Int -> a - --- | O(1) Safe indexing -(!?) :: Unbox a => Vector a -> Int -> Maybe a - --- | O(1) First element -head :: Unbox a => Vector a -> a - --- | O(1) Last element -last :: Unbox a => Vector a -> a - --- | O(1) Indexing in a monad. --- --- The monad allows operations to be strict in the vector when necessary. --- Suppose vector copying is implemented like this: --- --- 
---   copy mv v = ... write mv i (v ! i) ...
---
--- --- For lazy vectors, v ! i would not be evaluated which means --- that mv would unnecessarily retain a reference to v --- in each element written. --- --- With indexM, copying can be implemented like this instead: --- --- 
---   copy mv v = ... do
---                     x <- indexM v i
---                     write mv i x
---
--- --- Here, no references to v are retained because indexing (but --- not the elements) is evaluated eagerly. -indexM :: (Unbox a, Monad m) => Vector a -> Int -> m a - --- | O(1) First element of a vector in a monad. See indexM --- for an explanation of why this is useful. -headM :: (Unbox a, Monad m) => Vector a -> m a - --- | O(1) Last element of a vector in a monad. See indexM for --- an explanation of why this is useful. -lastM :: (Unbox a, Monad m) => Vector a -> m a - --- | O(1) Yield a slice of the vector without copying it. The vector --- must contain at least i+n elements. -slice :: Unbox a => Int -> Int -> Vector a -> Vector a - --- | O(1) Yield all but the last element without copying. The vector --- may not be empty. -init :: Unbox a => Vector a -> Vector a - --- | O(1) Yield all but the first element without copying. The --- vector may not be empty. -tail :: Unbox a => Vector a -> Vector a - --- | O(1) Yield at the first n elements without copying. --- The vector may contain less than n elements in which case it --- is returned unchanged. -take :: Unbox a => Int -> Vector a -> Vector a - --- | O(1) Yield all but the first n elements without --- copying. The vector may contain less than n elements in which --- case an empty vector is returned. -drop :: Unbox a => Int -> Vector a -> Vector a - --- | O(1) Yield the first n elements paired with the --- remainder without copying. --- --- Note that splitAt n v is equivalent to --- (take n v, drop n v) but slightly more --- efficient. -splitAt :: Unbox a => Int -> Vector a -> (Vector a, Vector a) - --- | O(1) Empty vector -empty :: Unbox a => Vector a - --- | O(1) Vector with exactly one element -singleton :: Unbox a => a -> Vector a - --- | O(n) Vector of the given length with the same value in each --- position -replicate :: Unbox a => Int -> a -> Vector a - --- | O(n) Construct a vector of the given length by applying the --- function to each index -generate :: Unbox a => Int -> (Int -> a) -> Vector a - --- | O(n) Apply function n times to value. Zeroth element is --- original value. -iterateN :: Unbox a => Int -> (a -> a) -> a -> Vector a - --- | O(n) Execute the monadic action the given number of times and --- store the results in a vector. -replicateM :: (Monad m, Unbox a) => Int -> m a -> m (Vector a) - --- | O(n) Construct a vector of the given length by applying the --- monadic action to each index -generateM :: (Monad m, Unbox a) => Int -> (Int -> m a) -> m (Vector a) - --- | Execute the monadic action and freeze the resulting vector. --- --- 
---   create (do { v <- new 2; write v 0 'a'; write v 1 'b' }) = <a,b>
---
-create :: Unbox a => (forall s. ST s (MVector s a)) -> Vector a - --- | O(n) Construct a vector by repeatedly applying the generator --- function to a seed. The generator function yields Just the next --- element and the new seed or Nothing if there are no more --- elements. --- --- 
---   unfoldr (\n -> if n == 0 then Nothing else Just (n,n-1)) 10
---    = <10,9,8,7,6,5,4,3,2,1>
---
-unfoldr :: Unbox a => (b -> Maybe (a, b)) -> b -> Vector a - --- | O(n) Construct a vector with at most n by repeatedly --- applying the generator function to the a seed. The generator function --- yields Just the next element and the new seed or Nothing --- if there are no more elements. --- --- 
---   unfoldrN 3 (\n -> Just (n,n-1)) 10 = <10,9,8>
---
-unfoldrN :: Unbox a => Int -> (b -> Maybe (a, b)) -> b -> Vector a - --- | O(n) Construct a vector with n elements by repeatedly --- applying the generator function to the already constructed part of the --- vector. --- --- 
---   constructN 3 f = let a = f <> ; b = f <a> ; c = f <a,b> in f <a,b,c>
---
-constructN :: Unbox a => Int -> (Vector a -> a) -> Vector a - --- | O(n) Construct a vector with n elements from right to --- left by repeatedly applying the generator function to the already --- constructed part of the vector. --- --- 
---   constructrN 3 f = let a = f <> ; b = f<a> ; c = f <b,a> in f <c,b,a>
---
-constructrN :: Unbox a => Int -> (Vector a -> a) -> Vector a - --- | O(n) Yield a vector of the given length containing the values --- x, x+1 etc. This operation is usually more efficient --- than enumFromTo. --- --- 
---   enumFromN 5 3 = <5,6,7>
---
-enumFromN :: (Unbox a, Num a) => a -> Int -> Vector a - --- | O(n) Yield a vector of the given length containing the values --- x, x+y, x+y+y etc. This operations is --- usually more efficient than enumFromThenTo. --- --- 
---   enumFromStepN 1 0.1 5 = <1,1.1,1.2,1.3,1.4>
---
-enumFromStepN :: (Unbox a, Num a) => a -> a -> Int -> Vector a - --- | O(n) Enumerate values from x to y. --- --- WARNING: This operation can be very inefficient. If at all --- possible, use enumFromN instead. -enumFromTo :: (Unbox a, Enum a) => a -> a -> Vector a - --- | O(n) Enumerate values from x to y with a --- specific step z. --- --- WARNING: This operation can be very inefficient. If at all --- possible, use enumFromStepN instead. -enumFromThenTo :: (Unbox a, Enum a) => a -> a -> a -> Vector a - --- | O(n) Prepend an element -cons :: Unbox a => a -> Vector a -> Vector a - --- | O(n) Append an element -snoc :: Unbox a => Vector a -> a -> Vector a - --- | O(m+n) Concatenate two vectors -(++) :: Unbox a => Vector a -> Vector a -> Vector a - --- | O(n) Concatenate all vectors in the list -concat :: Unbox a => [Vector a] -> Vector a - --- | O(n) Yield the argument but force it not to retain any extra --- memory, possibly by copying it. --- --- This is especially useful when dealing with slices. For example: --- --- 
---   force (slice 0 2 <huge vector>)
---
--- --- Here, the slice retains a reference to the huge vector. Forcing it --- creates a copy of just the elements that belong to the slice and --- allows the huge vector to be garbage collected. -force :: Unbox a => Vector a -> Vector a - --- | O(m+n) For each pair (i,a) from the list, replace the --- vector element at position i by a. --- --- 
---   <5,9,2,7> // [(2,1),(0,3),(2,8)] = <3,9,8,7>
---
-(//) :: Unbox a => Vector a -> [(Int, a)] -> Vector a - --- | O(m+n) For each pair (i,a) from the vector of --- index/value pairs, replace the vector element at position i --- by a. --- --- 
---   update <5,9,2,7> <(2,1),(0,3),(2,8)> = <3,9,8,7>
---
-update :: Unbox a => Vector a -> Vector (Int, a) -> Vector a - --- | O(m+min(n1,n2)) For each index i from the index vector --- and the corresponding value a from the value vector, replace --- the element of the initial vector at position i by --- a. --- --- 
---   update_ <5,9,2,7>  <2,0,2> <1,3,8> = <3,9,8,7>
---
--- --- The function update provides the same functionality and is --- usually more convenient. --- --- 
---   update_ xs is ys = update xs (zip is ys)
---
-update_ :: Unbox a => Vector a -> Vector Int -> Vector a -> Vector a - --- | O(m+n) For each pair (i,b) from the list, replace the --- vector element a at position i by f a b. --- --- 
---   accum (+) <5,9,2> [(2,4),(1,6),(0,3),(1,7)] = <5+3, 9+6+7, 2+4>
---
-accum :: Unbox a => (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a - --- | O(m+n) For each pair (i,b) from the vector of pairs, --- replace the vector element a at position i by f --- a b. --- --- 
---   accumulate (+) <5,9,2> <(2,4),(1,6),(0,3),(1,7)> = <5+3, 9+6+7, 2+4>
---
-accumulate :: (Unbox a, Unbox b) => (a -> b -> a) -> Vector a -> Vector (Int, b) -> Vector a - --- | O(m+min(n1,n2)) For each index i from the index vector --- and the corresponding value b from the the value vector, --- replace the element of the initial vector at position i by --- f a b. --- --- 
---   accumulate_ (+) <5,9,2> <2,1,0,1> <4,6,3,7> = <5+3, 9+6+7, 2+4>
---
--- --- The function accumulate provides the same functionality and is --- usually more convenient. --- --- 
---   accumulate_ f as is bs = accumulate f as (zip is bs)
---
-accumulate_ :: (Unbox a, Unbox b) => (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a - --- | O(n) Reverse a vector -reverse :: Unbox a => Vector a -> Vector a - --- | O(n) Yield the vector obtained by replacing each element --- i of the index vector by xs!i. This is --- equivalent to map (xs!) is but is often much --- more efficient. --- --- 
---   backpermute <a,b,c,d> <0,3,2,3,1,0> = <a,d,c,d,b,a>
---
-backpermute :: Unbox a => Vector a -> Vector Int -> Vector a - --- | Apply a destructive operation to a vector. The operation will be --- performed in place if it is safe to do so and will modify a copy of --- the vector otherwise. --- --- 
---   modify (\v -> write v 0 'x') (replicate 3 'a') = <'x','a','a'>
---
-modify :: Unbox a => (forall s. MVector s a -> ST s ()) -> Vector a -> Vector a - --- | O(n) Pair each element in a vector with its index -indexed :: Unbox a => Vector a -> Vector (Int, a) - --- | O(n) Map a function over a vector -map :: (Unbox a, Unbox b) => (a -> b) -> Vector a -> Vector b - --- | O(n) Apply a function to every element of a vector and its --- index -imap :: (Unbox a, Unbox b) => (Int -> a -> b) -> Vector a -> Vector b - --- | Map a function over a vector and concatenate the results. -concatMap :: (Unbox a, Unbox b) => (a -> Vector b) -> Vector a -> Vector b - --- | O(n) Apply the monadic action to all elements of the vector, --- yielding a vector of results -mapM :: (Monad m, Unbox a, Unbox b) => (a -> m b) -> Vector a -> m (Vector b) - --- | O(n) Apply the monadic action to all elements of a vector and --- ignore the results -mapM_ :: (Monad m, Unbox a) => (a -> m b) -> Vector a -> m () - --- | O(n) Apply the monadic action to all elements of the vector, --- yielding a vector of results. Equvalent to flip mapM. -forM :: (Monad m, Unbox a, Unbox b) => Vector a -> (a -> m b) -> m (Vector b) - --- | O(n) Apply the monadic action to all elements of a vector and --- ignore the results. Equivalent to flip mapM_. -forM_ :: (Monad m, Unbox a) => Vector a -> (a -> m b) -> m () - --- | O(min(m,n)) Zip two vectors with the given function. -zipWith :: (Unbox a, Unbox b, Unbox c) => (a -> b -> c) -> Vector a -> Vector b -> Vector c - --- | Zip three vectors with the given function. -zipWith3 :: (Unbox a, Unbox b, Unbox c, Unbox d) => (a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d -zipWith4 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e) => (a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -zipWith5 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f) => (a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -zipWith6 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f, Unbox g) => (a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g - --- | O(min(m,n)) Zip two vectors with a function that also takes the --- elements' indices. -izipWith :: (Unbox a, Unbox b, Unbox c) => (Int -> a -> b -> c) -> Vector a -> Vector b -> Vector c - --- | Zip three vectors and their indices with the given function. -izipWith3 :: (Unbox a, Unbox b, Unbox c, Unbox d) => (Int -> a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d -izipWith4 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e) => (Int -> a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -izipWith5 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f) => (Int -> a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -izipWith6 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f, Unbox g) => (Int -> a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g - --- | O(1) Zip 2 vectors -zip :: (Unbox a, Unbox b) => Vector a -> Vector b -> Vector (a, b) - --- | O(1) Zip 3 vectors -zip3 :: (Unbox a, Unbox b, Unbox c) => Vector a -> Vector b -> Vector c -> Vector (a, b, c) - --- | O(1) Zip 4 vectors -zip4 :: (Unbox a, Unbox b, Unbox c, Unbox d) => Vector a -> Vector b -> Vector c -> Vector d -> Vector (a, b, c, d) - --- | O(1) Zip 5 vectors -zip5 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e) => Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector (a, b, c, d, e) - --- | O(1) Zip 6 vectors -zip6 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f) => Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector (a, b, c, d, e, f) - --- | O(min(m,n)) Zip the two vectors with the monadic action and --- yield a vector of results -zipWithM :: (Monad m, Unbox a, Unbox b, Unbox c) => (a -> b -> m c) -> Vector a -> Vector b -> m (Vector c) - --- | O(min(m,n)) Zip the two vectors with the monadic action and --- ignore the results -zipWithM_ :: (Monad m, Unbox a, Unbox b) => (a -> b -> m c) -> Vector a -> Vector b -> m () - --- | O(1) Unzip 2 vectors -unzip :: (Unbox a, Unbox b) => Vector (a, b) -> (Vector a, Vector b) - --- | O(1) Unzip 3 vectors -unzip3 :: (Unbox a, Unbox b, Unbox c) => Vector (a, b, c) -> (Vector a, Vector b, Vector c) - --- | O(1) Unzip 4 vectors -unzip4 :: (Unbox a, Unbox b, Unbox c, Unbox d) => Vector (a, b, c, d) -> (Vector a, Vector b, Vector c, Vector d) - --- | O(1) Unzip 5 vectors -unzip5 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e) => Vector (a, b, c, d, e) -> (Vector a, Vector b, Vector c, Vector d, Vector e) - --- | O(1) Unzip 6 vectors -unzip6 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f) => Vector (a, b, c, d, e, f) -> (Vector a, Vector b, Vector c, Vector d, Vector e, Vector f) - --- | O(n) Drop elements that do not satisfy the predicate -filter :: Unbox a => (a -> Bool) -> Vector a -> Vector a - --- | O(n) Drop elements that do not satisfy the predicate which is --- applied to values and their indices -ifilter :: Unbox a => (Int -> a -> Bool) -> Vector a -> Vector a - --- | O(n) Drop elements that do not satisfy the monadic predicate -filterM :: (Monad m, Unbox a) => (a -> m Bool) -> Vector a -> m (Vector a) - --- | O(n) Yield the longest prefix of elements satisfying the --- predicate without copying. -takeWhile :: Unbox a => (a -> Bool) -> Vector a -> Vector a - --- | O(n) Drop the longest prefix of elements that satisfy the --- predicate without copying. -dropWhile :: Unbox a => (a -> Bool) -> Vector a -> Vector a - --- | O(n) Split the vector in two parts, the first one containing --- those elements that satisfy the predicate and the second one those --- that don't. The relative order of the elements is preserved at the --- cost of a sometimes reduced performance compared to --- unstablePartition. -partition :: Unbox a => (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Split the vector in two parts, the first one containing --- those elements that satisfy the predicate and the second one those --- that don't. The order of the elements is not preserved but the --- operation is often faster than partition. -unstablePartition :: Unbox a => (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Split the vector into the longest prefix of elements that --- satisfy the predicate and the rest without copying. -span :: Unbox a => (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Split the vector into the longest prefix of elements that --- do not satisfy the predicate and the rest without copying. -break :: Unbox a => (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Check if the vector contains an element -elem :: (Unbox a, Eq a) => a -> Vector a -> Bool - --- | O(n) Check if the vector does not contain an element (inverse --- of elem) -notElem :: (Unbox a, Eq a) => a -> Vector a -> Bool - --- | O(n) Yield Just the first element matching the predicate --- or Nothing if no such element exists. -find :: Unbox a => (a -> Bool) -> Vector a -> Maybe a - --- | O(n) Yield Just the index of the first element matching --- the predicate or Nothing if no such element exists. -findIndex :: Unbox a => (a -> Bool) -> Vector a -> Maybe Int - --- | O(n) Yield the indices of elements satisfying the predicate in --- ascending order. -findIndices :: Unbox a => (a -> Bool) -> Vector a -> Vector Int - --- | O(n) Yield Just the index of the first occurence of the --- given element or Nothing if the vector does not contain the --- element. This is a specialised version of findIndex. -elemIndex :: (Unbox a, Eq a) => a -> Vector a -> Maybe Int - --- | O(n) Yield the indices of all occurences of the given element --- in ascending order. This is a specialised version of --- findIndices. -elemIndices :: (Unbox a, Eq a) => a -> Vector a -> Vector Int - --- | O(n) Left fold -foldl :: Unbox b => (a -> b -> a) -> a -> Vector b -> a - --- | O(n) Left fold on non-empty vectors -foldl1 :: Unbox a => (a -> a -> a) -> Vector a -> a - --- | O(n) Left fold with strict accumulator -foldl' :: Unbox b => (a -> b -> a) -> a -> Vector b -> a - --- | O(n) Left fold on non-empty vectors with strict accumulator -foldl1' :: Unbox a => (a -> a -> a) -> Vector a -> a - --- | O(n) Right fold -foldr :: Unbox a => (a -> b -> b) -> b -> Vector a -> b - --- | O(n) Right fold on non-empty vectors -foldr1 :: Unbox a => (a -> a -> a) -> Vector a -> a - --- | O(n) Right fold with a strict accumulator -foldr' :: Unbox a => (a -> b -> b) -> b -> Vector a -> b - --- | O(n) Right fold on non-empty vectors with strict accumulator -foldr1' :: Unbox a => (a -> a -> a) -> Vector a -> a - --- | O(n) Left fold (function applied to each element and its index) -ifoldl :: Unbox b => (a -> Int -> b -> a) -> a -> Vector b -> a - --- | O(n) Left fold with strict accumulator (function applied to --- each element and its index) -ifoldl' :: Unbox b => (a -> Int -> b -> a) -> a -> Vector b -> a - --- | O(n) Right fold (function applied to each element and its --- index) -ifoldr :: Unbox a => (Int -> a -> b -> b) -> b -> Vector a -> b - --- | O(n) Right fold with strict accumulator (function applied to --- each element and its index) -ifoldr' :: Unbox a => (Int -> a -> b -> b) -> b -> Vector a -> b - --- | O(n) Check if all elements satisfy the predicate. -all :: Unbox a => (a -> Bool) -> Vector a -> Bool - --- | O(n) Check if any element satisfies the predicate. -any :: Unbox a => (a -> Bool) -> Vector a -> Bool - --- | O(n) Check if all elements are True -and :: Vector Bool -> Bool - --- | O(n) Check if any element is True -or :: Vector Bool -> Bool - --- | O(n) Compute the sum of the elements -sum :: (Unbox a, Num a) => Vector a -> a - --- | O(n) Compute the produce of the elements -product :: (Unbox a, Num a) => Vector a -> a - --- | O(n) Yield the maximum element of the vector. The vector may --- not be empty. -maximum :: (Unbox a, Ord a) => Vector a -> a - --- | O(n) Yield the maximum element of the vector according to the --- given comparison function. The vector may not be empty. -maximumBy :: Unbox a => (a -> a -> Ordering) -> Vector a -> a - --- | O(n) Yield the minimum element of the vector. The vector may --- not be empty. -minimum :: (Unbox a, Ord a) => Vector a -> a - --- | O(n) Yield the minimum element of the vector according to the --- given comparison function. The vector may not be empty. -minimumBy :: Unbox a => (a -> a -> Ordering) -> Vector a -> a - --- | O(n) Yield the index of the minimum element of the vector. The --- vector may not be empty. -minIndex :: (Unbox a, Ord a) => Vector a -> Int - --- | O(n) Yield the index of the minimum element of the vector --- according to the given comparison function. The vector may not be --- empty. -minIndexBy :: Unbox a => (a -> a -> Ordering) -> Vector a -> Int - --- | O(n) Yield the index of the maximum element of the vector. The --- vector may not be empty. -maxIndex :: (Unbox a, Ord a) => Vector a -> Int - --- | O(n) Yield the index of the maximum element of the vector --- according to the given comparison function. The vector may not be --- empty. -maxIndexBy :: Unbox a => (a -> a -> Ordering) -> Vector a -> Int - --- | O(n) Monadic fold -foldM :: (Monad m, Unbox b) => (a -> b -> m a) -> a -> Vector b -> m a - --- | O(n) Monadic fold with strict accumulator -foldM' :: (Monad m, Unbox b) => (a -> b -> m a) -> a -> Vector b -> m a - --- | O(n) Monadic fold over non-empty vectors -fold1M :: (Monad m, Unbox a) => (a -> a -> m a) -> Vector a -> m a - --- | O(n) Monadic fold over non-empty vectors with strict --- accumulator -fold1M' :: (Monad m, Unbox a) => (a -> a -> m a) -> Vector a -> m a - --- | O(n) Monadic fold that discards the result -foldM_ :: (Monad m, Unbox b) => (a -> b -> m a) -> a -> Vector b -> m () - --- | O(n) Monadic fold with strict accumulator that discards the --- result -foldM'_ :: (Monad m, Unbox b) => (a -> b -> m a) -> a -> Vector b -> m () - --- | O(n) Monadic fold over non-empty vectors that discards the --- result -fold1M_ :: (Monad m, Unbox a) => (a -> a -> m a) -> Vector a -> m () - --- | O(n) Monadic fold over non-empty vectors with strict --- accumulator that discards the result -fold1M'_ :: (Monad m, Unbox a) => (a -> a -> m a) -> Vector a -> m () - --- | O(n) Prescan --- --- 
---   prescanl f z = init . scanl f z
---
--- --- Example: prescanl (+) 0 <1,2,3,4> = <0,1,3,6> -prescanl :: (Unbox a, Unbox b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Prescan with strict accumulator -prescanl' :: (Unbox a, Unbox b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Scan --- --- 
---   postscanl f z = tail . scanl f z
---
--- --- Example: postscanl (+) 0 <1,2,3,4> = <1,3,6,10> -postscanl :: (Unbox a, Unbox b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Scan with strict accumulator -postscanl' :: (Unbox a, Unbox b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Haskell-style scan --- --- 
---   scanl f z <x1,...,xn> = <y1,...,y(n+1)>
---     where y1 = z
---           yi = f y(i-1) x(i-1)
---
--- --- Example: scanl (+) 0 <1,2,3,4> = <0,1,3,6,10> -scanl :: (Unbox a, Unbox b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Haskell-style scan with strict accumulator -scanl' :: (Unbox a, Unbox b) => (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Scan over a non-empty vector --- --- 
---   scanl f <x1,...,xn> = <y1,...,yn>
---     where y1 = x1
---           yi = f y(i-1) xi
---
-scanl1 :: Unbox a => (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Scan over a non-empty vector with a strict accumulator -scanl1' :: Unbox a => (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Right-to-left prescan --- --- 
---   prescanr f z = reverse . prescanl (flip f) z . reverse
---
-prescanr :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left prescan with strict accumulator -prescanr' :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left scan -postscanr :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left scan with strict accumulator -postscanr' :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left Haskell-style scan -scanr :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left Haskell-style scan with strict accumulator -scanr' :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left scan over a non-empty vector -scanr1 :: Unbox a => (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Right-to-left scan over a non-empty vector with a strict --- accumulator -scanr1' :: Unbox a => (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Convert a vector to a list -toList :: Unbox a => Vector a -> [a] - --- | O(n) Convert a list to a vector -fromList :: Unbox a => [a] -> Vector a - --- | O(n) Convert the first n elements of a list to a --- vector --- --- 
---   fromListN n xs = fromList (take n xs)
---
-fromListN :: Unbox a => Int -> [a] -> Vector a - --- | O(n) Convert different vector types -convert :: (Vector v a, Vector w a) => v a -> w a - --- | O(n) Yield an immutable copy of the mutable vector. -freeze :: (Unbox a, PrimMonad m) => MVector (PrimState m) a -> m (Vector a) - --- | O(n) Yield a mutable copy of the immutable vector. -thaw :: (Unbox a, PrimMonad m) => Vector a -> m (MVector (PrimState m) a) - --- | O(n) Copy an immutable vector into a mutable one. The two --- vectors must have the same length. -copy :: (Unbox a, PrimMonad m) => MVector (PrimState m) a -> Vector a -> m () - - --- | Mutable adaptive unboxed vectors -module Data.Vector.Unboxed.Mutable -type IOVector = MVector RealWorld -type STVector s = MVector s -class (Vector Vector a, MVector MVector a) => Unbox a - --- | Length of the mutable vector. -length :: Unbox a => MVector s a -> Int - --- | Check whether the vector is empty -null :: Unbox a => MVector s a -> Bool - --- | Yield a part of the mutable vector without copying it. -slice :: Unbox a => Int -> Int -> MVector s a -> MVector s a -init :: Unbox a => MVector s a -> MVector s a -tail :: Unbox a => MVector s a -> MVector s a -take :: Unbox a => Int -> MVector s a -> MVector s a -drop :: Unbox a => Int -> MVector s a -> MVector s a -splitAt :: Unbox a => Int -> MVector s a -> (MVector s a, MVector s a) - --- | Yield a part of the mutable vector without copying it. No bounds --- checks are performed. -unsafeSlice :: Unbox a => Int -> Int -> MVector s a -> MVector s a -unsafeInit :: Unbox a => MVector s a -> MVector s a -unsafeTail :: Unbox a => MVector s a -> MVector s a -unsafeTake :: Unbox a => Int -> MVector s a -> MVector s a -unsafeDrop :: Unbox a => Int -> MVector s a -> MVector s a -overlaps :: Unbox a => MVector s a -> MVector s a -> Bool - --- | Create a mutable vector of the given length. -new :: (PrimMonad m, Unbox a) => Int -> m (MVector (PrimState m) a) - --- | Create a mutable vector of the given length. The length is not --- checked. -unsafeNew :: (PrimMonad m, Unbox a) => Int -> m (MVector (PrimState m) a) - --- | Create a mutable vector of the given length (0 if the length is --- negative) and fill it with an initial value. -replicate :: (PrimMonad m, Unbox a) => Int -> a -> m (MVector (PrimState m) a) - --- | Create a mutable vector of the given length (0 if the length is --- negative) and fill it with values produced by repeatedly executing the --- monadic action. -replicateM :: (PrimMonad m, Unbox a) => Int -> m a -> m (MVector (PrimState m) a) - --- | Create a copy of a mutable vector. -clone :: (PrimMonad m, Unbox a) => MVector (PrimState m) a -> m (MVector (PrimState m) a) - --- | Grow a vector by the given number of elements. The number must be --- positive. -grow :: (PrimMonad m, Unbox a) => MVector (PrimState m) a -> Int -> m (MVector (PrimState m) a) - --- | Grow a vector by the given number of elements. The number must be --- positive but this is not checked. -unsafeGrow :: (PrimMonad m, Unbox a) => MVector (PrimState m) a -> Int -> m (MVector (PrimState m) a) - --- | Reset all elements of the vector to some undefined value, clearing all --- references to external objects. This is usually a noop for unboxed --- vectors. -clear :: (PrimMonad m, Unbox a) => MVector (PrimState m) a -> m () - --- | O(1) Zip 2 vectors -zip :: (Unbox a, Unbox b) => MVector s a -> MVector s b -> MVector s (a, b) - --- | O(1) Zip 3 vectors -zip3 :: (Unbox a, Unbox b, Unbox c) => MVector s a -> MVector s b -> MVector s c -> MVector s (a, b, c) - --- | O(1) Zip 4 vectors -zip4 :: (Unbox a, Unbox b, Unbox c, Unbox d) => MVector s a -> MVector s b -> MVector s c -> MVector s d -> MVector s (a, b, c, d) - --- | O(1) Zip 5 vectors -zip5 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e) => MVector s a -> MVector s b -> MVector s c -> MVector s d -> MVector s e -> MVector s (a, b, c, d, e) - --- | O(1) Zip 6 vectors -zip6 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f) => MVector s a -> MVector s b -> MVector s c -> MVector s d -> MVector s e -> MVector s f -> MVector s (a, b, c, d, e, f) - --- | O(1) Unzip 2 vectors -unzip :: (Unbox a, Unbox b) => MVector s (a, b) -> (MVector s a, MVector s b) - --- | O(1) Unzip 3 vectors -unzip3 :: (Unbox a, Unbox b, Unbox c) => MVector s (a, b, c) -> (MVector s a, MVector s b, MVector s c) - --- | O(1) Unzip 4 vectors -unzip4 :: (Unbox a, Unbox b, Unbox c, Unbox d) => MVector s (a, b, c, d) -> (MVector s a, MVector s b, MVector s c, MVector s d) - --- | O(1) Unzip 5 vectors -unzip5 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e) => MVector s (a, b, c, d, e) -> (MVector s a, MVector s b, MVector s c, MVector s d, MVector s e) - --- | O(1) Unzip 6 vectors -unzip6 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f) => MVector s (a, b, c, d, e, f) -> (MVector s a, MVector s b, MVector s c, MVector s d, MVector s e, MVector s f) - --- | Yield the element at the given position. -read :: (PrimMonad m, Unbox a) => MVector (PrimState m) a -> Int -> m a - --- | Replace the element at the given position. -write :: (PrimMonad m, Unbox a) => MVector (PrimState m) a -> Int -> a -> m () - --- | Swap the elements at the given positions. -swap :: (PrimMonad m, Unbox a) => MVector (PrimState m) a -> Int -> Int -> m () - --- | Yield the element at the given position. No bounds checks are --- performed. -unsafeRead :: (PrimMonad m, Unbox a) => MVector (PrimState m) a -> Int -> m a - --- | Replace the element at the given position. No bounds checks are --- performed. -unsafeWrite :: (PrimMonad m, Unbox a) => MVector (PrimState m) a -> Int -> a -> m () - --- | Swap the elements at the given positions. No bounds checks are --- performed. -unsafeSwap :: (PrimMonad m, Unbox a) => MVector (PrimState m) a -> Int -> Int -> m () - --- | Set all elements of the vector to the given value. -set :: (PrimMonad m, Unbox a) => MVector (PrimState m) a -> a -> m () - --- | Copy a vector. The two vectors must have the same length and may not --- overlap. -copy :: (PrimMonad m, Unbox a) => MVector (PrimState m) a -> MVector (PrimState m) a -> m () - --- | Move the contents of a vector. The two vectors must have the same --- length. --- --- If the vectors do not overlap, then this is equivalent to copy. --- Otherwise, the copying is performed as if the source vector were --- copied to a temporary vector and then the temporary vector was copied --- to the target vector. -move :: (PrimMonad m, Unbox a) => MVector (PrimState m) a -> MVector (PrimState m) a -> m () - --- | Copy a vector. The two vectors must have the same length and may not --- overlap. This is not checked. -unsafeCopy :: (PrimMonad m, Unbox a) => MVector (PrimState m) a -> MVector (PrimState m) a -> m () - --- | Move the contents of a vector. The two vectors must have the same --- length, but this is not checked. --- --- If the vectors do not overlap, then this is equivalent to --- unsafeCopy. Otherwise, the copying is performed as if the --- source vector were copied to a temporary vector and then the temporary --- vector was copied to the target vector. -unsafeMove :: (PrimMonad m, Unbox a) => MVector (PrimState m) a -> MVector (PrimState m) a -> m () - - --- | Safe interface to Data.Vector.Unboxed.Mutable -module Data.Vector.Unboxed.Mutable.Safe -type IOVector = MVector RealWorld -type STVector s = MVector s -class (Vector Vector a, MVector MVector a) => Unbox a - --- | Length of the mutable vector. -length :: Unbox a => MVector s a -> Int - --- | Check whether the vector is empty -null :: Unbox a => MVector s a -> Bool - --- | Yield a part of the mutable vector without copying it. -slice :: Unbox a => Int -> Int -> MVector s a -> MVector s a -init :: Unbox a => MVector s a -> MVector s a -tail :: Unbox a => MVector s a -> MVector s a -take :: Unbox a => Int -> MVector s a -> MVector s a -drop :: Unbox a => Int -> MVector s a -> MVector s a -splitAt :: Unbox a => Int -> MVector s a -> (MVector s a, MVector s a) -overlaps :: Unbox a => MVector s a -> MVector s a -> Bool - --- | Create a mutable vector of the given length. -new :: (PrimMonad m, Unbox a) => Int -> m (MVector (PrimState m) a) - --- | Create a mutable vector of the given length (0 if the length is --- negative) and fill it with an initial value. -replicate :: (PrimMonad m, Unbox a) => Int -> a -> m (MVector (PrimState m) a) - --- | Create a mutable vector of the given length (0 if the length is --- negative) and fill it with values produced by repeatedly executing the --- monadic action. -replicateM :: (PrimMonad m, Unbox a) => Int -> m a -> m (MVector (PrimState m) a) - --- | Create a copy of a mutable vector. -clone :: (PrimMonad m, Unbox a) => MVector (PrimState m) a -> m (MVector (PrimState m) a) - --- | Grow a vector by the given number of elements. The number must be --- positive. -grow :: (PrimMonad m, Unbox a) => MVector (PrimState m) a -> Int -> m (MVector (PrimState m) a) - --- | Reset all elements of the vector to some undefined value, clearing all --- references to external objects. This is usually a noop for unboxed --- vectors. -clear :: (PrimMonad m, Unbox a) => MVector (PrimState m) a -> m () - --- | O(1) Zip 2 vectors -zip :: (Unbox a, Unbox b) => MVector s a -> MVector s b -> MVector s (a, b) - --- | O(1) Zip 3 vectors -zip3 :: (Unbox a, Unbox b, Unbox c) => MVector s a -> MVector s b -> MVector s c -> MVector s (a, b, c) - --- | O(1) Zip 4 vectors -zip4 :: (Unbox a, Unbox b, Unbox c, Unbox d) => MVector s a -> MVector s b -> MVector s c -> MVector s d -> MVector s (a, b, c, d) - --- | O(1) Zip 5 vectors -zip5 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e) => MVector s a -> MVector s b -> MVector s c -> MVector s d -> MVector s e -> MVector s (a, b, c, d, e) - --- | O(1) Zip 6 vectors -zip6 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f) => MVector s a -> MVector s b -> MVector s c -> MVector s d -> MVector s e -> MVector s f -> MVector s (a, b, c, d, e, f) - --- | O(1) Unzip 2 vectors -unzip :: (Unbox a, Unbox b) => MVector s (a, b) -> (MVector s a, MVector s b) - --- | O(1) Unzip 3 vectors -unzip3 :: (Unbox a, Unbox b, Unbox c) => MVector s (a, b, c) -> (MVector s a, MVector s b, MVector s c) - --- | O(1) Unzip 4 vectors -unzip4 :: (Unbox a, Unbox b, Unbox c, Unbox d) => MVector s (a, b, c, d) -> (MVector s a, MVector s b, MVector s c, MVector s d) - --- | O(1) Unzip 5 vectors -unzip5 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e) => MVector s (a, b, c, d, e) -> (MVector s a, MVector s b, MVector s c, MVector s d, MVector s e) - --- | O(1) Unzip 6 vectors -unzip6 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f) => MVector s (a, b, c, d, e, f) -> (MVector s a, MVector s b, MVector s c, MVector s d, MVector s e, MVector s f) - --- | Yield the element at the given position. -read :: (PrimMonad m, Unbox a) => MVector (PrimState m) a -> Int -> m a - --- | Replace the element at the given position. -write :: (PrimMonad m, Unbox a) => MVector (PrimState m) a -> Int -> a -> m () - --- | Swap the elements at the given positions. -swap :: (PrimMonad m, Unbox a) => MVector (PrimState m) a -> Int -> Int -> m () - --- | Set all elements of the vector to the given value. -set :: (PrimMonad m, Unbox a) => MVector (PrimState m) a -> a -> m () - --- | Copy a vector. The two vectors must have the same length and may not --- overlap. -copy :: (PrimMonad m, Unbox a) => MVector (PrimState m) a -> MVector (PrimState m) a -> m () - --- | Move the contents of a vector. The two vectors must have the same --- length. --- --- If the vectors do not overlap, then this is equivalent to copy. --- Otherwise, the copying is performed as if the source vector were --- copied to a temporary vector and then the temporary vector was copied --- to the target vector. -move :: (PrimMonad m, Unbox a) => MVector (PrimState m) a -> MVector (PrimState m) a -> m () - - --- | Mutable boxed vectors. -module Data.Vector.Mutable - --- | Mutable boxed vectors keyed on the monad they live in (IO or --- ST s). -data MVector s a -MVector :: {-# UNPACK #-} !Int -> {-# UNPACK #-} !Int -> {-# UNPACK #-} !MutableArray s a -> MVector s a -type IOVector = MVector RealWorld -type STVector s = MVector s - --- | Length of the mutable vector. -length :: MVector s a -> Int - --- | Check whether the vector is empty -null :: MVector s a -> Bool - --- | Yield a part of the mutable vector without copying it. -slice :: Int -> Int -> MVector s a -> MVector s a -init :: MVector s a -> MVector s a -tail :: MVector s a -> MVector s a -take :: Int -> MVector s a -> MVector s a -drop :: Int -> MVector s a -> MVector s a -splitAt :: Int -> MVector s a -> (MVector s a, MVector s a) - --- | Yield a part of the mutable vector without copying it. No bounds --- checks are performed. -unsafeSlice :: Int -> Int -> MVector s a -> MVector s a -unsafeInit :: MVector s a -> MVector s a -unsafeTail :: MVector s a -> MVector s a -unsafeTake :: Int -> MVector s a -> MVector s a -unsafeDrop :: Int -> MVector s a -> MVector s a -overlaps :: MVector s a -> MVector s a -> Bool - --- | Create a mutable vector of the given length. -new :: PrimMonad m => Int -> m (MVector (PrimState m) a) - --- | Create a mutable vector of the given length. The length is not --- checked. -unsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) a) - --- | Create a mutable vector of the given length (0 if the length is --- negative) and fill it with an initial value. -replicate :: PrimMonad m => Int -> a -> m (MVector (PrimState m) a) - --- | Create a mutable vector of the given length (0 if the length is --- negative) and fill it with values produced by repeatedly executing the --- monadic action. -replicateM :: PrimMonad m => Int -> m a -> m (MVector (PrimState m) a) - --- | Create a copy of a mutable vector. -clone :: PrimMonad m => MVector (PrimState m) a -> m (MVector (PrimState m) a) - --- | Grow a vector by the given number of elements. The number must be --- positive. -grow :: PrimMonad m => MVector (PrimState m) a -> Int -> m (MVector (PrimState m) a) - --- | Grow a vector by the given number of elements. The number must be --- positive but this is not checked. -unsafeGrow :: PrimMonad m => MVector (PrimState m) a -> Int -> m (MVector (PrimState m) a) - --- | Reset all elements of the vector to some undefined value, clearing all --- references to external objects. This is usually a noop for unboxed --- vectors. -clear :: PrimMonad m => MVector (PrimState m) a -> m () - --- | Yield the element at the given position. -read :: PrimMonad m => MVector (PrimState m) a -> Int -> m a - --- | Replace the element at the given position. -write :: PrimMonad m => MVector (PrimState m) a -> Int -> a -> m () - --- | Swap the elements at the given positions. -swap :: PrimMonad m => MVector (PrimState m) a -> Int -> Int -> m () - --- | Yield the element at the given position. No bounds checks are --- performed. -unsafeRead :: PrimMonad m => MVector (PrimState m) a -> Int -> m a - --- | Replace the element at the given position. No bounds checks are --- performed. -unsafeWrite :: PrimMonad m => MVector (PrimState m) a -> Int -> a -> m () - --- | Swap the elements at the given positions. No bounds checks are --- performed. -unsafeSwap :: PrimMonad m => MVector (PrimState m) a -> Int -> Int -> m () - --- | Set all elements of the vector to the given value. -set :: PrimMonad m => MVector (PrimState m) a -> a -> m () - --- | Copy a vector. The two vectors must have the same length and may not --- overlap. -copy :: PrimMonad m => MVector (PrimState m) a -> MVector (PrimState m) a -> m () - --- | Move the contents of a vector. The two vectors must have the same --- length. --- --- If the vectors do not overlap, then this is equivalent to copy. --- Otherwise, the copying is performed as if the source vector were --- copied to a temporary vector and then the temporary vector was copied --- to the target vector. -move :: PrimMonad m => MVector (PrimState m) a -> MVector (PrimState m) a -> m () - --- | Copy a vector. The two vectors must have the same length and may not --- overlap. This is not checked. -unsafeCopy :: PrimMonad m => MVector (PrimState m) a -> MVector (PrimState m) a -> m () - --- | Move the contents of a vector. The two vectors must have the same --- length, but this is not checked. --- --- If the vectors do not overlap, then this is equivalent to --- unsafeCopy. Otherwise, the copying is performed as if the --- source vector were copied to a temporary vector and then the temporary --- vector was copied to the target vector. -unsafeMove :: PrimMonad m => MVector (PrimState m) a -> MVector (PrimState m) a -> m () -instance Typeable2 MVector -instance MVector MVector a - - --- | A library for boxed vectors (that is, polymorphic arrays capable of --- holding any Haskell value). The vectors come in two flavours: --- --- --- --- and support a rich interface of both list-like operations, and bulk --- array operations. --- --- For unboxed arrays, use Data.Vector.Unboxed -module Data.Vector - --- | Boxed vectors, supporting efficient slicing. -data Vector a - --- | Mutable boxed vectors keyed on the monad they live in (IO or --- ST s). -data MVector s a - --- | O(1) Yield the length of the vector. -length :: Vector a -> Int - --- | O(1) Test whether a vector if empty -null :: Vector a -> Bool - --- | O(1) Indexing -(!) :: Vector a -> Int -> a - --- | O(1) Safe indexing -(!?) :: Vector a -> Int -> Maybe a - --- | O(1) First element -head :: Vector a -> a - --- | O(1) Last element -last :: Vector a -> a - --- | O(1) Unsafe indexing without bounds checking -unsafeIndex :: Vector a -> Int -> a - --- | O(1) First element without checking if the vector is empty -unsafeHead :: Vector a -> a - --- | O(1) Last element without checking if the vector is empty -unsafeLast :: Vector a -> a - --- | O(1) Indexing in a monad. --- --- The monad allows operations to be strict in the vector when necessary. --- Suppose vector copying is implemented like this: --- --- 
---   copy mv v = ... write mv i (v ! i) ...
---
--- --- For lazy vectors, v ! i would not be evaluated which means --- that mv would unnecessarily retain a reference to v --- in each element written. --- --- With indexM, copying can be implemented like this instead: --- --- 
---   copy mv v = ... do
---                     x <- indexM v i
---                     write mv i x
---
--- --- Here, no references to v are retained because indexing (but --- not the elements) is evaluated eagerly. -indexM :: Monad m => Vector a -> Int -> m a - --- | O(1) First element of a vector in a monad. See indexM --- for an explanation of why this is useful. -headM :: Monad m => Vector a -> m a - --- | O(1) Last element of a vector in a monad. See indexM for --- an explanation of why this is useful. -lastM :: Monad m => Vector a -> m a - --- | O(1) Indexing in a monad without bounds checks. See --- indexM for an explanation of why this is useful. -unsafeIndexM :: Monad m => Vector a -> Int -> m a - --- | O(1) First element in a monad without checking for empty --- vectors. See indexM for an explanation of why this is useful. -unsafeHeadM :: Monad m => Vector a -> m a - --- | O(1) Last element in a monad without checking for empty --- vectors. See indexM for an explanation of why this is useful. -unsafeLastM :: Monad m => Vector a -> m a - --- | O(1) Yield a slice of the vector without copying it. The vector --- must contain at least i+n elements. -slice :: Int -> Int -> Vector a -> Vector a - --- | O(1) Yield all but the last element without copying. The vector --- may not be empty. -init :: Vector a -> Vector a - --- | O(1) Yield all but the first element without copying. The --- vector may not be empty. -tail :: Vector a -> Vector a - --- | O(1) Yield at the first n elements without copying. --- The vector may contain less than n elements in which case it --- is returned unchanged. -take :: Int -> Vector a -> Vector a - --- | O(1) Yield all but the first n elements without --- copying. The vector may contain less than n elements in which --- case an empty vector is returned. -drop :: Int -> Vector a -> Vector a - --- | O(1) Yield the first n elements paired with the --- remainder without copying. --- --- Note that splitAt n v is equivalent to --- (take n v, drop n v) but slightly more --- efficient. -splitAt :: Int -> Vector a -> (Vector a, Vector a) - --- | O(1) Yield a slice of the vector without copying. The vector --- must contain at least i+n elements but this is not checked. -unsafeSlice :: Int -> Int -> Vector a -> Vector a - --- | O(1) Yield all but the last element without copying. The vector --- may not be empty but this is not checked. -unsafeInit :: Vector a -> Vector a - --- | O(1) Yield all but the first element without copying. The --- vector may not be empty but this is not checked. -unsafeTail :: Vector a -> Vector a - --- | O(1) Yield the first n elements without copying. The --- vector must contain at least n elements but this is not --- checked. -unsafeTake :: Int -> Vector a -> Vector a - --- | O(1) Yield all but the first n elements without --- copying. The vector must contain at least n elements but this --- is not checked. -unsafeDrop :: Int -> Vector a -> Vector a - --- | O(1) Empty vector -empty :: Vector a - --- | O(1) Vector with exactly one element -singleton :: a -> Vector a - --- | O(n) Vector of the given length with the same value in each --- position -replicate :: Int -> a -> Vector a - --- | O(n) Construct a vector of the given length by applying the --- function to each index -generate :: Int -> (Int -> a) -> Vector a - --- | O(n) Apply function n times to value. Zeroth element is --- original value. -iterateN :: Int -> (a -> a) -> a -> Vector a - --- | O(n) Execute the monadic action the given number of times and --- store the results in a vector. -replicateM :: Monad m => Int -> m a -> m (Vector a) - --- | O(n) Construct a vector of the given length by applying the --- monadic action to each index -generateM :: Monad m => Int -> (Int -> m a) -> m (Vector a) - --- | Execute the monadic action and freeze the resulting vector. --- --- 
---   create (do { v <- new 2; write v 0 'a'; write v 1 'b' }) = <a,b>
---
-create :: (forall s. ST s (MVector s a)) -> Vector a - --- | O(n) Construct a vector by repeatedly applying the generator --- function to a seed. The generator function yields Just the next --- element and the new seed or Nothing if there are no more --- elements. --- --- 
---   unfoldr (\n -> if n == 0 then Nothing else Just (n,n-1)) 10
---    = <10,9,8,7,6,5,4,3,2,1>
---
-unfoldr :: (b -> Maybe (a, b)) -> b -> Vector a - --- | O(n) Construct a vector with at most n by repeatedly --- applying the generator function to the a seed. The generator function --- yields Just the next element and the new seed or Nothing --- if there are no more elements. --- --- 
---   unfoldrN 3 (\n -> Just (n,n-1)) 10 = <10,9,8>
---
-unfoldrN :: Int -> (b -> Maybe (a, b)) -> b -> Vector a - --- | O(n) Construct a vector with n elements by repeatedly --- applying the generator function to the already constructed part of the --- vector. --- --- 
---   constructN 3 f = let a = f <> ; b = f <a> ; c = f <a,b> in f <a,b,c>
---
-constructN :: Int -> (Vector a -> a) -> Vector a - --- | O(n) Construct a vector with n elements from right to --- left by repeatedly applying the generator function to the already --- constructed part of the vector. --- --- 
---   constructrN 3 f = let a = f <> ; b = f<a> ; c = f <b,a> in f <c,b,a>
---
-constructrN :: Int -> (Vector a -> a) -> Vector a - --- | O(n) Yield a vector of the given length containing the values --- x, x+1 etc. This operation is usually more efficient --- than enumFromTo. --- --- 
---   enumFromN 5 3 = <5,6,7>
---
-enumFromN :: Num a => a -> Int -> Vector a - --- | O(n) Yield a vector of the given length containing the values --- x, x+y, x+y+y etc. This operations is --- usually more efficient than enumFromThenTo. --- --- 
---   enumFromStepN 1 0.1 5 = <1,1.1,1.2,1.3,1.4>
---
-enumFromStepN :: Num a => a -> a -> Int -> Vector a - --- | O(n) Enumerate values from x to y. --- --- WARNING: This operation can be very inefficient. If at all --- possible, use enumFromN instead. -enumFromTo :: Enum a => a -> a -> Vector a - --- | O(n) Enumerate values from x to y with a --- specific step z. --- --- WARNING: This operation can be very inefficient. If at all --- possible, use enumFromStepN instead. -enumFromThenTo :: Enum a => a -> a -> a -> Vector a - --- | O(n) Prepend an element -cons :: a -> Vector a -> Vector a - --- | O(n) Append an element -snoc :: Vector a -> a -> Vector a - --- | O(m+n) Concatenate two vectors -(++) :: Vector a -> Vector a -> Vector a - --- | O(n) Concatenate all vectors in the list -concat :: [Vector a] -> Vector a - --- | O(n) Yield the argument but force it not to retain any extra --- memory, possibly by copying it. --- --- This is especially useful when dealing with slices. For example: --- --- 
---   force (slice 0 2 <huge vector>)
---
--- --- Here, the slice retains a reference to the huge vector. Forcing it --- creates a copy of just the elements that belong to the slice and --- allows the huge vector to be garbage collected. -force :: Vector a -> Vector a - --- | O(m+n) For each pair (i,a) from the list, replace the --- vector element at position i by a. --- --- 
---   <5,9,2,7> // [(2,1),(0,3),(2,8)] = <3,9,8,7>
---
-(//) :: Vector a -> [(Int, a)] -> Vector a - --- | O(m+n) For each pair (i,a) from the vector of --- index/value pairs, replace the vector element at position i --- by a. --- --- 
---   update <5,9,2,7> <(2,1),(0,3),(2,8)> = <3,9,8,7>
---
-update :: Vector a -> Vector (Int, a) -> Vector a - --- | O(m+min(n1,n2)) For each index i from the index vector --- and the corresponding value a from the value vector, replace --- the element of the initial vector at position i by --- a. --- --- 
---   update_ <5,9,2,7>  <2,0,2> <1,3,8> = <3,9,8,7>
---
--- --- The function update provides the same functionality and is --- usually more convenient. --- --- 
---   update_ xs is ys = update xs (zip is ys)
---
-update_ :: Vector a -> Vector Int -> Vector a -> Vector a - --- | Same as (//) but without bounds checking. -unsafeUpd :: Vector a -> [(Int, a)] -> Vector a - --- | Same as update but without bounds checking. -unsafeUpdate :: Vector a -> Vector (Int, a) -> Vector a - --- | Same as update_ but without bounds checking. -unsafeUpdate_ :: Vector a -> Vector Int -> Vector a -> Vector a - --- | O(m+n) For each pair (i,b) from the list, replace the --- vector element a at position i by f a b. --- --- 
---   accum (+) <5,9,2> [(2,4),(1,6),(0,3),(1,7)] = <5+3, 9+6+7, 2+4>
---
-accum :: (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a - --- | O(m+n) For each pair (i,b) from the vector of pairs, --- replace the vector element a at position i by f --- a b. --- --- 
---   accumulate (+) <5,9,2> <(2,4),(1,6),(0,3),(1,7)> = <5+3, 9+6+7, 2+4>
---
-accumulate :: (a -> b -> a) -> Vector a -> Vector (Int, b) -> Vector a - --- | O(m+min(n1,n2)) For each index i from the index vector --- and the corresponding value b from the the value vector, --- replace the element of the initial vector at position i by --- f a b. --- --- 
---   accumulate_ (+) <5,9,2> <2,1,0,1> <4,6,3,7> = <5+3, 9+6+7, 2+4>
---
--- --- The function accumulate provides the same functionality and is --- usually more convenient. --- --- 
---   accumulate_ f as is bs = accumulate f as (zip is bs)
---
-accumulate_ :: (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a - --- | Same as accum but without bounds checking. -unsafeAccum :: (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a - --- | Same as accumulate but without bounds checking. -unsafeAccumulate :: (a -> b -> a) -> Vector a -> Vector (Int, b) -> Vector a - --- | Same as accumulate_ but without bounds checking. -unsafeAccumulate_ :: (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a - --- | O(n) Reverse a vector -reverse :: Vector a -> Vector a - --- | O(n) Yield the vector obtained by replacing each element --- i of the index vector by xs!i. This is --- equivalent to map (xs!) is but is often much --- more efficient. --- --- 
---   backpermute <a,b,c,d> <0,3,2,3,1,0> = <a,d,c,d,b,a>
---
-backpermute :: Vector a -> Vector Int -> Vector a - --- | Same as backpermute but without bounds checking. -unsafeBackpermute :: Vector a -> Vector Int -> Vector a - --- | Apply a destructive operation to a vector. The operation will be --- performed in place if it is safe to do so and will modify a copy of --- the vector otherwise. --- --- 
---   modify (\v -> write v 0 'x') (replicate 3 'a') = <'x','a','a'>
---
-modify :: (forall s. MVector s a -> ST s ()) -> Vector a -> Vector a - --- | O(n) Pair each element in a vector with its index -indexed :: Vector a -> Vector (Int, a) - --- | O(n) Map a function over a vector -map :: (a -> b) -> Vector a -> Vector b - --- | O(n) Apply a function to every element of a vector and its --- index -imap :: (Int -> a -> b) -> Vector a -> Vector b - --- | Map a function over a vector and concatenate the results. -concatMap :: (a -> Vector b) -> Vector a -> Vector b - --- | O(n) Apply the monadic action to all elements of the vector, --- yielding a vector of results -mapM :: Monad m => (a -> m b) -> Vector a -> m (Vector b) - --- | O(n) Apply the monadic action to all elements of a vector and --- ignore the results -mapM_ :: Monad m => (a -> m b) -> Vector a -> m () - --- | O(n) Apply the monadic action to all elements of the vector, --- yielding a vector of results. Equvalent to flip mapM. -forM :: Monad m => Vector a -> (a -> m b) -> m (Vector b) - --- | O(n) Apply the monadic action to all elements of a vector and --- ignore the results. Equivalent to flip mapM_. -forM_ :: Monad m => Vector a -> (a -> m b) -> m () - --- | O(min(m,n)) Zip two vectors with the given function. -zipWith :: (a -> b -> c) -> Vector a -> Vector b -> Vector c - --- | Zip three vectors with the given function. -zipWith3 :: (a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d -zipWith4 :: (a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -zipWith5 :: (a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -zipWith6 :: (a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g - --- | O(min(m,n)) Zip two vectors with a function that also takes the --- elements' indices. -izipWith :: (Int -> a -> b -> c) -> Vector a -> Vector b -> Vector c - --- | Zip three vectors and their indices with the given function. -izipWith3 :: (Int -> a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d -izipWith4 :: (Int -> a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -izipWith5 :: (Int -> a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -izipWith6 :: (Int -> a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g - --- | Elementwise pairing of array elements. -zip :: Vector a -> Vector b -> Vector (a, b) - --- | zip together three vectors into a vector of triples -zip3 :: Vector a -> Vector b -> Vector c -> Vector (a, b, c) -zip4 :: Vector a -> Vector b -> Vector c -> Vector d -> Vector (a, b, c, d) -zip5 :: Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector (a, b, c, d, e) -zip6 :: Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector (a, b, c, d, e, f) - --- | O(min(m,n)) Zip the two vectors with the monadic action and --- yield a vector of results -zipWithM :: Monad m => (a -> b -> m c) -> Vector a -> Vector b -> m (Vector c) - --- | O(min(m,n)) Zip the two vectors with the monadic action and --- ignore the results -zipWithM_ :: Monad m => (a -> b -> m c) -> Vector a -> Vector b -> m () - --- | O(min(m,n)) Unzip a vector of pairs. -unzip :: Vector (a, b) -> (Vector a, Vector b) -unzip3 :: Vector (a, b, c) -> (Vector a, Vector b, Vector c) -unzip4 :: Vector (a, b, c, d) -> (Vector a, Vector b, Vector c, Vector d) -unzip5 :: Vector (a, b, c, d, e) -> (Vector a, Vector b, Vector c, Vector d, Vector e) -unzip6 :: Vector (a, b, c, d, e, f) -> (Vector a, Vector b, Vector c, Vector d, Vector e, Vector f) - --- | O(n) Drop elements that do not satisfy the predicate -filter :: (a -> Bool) -> Vector a -> Vector a - --- | O(n) Drop elements that do not satisfy the predicate which is --- applied to values and their indices -ifilter :: (Int -> a -> Bool) -> Vector a -> Vector a - --- | O(n) Drop elements that do not satisfy the monadic predicate -filterM :: Monad m => (a -> m Bool) -> Vector a -> m (Vector a) - --- | O(n) Yield the longest prefix of elements satisfying the --- predicate without copying. -takeWhile :: (a -> Bool) -> Vector a -> Vector a - --- | O(n) Drop the longest prefix of elements that satisfy the --- predicate without copying. -dropWhile :: (a -> Bool) -> Vector a -> Vector a - --- | O(n) Split the vector in two parts, the first one containing --- those elements that satisfy the predicate and the second one those --- that don't. The relative order of the elements is preserved at the --- cost of a sometimes reduced performance compared to --- unstablePartition. -partition :: (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Split the vector in two parts, the first one containing --- those elements that satisfy the predicate and the second one those --- that don't. The order of the elements is not preserved but the --- operation is often faster than partition. -unstablePartition :: (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Split the vector into the longest prefix of elements that --- satisfy the predicate and the rest without copying. -span :: (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Split the vector into the longest prefix of elements that --- do not satisfy the predicate and the rest without copying. -break :: (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Check if the vector contains an element -elem :: Eq a => a -> Vector a -> Bool - --- | O(n) Check if the vector does not contain an element (inverse --- of elem) -notElem :: Eq a => a -> Vector a -> Bool - --- | O(n) Yield Just the first element matching the predicate --- or Nothing if no such element exists. -find :: (a -> Bool) -> Vector a -> Maybe a - --- | O(n) Yield Just the index of the first element matching --- the predicate or Nothing if no such element exists. -findIndex :: (a -> Bool) -> Vector a -> Maybe Int - --- | O(n) Yield the indices of elements satisfying the predicate in --- ascending order. -findIndices :: (a -> Bool) -> Vector a -> Vector Int - --- | O(n) Yield Just the index of the first occurence of the --- given element or Nothing if the vector does not contain the --- element. This is a specialised version of findIndex. -elemIndex :: Eq a => a -> Vector a -> Maybe Int - --- | O(n) Yield the indices of all occurences of the given element --- in ascending order. This is a specialised version of --- findIndices. -elemIndices :: Eq a => a -> Vector a -> Vector Int - --- | O(n) Left fold -foldl :: (a -> b -> a) -> a -> Vector b -> a - --- | O(n) Left fold on non-empty vectors -foldl1 :: (a -> a -> a) -> Vector a -> a - --- | O(n) Left fold with strict accumulator -foldl' :: (a -> b -> a) -> a -> Vector b -> a - --- | O(n) Left fold on non-empty vectors with strict accumulator -foldl1' :: (a -> a -> a) -> Vector a -> a - --- | O(n) Right fold -foldr :: (a -> b -> b) -> b -> Vector a -> b - --- | O(n) Right fold on non-empty vectors -foldr1 :: (a -> a -> a) -> Vector a -> a - --- | O(n) Right fold with a strict accumulator -foldr' :: (a -> b -> b) -> b -> Vector a -> b - --- | O(n) Right fold on non-empty vectors with strict accumulator -foldr1' :: (a -> a -> a) -> Vector a -> a - --- | O(n) Left fold (function applied to each element and its index) -ifoldl :: (a -> Int -> b -> a) -> a -> Vector b -> a - --- | O(n) Left fold with strict accumulator (function applied to --- each element and its index) -ifoldl' :: (a -> Int -> b -> a) -> a -> Vector b -> a - --- | O(n) Right fold (function applied to each element and its --- index) -ifoldr :: (Int -> a -> b -> b) -> b -> Vector a -> b - --- | O(n) Right fold with strict accumulator (function applied to --- each element and its index) -ifoldr' :: (Int -> a -> b -> b) -> b -> Vector a -> b - --- | O(n) Check if all elements satisfy the predicate. -all :: (a -> Bool) -> Vector a -> Bool - --- | O(n) Check if any element satisfies the predicate. -any :: (a -> Bool) -> Vector a -> Bool - --- | O(n) Check if all elements are True -and :: Vector Bool -> Bool - --- | O(n) Check if any element is True -or :: Vector Bool -> Bool - --- | O(n) Compute the sum of the elements -sum :: Num a => Vector a -> a - --- | O(n) Compute the produce of the elements -product :: Num a => Vector a -> a - --- | O(n) Yield the maximum element of the vector. The vector may --- not be empty. -maximum :: Ord a => Vector a -> a - --- | O(n) Yield the maximum element of the vector according to the --- given comparison function. The vector may not be empty. -maximumBy :: (a -> a -> Ordering) -> Vector a -> a - --- | O(n) Yield the minimum element of the vector. The vector may --- not be empty. -minimum :: Ord a => Vector a -> a - --- | O(n) Yield the minimum element of the vector according to the --- given comparison function. The vector may not be empty. -minimumBy :: (a -> a -> Ordering) -> Vector a -> a - --- | O(n) Yield the index of the minimum element of the vector. The --- vector may not be empty. -minIndex :: Ord a => Vector a -> Int - --- | O(n) Yield the index of the minimum element of the vector --- according to the given comparison function. The vector may not be --- empty. -minIndexBy :: (a -> a -> Ordering) -> Vector a -> Int - --- | O(n) Yield the index of the maximum element of the vector. The --- vector may not be empty. -maxIndex :: Ord a => Vector a -> Int - --- | O(n) Yield the index of the maximum element of the vector --- according to the given comparison function. The vector may not be --- empty. -maxIndexBy :: (a -> a -> Ordering) -> Vector a -> Int - --- | O(n) Monadic fold -foldM :: Monad m => (a -> b -> m a) -> a -> Vector b -> m a - --- | O(n) Monadic fold with strict accumulator -foldM' :: Monad m => (a -> b -> m a) -> a -> Vector b -> m a - --- | O(n) Monadic fold over non-empty vectors -fold1M :: Monad m => (a -> a -> m a) -> Vector a -> m a - --- | O(n) Monadic fold over non-empty vectors with strict --- accumulator -fold1M' :: Monad m => (a -> a -> m a) -> Vector a -> m a - --- | O(n) Monadic fold that discards the result -foldM_ :: Monad m => (a -> b -> m a) -> a -> Vector b -> m () - --- | O(n) Monadic fold with strict accumulator that discards the --- result -foldM'_ :: Monad m => (a -> b -> m a) -> a -> Vector b -> m () - --- | O(n) Monadic fold over non-empty vectors that discards the --- result -fold1M_ :: Monad m => (a -> a -> m a) -> Vector a -> m () - --- | O(n) Monadic fold over non-empty vectors with strict --- accumulator that discards the result -fold1M'_ :: Monad m => (a -> a -> m a) -> Vector a -> m () - --- | Evaluate each action and collect the results -sequence :: Monad m => Vector (m a) -> m (Vector a) - --- | Evaluate each action and discard the results -sequence_ :: Monad m => Vector (m a) -> m () - --- | O(n) Prescan --- --- 
---   prescanl f z = init . scanl f z
---
--- --- Example: prescanl (+) 0 <1,2,3,4> = <0,1,3,6> -prescanl :: (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Prescan with strict accumulator -prescanl' :: (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Scan --- --- 
---   postscanl f z = tail . scanl f z
---
--- --- Example: postscanl (+) 0 <1,2,3,4> = <1,3,6,10> -postscanl :: (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Scan with strict accumulator -postscanl' :: (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Haskell-style scan --- --- 
---   scanl f z <x1,...,xn> = <y1,...,y(n+1)>
---     where y1 = z
---           yi = f y(i-1) x(i-1)
---
--- --- Example: scanl (+) 0 <1,2,3,4> = <0,1,3,6,10> -scanl :: (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Haskell-style scan with strict accumulator -scanl' :: (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Scan over a non-empty vector --- --- 
---   scanl f <x1,...,xn> = <y1,...,yn>
---     where y1 = x1
---           yi = f y(i-1) xi
---
-scanl1 :: (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Scan over a non-empty vector with a strict accumulator -scanl1' :: (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Right-to-left prescan --- --- 
---   prescanr f z = reverse . prescanl (flip f) z . reverse
---
-prescanr :: (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left prescan with strict accumulator -prescanr' :: (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left scan -postscanr :: (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left scan with strict accumulator -postscanr' :: (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left Haskell-style scan -scanr :: (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left Haskell-style scan with strict accumulator -scanr' :: (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left scan over a non-empty vector -scanr1 :: (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Right-to-left scan over a non-empty vector with a strict --- accumulator -scanr1' :: (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Convert a vector to a list -toList :: Vector a -> [a] - --- | O(n) Convert a list to a vector -fromList :: [a] -> Vector a - --- | O(n) Convert the first n elements of a list to a --- vector --- --- 
---   fromListN n xs = fromList (take n xs)
---
-fromListN :: Int -> [a] -> Vector a - --- | O(n) Convert different vector types -convert :: (Vector v a, Vector w a) => v a -> w a - --- | O(n) Yield an immutable copy of the mutable vector. -freeze :: PrimMonad m => MVector (PrimState m) a -> m (Vector a) - --- | O(n) Yield a mutable copy of the immutable vector. -thaw :: PrimMonad m => Vector a -> m (MVector (PrimState m) a) - --- | O(n) Copy an immutable vector into a mutable one. The two --- vectors must have the same length. -copy :: PrimMonad m => MVector (PrimState m) a -> Vector a -> m () - --- | O(1) Unsafe convert a mutable vector to an immutable one --- without copying. The mutable vector may not be used after this --- operation. -unsafeFreeze :: PrimMonad m => MVector (PrimState m) a -> m (Vector a) - --- | O(1) Unsafely convert an immutable vector to a mutable one --- without copying. The immutable vector may not be used after this --- operation. -unsafeThaw :: PrimMonad m => Vector a -> m (MVector (PrimState m) a) - --- | O(n) Copy an immutable vector into a mutable one. The two --- vectors must have the same length. This is not checked. -unsafeCopy :: PrimMonad m => MVector (PrimState m) a -> Vector a -> m () -instance Typeable1 Vector -instance Traversable Vector -instance Foldable Vector -instance Alternative Vector -instance Applicative Vector -instance MonadPlus Vector -instance Monad Vector -instance Functor Vector -instance Monoid (Vector a) -instance Ord a => Ord (Vector a) -instance Eq a => Eq (Vector a) -instance Vector Vector a -instance Data a => Data (Vector a) -instance Read a => Read (Vector a) -instance Show a => Show (Vector a) - - --- | Safe interface to Data.Vector -module Data.Vector.Safe - --- | Boxed vectors, supporting efficient slicing. -data Vector a - --- | Mutable boxed vectors keyed on the monad they live in (IO or --- ST s). -data MVector s a - --- | O(1) Yield the length of the vector. -length :: Vector a -> Int - --- | O(1) Test whether a vector if empty -null :: Vector a -> Bool - --- | O(1) Indexing -(!) :: Vector a -> Int -> a - --- | O(1) Safe indexing -(!?) :: Vector a -> Int -> Maybe a - --- | O(1) First element -head :: Vector a -> a - --- | O(1) Last element -last :: Vector a -> a - --- | O(1) Indexing in a monad. --- --- The monad allows operations to be strict in the vector when necessary. --- Suppose vector copying is implemented like this: --- --- 
---   copy mv v = ... write mv i (v ! i) ...
---
--- --- For lazy vectors, v ! i would not be evaluated which means --- that mv would unnecessarily retain a reference to v --- in each element written. --- --- With indexM, copying can be implemented like this instead: --- --- 
---   copy mv v = ... do
---                     x <- indexM v i
---                     write mv i x
---
--- --- Here, no references to v are retained because indexing (but --- not the elements) is evaluated eagerly. -indexM :: Monad m => Vector a -> Int -> m a - --- | O(1) First element of a vector in a monad. See indexM --- for an explanation of why this is useful. -headM :: Monad m => Vector a -> m a - --- | O(1) Last element of a vector in a monad. See indexM for --- an explanation of why this is useful. -lastM :: Monad m => Vector a -> m a - --- | O(1) Yield a slice of the vector without copying it. The vector --- must contain at least i+n elements. -slice :: Int -> Int -> Vector a -> Vector a - --- | O(1) Yield all but the last element without copying. The vector --- may not be empty. -init :: Vector a -> Vector a - --- | O(1) Yield all but the first element without copying. The --- vector may not be empty. -tail :: Vector a -> Vector a - --- | O(1) Yield at the first n elements without copying. --- The vector may contain less than n elements in which case it --- is returned unchanged. -take :: Int -> Vector a -> Vector a - --- | O(1) Yield all but the first n elements without --- copying. The vector may contain less than n elements in which --- case an empty vector is returned. -drop :: Int -> Vector a -> Vector a - --- | O(1) Yield the first n elements paired with the --- remainder without copying. --- --- Note that splitAt n v is equivalent to --- (take n v, drop n v) but slightly more --- efficient. -splitAt :: Int -> Vector a -> (Vector a, Vector a) - --- | O(1) Empty vector -empty :: Vector a - --- | O(1) Vector with exactly one element -singleton :: a -> Vector a - --- | O(n) Vector of the given length with the same value in each --- position -replicate :: Int -> a -> Vector a - --- | O(n) Construct a vector of the given length by applying the --- function to each index -generate :: Int -> (Int -> a) -> Vector a - --- | O(n) Apply function n times to value. Zeroth element is --- original value. -iterateN :: Int -> (a -> a) -> a -> Vector a - --- | O(n) Execute the monadic action the given number of times and --- store the results in a vector. -replicateM :: Monad m => Int -> m a -> m (Vector a) - --- | O(n) Construct a vector of the given length by applying the --- monadic action to each index -generateM :: Monad m => Int -> (Int -> m a) -> m (Vector a) - --- | Execute the monadic action and freeze the resulting vector. --- --- 
---   create (do { v <- new 2; write v 0 'a'; write v 1 'b' }) = <a,b>
---
-create :: (forall s. ST s (MVector s a)) -> Vector a - --- | O(n) Construct a vector by repeatedly applying the generator --- function to a seed. The generator function yields Just the next --- element and the new seed or Nothing if there are no more --- elements. --- --- 
---   unfoldr (\n -> if n == 0 then Nothing else Just (n,n-1)) 10
---    = <10,9,8,7,6,5,4,3,2,1>
---
-unfoldr :: (b -> Maybe (a, b)) -> b -> Vector a - --- | O(n) Construct a vector with at most n by repeatedly --- applying the generator function to the a seed. The generator function --- yields Just the next element and the new seed or Nothing --- if there are no more elements. --- --- 
---   unfoldrN 3 (\n -> Just (n,n-1)) 10 = <10,9,8>
---
-unfoldrN :: Int -> (b -> Maybe (a, b)) -> b -> Vector a - --- | O(n) Construct a vector with n elements by repeatedly --- applying the generator function to the already constructed part of the --- vector. --- --- 
---   constructN 3 f = let a = f <> ; b = f <a> ; c = f <a,b> in f <a,b,c>
---
-constructN :: Int -> (Vector a -> a) -> Vector a - --- | O(n) Construct a vector with n elements from right to --- left by repeatedly applying the generator function to the already --- constructed part of the vector. --- --- 
---   constructrN 3 f = let a = f <> ; b = f<a> ; c = f <b,a> in f <c,b,a>
---
-constructrN :: Int -> (Vector a -> a) -> Vector a - --- | O(n) Yield a vector of the given length containing the values --- x, x+1 etc. This operation is usually more efficient --- than enumFromTo. --- --- 
---   enumFromN 5 3 = <5,6,7>
---
-enumFromN :: Num a => a -> Int -> Vector a - --- | O(n) Yield a vector of the given length containing the values --- x, x+y, x+y+y etc. This operations is --- usually more efficient than enumFromThenTo. --- --- 
---   enumFromStepN 1 0.1 5 = <1,1.1,1.2,1.3,1.4>
---
-enumFromStepN :: Num a => a -> a -> Int -> Vector a - --- | O(n) Enumerate values from x to y. --- --- WARNING: This operation can be very inefficient. If at all --- possible, use enumFromN instead. -enumFromTo :: Enum a => a -> a -> Vector a - --- | O(n) Enumerate values from x to y with a --- specific step z. --- --- WARNING: This operation can be very inefficient. If at all --- possible, use enumFromStepN instead. -enumFromThenTo :: Enum a => a -> a -> a -> Vector a - --- | O(n) Prepend an element -cons :: a -> Vector a -> Vector a - --- | O(n) Append an element -snoc :: Vector a -> a -> Vector a - --- | O(m+n) Concatenate two vectors -(++) :: Vector a -> Vector a -> Vector a - --- | O(n) Concatenate all vectors in the list -concat :: [Vector a] -> Vector a - --- | O(n) Yield the argument but force it not to retain any extra --- memory, possibly by copying it. --- --- This is especially useful when dealing with slices. For example: --- --- 
---   force (slice 0 2 <huge vector>)
---
--- --- Here, the slice retains a reference to the huge vector. Forcing it --- creates a copy of just the elements that belong to the slice and --- allows the huge vector to be garbage collected. -force :: Vector a -> Vector a - --- | O(m+n) For each pair (i,a) from the list, replace the --- vector element at position i by a. --- --- 
---   <5,9,2,7> // [(2,1),(0,3),(2,8)] = <3,9,8,7>
---
-(//) :: Vector a -> [(Int, a)] -> Vector a - --- | O(m+n) For each pair (i,a) from the vector of --- index/value pairs, replace the vector element at position i --- by a. --- --- 
---   update <5,9,2,7> <(2,1),(0,3),(2,8)> = <3,9,8,7>
---
-update :: Vector a -> Vector (Int, a) -> Vector a - --- | O(m+min(n1,n2)) For each index i from the index vector --- and the corresponding value a from the value vector, replace --- the element of the initial vector at position i by --- a. --- --- 
---   update_ <5,9,2,7>  <2,0,2> <1,3,8> = <3,9,8,7>
---
--- --- The function update provides the same functionality and is --- usually more convenient. --- --- 
---   update_ xs is ys = update xs (zip is ys)
---
-update_ :: Vector a -> Vector Int -> Vector a -> Vector a - --- | O(m+n) For each pair (i,b) from the list, replace the --- vector element a at position i by f a b. --- --- 
---   accum (+) <5,9,2> [(2,4),(1,6),(0,3),(1,7)] = <5+3, 9+6+7, 2+4>
---
-accum :: (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a - --- | O(m+n) For each pair (i,b) from the vector of pairs, --- replace the vector element a at position i by f --- a b. --- --- 
---   accumulate (+) <5,9,2> <(2,4),(1,6),(0,3),(1,7)> = <5+3, 9+6+7, 2+4>
---
-accumulate :: (a -> b -> a) -> Vector a -> Vector (Int, b) -> Vector a - --- | O(m+min(n1,n2)) For each index i from the index vector --- and the corresponding value b from the the value vector, --- replace the element of the initial vector at position i by --- f a b. --- --- 
---   accumulate_ (+) <5,9,2> <2,1,0,1> <4,6,3,7> = <5+3, 9+6+7, 2+4>
---
--- --- The function accumulate provides the same functionality and is --- usually more convenient. --- --- 
---   accumulate_ f as is bs = accumulate f as (zip is bs)
---
-accumulate_ :: (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a - --- | O(n) Reverse a vector -reverse :: Vector a -> Vector a - --- | O(n) Yield the vector obtained by replacing each element --- i of the index vector by xs!i. This is --- equivalent to map (xs!) is but is often much --- more efficient. --- --- 
---   backpermute <a,b,c,d> <0,3,2,3,1,0> = <a,d,c,d,b,a>
---
-backpermute :: Vector a -> Vector Int -> Vector a - --- | Apply a destructive operation to a vector. The operation will be --- performed in place if it is safe to do so and will modify a copy of --- the vector otherwise. --- --- 
---   modify (\v -> write v 0 'x') (replicate 3 'a') = <'x','a','a'>
---
-modify :: (forall s. MVector s a -> ST s ()) -> Vector a -> Vector a - --- | O(n) Pair each element in a vector with its index -indexed :: Vector a -> Vector (Int, a) - --- | O(n) Map a function over a vector -map :: (a -> b) -> Vector a -> Vector b - --- | O(n) Apply a function to every element of a vector and its --- index -imap :: (Int -> a -> b) -> Vector a -> Vector b - --- | Map a function over a vector and concatenate the results. -concatMap :: (a -> Vector b) -> Vector a -> Vector b - --- | O(n) Apply the monadic action to all elements of the vector, --- yielding a vector of results -mapM :: Monad m => (a -> m b) -> Vector a -> m (Vector b) - --- | O(n) Apply the monadic action to all elements of a vector and --- ignore the results -mapM_ :: Monad m => (a -> m b) -> Vector a -> m () - --- | O(n) Apply the monadic action to all elements of the vector, --- yielding a vector of results. Equvalent to flip mapM. -forM :: Monad m => Vector a -> (a -> m b) -> m (Vector b) - --- | O(n) Apply the monadic action to all elements of a vector and --- ignore the results. Equivalent to flip mapM_. -forM_ :: Monad m => Vector a -> (a -> m b) -> m () - --- | O(min(m,n)) Zip two vectors with the given function. -zipWith :: (a -> b -> c) -> Vector a -> Vector b -> Vector c - --- | Zip three vectors with the given function. -zipWith3 :: (a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d -zipWith4 :: (a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -zipWith5 :: (a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -zipWith6 :: (a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g - --- | O(min(m,n)) Zip two vectors with a function that also takes the --- elements' indices. -izipWith :: (Int -> a -> b -> c) -> Vector a -> Vector b -> Vector c - --- | Zip three vectors and their indices with the given function. -izipWith3 :: (Int -> a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d -izipWith4 :: (Int -> a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -izipWith5 :: (Int -> a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -izipWith6 :: (Int -> a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g - --- | Elementwise pairing of array elements. -zip :: Vector a -> Vector b -> Vector (a, b) - --- | zip together three vectors into a vector of triples -zip3 :: Vector a -> Vector b -> Vector c -> Vector (a, b, c) -zip4 :: Vector a -> Vector b -> Vector c -> Vector d -> Vector (a, b, c, d) -zip5 :: Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector (a, b, c, d, e) -zip6 :: Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector (a, b, c, d, e, f) - --- | O(min(m,n)) Zip the two vectors with the monadic action and --- yield a vector of results -zipWithM :: Monad m => (a -> b -> m c) -> Vector a -> Vector b -> m (Vector c) - --- | O(min(m,n)) Zip the two vectors with the monadic action and --- ignore the results -zipWithM_ :: Monad m => (a -> b -> m c) -> Vector a -> Vector b -> m () - --- | O(min(m,n)) Unzip a vector of pairs. -unzip :: Vector (a, b) -> (Vector a, Vector b) -unzip3 :: Vector (a, b, c) -> (Vector a, Vector b, Vector c) -unzip4 :: Vector (a, b, c, d) -> (Vector a, Vector b, Vector c, Vector d) -unzip5 :: Vector (a, b, c, d, e) -> (Vector a, Vector b, Vector c, Vector d, Vector e) -unzip6 :: Vector (a, b, c, d, e, f) -> (Vector a, Vector b, Vector c, Vector d, Vector e, Vector f) - --- | O(n) Drop elements that do not satisfy the predicate -filter :: (a -> Bool) -> Vector a -> Vector a - --- | O(n) Drop elements that do not satisfy the predicate which is --- applied to values and their indices -ifilter :: (Int -> a -> Bool) -> Vector a -> Vector a - --- | O(n) Drop elements that do not satisfy the monadic predicate -filterM :: Monad m => (a -> m Bool) -> Vector a -> m (Vector a) - --- | O(n) Yield the longest prefix of elements satisfying the --- predicate without copying. -takeWhile :: (a -> Bool) -> Vector a -> Vector a - --- | O(n) Drop the longest prefix of elements that satisfy the --- predicate without copying. -dropWhile :: (a -> Bool) -> Vector a -> Vector a - --- | O(n) Split the vector in two parts, the first one containing --- those elements that satisfy the predicate and the second one those --- that don't. The relative order of the elements is preserved at the --- cost of a sometimes reduced performance compared to --- unstablePartition. -partition :: (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Split the vector in two parts, the first one containing --- those elements that satisfy the predicate and the second one those --- that don't. The order of the elements is not preserved but the --- operation is often faster than partition. -unstablePartition :: (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Split the vector into the longest prefix of elements that --- satisfy the predicate and the rest without copying. -span :: (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Split the vector into the longest prefix of elements that --- do not satisfy the predicate and the rest without copying. -break :: (a -> Bool) -> Vector a -> (Vector a, Vector a) - --- | O(n) Check if the vector contains an element -elem :: Eq a => a -> Vector a -> Bool - --- | O(n) Check if the vector does not contain an element (inverse --- of elem) -notElem :: Eq a => a -> Vector a -> Bool - --- | O(n) Yield Just the first element matching the predicate --- or Nothing if no such element exists. -find :: (a -> Bool) -> Vector a -> Maybe a - --- | O(n) Yield Just the index of the first element matching --- the predicate or Nothing if no such element exists. -findIndex :: (a -> Bool) -> Vector a -> Maybe Int - --- | O(n) Yield the indices of elements satisfying the predicate in --- ascending order. -findIndices :: (a -> Bool) -> Vector a -> Vector Int - --- | O(n) Yield Just the index of the first occurence of the --- given element or Nothing if the vector does not contain the --- element. This is a specialised version of findIndex. -elemIndex :: Eq a => a -> Vector a -> Maybe Int - --- | O(n) Yield the indices of all occurences of the given element --- in ascending order. This is a specialised version of --- findIndices. -elemIndices :: Eq a => a -> Vector a -> Vector Int - --- | O(n) Left fold -foldl :: (a -> b -> a) -> a -> Vector b -> a - --- | O(n) Left fold on non-empty vectors -foldl1 :: (a -> a -> a) -> Vector a -> a - --- | O(n) Left fold with strict accumulator -foldl' :: (a -> b -> a) -> a -> Vector b -> a - --- | O(n) Left fold on non-empty vectors with strict accumulator -foldl1' :: (a -> a -> a) -> Vector a -> a - --- | O(n) Right fold -foldr :: (a -> b -> b) -> b -> Vector a -> b - --- | O(n) Right fold on non-empty vectors -foldr1 :: (a -> a -> a) -> Vector a -> a - --- | O(n) Right fold with a strict accumulator -foldr' :: (a -> b -> b) -> b -> Vector a -> b - --- | O(n) Right fold on non-empty vectors with strict accumulator -foldr1' :: (a -> a -> a) -> Vector a -> a - --- | O(n) Left fold (function applied to each element and its index) -ifoldl :: (a -> Int -> b -> a) -> a -> Vector b -> a - --- | O(n) Left fold with strict accumulator (function applied to --- each element and its index) -ifoldl' :: (a -> Int -> b -> a) -> a -> Vector b -> a - --- | O(n) Right fold (function applied to each element and its --- index) -ifoldr :: (Int -> a -> b -> b) -> b -> Vector a -> b - --- | O(n) Right fold with strict accumulator (function applied to --- each element and its index) -ifoldr' :: (Int -> a -> b -> b) -> b -> Vector a -> b - --- | O(n) Check if all elements satisfy the predicate. -all :: (a -> Bool) -> Vector a -> Bool - --- | O(n) Check if any element satisfies the predicate. -any :: (a -> Bool) -> Vector a -> Bool - --- | O(n) Check if all elements are True -and :: Vector Bool -> Bool - --- | O(n) Check if any element is True -or :: Vector Bool -> Bool - --- | O(n) Compute the sum of the elements -sum :: Num a => Vector a -> a - --- | O(n) Compute the produce of the elements -product :: Num a => Vector a -> a - --- | O(n) Yield the maximum element of the vector. The vector may --- not be empty. -maximum :: Ord a => Vector a -> a - --- | O(n) Yield the maximum element of the vector according to the --- given comparison function. The vector may not be empty. -maximumBy :: (a -> a -> Ordering) -> Vector a -> a - --- | O(n) Yield the minimum element of the vector. The vector may --- not be empty. -minimum :: Ord a => Vector a -> a - --- | O(n) Yield the minimum element of the vector according to the --- given comparison function. The vector may not be empty. -minimumBy :: (a -> a -> Ordering) -> Vector a -> a - --- | O(n) Yield the index of the minimum element of the vector. The --- vector may not be empty. -minIndex :: Ord a => Vector a -> Int - --- | O(n) Yield the index of the minimum element of the vector --- according to the given comparison function. The vector may not be --- empty. -minIndexBy :: (a -> a -> Ordering) -> Vector a -> Int - --- | O(n) Yield the index of the maximum element of the vector. The --- vector may not be empty. -maxIndex :: Ord a => Vector a -> Int - --- | O(n) Yield the index of the maximum element of the vector --- according to the given comparison function. The vector may not be --- empty. -maxIndexBy :: (a -> a -> Ordering) -> Vector a -> Int - --- | O(n) Monadic fold -foldM :: Monad m => (a -> b -> m a) -> a -> Vector b -> m a - --- | O(n) Monadic fold with strict accumulator -foldM' :: Monad m => (a -> b -> m a) -> a -> Vector b -> m a - --- | O(n) Monadic fold over non-empty vectors -fold1M :: Monad m => (a -> a -> m a) -> Vector a -> m a - --- | O(n) Monadic fold over non-empty vectors with strict --- accumulator -fold1M' :: Monad m => (a -> a -> m a) -> Vector a -> m a - --- | O(n) Monadic fold that discards the result -foldM_ :: Monad m => (a -> b -> m a) -> a -> Vector b -> m () - --- | O(n) Monadic fold with strict accumulator that discards the --- result -foldM'_ :: Monad m => (a -> b -> m a) -> a -> Vector b -> m () - --- | O(n) Monadic fold over non-empty vectors that discards the --- result -fold1M_ :: Monad m => (a -> a -> m a) -> Vector a -> m () - --- | O(n) Monadic fold over non-empty vectors with strict --- accumulator that discards the result -fold1M'_ :: Monad m => (a -> a -> m a) -> Vector a -> m () - --- | Evaluate each action and collect the results -sequence :: Monad m => Vector (m a) -> m (Vector a) - --- | Evaluate each action and discard the results -sequence_ :: Monad m => Vector (m a) -> m () - --- | O(n) Prescan --- --- 
---   prescanl f z = init . scanl f z
---
--- --- Example: prescanl (+) 0 <1,2,3,4> = <0,1,3,6> -prescanl :: (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Prescan with strict accumulator -prescanl' :: (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Scan --- --- 
---   postscanl f z = tail . scanl f z
---
--- --- Example: postscanl (+) 0 <1,2,3,4> = <1,3,6,10> -postscanl :: (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Scan with strict accumulator -postscanl' :: (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Haskell-style scan --- --- 
---   scanl f z <x1,...,xn> = <y1,...,y(n+1)>
---     where y1 = z
---           yi = f y(i-1) x(i-1)
---
--- --- Example: scanl (+) 0 <1,2,3,4> = <0,1,3,6,10> -scanl :: (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Haskell-style scan with strict accumulator -scanl' :: (a -> b -> a) -> a -> Vector b -> Vector a - --- | O(n) Scan over a non-empty vector --- --- 
---   scanl f <x1,...,xn> = <y1,...,yn>
---     where y1 = x1
---           yi = f y(i-1) xi
---
-scanl1 :: (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Scan over a non-empty vector with a strict accumulator -scanl1' :: (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Right-to-left prescan --- --- 
---   prescanr f z = reverse . prescanl (flip f) z . reverse
---
-prescanr :: (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left prescan with strict accumulator -prescanr' :: (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left scan -postscanr :: (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left scan with strict accumulator -postscanr' :: (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left Haskell-style scan -scanr :: (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left Haskell-style scan with strict accumulator -scanr' :: (a -> b -> b) -> b -> Vector a -> Vector b - --- | O(n) Right-to-left scan over a non-empty vector -scanr1 :: (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Right-to-left scan over a non-empty vector with a strict --- accumulator -scanr1' :: (a -> a -> a) -> Vector a -> Vector a - --- | O(n) Convert a vector to a list -toList :: Vector a -> [a] - --- | O(n) Convert a list to a vector -fromList :: [a] -> Vector a - --- | O(n) Convert the first n elements of a list to a --- vector --- --- 
---   fromListN n xs = fromList (take n xs)
---
-fromListN :: Int -> [a] -> Vector a - --- | O(n) Convert different vector types -convert :: (Vector v a, Vector w a) => v a -> w a - --- | O(n) Yield an immutable copy of the mutable vector. -freeze :: PrimMonad m => MVector (PrimState m) a -> m (Vector a) - --- | O(n) Yield a mutable copy of the immutable vector. -thaw :: PrimMonad m => Vector a -> m (MVector (PrimState m) a) - --- | O(n) Copy an immutable vector into a mutable one. The two --- vectors must have the same length. -copy :: PrimMonad m => MVector (PrimState m) a -> Vector a -> m () - - --- | Safe interface to Data.Vector.Mutable -module Data.Vector.Mutable.Safe - --- | Mutable boxed vectors keyed on the monad they live in (IO or --- ST s). -data MVector s a -type IOVector = MVector RealWorld -type STVector s = MVector s - --- | Length of the mutable vector. -length :: MVector s a -> Int - --- | Check whether the vector is empty -null :: MVector s a -> Bool - --- | Yield a part of the mutable vector without copying it. -slice :: Int -> Int -> MVector s a -> MVector s a -init :: MVector s a -> MVector s a -tail :: MVector s a -> MVector s a -take :: Int -> MVector s a -> MVector s a -drop :: Int -> MVector s a -> MVector s a -splitAt :: Int -> MVector s a -> (MVector s a, MVector s a) -overlaps :: MVector s a -> MVector s a -> Bool - --- | Create a mutable vector of the given length. -new :: PrimMonad m => Int -> m (MVector (PrimState m) a) - --- | Create a mutable vector of the given length (0 if the length is --- negative) and fill it with an initial value. -replicate :: PrimMonad m => Int -> a -> m (MVector (PrimState m) a) - --- | Create a mutable vector of the given length (0 if the length is --- negative) and fill it with values produced by repeatedly executing the --- monadic action. -replicateM :: PrimMonad m => Int -> m a -> m (MVector (PrimState m) a) - --- | Create a copy of a mutable vector. -clone :: PrimMonad m => MVector (PrimState m) a -> m (MVector (PrimState m) a) - --- | Grow a vector by the given number of elements. The number must be --- positive. -grow :: PrimMonad m => MVector (PrimState m) a -> Int -> m (MVector (PrimState m) a) - --- | Reset all elements of the vector to some undefined value, clearing all --- references to external objects. This is usually a noop for unboxed --- vectors. -clear :: PrimMonad m => MVector (PrimState m) a -> m () - --- | Yield the element at the given position. -read :: PrimMonad m => MVector (PrimState m) a -> Int -> m a - --- | Replace the element at the given position. -write :: PrimMonad m => MVector (PrimState m) a -> Int -> a -> m () - --- | Swap the elements at the given positions. -swap :: PrimMonad m => MVector (PrimState m) a -> Int -> Int -> m () - --- | Set all elements of the vector to the given value. -set :: PrimMonad m => MVector (PrimState m) a -> a -> m () - --- | Copy a vector. The two vectors must have the same length and may not --- overlap. -copy :: PrimMonad m => MVector (PrimState m) a -> MVector (PrimState m) a -> m () - --- | Move the contents of a vector. The two vectors must have the same --- length. --- --- If the vectors do not overlap, then this is equivalent to copy. --- Otherwise, the copying is performed as if the source vector were --- copied to a temporary vector and then the temporary vector was copied --- to the target vector. -move :: PrimMonad m => MVector (PrimState m) a -> MVector (PrimState m) a -> m () diff --git a/data/wai.txt b/data/wai.txt deleted file mode 100644 --- a/data/wai.txt +++ /dev/null @@ -1,127 +0,0 @@ --- Hoogle documentation, generated by Haddock --- See Hoogle, http://www.haskell.org/hoogle/ - - --- | Web Application Interface. --- --- Provides a common protocol for communication between web aplications --- and web servers. -@package wai -@version 0.4.1 - - --- | This module defines a generic web application interface. It is a --- common protocol between web servers and web applications. --- --- The overriding design principles here are performance and generality . --- To address performance, this library is built on top of the enumerator --- and blaze-builder packages. The advantages of enumerators over lazy IO --- have been debated elsewhere and so will not be addressed here. --- However, helper functions like responseLBS allow you to --- continue using lazy IO if you so desire. --- --- Generality is achieved by removing many variables commonly found in --- similar projects that are not universal to all servers. The goal is --- that the Request object contains only data which is meaningful --- in all circumstances. --- --- Please remember when using this package that, while your application --- may compile without a hitch against many different servers, there are --- other considerations to be taken when moving to a new backend. For --- example, if you transfer from a CGI application to a FastCGI one, you --- might suddenly find you have a memory leak. Conversely, a FastCGI --- application would be well served to preload all templates from disk --- when first starting; this would kill the performance of a CGI --- application. --- --- This package purposely provides very little functionality. You can --- find various middlewares, backends and utilities on Hackage. Some of --- the most commonly used include: --- --- -module Network.Wai - --- | Information on the request sent by the client. This abstracts away the --- details of the underlying implementation. -data Request -Request :: Method -> HttpVersion -> ByteString -> ByteString -> ByteString -> Int -> RequestHeaders -> Bool -> SockAddr -> [Text] -> Query -> Request -requestMethod :: Request -> Method -httpVersion :: Request -> HttpVersion - --- | Extra path information sent by the client. The meaning varies slightly --- depending on backend; in a standalone server setting, this is most --- likely all information after the domain name. In a CGI application, --- this would be the information following the path to the CGI executable --- itself. Do not modify this raw value- modify pathInfo instead. -rawPathInfo :: Request -> ByteString - --- | If no query string was specified, this should be empty. This value --- will include the leading question mark. Do not modify this raw --- value- modify queryString instead. -rawQueryString :: Request -> ByteString - --- | Generally the host requested by the user via the Host request header. --- Backends are free to provide alternative values as necessary. This --- value should not be used to construct URLs. -serverName :: Request -> ByteString - --- | The listening port that the server received this request on. It is --- possible for a server to listen on a non-numeric port (i.e., Unix --- named socket), in which case this value will be arbitrary. Like --- serverName, this value should not be used in URL construction. -serverPort :: Request -> Int -requestHeaders :: Request -> RequestHeaders - --- | Was this request made over an SSL connection? -isSecure :: Request -> Bool - --- | The client's host information. -remoteHost :: Request -> SockAddr - --- | Path info in individual pieces- the url without a hostname/port and --- without a query string, split on forward slashes, -pathInfo :: Request -> [Text] - --- | Parsed query string information -queryString :: Request -> Query -data Response -ResponseFile :: Status -> ResponseHeaders -> FilePath -> (Maybe FilePart) -> Response -ResponseBuilder :: Status -> ResponseHeaders -> Builder -> Response -ResponseEnumerator :: (forall a. ResponseEnumerator a) -> Response -type ResponseEnumerator a = (Status -> ResponseHeaders -> Iteratee Builder IO a) -> IO a -responseEnumerator :: Response -> ResponseEnumerator a -type Application = Request -> Iteratee ByteString IO Response - --- | Middleware is a component that sits between the server and --- application. It can do such tasks as GZIP encoding or response --- caching. What follows is the general definition of middleware, though --- a middleware author should feel free to modify this. --- --- As an example of an alternate type for middleware, suppose you write a --- function to load up session information. The session information is --- simply a string map [(String, String)]. A logical type signatures for --- this middleware might be: --- --- 
---   loadSession :: ([(String, String)] -> Application) -> Application
---
--- --- Here, instead of taking a standard Application as its first --- argument, the middleware takes a function which consumes the session --- information as well. -type Middleware = Application -> Application -data FilePart -FilePart :: Integer -> Integer -> FilePart -filePartOffset :: FilePart -> Integer -filePartByteCount :: FilePart -> Integer -responseLBS :: Status -> ResponseHeaders -> ByteString -> Response -instance Typeable Request -instance Typeable Response -instance Show Request -instance Show FilePart diff --git a/data/warp.txt b/data/warp.txt deleted file mode 100644 --- a/data/warp.txt +++ /dev/null @@ -1,91 +0,0 @@ --- Hoogle documentation, generated by Haddock --- See Hoogle, http://www.haskell.org/hoogle/ - - --- | A fast, light-weight web server for WAI applications. --- --- The premier WAI handler. For more information, see --- http://steve.vinoski.net/blog/2011/05/01/warp-a-haskell-web-server/. -@package warp -@version 0.4.4 - - --- | A fast, light-weight HTTP server handler for WAI. Some random notes (a --- FAQ, if you will): --- --- -module Network.Wai.Handler.Warp - --- | Run an Application on the given port. This calls --- runSettings with defaultSettings. -run :: Port -> Application -> IO () - --- | Run a Warp server with the given settings. -runSettings :: Settings -> Application -> IO () - --- | Same as runSettings, but uses a user-supplied socket instead of --- opening one. This allows the user to provide, for example, Unix named --- socket, which can be used when reverse HTTP proxying into your --- application. --- --- Note that the settingsPort will still be passed to --- Applications via the serverPort record. -runSettingsSocket :: Settings -> Socket -> Application -> IO () - --- | Various Warp server settings. This is purposely kept as an abstract --- data type so that new settings can be added without breaking backwards --- compatibility. In order to create a Settings value, use --- defaultSettings and record syntax to modify individual records. --- For example: --- --- 
---   defaultSettings { settingsTimeout = 20 }
---
-data Settings - --- | The default settings for the Warp server. See the individual settings --- for the default value. -defaultSettings :: Settings - --- | Port to listen on. Default value: 3000 -settingsPort :: Settings -> Int - --- | Host to bind to, or * for all. Default value: * -settingsHost :: Settings -> String - --- | What to do with exceptions thrown by either the application or server. --- Default: ignore server-generated exceptions (see --- InvalidRequest) and print application-generated applications to --- stderr. -settingsOnException :: Settings -> SomeException -> IO () - --- | Timeout value in seconds. Default value: 30 -settingsTimeout :: Settings -> Int -type Port = Int -data InvalidRequest -NotEnoughLines :: [String] -> InvalidRequest -BadFirstLine :: String -> InvalidRequest -NonHttp :: InvalidRequest -IncompleteHeaders :: InvalidRequest -OverLargeHeader :: InvalidRequest - --- | A timeout manager -data Manager - --- | Call the inner function with a timeout manager. -withManager :: Int -> (Manager -> IO a) -> IO a -parseRequest :: Port -> SockAddr -> Iteratee ByteString IO (Integer, Request) -sendResponse :: Handle -> Request -> Socket -> Response -> IO Bool -registerKillThread :: Manager -> IO Handle -bindPort :: Int -> String -> IO Socket -enumSocket :: Handle -> Int -> Socket -> Enumerator ByteString IO a -resume, pause :: Handle -> IO () -instance Typeable InvalidRequest -instance Show InvalidRequest -instance Eq InvalidRequest -instance Exception InvalidRequest diff --git a/scion-browser.cabal b/scion-browser.cabal --- a/scion-browser.cabal +++ b/scion-browser.cabal @@ -1,5 +1,5 @@ name: scion-browser -version: 0.1.3 +version: 0.1.3.1 cabal-version: >= 1.8 build-type: Simple license: BSD3 @@ -31,7 +31,7 @@ zlib == 0.5.*, HTTP >= 4000 && < 5000, deepseq >= 1.1 && < 2, - aeson >= 0.3.2, + aeson-native >= 0.3.2, parallel-io >= 0.3, utf8-string , -- For Scion.packages (provisional) @@ -86,7 +86,7 @@ zlib == 0.5.*, HTTP >= 4000 && < 5000, deepseq >= 1.1 && < 2, - aeson >= 0.3.2, + aeson-native >= 0.3.2, parallel-io >= 0.3, utf8-string , -- For Scion.packages (provisional) diff --git a/scion-browser.cabal~ b/scion-browser.cabal~ --- a/scion-browser.cabal~ +++ b/scion-browser.cabal~ @@ -1,5 +1,5 @@ name: scion-browser -version: 0.1.3 +version: 0.1.3.1 cabal-version: >= 1.8 build-type: Simple license: BSD3 @@ -31,7 +31,7 @@ zlib == 0.5.*, HTTP >= 4000 && < 5000, deepseq >= 1.1 && < 2, - aeson >= 0.3.2, + aeson-native >= 0.3.2, parallel-io >= 0.3, utf8-string , -- For Scion.packages (provisional) @@ -86,7 +86,7 @@ zlib == 0.5.*, HTTP >= 4000 && < 5000, deepseq >= 1.1 && < 2, - aeson >= 0.3.2, + aeson-native >= 0.3.2, parallel-io >= 0.3, utf8-string , -- For Scion.packages (provisional) @@ -118,6 +118,7 @@ test-suite BrowserTests main-is: Test.hs type: exitcode-stdio-1.0 + x-uses-tf: true ghc-options: -Wall -rtsopts hs-source-dirs: src, test other-modules: Scion.Browser.Parser.Documentable, Scion.Browser.Parser.Internal, Scion.Browser.Parser, Scion.Browser.ParserTests @@ -145,7 +146,7 @@ zlib == 0.5.*, HTTP >= 4000 && < 5000, deepseq >= 1.1 && < 2, - aeson >= 0.3.2, + aeson-native >= 0.3.2, parallel-io >= 0.3, utf8-string , -- For Scion.packages (provisional) diff --git a/test/Scion/Browser/ParserTests.hs b/test/Scion/Browser/ParserTests.hs deleted file mode 100644 --- a/test/Scion/Browser/ParserTests.hs +++ /dev/null @@ -1,84 +0,0 @@ - -module Scion.Browser.ParserTests where - -import Scion.Browser.Parser -import Scion.Browser.Types -import Scion.Browser.Util -import qualified Data.Map as M -import Test.HUnit -import Language.Haskell.Exts.Annotated.Syntax -import System.Directory -import System.FilePath -import Data.Serialize -import Data.List -import qualified Data.Aeson as A -import qualified Data.ByteString.Lazy.UTF8 as LBS -import qualified Data.ByteString.Lazy.Char8 as LBS -import qualified Language.Haskell.Exts.Parser as Parser -import Language.Haskell.Exts.Extension -import Data.List.Split ---import Scion.Browser.FileUtil - -parserTests :: [Test] -parserTests = checkTypeParse:checkValids - -checkValids :: [Test] -checkValids=map (\(f,exps)->TestLabel ("Testing parsing "++f) (TestCase (checkValid f exps))) [ - ("warp",[("Network.Wai.Handler.Warp",["run","resume,pause","Settings","Manager"])]) - ,("wai",[("Network.Wai",[])]) - ,("vector",[("Data.Vector.Storable.Internal",["getPtr"]),("Data.Vector",["Vector","length"])]) - ,("ghc-mtl",[("Control.Monad.Ghc",["runGhc","Ghc"])]) - ,("html",[("Text.Html",["HtmlElement","markupContent"])]) - ,("containers",[("Data.Tree",["Tree","drawTree"])]) - ,("haskell98",[("Maybe",["Maybe","isJust"])]) - ,("haskell2010",[("Data.Array",["Array","ixmap"]),("Data.Complex",["(:+)"])]) - ,("ghc-prim",[]) - ,("base-unicode-symbols",[("Data.Ord.Unicode",["(≯)"]),("Control.Arrow.Unicode",["(⋙)"])]) - ] - -checkValid :: String -> [(String,[String])] -> IO() -checkValid name exps=do - let f="data" addExtension name "txt" - fe<-doesFileExist f - assertBool (f++" does not exist") fe - --Just txt<-downloadHoogleFile "http://hackage.haskell.org/packages/archive/warp/0.4.4/doc/html/warp.txt" - -- - --let res=parseHoogleString "" txt - res<-parseHoogleFile f - case res of - Right p@(Package _ pid m)->do - mapM_ (checkPresence m) exps - let db=pkgListToDb [p] - let bs=encode db - case ((decode bs)::Either String Database) of - Left _ -> assertFailure "cannot decode db" - Right db2 ->do - let mp=M.lookup pid db2 - case mp of - Just (Package _ _ m2) -> mapM_ (checkPresence m2) exps - Nothing -> assertFailure "cannot find pkg" - Left e->assertFailure $ show e - -checkPresence :: (M.Map String (Documented Module)) -> (String,[String]) -> IO() -checkPresence m (modName,exps)=do - let mmod=M.lookup modName m - case mmod of - Nothing->assertFailure ("module not found:" ++ modName) - Just (Module _ _ _ _ decls)->do - let names=map getName decls - mapM_ (\e->assertBool e (elem e names)) exps - let res=A.toJSON decls - let output=LBS.toString (A.encode res) - assertBool modName (not $ isInfixOf "not parsed" output) - mapM_ (\e->mapM_ (\e2->assertBool e2 (isInfixOf e2 output))(splitOn "," e)) exps - return () - -checkTypeParse :: Test -checkTypeParse= TestLabel "Testing checkTypeParse" (TestCase (do - let parseString="Category (⇝) => (α ⇝ β) -> (β ⇝ γ) -> (α ⇝ γ)" -- does not work if I remove the brackets around the first squiggly arrow - let parseTypeMode=Parser.ParseMode "" knownExtensions False False Nothing - let parsed = Parser.parseTypeWithMode parseTypeMode parseString - case parsed of - Parser.ParseFailed _ msg -> assertFailure msg - Parser.ParseOk _ -> return () - )) diff --git a/test/Test.hs b/test/Test.hs deleted file mode 100644 --- a/test/Test.hs +++ /dev/null @@ -1,9 +0,0 @@ - -import Scion.Browser.ParserTests - -import Test.Framework (defaultMain, testGroup) -import Test.Framework.Providers.HUnit - -main = defaultMain tests - -tests = [testGroup "Parser Tests" (concatMap (hUnitTestToTests) parserTests)]