Copyright	(c) 2018-2022 Kowainik
License	MPL-2.0
Maintainer	Kowainik <xrom.xkov@gmail.com>
Stability	Stable
Portability	Portable
Safe Haskell	Safe-Inferred
Language	Haskell2010

Toml.Type.PrefixTree

Contents

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

Description

Implementation of prefix tree for TOML AST.

Since: 0.0.0

Synopsis

data PrefixTree a
- = Leaf !Key !a
- | Branch !Prefix !(Maybe a) !(PrefixMap a)
singleT :: Key -> a -> PrefixTree a
insertT :: Key -> a -> PrefixTree a -> PrefixTree a
lookupT :: Key -> PrefixTree a -> Maybe a
toListT :: PrefixTree a -> [(Key, a)]
addPrefixT :: Prefix -> PrefixTree a -> PrefixTree a
differenceWithT :: (a -> b -> Maybe a) -> PrefixTree a -> PrefixTree b -> Maybe (PrefixTree a)
type PrefixMap a = HashMap Piece (PrefixTree a)
single :: Key -> a -> PrefixMap a
insert :: Key -> a -> PrefixMap a -> PrefixMap a
lookup :: Key -> PrefixMap a -> Maybe a
fromList :: [(Key, a)] -> PrefixMap a
toList :: PrefixMap a -> [(Key, a)]
differenceWith :: (a -> b -> Maybe a) -> PrefixMap a -> PrefixMap b -> PrefixMap a

Non-empty prefix tree

data PrefixTree a Source #

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

Instances details

Semigroup (PrefixTree a) Source #	Since: 0.3
Instance details 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 #
Generic (PrefixTree a) Source #
Instance details 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 #
Show a => Show (PrefixTree a) Source #
Instance details Defined in Toml.Type.PrefixTree Methods showsPrec :: Int -> PrefixTree a -> ShowS # show :: PrefixTree a -> String # showList :: [PrefixTree a] -> ShowS #
NFData a => NFData (PrefixTree a) Source #
Instance details Defined in Toml.Type.PrefixTree Methods rnf :: PrefixTree a -> () #
Eq a => Eq (PrefixTree a) Source #
Instance details Defined in Toml.Type.PrefixTree Methods (==) :: PrefixTree a -> PrefixTree a -> Bool # (/=) :: PrefixTree a -> PrefixTree a -> Bool #
type Rep (PrefixTree a) Source #
Instance details Defined in Toml.Type.PrefixTree type Rep (PrefixTree a) = D1 ('MetaData "PrefixTree" "Toml.Type.PrefixTree" "tomland-1.3.3.3-Ih5ryp7Jmpp9EbGekxhWoS" '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)))))