{-

Copyright (c) 2013 Lukas Mai

All rights reserved.

Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:

* Redistributions of source code must retain the above copyright notice, this
  list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
  this list of conditions and the following disclaimer in the documentation
  and/or other materials provided with the distribution.
* Neither the name of the author nor the names of his contributors
  may be used to endorse or promote products derived from this software
  without specific prior written permission.

THIS SOFTWARE IS PROVIDED BY LUKAS MAI AND CONTRIBUTORS "AS IS" AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

-}

module Data.Default.Instances.Containers (
-- | This module defines 'Default' instances for the types 'S.Set', 'M.Map',
-- 'IntMap', 'IntSet', 'Seq', and 'Tree'.
) where

import Data.Default.Class
import Data.Monoid (mempty)
import qualified Data.Set as S
import qualified Data.Map as M
import Data.IntMap (IntMap)
import Data.IntSet (IntSet)
import Data.Sequence (Seq)
import Data.Tree (Tree(..))

instance Default (S.Set v) where def :: Set v
def = Set v
forall v. Set v
S.empty
instance Default (M.Map k v) where def :: Map k v
def = Map k v
forall k v. Map k v
M.empty
instance Default (IntMap v) where def :: IntMap v
def = IntMap v
forall a. Monoid a => a
mempty
instance Default IntSet where def :: IntSet
def = IntSet
forall a. Monoid a => a
mempty
instance Default (Seq a) where def :: Seq a
def = Seq a
forall a. Monoid a => a
mempty
instance (Default a) => Default (Tree a) where def :: Tree a
def = a -> [Tree a] -> Tree a
forall a. a -> [Tree a] -> Tree a
Node a
forall a. Default a => a
def []