| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Base
Contents
Description
Synopsis
- showHex :: (Integral a, Show a) => a -> String
- showHex_list :: (Integral a, Show a) => [a] -> [Char]
- showHex_set :: IntSet -> [Char]
- showHex_option :: (Integral a, Show a) => Maybe a -> [Char]
- readHex' :: (Eq a, Num a) => String -> a
- im_lookup :: [Char] -> IntMap p -> Key -> p
- orElse :: Eq a => Maybe a -> a -> a
- orTry :: Eq a => Maybe a -> Maybe a -> Maybe a
- onlyWhen :: Bool -> a -> Maybe a
- existsAndSatisfies :: Maybe t -> (t -> Bool) -> Bool
- pair :: a -> b -> (a, b)
- findString :: Eq a => [a] -> [a] -> Maybe Int
- takeUntilString :: String -> String -> String
- strip_parentheses :: [Char] -> [Char]
- partitionWith :: (a -> Either b c) -> [a] -> ([b], [c])
- bytes_to_word :: [Word8] -> Word64
- word_to_sint :: Int -> Word64 -> Int
- average :: (Real a, Fractional b) => [a] -> b
- crossProduct :: [[a]] -> [[a]]
- crossProduct_size :: Foldable t => [t a] -> Int
- neFromList :: Ord a => [a] -> NESet a
- neSetToList :: NESet a -> [a]
- quotientBy :: Ord a => (a -> a -> Bool) -> Set a -> Set (Set a)
- data Graph = Edges (IntMap IntSet)
- graph_add_edges :: Graph -> Key -> IntSet -> Graph
- graph_delete :: Graph -> Key -> Graph
- graph_is_parent :: Graph -> Key -> Bool
- graph_is_vertex :: Graph -> Key -> Bool
- graph_is_edge :: Graph -> Key -> Key -> Bool
- graph_nontrivial_scc :: Graph -> IntSet
- graph_find_next :: Graph -> Maybe Int
- putNESetOf :: Putter a -> Putter (NESet a)
- getNESetOf :: Ord a => Get a -> Get (NESet a)
- hex_color_of_text :: String -> String
- hex_colors :: [[Char]]
- allp :: [a -> Bool] -> a -> Bool
Documentation
showHex_set :: IntSet -> [Char] Source #
Show an integer set as hex-list.
showHex_option :: (Integral a, Show a) => Maybe a -> [Char] Source #
Show an optional integer as an optional hex.
im_lookup :: [Char] -> IntMap p -> Key -> p Source #
Lookup and produce error message if key does not exists in map.
existsAndSatisfies :: Maybe t -> (t -> Bool) -> Bool Source #
A value exists (is not Nothing) and satisfies the predicate
strip_parentheses :: [Char] -> [Char] Source #
Strip outer parentheses from a string, if it has them.
partitionWith :: (a -> Either b c) -> [a] -> ([b], [c]) Source #
Uses a function to determine which of two output lists an input element should join
bytes_to_word :: [Word8] -> Word64 Source #
In little endian, convert a byte-list to a 64 bit word. Assume the list is at most length 8.
word_to_sint :: Int -> Word64 -> Int Source #
Convert first n bytes of a word to an integer.
Assume n<8.
average :: (Real a, Fractional b) => [a] -> b Source #
average of list of numbers
crossProduct :: [[a]] -> [[a]] Source #
crossProduct_size :: Foldable t => [t a] -> Int Source #
neFromList :: Ord a => [a] -> NESet a Source #
neSetToList :: NESet a -> [a] Source #
Generic graph with ints as vertices.
graph_nontrivial_scc :: Graph -> IntSet Source #
retrieve a non-trivial SCC, if any exists
graph_find_next :: Graph -> Maybe Int Source #
find next vertex to consider: either a terminal vertex (if any) or the head of an SCC
hex_color_of_text :: String -> String Source #
decide whether text should be white or black based on background color
hex_colors :: [[Char]] Source #
A list of RGB colors