-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | SDP classes for unordered containers
--   
--   Implementation of SDP core classes for unordered containers
@package sdp4unordered
@version 0.2


-- | <tt>SDP.HashMap.Lazy</tt> provides <a>HashMap</a> - lazy unordered
--   associative array with <a>Hashable</a> keys.
module SDP.HashMap.Lazy

-- | A map from keys to values. A map cannot contain duplicate keys; each
--   key can map to at most one value.
data HashMap k v

-- | <a>HashMap</a> alias, may reduce ambiguity.
type LHashMap = HashMap
instance SDP.Nullable.Nullable (Data.HashMap.Internal.HashMap k e)
instance SDP.Index.Index k => SDP.Estimate.Estimate (Data.HashMap.Internal.HashMap k e)
instance (GHC.Classes.Eq k, Data.Hashable.Class.Hashable k) => SDP.Map.Map (Data.HashMap.Internal.HashMap k e) k e


-- | <tt>SDP.HashMap.Strict</tt> provides <a>HashMap</a> - strict unordered
--   associative array with <a>Hashable</a> keys.
module SDP.HashMap.Strict

-- | A map from keys to values. A map cannot contain duplicate keys; each
--   key can map to at most one value.
data HashMap k v

-- | <a>HashMap</a> alias, may reduce ambiguity.
type SHashMap = HashMap
instance SDP.Nullable.Nullable (Data.HashMap.Internal.HashMap k e)
instance SDP.Index.Index k => SDP.Estimate.Estimate (Data.HashMap.Internal.HashMap k e)
instance (GHC.Classes.Eq k, Data.Hashable.Class.Hashable k) => SDP.Map.Map (Data.HashMap.Internal.HashMap k e) k e


-- | <tt>SDP.HashSet</tt> provides <a>HashSet</a> - unordered set with
--   <a>Hashable</a> keys.
module SDP.HashSet

-- | A set of values. A set cannot contain duplicate values.
data HashSet a
instance SDP.Nullable.Nullable (Data.HashSet.Internal.HashSet e)
instance SDP.Estimate.Estimate (Data.HashSet.Internal.HashSet e)
instance SDP.Linear.Bordered (Data.HashSet.Internal.HashSet e) GHC.Types.Int
instance (GHC.Classes.Eq e, Data.Hashable.Class.Hashable e) => SDP.Set.Set (Data.HashSet.Internal.HashSet e) e