Sound.Analysis.Spear.PTPF

Spear PTPF (par-text-partials-format) files.

Tuple

duples :: [t] -> [(t, t)]

Adjacent duples.

 duples [1..6] == [(1,2),(3,4),(5,6)]

triples :: [t] -> [(t, t, t)]

Adjacent triples.

 triples [1..6] == [(1,2,3),(4,5,6)]

List

at_last :: (a -> a) -> [a] -> [a]

Apply f at last element.

 at_last negate [1..3] == [1,2,-3]

mean :: Floating a => [a] -> a

Numerically stable mean

 map mean [[1..5],[3,5,7],[7,7],[3,9,10,11,12]] == [3,5,7,9]

minmax :: Ord b => [b] -> (b, b)

minimum & maximum.

 minmax [0..5] == (0,5)

Node

type N_Time = Double

type N_Data = Double

data Node

Record to hold data for single node of a partial track.

Constructors

Node

Fields

n_partial_id :: Int

Partial identifier

n_time :: Double

n_frequency :: N_Data

n_amplitude :: N_Data

Instances

Eq Node

Show Node

n_zero_amplitude :: Node -> Node

Set n_amplitude at Node to 0.

n_set_partial_id :: Int -> Node -> Node

Set n_partial_id at Node.

n_temporal_f :: (N_Time -> N_Time) -> Node -> Node

Apply transform f at n_time.

Seq

data Seq

A sequence of partial Node data.

Constructors

Seq

Fields

s_identifier :: Int

== to n_partial_id at s_data.

s_start_time :: N_Time

minimum n_time at s_data.

s_end_time :: N_Time

maximum n_time at s_data.

s_nodes :: Int

== to length s_data

s_data :: [Node]

Instances

Eq Seq

Show Seq

s_map :: (Node -> Node) -> Seq -> Seq

Apply f at s_data of Seq and re-calculate temporal bounds.

s_summarise :: ([a] -> b) -> (Node -> a) -> Seq -> b

s_max_amplitude :: Seq -> N_Data

maximum n_amplitude at s_data.

s_min_amplitude :: Seq -> N_Data

minimum n_amplitude at s_data.

s_mean_amplitude :: Seq -> N_Data

mean n_amplitude at s_data.

s_mean_frequency :: Seq -> N_Data

mean n_frequency at s_data.

s_duration :: Seq -> N_Time

s_end_time - s_start_time.

s_set_identifier :: Int -> Seq -> Seq

Set s_identifier and associated n_partial_id.

s_eq_identifier :: Seq -> Seq -> Bool

== on s_identifier.

s_union :: [Seq] -> [Seq] -> [Seq]

unionBy s_eq_identifier.

s_temporal_f :: (N_Time -> N_Time) -> Seq -> Seq

Apply transform f at n_time.

PTPF

data PTPF

A PTPF is a set of Seq.

Constructors

PTPF

Fields

p_partials :: Int

p_seq :: [Seq]

Instances

Eq PTPF

Show PTPF

p_start_time :: PTPF -> N_Time

minimum s_start_time at p_seq.

p_end_time :: PTPF -> N_Time

maximum s_end_time at p_seq.

p_nodes :: PTPF -> Int

sum of s_nodes of p_seq.

p_from_seq :: [Seq] -> PTPF

Generate PTPF from set of Seq. Re-assigns partial identifiers.

p_temporal_f :: (N_Time -> N_Time) -> PTPF -> PTPF

p_map :: (Seq -> Seq) -> PTPF -> PTPF

p_filter :: (Seq -> Bool) -> PTPF -> PTPF

p_node_map :: (Node -> Node) -> PTPF -> PTPF

Parser

type STR = ByteString

str_int :: ByteString -> Int

str_double :: Floating n => ByteString -> n

str_words :: ByteString -> [ByteString]

str_lines :: ByteString -> [ByteString]

ptpf_node :: Int -> (STR, STR, STR) -> Node

Parse Node.

ptpf_seq :: (STR, STR) -> Seq

Parse Seq from pair of input lines.

ptpf_header :: [STR] -> Maybe Int

Parse header section, result is number of partials.

parse_ptpf :: STR -> Either String PTPF

Parse PTPF at STR.

Operations

ptpf_time_asc :: PTPF -> [(N_Time, [Node])]

All Nodes grouped into sets with equal start times.