Language.Preprocessor.Cpphs.SymTab

| cpphs | Source code | Contents | Index
Language.Preprocessor.Cpphs.SymTab |
Portability | All
Stability | Stable
Maintainer | Malcolm 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 v | Source
insertST :: (String, v) -> SymTab v -> SymTab v | Source
deleteST :: String -> SymTab v -> SymTab v | Source
lookupST :: String -> SymTab v -> Maybe v | Source
definedST :: String -> SymTab v -> Bool | Source
data IndTree t | Source
Index Trees (storing indexes at nodes).
Instances
Show t => Show (IndTree t)
Produced by Haddock version 0.8