-- |
-- simple key value assocciation list
-- implemented as unordered list of pairs
--
-- Version : $Id: AssocList.hs,v 1.1 2003/02/10 13:52:18 hxml Exp $

module AssocList
where

import Maybe

type AssocList k v = [(k, v)]

-- lookup 	= lookup from Prelude

lookupDef	:: Eq k => v -> k -> AssocList k v -> v
lookupDef d k	= fromMaybe d . lookup k

lookup1		:: Eq k => k -> AssocList k [e] -> [e]
lookup1 k	= fromMaybe [] . lookup k

hasEntry	:: Eq k => k -> AssocList k v -> Bool
hasEntry k	= isJust . lookup k

addEntry	:: Eq k => k -> v -> AssocList k v -> AssocList k v
addEntry k v l	= (k, v) : delEntry k l

addEntries	:: Eq k => AssocList k v -> AssocList k v -> AssocList k v
addEntries	= foldr (.) id . map (uncurry addEntry) . reverse

delEntry		:: Eq k => k -> AssocList k v -> AssocList k v
delEntry k	= filter ((/= k) . fst)

delEntries	:: Eq k => [k] -> AssocList k v -> AssocList k v
delEntries	= foldl (.) id . map delEntry

-- -----------------------------------------------------------------------------