Safe Haskell	Safe-Inferred
Language	Haskell2010

Sound.SC3.Common.Base

Contents

Function
Read
STRING / CASE
LIST
TUPLES
System

Description

Common core functions.

Synopsis

type Fn1 a b = a -> b
type Fn2 a b c = a -> b -> c
type Fn3 a b c d = a -> b -> c -> d
type Fn4 a b c d e = a -> b -> c -> d -> e
iter :: Int -> (a -> a) -> a -> a
reads_exact :: Read a => String -> Maybe a
data Case_Rule
- = CI
- | CS
is_ci :: Case_Rule -> Bool
is_cs :: Case_Rule -> Bool
string_eq :: Case_Rule -> String -> String -> Bool
rlookup_str :: Case_Rule -> String -> [(a, String)] -> Maybe a
parse_enum :: (Show t, Enum t, Bounded t) => Case_Rule -> String -> Maybe t
compose_l :: [t -> t] -> t -> t
compose_r :: [t -> t] -> t -> t
d_dx :: Num a => [a] -> [a]
d_dx' :: Num n => [n] -> [n]
dx_d :: Num n => [n] -> [n]
dx_d' :: Num n => [n] -> [n]
lookup_by :: (a -> t -> Bool) -> a -> [(t, b)] -> Maybe b
lookup_by_err :: (a -> t -> Bool) -> a -> [(t, b)] -> b
rlookup_by :: (b -> b -> Bool) -> b -> [(a, b)] -> Maybe a
pcn_triples :: [a] -> [(Maybe a, a, Maybe a)]
sep_first :: [t] -> Maybe (t, [t])
sep_last :: [t] -> Maybe ([t], t)
equal_length_p :: [[a]] -> Bool
histogram :: Ord a => [a] -> [(a, Int)]
p4_zip :: (a, b, c, d) -> (e, f, g, h) -> ((a, e), (b, f), (c, g), (d, h))
type T2 a = (a, a)
type T3 a = (a, a, a)
type T4 a = (a, a, a, a)
dup2 :: t -> T2 t
dup3 :: t -> T3 t
dup4 :: t -> T4 t
mk_duples :: (a -> c) -> (b -> c) -> [(a, b)] -> [c]
mk_duples_l :: (Int -> c) -> (a -> c) -> (b -> c) -> [(a, [b])] -> [c]
mk_triples :: (a -> d) -> (b -> d) -> (c -> d) -> [(a, b, c)] -> [d]
t2_from_list :: [t] -> T2 t
t3_from_list :: [t] -> (t, t, t)
get_env_default :: String -> String -> IO String
lookup_env_default :: String -> String -> IO String

Function

type Fn1 a b = a -> b Source #

Unary function.

type Fn2 a b c = a -> b -> c Source #

Binary function.

type Fn3 a b c d = a -> b -> c -> d Source #

Ternary function.

type Fn4 a b c d e = a -> b -> c -> d -> e Source #

Quaternary function.

iter :: Int -> (a -> a) -> a -> a Source #

Apply f n times, ie. iterate f x !! n

iter 3 (* 2) 1 == 8
iterate (* 2) 1 !! 3 == 8

Read

reads_exact :: Read a => String -> Maybe a Source #

Variant of reads requiring exact match.

STRING / CASE

data Case_Rule Source #

CI = Case insensitive, CS = case sensitive.

Constructors

CI
CS

Instances

Instances details

Eq Case_Rule Source #
Instance details Defined in Sound.SC3.Common.Base Methods (==) :: Case_Rule -> Case_Rule -> Bool # (/=) :: Case_Rule -> Case_Rule -> Bool #

is_ci :: Case_Rule -> Bool Source #

Predicates for Case_Rule.

is_cs :: Case_Rule -> Bool Source #

Predicates for Case_Rule.

string_eq :: Case_Rule -> String -> String -> Bool Source #

String equality with Case_Rule.

string_eq CI "lower" "LOWER" == True

rlookup_str :: Case_Rule -> String -> [(a, String)] -> Maybe a Source #

rlookup_by of string_eq.

parse_enum :: (Show t, Enum t, Bounded t) => Case_Rule -> String -> Maybe t Source #

