Toml.PrefixTree

Implementation of prefix tree for TOML AST.

Core types

newtype Piece

Represents the key piece of some layer.

Constructors

Piece

Fields

• unPiece :: Text

Instances

Eq Piece

Defined in Toml.PrefixTree

Methods

(==) :: Piece -> Piece -> Bool

(/=) :: Piece -> Piece -> Bool

Ord Piece

Defined in Toml.PrefixTree

Methods

compare :: Piece -> Piece -> Ordering

(<) :: Piece -> Piece -> Bool

(<=) :: Piece -> Piece -> Bool

(>) :: Piece -> Piece -> Bool

(>=) :: Piece -> Piece -> Bool

max :: Piece -> Piece -> Piece

min :: Piece -> Piece -> Piece

Show Piece

Defined in Toml.PrefixTree

Methods

showsPrec :: Int -> Piece -> ShowS

show :: Piece -> String

showList :: [Piece] -> ShowS

IsString Piece

Defined in Toml.PrefixTree

Methods

fromString :: String -> Piece

Generic Piece

Defined in Toml.PrefixTree

Associated Types

type Rep Piece :: Type -> Type

Methods

from :: Piece -> Rep Piece x

to :: Rep Piece x -> Piece

NFData Piece

Defined in Toml.PrefixTree

Methods

rnf :: Piece -> ()

Hashable Piece

Defined in Toml.PrefixTree

Methods

hashWithSalt :: Int -> Piece -> Int

hash :: Piece -> Int

type Rep Piece

Defined in Toml.PrefixTree

type Rep Piece = D1 (MetaData "Piece" "Toml.PrefixTree" "tomland-1.1.0.0-inplace" True) (C1 (MetaCons "Piece" PrefixI True) (S1 (MetaSel (Just "unPiece") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Text)))

newtype Key

Key of value in key = val pair. Represents as non-empty list of key components — Pieces. Key like

site."google.com"

is represented like

Key (Piece "site" :| [Piece "\"google.com\""])

Constructors

Key

Fields

• unKey :: NonEmpty Piece

Instances

Eq Key

Defined in Toml.PrefixTree

Methods

(==) :: Key -> Key -> Bool

(/=) :: Key -> Key -> Bool

Ord Key

Defined in Toml.PrefixTree

Methods

compare :: Key -> Key -> Ordering

(<) :: Key -> Key -> Bool

(<=) :: Key -> Key -> Bool

(>) :: Key -> Key -> Bool

(>=) :: Key -> Key -> Bool

max :: Key -> Key -> Key

min :: Key -> Key -> Key

Show Key

Defined in Toml.PrefixTree

Methods

showsPrec :: Int -> Key -> ShowS

show :: Key -> String

showList :: [Key] -> ShowS

IsString Key

Split a dot-separated string into Key. Empty string turns into a Key with single element — empty Piece.

This instance is not safe for now. Use carefully. If you try to use as a key string like this site."google.com" you will have list of three components instead of desired two.

Defined in Toml.PrefixTree

Methods

fromString :: String -> Key

Generic Key

Defined in Toml.PrefixTree

Associated Types

type Rep Key :: Type -> Type

Methods

from :: Key -> Rep Key x

to :: Rep Key x -> Key

Semigroup Key

Defined in Toml.PrefixTree

Methods

(<>) :: Key -> Key -> Key

sconcat :: NonEmpty Key -> Key

stimes :: Integral b => b -> Key -> Key

NFData Key

Defined in Toml.PrefixTree

Methods

rnf :: Key -> ()

Hashable Key

Defined in Toml.PrefixTree

Methods

hashWithSalt :: Int -> Key -> Int

hash :: Key -> Int

type Rep Key

Defined in Toml.PrefixTree

type Rep Key = D1 (MetaData "Key" "Toml.PrefixTree" "tomland-1.1.0.0-inplace" True) (C1 (MetaCons "Key" PrefixI True) (S1 (MetaSel (Just "unKey") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (NonEmpty Piece))))

type Prefix = Key

Type synonym for Key.

pattern (:||) :: Piece -> [Piece] -> Key

Bidirectional pattern synonym for constructing and deconstructing Keys.

Key difference

data KeysDiff

Data structure to compare keys.

Constructors

Equal

Keys are equal

NoPrefix

Keys don't have any common part.

FstIsPref

The first key is the prefix of the second one.

Fields

• !Key

  Rest of the second key.

SndIsPref

The second key is the prefix of the first one.

Fields

• !Key

  Rest of the first key.

Diff

Key have a common prefix.

Fields

• !Key

  Common prefix.

• !Key

  Rest of the first key.

• !Key

  Rest of the second key.

Instances

Eq KeysDiff

Defined in Toml.PrefixTree

Methods

(==) :: KeysDiff -> KeysDiff -> Bool

(/=) :: KeysDiff -> KeysDiff -> Bool

Show KeysDiff

Defined in Toml.PrefixTree

Methods

showsPrec :: Int -> KeysDiff -> ShowS

show :: KeysDiff -> String

showList :: [KeysDiff] -> ShowS

keysDiff :: Key -> Key -> KeysDiff

Compares two keys

Non-empty prefix tree

data PrefixTree a

Data structure to represent table tree for toml.

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.PrefixTree

Methods

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

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

Show a => Show (PrefixTree a)

Defined in Toml.PrefixTree

Methods

showsPrec :: Int -> PrefixTree a -> ShowS

show :: PrefixTree a -> String

showList :: [PrefixTree a] -> ShowS

Generic (PrefixTree a)

Defined in Toml.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)

Defined in Toml.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.PrefixTree

Methods

rnf :: PrefixTree a -> ()

type Rep (PrefixTree a)

Defined in Toml.PrefixTree

type Rep (PrefixTree a) = D1 (MetaData "PrefixTree" "Toml.PrefixTree" "tomland-1.1.0.0-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)))))

(<|) :: Piece -> Key -> Key

Prepends Piece to the beginning of the Key.

singleT :: Key -> a -> PrefixTree a

Creates a PrefixTree of one key-value element.

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

Inserts key-value element into the given PrefixTree.

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

Looks up the value at a key in the PrefixTree.

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

Converts PrefixTree to the list of pairs.

Prefix map that stores roots of PrefixTree

type PrefixMap a = HashMap Piece (PrefixTree a)

Map of layer names and corresponding PrefixTrees.

single :: Key -> a -> PrefixMap a

Creates a PrefixMap of one key-value element.

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

Inserts key-value element into the given PrefixMap.

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

Looks up the value at a key in the PrefixMap.

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

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

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

Converts PrefixMap to the list of pairs.