Data.BCP47.Trie

A trie like data structure for defining maps from BCP47 tags to values.

This structure supports collection and lookup of language tagged values. Its semantics are based on those defined in the BCP 47 specification.

Documentation

data Trie a

A trie mapping BCP47 tags to values

Instances

Functor Trie

Defined in Data.BCP47.Trie.Internal

Methods

fmap :: (a -> b) -> Trie a -> Trie b

(<$) :: a -> Trie b -> Trie a

Foldable Trie

Defined in Data.BCP47.Trie.Internal

Methods

fold :: Monoid m => Trie m -> m

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

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

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

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

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

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

foldr1 :: (a -> a -> a) -> Trie a -> a

foldl1 :: (a -> a -> a) -> Trie a -> a

toList :: Trie a -> [a]

null :: Trie a -> Bool

length :: Trie a -> Int

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

maximum :: Ord a => Trie a -> a

minimum :: Ord a => Trie a -> a

sum :: Num a => Trie a -> a

product :: Num a => Trie a -> a

Traversable Trie

Defined in Data.BCP47.Trie.Internal

Methods

traverse :: Applicative f => (a -> f b) -> Trie a -> f (Trie b)

sequenceA :: Applicative f => Trie (f a) -> f (Trie a)

mapM :: Monad m => (a -> m b) -> Trie a -> m (Trie b)

sequence :: Monad m => Trie (m a) -> m (Trie a)

Eq a => Eq (Trie a)

Defined in Data.BCP47.Trie.Internal

Methods

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

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

Ord a => Ord (Trie a)

Defined in Data.BCP47.Trie.Internal

Methods

compare :: Trie a -> Trie a -> Ordering

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

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

(>) :: Trie a -> Trie a -> Bool

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

max :: Trie a -> Trie a -> Trie a

min :: Trie a -> Trie a -> Trie a

Show a => Show (Trie a)

Defined in Data.BCP47.Trie.Internal

Methods

showsPrec :: Int -> Trie a -> ShowS

show :: Trie a -> String

showList :: [Trie a] -> ShowS

Semigroup a => Semigroup (Trie a)

Defined in Data.BCP47.Trie.Internal

Methods

(<>) :: Trie a -> Trie a -> Trie a

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

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

Arbitrary a => Arbitrary (Trie a)

Defined in Data.BCP47.Trie.Internal

Methods

arbitrary :: Gen (Trie a)

shrink :: Trie a -> [Trie a]

fromList :: [(BCP47, a)] -> Maybe (Trie a)

Construct a Trie from a list of tag/value pairs.

fromNonEmpty :: NonEmpty (BCP47, a) -> Trie a

Construct a Trie from a non empty list of tag/value pairs.

singleton :: BCP47 -> a -> Trie a

Construct a Trie from a single tag/value pair.

lookup :: BCP47 -> Trie a -> Maybe a

Lookup the most relevant item for a tag

"Lookup is used to select the single language tag that best matches the language priority list for a given request...For example, if the language range is 'de-ch', a lookup operation can produce content with the tags de or 'de-CH' but never content with the tag 'de-CH-1996'."

https://tools.ietf.org/html/bcp47#page-2-12

match :: BCP47 -> Trie a -> Maybe a

Lookup an exact match for a tag

elem :: BCP47 -> Trie a -> Bool

Check if a tag exists in the Trie

union :: Trie a -> Trie a -> Trie a

A left-biased union of two Trie structures. The left value is prefered when duplicate tags are found.

unionWith :: (a -> a -> a) -> Trie a -> Trie a -> Trie a

union with a combining function.

mapMaybe :: (a -> Maybe b) -> Trie a -> Maybe (Trie b)