cpphs
Copyright2000-2004 Malcolm Wallace
LicenseLGPL
MaintainerMalcolm Wallace <Malcolm.Wallace@cs.york.ac.uk>
StabilityStable
PortabilityAll
Safe HaskellSafe-Inferred
LanguageHaskell98

Language.Preprocessor.Cpphs.SymTab

Description

Symbol Table, based on index trees using a hash on the key. Keys are always Strings. Stored values can be any type.

Synopsis

Documentation

type SymTab v = IndTree [(String, v)] #

Symbol Table. Stored values are polymorphic, but the keys are always strings.

insertST :: (String, v) -> SymTab v -> SymTab v #

deleteST :: String -> SymTab v -> SymTab v #

lookupST :: String -> SymTab v -> Maybe v #

definedST :: String -> SymTab v -> Bool #

flattenST :: SymTab v -> [v] #

data IndTree t #

Index Trees (storing indexes at nodes).

Instances

Instances details
Show t => Show (IndTree t) # 
Instance details

Defined in Language.Preprocessor.Cpphs.SymTab

Methods

showsPrec :: Int -> IndTree t -> ShowS

show :: IndTree t -> String

showList :: [IndTree t] -> ShowS