Agda.Utils.Trie

Strict tries (based on Data.Map.Strict and Agda.Utils.Maybe.Strict).

Documentation

data Trie k v

Finite map from [k] to v.

With the strict Maybe type, Trie is also strict in v.

Constructors

Trie !(Maybe v) !(Map k (Trie k v))

Instances

Foldable (Trie k)

Defined in Agda.Utils.Trie

Methods

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

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

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

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

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

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

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

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

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

toList :: Trie k a -> [a]

null :: Trie k a -> Bool

length :: Trie k a -> Int

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

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

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

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

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

Functor (Trie k)

Defined in Agda.Utils.Trie

Methods

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

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

(Ord a, EmbPrj a, EmbPrj b) => EmbPrj (Trie a b)

Defined in Agda.TypeChecking.Serialise.Instances.Common

Methods

icode :: Trie a b -> S Int32

icod_ :: Trie a b -> S Int32

value :: Int32 -> R (Trie a b)

Null (Trie k v)

Empty trie.

Defined in Agda.Utils.Trie

Methods

empty :: Trie k v

null :: Trie k v -> Bool

(Show v, Show k) => Show (Trie k v)

Defined in Agda.Utils.Trie

Methods

showsPrec :: Int -> Trie k v -> ShowS

show :: Trie k v -> String

showList :: [Trie k v] -> ShowS

(NFData k, NFData v) => NFData (Trie k v)

Defined in Agda.Utils.Trie

Methods

rnf :: Trie k v -> ()

(Eq v, Eq k) => Eq (Trie k v)

Defined in Agda.Utils.Trie

Methods

(==) :: Trie k v -> Trie k v -> Bool

(/=) :: Trie k v -> Trie k v -> Bool

empty :: Null a => a

singleton :: [k] -> v -> Trie k v

Singleton trie.

everyPrefix :: [k] -> v -> Trie k v

everyPrefix k v is a trie where every prefix of k (including k itself) is mapped to v.

insert :: Ord k => [k] -> v -> Trie k v -> Trie k v

Insert. Overwrites existing value if present.

insert = insertWith ( new old -> new)

insertWith :: Ord k => (v -> v -> v) -> [k] -> v -> Trie k v -> Trie k v

Insert with function merging new value with old value.

union :: Ord k => Trie k v -> Trie k v -> Trie k v

Left biased union.

union = unionWith ( new old -> new).

unionWith :: Ord k => (v -> v -> v) -> Trie k v -> Trie k v -> Trie k v

Pointwise union with merge function for values.

adjust :: Ord k => [k] -> (Maybe v -> Maybe v) -> Trie k v -> Trie k v

Adjust value at key, leave subtree intact.

delete :: Ord k => [k] -> Trie k v -> Trie k v

Delete value at key, but leave subtree intact.

toList :: Ord k => Trie k v -> [([k], v)]

Convert to ascending list.

toAscList :: Ord k => Trie k v -> [([k], v)]

Convert to ascending list.

toListOrderedBy :: Ord k => (v -> v -> Ordering) -> Trie k v -> [([k], v)]

Convert to list where nodes at the same level are ordered according to the given ordering.

lookup :: Ord k => [k] -> Trie k v -> Maybe v

Returns the value associated with the given key, if any.

member :: Ord k => [k] -> Trie k v -> Bool

Is the given key present in the trie?

lookupPath :: Ord k => [k] -> Trie k v -> [v]

Collect all values along a given path.

lookupTrie :: Ord k => [k] -> Trie k v -> Trie k v

Get the subtrie rooted at the given key.

mapSubTries :: Ord k => (Trie k u -> Maybe v) -> Trie k u -> Trie k v

Create new values based on the entire subtrie. Almost, but not quite comonad extend.

filter :: Ord k => (v -> Bool) -> Trie k v -> Trie k v

Filter a trie.

valueAt :: Ord k => [k] -> Lens' (Maybe v) (Trie k v)

Key lens.