Graphics.Text.Font.Choose.LangSet

Languages supported by different fonts.

Documentation

type LangSet = Set String

A set of language names (each of which include language and an optional territory). They are used when selecting fonts to indicate which languages the fonts need to support. Each font is marked, using language orthography information built into fontconfig, with the set of supported languages.

newtype LangSet'

Wrapper around LangSet adding useful typeclasses

Constructors

LangSet'

Fields

• unLangSet :: LangSet

Instances

Arbitrary LangSet'

Defined in Graphics.Text.Font.Choose.LangSet

Methods

arbitrary :: Gen LangSet'

shrink :: LangSet' -> [LangSet']

Read LangSet'

Defined in Graphics.Text.Font.Choose.LangSet

Methods

readsPrec :: Int -> ReadS LangSet'

readList :: ReadS [LangSet']

readPrec :: ReadPrec LangSet'

readListPrec :: ReadPrec [LangSet']

Show LangSet'

Defined in Graphics.Text.Font.Choose.LangSet

Methods

showsPrec :: Int -> LangSet' -> ShowS

show :: LangSet' -> String

showList :: [LangSet'] -> ShowS

ToValue LangSet'

Defined in Graphics.Text.Font.Choose.Value

Methods

toValue :: LangSet' -> Value

fromValue :: Value -> Maybe LangSet'

fromValue' :: Value -> LangSet'

Eq LangSet'

Defined in Graphics.Text.Font.Choose.LangSet

Methods

(==) :: LangSet' -> LangSet' -> Bool

(/=) :: LangSet' -> LangSet' -> Bool

Hashable LangSet'

Defined in Graphics.Text.Font.Choose.LangSet

Methods

hashWithSalt :: Int -> LangSet' -> Int

hash :: LangSet' -> Int

MessagePack LangSet'

Defined in Graphics.Text.Font.Choose.LangSet

Methods

toObject :: LangSet' -> Object

fromObject :: Object -> Maybe LangSet'

data Set a

A set of values a.

Instances

Foldable Set

Folds in order of increasing key.

Defined in Data.Set.Internal

Methods

fold :: Monoid m => Set m -> m

foldMap :: Monoid m => (a -> m) -> Set a -> m

foldMap' :: Monoid m => (a -> m) -> Set a -> m

foldr :: (a -> b -> b) -> b -> Set a -> b

foldr' :: (a -> b -> b) -> b -> Set a -> b

foldl :: (b -> a -> b) -> b -> Set a -> b

foldl' :: (b -> a -> b) -> b -> Set a -> b

foldr1 :: (a -> a -> a) -> Set a -> a

foldl1 :: (a -> a -> a) -> Set a -> a

toList :: Set a -> [a]

null :: Set a -> Bool

length :: Set a -> Int

elem :: Eq a => a -> Set a -> Bool

maximum :: Ord a => Set a -> a

minimum :: Ord a => Set a -> a

sum :: Num a => Set a -> a

product :: Num a => Set a -> a

Eq1 Set

Since: containers-0.5.9

Defined in Data.Set.Internal

Methods

liftEq :: (a -> b -> Bool) -> Set a -> Set b -> Bool

Ord1 Set

Since: containers-0.5.9

Defined in Data.Set.Internal

Methods

liftCompare :: (a -> b -> Ordering) -> Set a -> Set b -> Ordering

Show1 Set

Since: containers-0.5.9

Defined in Data.Set.Internal

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Set a -> ShowS

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Set a] -> ShowS

Hashable1 Set

Since: hashable-1.3.4.0

Defined in Data.Hashable.Class

Methods

liftHashWithSalt :: (Int -> a -> Int) -> Int -> Set a -> Int

Lift a => Lift (Set a :: Type)

Since: containers-0.6.6

Defined in Data.Set.Internal

Methods

lift :: Quote m => Set a -> m Exp

liftTyped :: forall (m :: Type -> Type). Quote m => Set a -> Code m (Set a)

(Ord a, Arbitrary a) => Arbitrary (Set a)

WARNING: Users working on the internals of the Set type via e.g. Data.Set.Internal should be aware that this instance aims to give a good representation of Set a as mathematical sets but *does not* aim to provide a varied distribution over the underlying representation.

Defined in Test.QuickCheck.Arbitrary

Methods

arbitrary :: Gen (Set a)

shrink :: Set a -> [Set a]

CoArbitrary a => CoArbitrary (Set a)

Defined in Test.QuickCheck.Arbitrary

Methods

coarbitrary :: Set a -> Gen b -> Gen b

(Data a, Ord a) => Data (Set a)

Defined in Data.Set.Internal

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Set a -> c (Set a)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Set a)

toConstr :: Set a -> Constr

dataTypeOf :: Set a -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Set a))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Set a))

