aftovolio-0.2.0.0: An AFTOVolio implementation for creating texts with special phonetic / prosodic properties.
Copyright(c) Oleksandr Zhabenko 2020-2024
LicenseMIT
Maintaineroleksandr.zhabenko@yahoo.com
StabilityExperimental
Safe HaskellSafe-Inferred
LanguageHaskell2010
ExtensionsBangPatterns

Aftovolio.StrictVG

Description

Simplified version of the phonetic-languages-common package. Uses less dependencies.

Synopsis

Working with lists

uniquenessVariants2GNBL Source #

Arguments

:: (Eq a, Foldable t, InsertLeft t a, Monoid (t a), Monoid (t (t a))) 
=> a

The first most common element in the "whitespace symbols" structure

-> (t a -> [a])

The function that is used internally to convert to the [a] so that the function can process further the permutations

-> (t (t a) -> [[a]])

The function that is used internally to convert to the [[a]] so that the function can process further

-> ([a] -> t a)

The function that is used internally to convert to the needed representation so that the function can process further

-> [Array Int Int]

The permutations of Int indices starting from 0 and up to n (n is probably less than 8).

-> t (t a)

Must be obtained as subG whspss xs or in equivalent way

-> [t a] 

uniquenessVariants2GNPBL Source #

Arguments

:: (Eq a, Foldable t, InsertLeft t a, Monoid (t a), Monoid (t (t a))) 
=> t a 
-> t a 
-> a

The first most common element in the whitespace symbols structure

-> (t a -> [a])

The function that is used internally to convert to the [a] so that the function can process further the permutations

-> (t (t a) -> [[a]])

The function that is used internally to convert to the [[a]] so that the function can process further

-> ([a] -> t a)

The function that is used internally to convert to the needed representation that the function can process further

-> [Array Int Int]

The permutations of Int indices starting from 0 and up to n (n is probably less than 8).

-> t (t a)

Must be obtained as subG whspss xs or in equivalent way

-> [t a]