Toml.Type.PrefixTree

Implementation of prefix tree for TOML AST.

Since: 0.0.0

Non-empty prefix tree

data PrefixTree a

Data structure to represent table tree for toml.

Since: 0.0.0

Constructors

Leaf

End of a key.

Fields

• !Key

  End piece of the key.

• !a

  Value at the end.

Branch

Values along pieces of a key.

Fields

• !Prefix

  Greatest common key prefix.

• !(Maybe a)

  Possible value at that point.

• !(PrefixMap a)

  Values at suffixes of the prefix.

Instances

Eq a => Eq (PrefixTree a)

Defined in Toml.Type.PrefixTree

Methods

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

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

Show a => Show (PrefixTree a)

Defined in Toml.Type.PrefixTree

Methods

showsPrec :: Int -> PrefixTree a -> ShowS

show :: PrefixTree a -> String

showList :: [PrefixTree a] -> ShowS

Generic (PrefixTree a)

Defined in Toml.Type.PrefixTree

Associated Types

type Rep (PrefixTree a) :: Type -> Type

Methods

from :: PrefixTree a -> Rep (PrefixTree a) x

to :: Rep (PrefixTree a) x -> PrefixTree a

Semigroup (PrefixTree a)

Since: 0.3

Defined in Toml.Type.PrefixTree

Methods

(<>) :: PrefixTree a -> PrefixTree a -> PrefixTree a

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

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

NFData a => NFData (PrefixTree a)

Defined in Toml.Type.PrefixTree

Methods

rnf :: PrefixTree a -> ()

type Rep (PrefixTree a)

Defined in Toml.Type.PrefixTree

type Rep (PrefixTree a) = D1 ('MetaData "PrefixTree" "Toml.Type.PrefixTree" "tomland-1.3.3.1-inplace" 'False) (C1 ('MetaCons "Leaf" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Key) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 a)) :+: C1 ('MetaCons "Branch" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Prefix) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Maybe a)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (PrefixMap a)))))

singleT :: Key -> a -> PrefixTree a

Creates a PrefixTree of one key-value element.

Since: 0.0.0

insertT :: Key -> a -> PrefixTree a -> PrefixTree a

Inserts key-value element into the given PrefixTree.

Since: 0.0.0

lookupT :: Key -> PrefixTree a -> Maybe a

Looks up the value at a key in the PrefixTree.

Since: 0.0.0

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

Converts PrefixTree to the list of pairs.

Since: 0.0.0

addPrefixT :: Prefix -> PrefixTree a -> PrefixTree a

Push Prefix inside the given PrefixTree.

Since: 1.3.2.0

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

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

Since: 1.3.2.0

Prefix map that stores roots of PrefixTree

type PrefixMap a = HashMap Piece (PrefixTree a)

Map of layer names and corresponding PrefixTrees.

Since: 0.0.0

single :: Key -> a -> PrefixMap a

Creates a PrefixMap of one key-value element.

Since: 0.0.0

insert :: Key -> a -> PrefixMap a -> PrefixMap a

Inserts key-value element into the given PrefixMap.

Since: 0.0.0

lookup :: Key -> PrefixMap a -> Maybe a

Looks up the value at a key in the PrefixMap.

Since: 0.0.0

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

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

Since: 0.0.0

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

Converts PrefixMap to the list of pairs.

Since: 0.0.0

differenceWith :: (a -> b -> Maybe a) -> PrefixMap a -> PrefixMap b -> PrefixMap a

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

Since: 1.3.2.0