gmapT :: (forall b. Data b => b -> b) -> Set a -> Set a

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Set a -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Set a -> r

gmapQ :: (forall d. Data d => d -> u) -> Set a -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Set a -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Set a -> m (Set a)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Set a -> m (Set a)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Set a -> m (Set a)

Ord a => Monoid (Set a)

Defined in Data.Set.Internal

Methods

mempty :: Set a

mappend :: Set a -> Set a -> Set a

mconcat :: [Set a] -> Set a

Ord a => Semigroup (Set a)

Since: containers-0.5.7

Defined in Data.Set.Internal

Methods

(<>) :: Set a -> Set a -> Set a

sconcat :: NonEmpty (Set a) -> Set a

stimes :: Integral b => b -> Set a -> Set a

Ord a => IsList (Set a)

Since: containers-0.5.6.2

Defined in Data.Set.Internal

Associated Types

type Item (Set a)

Methods

fromList :: [Item (Set a)] -> Set a

fromListN :: Int -> [Item (Set a)] -> Set a

toList :: Set a -> [Item (Set a)]

(Read a, Ord a) => Read (Set a)

Defined in Data.Set.Internal

Methods

readsPrec :: Int -> ReadS (Set a)

readList :: ReadS [Set a]

readPrec :: ReadPrec (Set a)

readListPrec :: ReadPrec [Set a]

Show a => Show (Set a)

Defined in Data.Set.Internal

Methods

showsPrec :: Int -> Set a -> ShowS

show :: Set a -> String

showList :: [Set a] -> ShowS

NFData a => NFData (Set a)

Defined in Data.Set.Internal

Methods

rnf :: Set a -> ()

Eq a => Eq (Set a)

Defined in Data.Set.Internal

Methods

(==) :: Set a -> Set a -> Bool

(/=) :: Set a -> Set a -> Bool

Ord a => Ord (Set a)

Defined in Data.Set.Internal

Methods

compare :: Set a -> Set a -> Ordering

(<) :: Set a -> Set a -> Bool

(<=) :: Set a -> Set a -> Bool

(>) :: Set a -> Set a -> Bool

(>=) :: Set a -> Set a -> Bool

max :: Set a -> Set a -> Set a

min :: Set a -> Set a -> Set a

Hashable v => Hashable (Set v)

Since: hashable-1.3.4.0

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Set v -> Int

hash :: Set v -> Int

Ord k => At (Set k)

Defined in Control.Lens.At

Methods

at :: Index (Set k) -> Lens' (Set k) (Maybe (IxValue (Set k)))

Ord a => Contains (Set a)

Defined in Control.Lens.At

Methods

contains :: Index (Set a) -> Lens' (Set a) Bool

Ord k => Ixed (Set k)

Defined in Control.Lens.At

Methods

ix :: Index (Set k) -> Traversal' (Set k) (IxValue (Set k))

Ord a => Wrapped (Set a)

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Set a)

Methods

_Wrapped' :: Iso' (Set a) (Unwrapped (Set a))

