Moduletomland-1.3.3.3Haskell2010

Toml.Type.PrefixTree

SPDX-License-Identifier : MPL-2.0 Maintainer : Kowainik xrom.xkov@gmail.com Stability : Stable Portability : Portable

Implementation of prefix tree for TOML AST.

Non-empty prefix tree

7 declarations

datadata PrefixTree a

Data structure to represent table tree for toml.

Instances6Eq, Show, Generic, Semigroup, NFData, Rep

Eq a => Eq (PrefixTree a)Defined in tomland-1.3.3.3 · Toml.Type.PrefixTree
Show a => Show (PrefixTree a)Defined in tomland-1.3.3.3 · Toml.Type.PrefixTree
Generic (PrefixTree a)Defined in tomland-1.3.3.3 · Toml.Type.PrefixTree
Semigroup (PrefixTree a)Defined in tomland-1.3.3.3 · Toml.Type.PrefixTree
NFData a => NFData (PrefixTree a)Defined in tomland-1.3.3.3 · Toml.Type.PrefixTree
type Rep (PrefixTree a) = D1 ('MetaData "PrefixTree" "Toml.Type.PrefixTree" "tomland-1.3.3.3-IZ1IPk9NxLy7CYVHjydqUA" 'False) (C1 ('MetaCons "Leaf" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Key) :*: S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 a)) :+: C1 ('MetaCons "Branch" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Prefix) :*: (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Maybe a)) :*: S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (PrefixMap a)))))Defined in tomland-1.3.3.3 · Toml.Type.PrefixTree

valuesingleT :: Key -> a -> PrefixTree a

Creates a PrefixTree of one key-value element.

valueinsertT :: Key -> a -> PrefixTree a -> PrefixTree a

Inserts key-value element into the given PrefixTree.

valuelookupT :: Key -> PrefixTree a -> Maybe a

Looks up the value at a key in the PrefixTree.

valuetoListT :: PrefixTree a -> [(Key, a)]

Converts PrefixTree to the list of pairs.

valueaddPrefixT :: Prefix -> PrefixTree a -> PrefixTree a

Push Prefix inside the given PrefixTree.

valuedifferenceWithT

Difference of two PrefixTrees. Returns elements of the first PrefixTree that are not existing in the second one.

7 declarations

typetype PrefixMap a = HashMap Piece (PrefixTree a)

Map of layer names and corresponding PrefixTrees.

valuesingle :: Key -> a -> PrefixMap a

Creates a PrefixMap of one key-value element.

valueinsert :: Key -> a -> PrefixMap a -> PrefixMap a

Inserts key-value element into the given PrefixMap.

valuelookup :: Key -> PrefixMap a -> Maybe a

Looks up the value at a key in the PrefixMap.

valuefromList :: [(Key, a)] -> PrefixMap a

Constructs PrefixMap structure from the given list of Key and value pairs.

valuetoList :: PrefixMap a -> [(Key, a)]

Converts PrefixMap to the list of pairs.

valuedifferenceWith

Difference of two PrefixMaps. Returns elements of the first PrefixMap that are not existing in the second one.