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.

Contents

Non-empty prefix tree
Prefix map that stores roots of PrefixTree

Synopsis

data PrefixTree
value singleT
value insertT
value lookupT
value toListT
value addPrefixT
value differenceWithT
type PrefixMap
value single
value insert
value lookup
value fromList
value toList
value differenceWith

Packagetomland-1.3.3.3
Exports14
LanguageHaskell2010
LicenceMPL-2.0
SourcePrefixTree.hs

Non-empty prefix tree

datadata PrefixTree a

Source#

Data structure to represent table tree for toml.

Constructors

Leaf !Key !a
End of a key.
Branch !Prefix !(Maybe a) !(PrefixMap a)
Values along pieces of a key.

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-LJnkrEBIZd1ILDFs176NM4" '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

Source#

Creates a PrefixTree of one key-value element.

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

Source#

Inserts key-value element into the given PrefixTree.

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

Source#

Looks up the value at a key in the PrefixTree.

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

Source#

Converts PrefixTree to the list of pairs.

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

Source#

Push Prefix inside the given PrefixTree.

valuedifferenceWithT

:: a -> b -> Maybe a
-> PrefixTree a
-> PrefixTree b
-> Maybe (PrefixTree a)

Source#

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

Prefix map that stores roots of PrefixTree

typetype PrefixMap a = HashMap Piece (PrefixTree a)

Source#

Map of layer names and corresponding PrefixTrees.

valuesingle :: Key -> a -> PrefixMap a

Source#

Creates a PrefixMap of one key-value element.

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

Source#

Inserts key-value element into the given PrefixMap.

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

Source#

Looks up the value at a key in the PrefixMap.

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

Source#

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

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

Source#

Converts PrefixMap to the list of pairs.

valuedifferenceWith

:: a -> b -> Maybe a
-> PrefixMap a
-> PrefixMap b
-> PrefixMap a

Source#

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