cpphsSource codeContentsIndex
Language.Preprocessor.Cpphs.SymTab
PortabilityAll
StabilityStable
MaintainerMalcolm Wallace <Malcolm.Wallace@cs.york.ac.uk>
Description
Symbol Table, based on index trees using a hash on the key. Keys are always Strings. Stored values can be any type.
Synopsis
type SymTab v = IndTree [(String, v)]
emptyST :: SymTab v
insertST :: (String, v) -> SymTab v -> SymTab v
deleteST :: String -> SymTab v -> SymTab v
lookupST :: String -> SymTab v -> Maybe v
definedST :: String -> SymTab v -> Bool
data IndTree t
Documentation
type SymTab v = IndTree [(String, v)]Source
Symbol Table. Stored values are polymorphic, but the keys are always strings.
emptyST :: SymTab vSource
insertST :: (String, v) -> SymTab v -> SymTab vSource
deleteST :: String -> SymTab v -> SymTab vSource
lookupST :: String -> SymTab v -> Maybe vSource
definedST :: String -> SymTab v -> BoolSource
data IndTree tSource
Index Trees (storing indexes at nodes).
show/hide Instances
Show t => Show (IndTree t)
Produced by Haddock version 0.8