Safe Haskell | None |
---|---|
Language | Haskell98 |
Tom Johnson. Other Harmony: Beyond Tonal and Atonal. Editions 75, 2014.
- type Z12 = Int
- mod12 :: Integral a => a -> a
- dif :: Num a => (a, a) -> a
- absdif :: Num a => (a, a) -> a
- i_to_ic :: (Num a, Ord a) => a -> a
- p2_and :: (t -> u -> Bool) -> (t -> u -> Bool) -> t -> u -> Bool
- doi :: Eq t => [t] -> [t] -> Int
- doi_of :: Eq t => Int -> [t] -> [t] -> Bool
- loc_dif :: Num t => [t] -> [t] -> t
- loc_dif_of :: (Eq t, Num t) => t -> [t] -> [t] -> Bool
- loc_dif_in :: (Eq t, Num t) => [t] -> [t] -> [t] -> Bool
- loc_dif_n :: (Eq t, Num i) => [t] -> [t] -> i
- loc_dif_n_of :: Eq t => Int -> [t] -> [t] -> Bool
- min_vl :: (Num a, Ord a) => [a] -> [a] -> a
- min_vl_of :: (Num a, Ord a) => a -> [a] -> [a] -> Bool
- min_vl_in :: (Num a, Ord a) => [a] -> [a] -> [a] -> Bool
- combinations2 :: Ord t => [t] -> [(t, t)]
- set_pp :: Show t => [t] -> String
- m_get :: Ord k => Map k v -> k -> v
- m_doi_of :: Map Int [Z12] -> Int -> Int -> Int -> Bool
- gen_graph_ul :: Ord v => [DOT_ATTR] -> (v -> String) -> [EDGE v] -> [String]
- gen_graph_ul_ty :: Ord v => String -> (v -> String) -> [EDGE v] -> [String]
- gen_flt_graph :: (Ord t, Show t) => [DOT_ATTR] -> ([t] -> [t] -> Bool) -> [[t]] -> [String]
- p12_euler_plane :: Euler_Plane Rational
- p12_euler_plane_gr :: [String]
- p14_edges :: [(Key, Key)]
- p14_gr :: [String]
- p31_f_4_22 :: [Z12]
- p31_e_set :: [([Z12], [Z12])]
- p31_gr :: [String]
- p114_f_3_7 :: [Z12]
- p114_mk_gr :: Double -> ([Z12] -> [Z12] -> Bool) -> [String]
- p114_gr_set :: [(String, [String])]
- p125_gr :: [String]
- p131_gr :: [String]
- p148_mk_gr :: ([Int] -> [Int] -> Bool) -> [String]
- p148_gr_set :: [(String, [String])]
- p162_gr :: [String]
- p172_nd_map :: Map Int [Z12]
- p172_set_pp :: Int -> String
- p172_gr_set :: [(String, [String])]
- partition_ic :: (Num t, Ord t, Show t) => t -> [t] -> ([t], [t])
- p177_gr_set :: [(String, [String])]
- wr_graphs :: IO ()
Common
loc_dif_n :: (Eq t, Num i) => [t] -> [t] -> i Source #
The number of places that are, pointwise, not equal.
loc_dif_n "test" "pest" == 1
combinations2 :: Ord t => [t] -> [(t, t)] Source #
Map
Graph
gen_flt_graph :: (Ord t, Show t) => [DOT_ATTR] -> ([t] -> [t] -> Bool) -> [[t]] -> [String] Source #
P.12
p12_euler_plane_gr :: [String] Source #
P.14
P.31
p31_f_4_22 :: [Z12] Source #
P.114
p114_f_3_7 :: [Z12] Source #
p114_gr_set :: [(String, [String])] Source #
P.125
P.131
P.148
p148_gr_set :: [(String, [String])] Source #
P.162
P.172
p172_set_pp :: Int -> String Source #
p172_gr_set :: [(String, [String])] Source #
P.177
p177_gr_set :: [(String, [String])] Source #