Enum parser with Case_Rule.

parse_enum CI "FALSE" == Just False

LIST

compose_l :: [t -> t] -> t -> t Source #

Left to right composition of a list of functions.

compose_l [(* 2),(+ 1)] 3 == 7

compose_r :: [t -> t] -> t -> t Source #

Right to left composition of a list of functions.

compose_r [(* 2),(+ 1)] 3 == 8

d_dx :: Num a => [a] -> [a] Source #

SequenceableCollection.differentiate

> [3,4,1,1].differentiate == [3,1,-3,0]

d_dx [3,4,1,1] == [3,1,-3,0]
d_dx [0,1,3,6] == [0,1,2,3]

d_dx' :: Num n => [n] -> [n] Source #

Variant that does not prepend zero to input, ie. tail of d_dx.

d_dx' [3,4,1,1] == [1,-3,0]
d_dx' [0,1,3,6] == [1,2,3]

dx_d :: Num n => [n] -> [n] Source #

SequenceableCollection.integrate

> [3,4,1,1].integrate == [3,7,8,9]

dx_d [3,4,1,1] == [3,7,8,9]
dx_d (d_dx [0,1,3,6]) == [0,1,3,6]
dx_d [0.5,0.5] == [0.5,1]

dx_d' :: Num n => [n] -> [n] Source #

Variant pre-prending zero to output.

dx_d' [3,4,1,1] == [0,3,7,8,9]
dx_d' (d_dx' [0,1,3,6]) == [0,1,3,6]
dx_d' [0.5,0.5] == [0,0.5,1]

lookup_by :: (a -> t -> Bool) -> a -> [(t, b)] -> Maybe b Source #

lookup with equality function.

lookup_by_err :: (a -> t -> Bool) -> a -> [(t, b)] -> b Source #

Erroring variant.

rlookup_by :: (b -> b -> Bool) -> b -> [(a, b)] -> Maybe a Source #

Reverse lookup with equality function.

pcn_triples :: [a] -> [(Maybe a, a, Maybe a)] Source #

(prev,cur,next) triples.

pcn_triples [1..3] == [(Nothing,1,Just 2),(Just 1,2,Just 3),(Just 2,3,Nothing)]

sep_first :: [t] -> Maybe (t, [t]) Source #

Separate first list element.

sep_first "astring" == Just ('a',"string")

sep_last :: [t] -> Maybe ([t], t) Source #

Separate last list element.

sep_last "stringb" == Just ("string",'b')

equal_length_p :: [[a]] -> Bool Source #

Are lists of equal length?

equal_length_p ["t1","t2"] == True
equal_length_p ["t","t1","t2"] == False

histogram :: Ord a => [a] -> [(a, Int)] Source #

Histogram

TUPLES

p4_zip :: (a, b, c, d) -> (e, f, g, h) -> ((a, e), (b, f), (c, g), (d, h)) Source #

Zip two 4-tuples.

type T2 a = (a, a) Source #

Two-tuple.

type T3 a = (a, a, a) Source #

Three-tuple.

type T4 a = (a, a, a, a) Source #

Four-tuple.

dup2 :: t -> T2 t Source #

t -> (t,t)

dup3 :: t -> T3 t Source #

t -> (t,t,t)

dup4 :: t -> T4 t Source #

t -> (t,t,t,t)

mk_duples :: (a -> c) -> (b -> c) -> [(a, b)] -> [c] Source #

concatMap of f at x and g at y.

mk_duples_l :: (Int -> c) -> (a -> c) -> (b -> c) -> [(a, [b])] -> [c] Source #

Length prefixed list variant of mk_duples.

mk_triples :: (a -> d) -> (b -> d) -> (c -> d) -> [(a, b, c)] -> [d] Source #

concatMap of f at x and g at y and h at z.

t2_from_list :: [t] -> T2 t Source #

x,y: -> (x,y)

t3_from_list :: [t] -> (t, t, t) Source #

x,y,z: -> (x,y,z)

System

get_env_default :: String -> String -> IO String Source #

Guarded variant of getEnv with default value.

lookup_env_default :: String -> String -> IO String Source #

lookupEnv with default value.

lookup_env_default "PATH" "/usr/bin"