(t ~ Set a', Ord a) => Rewrapped (Set a) t

Use _Wrapping fromList. unwrapping returns a sorted list.

Defined in Control.Lens.Wrapped

type Item (Set a)

Defined in Data.Set.Internal

type Item (Set a) = a

type Index (Set a)

Defined in Control.Lens.At

type Index (Set a) = a

type IxValue (Set k)

Defined in Control.Lens.At

type IxValue (Set k) = ()

type Unwrapped (Set a)

Defined in Control.Lens.Wrapped

type Unwrapped (Set a) = [a]

fromList :: Ord a => [a] -> Set a

\(O(n \log n)\). Create a set from a list of elements.

If the elements are ordered, a linear-time implementation is used, with the performance equal to fromDistinctAscList.

toList :: Set a -> [a]

\(O(n)\). Convert the set to a list of elements. Subject to list fusion.

delete :: Ord a => a -> Set a -> Set a

\(O(\log n)\). Delete an element from a set.

foldr :: (a -> b -> b) -> b -> Set a -> b

\(O(n)\). Fold the elements in the set using the given right-associative binary operator, such that foldr f z == foldr f z . toAscList.

For example,

toAscList set = foldr (:) [] set

map :: Ord b => (a -> b) -> Set a -> Set b

\(O(n \log n)\). map f s is the set obtained by applying f to each element of s.

It's worth noting that the size of the result may be smaller if, for some (x,y), x /= y && f x == f y

elems :: Set a -> [a]

\(O(n)\). An alias of toAscList. The elements of a set in ascending order. Subject to list fusion.

filter :: (a -> Bool) -> Set a -> Set a

\(O(n)\). Filter all elements that satisfy the predicate.

foldl :: (a -> b -> a) -> a -> Set b -> a

\(O(n)\). Fold the elements in the set using the given left-associative binary operator, such that foldl f z == foldl f z . toAscList.

For example,

toDescList set = foldl (flip (:)) [] set

empty :: Set a

\(O(1)\). The empty set.

null :: Set a -> Bool

\(O(1)\). Is this the empty set?

foldl' :: (a -> b -> a) -> a -> Set b -> a

\(O(n)\). A strict version of foldl. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.

foldr' :: (a -> b -> b) -> b -> Set a -> b

\(O(n)\). A strict version of foldr. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.

take :: Int -> Set a -> Set a

\(O(\log n)\). Take a given number of elements in order, beginning with the smallest ones.

take n = fromDistinctAscList . take n . toAscList

Since: containers-0.5.8

drop :: Int -> Set a -> Set a

\(O(\log n)\). Drop a given number of elements in order, beginning with the smallest ones.

drop n = fromDistinctAscList . drop n . toAscList

Since: containers-0.5.8

splitAt :: Int -> Set a -> (Set a, Set a)

\(O(\log n)\). Split a set at a particular index.

splitAt !n !xs = (take n xs, drop n xs)

fold :: (a -> b -> b) -> b -> Set a -> b

\(O(n)\). Fold the elements in the set using the given right-associative binary operator. This function is an equivalent of foldr and is present for compatibility only.

Please note that fold will be deprecated in the future and removed.

findIndex :: Ord a => a -> Set a -> Int

\(O(\log n)\). Return the index of an element, which is its zero-based index in the sorted sequence of elements. The index is a number from 0 up to, but not including, the size of the set. Calls error when the element is not a member of the set.

findIndex 2 (fromList [5,3])    Error: element is not in the set
findIndex 3 (fromList [5,3]) == 0
findIndex 5 (fromList [5,3]) == 1
findIndex 6 (fromList [5,3])    Error: element is not in the set

Since: containers-0.5.4

(\\) :: Ord a => Set a -> Set a -> Set a infixl 9

\(O\bigl(m \log\bigl(\frac{n+1}{m+1}\bigr)\bigr), \; m \leq n\). See difference.

union :: Ord a => Set a -> Set a -> Set a

\(O\bigl(m \log\bigl(\frac{n+1}{m+1}\bigr)\bigr), \; m \leq n\). The union of two sets, preferring the first set when equal elements are encountered.

partition :: (a -> Bool) -> Set a -> (Set a, Set a)

\(O(n)\). Partition the set into two sets, one with all elements that satisfy the predicate and one with all elements that don't satisfy the predicate. See also split.

insert :: Ord a => a -> Set a -> Set a

\(O(\log n)\). Insert an element in a set. If the set already contains an element equal to the given value, it is replaced with the new value.

singleton :: a -> Set a

\(O(1)\). Create a singleton set.

size :: Set a -> Int

\(O(1)\). The number of elements in the set.

findMin :: Set a -> a

\(O(\log n)\). The minimal element of a set.

deleteMin :: Set a -> Set a

\(O(\log n)\). Delete the minimal element. Returns an empty set if the set is empty.

minView :: Set a -> Maybe (a, Set a)

\(O(\log n)\). Retrieves the minimal key of the set, and the set stripped of that element, or Nothing if passed an empty set.

split :: Ord a => a -> Set a -> (Set a, Set a)

\(O(\log n)\). The expression (split x set) is a pair (set1,set2) where set1 comprises the elements of set less than x and set2 comprises the elements of set greater than x.

showTree :: Show a => Set a -> String

\(O(n \log n)\). Show the tree that implements the set. The tree is shown in a compressed, hanging format.

showTreeWith :: Show a => Bool -> Bool -> Set a -> String

\(O(n \log n)\). The expression (showTreeWith hang wide map) shows the tree that implements the set. If hang is True, a hanging tree is shown otherwise a rotated tree is shown. If wide is True, an extra wide version is shown.

Set> putStrLn $ showTreeWith True False $ fromDistinctAscList [1..5]
4
+--2
|  +--1
|  +--3
+--5

Set> putStrLn $ showTreeWith True True $ fromDistinctAscList [1..5]
4
|
+--2
|  |
|  +--1
|  |
|  +--3
|
+--5

Set> putStrLn $ showTreeWith False True $ fromDistinctAscList [1..5]
+--5
|
4
|
|  +--3
|  |
+--2
   |
   +--1

member :: Ord a => a -> Set a -> Bool

\(O(\log n)\). Is the element in the set?

notMember :: Ord a => a -> Set a -> Bool

\(O(\log n)\). Is the element not in the set?

lookupLT :: Ord a => a -> Set a -> Maybe a

\(O(\log n)\). Find largest element smaller than the given one.

lookupLT 3 (fromList [3, 5]) == Nothing
lookupLT 5 (fromList [3, 5]) == Just 3

lookupGT :: Ord a => a -> Set a -> Maybe a

\(O(\log n)\). Find smallest element greater than the given one.

lookupGT 4 (fromList [3, 5]) == Just 5
lookupGT 5 (fromList [3, 5]) == Nothing

lookupLE :: Ord a => a -> Set a -> Maybe a

\(O(\log n)\). Find largest element smaller or equal to the given one.

lookupLE 2 (fromList [3, 5]) == Nothing
lookupLE 4 (fromList [3, 5]) == Just 3
lookupLE 5 (fromList [3, 5]) == Just 5

lookupGE :: Ord a => a -> Set a -> Maybe a

\(O(\log n)\). Find smallest element greater or equal to the given one.

lookupGE 3 (fromList [3, 5]) == Just 3
lookupGE 4 (fromList [3, 5]) == Just 5
lookupGE 6 (fromList [3, 5]) == Nothing

alterF :: (Ord a, Functor f) => (Bool -> f Bool) -> a -> Set a -> f (Set a)

\(O(\log n)\) (alterF f x s) can delete or insert x in s depending on whether an equal element is found in s.

In short:

member x <$> alterF f x s = f (member x s)

Note that unlike insert, alterF will not replace an element equal to the given value.

Note: alterF is a variant of the at combinator from Control.Lens.At.

Since: containers-0.6.3.1

isProperSubsetOf :: Ord a => Set a -> Set a -> Bool

\(O\bigl(m \log\bigl(\frac{n+1}{m+1}\bigr)\bigr), \; m \leq n\). (s1 `isProperSubsetOf` s2) indicates whether s1 is a proper subset of s2.

s1 `isProperSubsetOf` s2 = s1 `isSubsetOf` s2 && s1 /= s2

isSubsetOf :: Ord a => Set a -> Set a -> Bool

\(O\bigl(m \log\bigl(\frac{n+1}{m+1}\bigr)\bigr), \; m \leq n\). (s1 `isSubsetOf` s2) indicates whether s1 is a subset of s2.

s1 `isSubsetOf` s2 = all (`member` s2) s1
s1 `isSubsetOf` s2 = null (s1 `difference` s2)
s1 `isSubsetOf` s2 = s1 `union` s2 == s2
s1 `isSubsetOf` s2 = s1 `intersection` s2 == s1

disjoint :: Ord a => Set a -> Set a -> Bool

\(O\bigl(m \log\bigl(\frac{n+1}{m+1}\bigr)\bigr), \; m \leq n\). Check whether two sets are disjoint (i.e., their intersection is empty).

disjoint (fromList [2,4,6])   (fromList [1,3])     == True
disjoint (fromList [2,4,6,8]) (fromList [2,3,5,7]) == False
disjoint (fromList [1,2])     (fromList [1,2,3,4]) == False
disjoint (fromList [])        (fromList [])        == True

xs `disjoint` ys = null (xs `intersection` ys)

Since: containers-0.5.11

lookupMin :: Set a -> Maybe a

\(O(\log n)\). The minimal element of a set.

Since: containers-0.5.9

lookupMax :: Set a -> Maybe a

\(O(\log n)\). The maximal element of a set.

Since: containers-0.5.9

findMax :: Set a -> a

\(O(\log n)\). The maximal element of a set.

deleteMax :: Set a -> Set a

\(O(\log n)\). Delete the maximal element. Returns an empty set if the set is empty.

unions :: (Foldable f, Ord a) => f (Set a) -> Set a

The union of the sets in a Foldable structure : (unions == foldl union empty).

difference :: Ord a => Set a -> Set a -> Set a

\(O\bigl(m \log\bigl(\frac{n+1}{m+1}\bigr)\bigr), \; m \leq n\). Difference of two sets.

Return elements of the first set not existing in the second set.

difference (fromList [5, 3]) (fromList [5, 7]) == singleton 3

intersection :: Ord a => Set a -> Set a -> Set a

\(O\bigl(m \log\bigl(\frac{n+1}{m+1}\bigr)\bigr), \; m \leq n\). The intersection of two sets. Elements of the result come from the first set, so for example

import qualified Data.Set as S
data AB = A | B deriving Show
instance Ord AB where compare _ _ = EQ
instance Eq AB where _ == _ = True
main = print (S.singleton A `S.intersection` S.singleton B,
              S.singleton B `S.intersection` S.singleton A)

prints (fromList [A],fromList [B]).

mapMonotonic :: (a -> b) -> Set a -> Set b

\(O(n)\). The

mapMonotonic f s == map f s, but works only when f is strictly increasing. The precondition is not checked. Semi-formally, we have:

and [x < y ==> f x < f y | x <- ls, y <- ls]
                    ==> mapMonotonic f s == map f s
    where ls = toList s

toAscList :: Set a -> [a]

\(O(n)\). Convert the set to an ascending list of elements. Subject to list fusion.

toDescList :: Set a -> [a]

\(O(n)\). Convert the set to a descending list of elements. Subject to list fusion.

fromAscList :: Eq a => [a] -> Set a

\(O(n)\). Build a set from an ascending list in linear time. The precondition (input list is ascending) is not checked.

fromDescList :: Eq a => [a] -> Set a

\(O(n)\). Build a set from a descending list in linear time. The precondition (input list is descending) is not checked.

Since: containers-0.5.8

fromDistinctAscList :: [a] -> Set a

\(O(n)\). Build a set from an ascending list of distinct elements in linear time. The precondition (input list is strictly ascending) is not checked.

fromDistinctDescList :: [a] -> Set a

\(O(n)\). Build a set from a descending list of distinct elements in linear time. The precondition (input list is strictly descending) is not checked.

splitMember :: Ord a => a -> Set a -> (Set a, Bool, Set a)

\(O(\log n)\). Performs a split but also returns whether the pivot element was found in the original set.

lookupIndex :: Ord a => a -> Set a -> Maybe Int

\(O(\log n)\). Lookup the index of an element, which is its zero-based index in the sorted sequence of elements. The index is a number from 0 up to, but not including, the size of the set.

isJust   (lookupIndex 2 (fromList [5,3])) == False
fromJust (lookupIndex 3 (fromList [5,3])) == 0
fromJust (lookupIndex 5 (fromList [5,3])) == 1
isJust   (lookupIndex 6 (fromList [5,3])) == False

Since: containers-0.5.4

elemAt :: Int -> Set a -> a

\(O(\log n)\). Retrieve an element by its index, i.e. by its zero-based index in the sorted sequence of elements. If the index is out of range (less than zero, greater or equal to size of the set), error is called.

elemAt 0 (fromList [5,3]) == 3
elemAt 1 (fromList [5,3]) == 5
elemAt 2 (fromList [5,3])    Error: index out of range

Since: containers-0.5.4

deleteAt :: Int -> Set a -> Set a

\(O(\log n)\). Delete the element at index, i.e. by its zero-based index in the sorted sequence of elements. If the index is out of range (less than zero, greater or equal to size of the set), error is called.

deleteAt 0    (fromList [5,3]) == singleton 5
deleteAt 1    (fromList [5,3]) == singleton 3
deleteAt 2    (fromList [5,3])    Error: index out of range
deleteAt (-1) (fromList [5,3])    Error: index out of range

Since: containers-0.5.4

takeWhileAntitone :: (a -> Bool) -> Set a -> Set a

\(O(\log n)\). Take while a predicate on the elements holds. The user is responsible for ensuring that for all elements j and k in the set, j < k ==> p j >= p k. See note at spanAntitone.

takeWhileAntitone p = fromDistinctAscList . takeWhile p . toList
takeWhileAntitone p = filter p

Since: containers-0.5.8

dropWhileAntitone :: (a -> Bool) -> Set a -> Set a

\(O(\log n)\). Drop while a predicate on the elements holds. The user is responsible for ensuring that for all elements j and k in the set, j < k ==> p j >= p k. See note at spanAntitone.

dropWhileAntitone p = fromDistinctAscList . dropWhile p . toList
dropWhileAntitone p = filter (not . p)

Since: containers-0.5.8

spanAntitone :: (a -> Bool) -> Set a -> (Set a, Set a)

\(O(\log n)\). Divide a set at the point where a predicate on the elements stops holding. The user is responsible for ensuring that for all elements j and k in the set, j < k ==> p j >= p k.

spanAntitone p xs = (takeWhileAntitone p xs, dropWhileAntitone p xs)
spanAntitone p xs = partition p xs

Note: if p is not actually antitone, then spanAntitone will split the set at some unspecified point where the predicate switches from holding to not holding (where the predicate is seen to hold before the first element and to fail after the last element).

Since: containers-0.5.8

deleteFindMin :: Set a -> (a, Set a)

\(O(\log n)\). Delete and find the minimal element.

deleteFindMin set = (findMin set, deleteMin set)

deleteFindMax :: Set a -> (a, Set a)

\(O(\log n)\). Delete and find the maximal element.

deleteFindMax set = (findMax set, deleteMax set)

maxView :: Set a -> Maybe (a, Set a)

\(O(\log n)\). Retrieves the maximal key of the set, and the set stripped of that element, or Nothing if passed an empty set.

splitRoot :: Set a -> [Set a]

\(O(1)\). Decompose a set into pieces based on the structure of the underlying tree. This function is useful for consuming a set in parallel.

No guarantee is made as to the sizes of the pieces; an internal, but deterministic process determines this. However, it is guaranteed that the pieces returned will be in ascending order (all elements in the first subset less than all elements in the second, and so on).

Examples:

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

splitRoot empty == []

Note that the current implementation does not return more than three subsets, but you should not depend on this behaviour because it can change in the future without notice.

Since: containers-0.5.4

powerSet :: Set a -> Set (Set a)

\(O(2^n \log n)\). Calculate the power set of a set: the set of all its subsets.

t `member` powerSet s == t `isSubsetOf` s

Example:

powerSet (fromList [1,2,3]) =
  fromList $ map fromList [[],[1],[1,2],[1,2,3],[1,3],[2],[2,3],[3]]

Since: containers-0.5.11

cartesianProduct :: Set a -> Set b -> Set (a, b)

\(O(nm)\). Calculate the Cartesian product of two sets.

cartesianProduct xs ys = fromList $ liftA2 (,) (toList xs) (toList ys)

Example:

cartesianProduct (fromList [1,2]) (fromList ['a','b']) =
  fromList [(1,'a'), (1,'b'), (2,'a'), (2,'b')]

Since: containers-0.5.11

disjointUnion :: Set a -> Set b -> Set (Either a b)

\(O(n+m)\). Calculate the disjoint union of two sets.

 disjointUnion xs ys = map Left xs `union` map Right ys

Example:

disjointUnion (fromList [1,2]) (fromList ["hi", "bye"]) =
  fromList [Left 1, Left 2, Right "hi", Right "bye"]

Since: containers-0.5.11

data LangComparison

The result of cmp.

Constructors

DifferentLang

The locales share no languages in common

SameLang

The locales share any language and territory pair

DifferentTerritory

The locales share a language but differ in which territory that language is for

Instances

Bounded LangComparison

Defined in Graphics.Text.Font.Choose.LangSet

Methods

minBound :: LangComparison

maxBound :: LangComparison

Enum LangComparison

Defined in Graphics.Text.Font.Choose.LangSet

Methods

succ :: LangComparison -> LangComparison

pred :: LangComparison -> LangComparison

toEnum :: Int -> LangComparison

fromEnum :: LangComparison -> Int

enumFrom :: LangComparison -> [LangComparison]

enumFromThen :: LangComparison -> LangComparison -> [LangComparison]

enumFromTo :: LangComparison -> LangComparison -> [LangComparison]

enumFromThenTo :: LangComparison -> LangComparison -> LangComparison -> [LangComparison]

Read LangComparison

Defined in Graphics.Text.Font.Choose.LangSet

Methods

readsPrec :: Int -> ReadS LangComparison

readList :: ReadS [LangComparison]

readPrec :: ReadPrec LangComparison

readListPrec :: ReadPrec [LangComparison]

Show LangComparison

Defined in Graphics.Text.Font.Choose.LangSet

Methods

showsPrec :: Int -> LangComparison -> ShowS

show :: LangComparison -> String

showList :: [LangComparison] -> ShowS

Eq LangComparison

Defined in Graphics.Text.Font.Choose.LangSet

Methods

(==) :: LangComparison -> LangComparison -> Bool

(/=) :: LangComparison -> LangComparison -> Bool

validLangSet :: LangSet -> Bool

Can the given LangSet be processed by FontConfig?

validLangSet' :: LangSet' -> Bool

Can the given LangSet' be processed by FontConfig?

cmp :: LangSet -> LangSet -> LangComparison

cmp' :: LangSet' -> LangSet' -> LangComparison

Compares language coverage for the 2 given LangSets.

has :: LangSet' -> String -> LangComparison

returns True if a contains every language in b. a` will contain a language from b if a has exactly the language, or either the language or a has no territory.

defaultLangs :: StrSet

Returns a string set of the default languages according to the environment variables on the system. This function looks for them in order of FC_LANG, LC_ALL, LC_CTYPE and LANG then. If there are no valid values in those environment variables, "en" will be set as fallback.

langs :: StrSet

Returns a string set of all languages.

normalize :: String -> String

Returns a string to make lang suitable on fontconfig.

langCharSet :: String -> CharSet'

Returns the CharSet for a language.