containers-unicode-symbols 0.3.0.7 → 0.3.1
raw patch · 11 files changed
+554/−254 lines, 11 filesdep ~containersPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: containers
API changes (from Hackage documentation)
- Data.IntMap.Unicode: (∅) :: IntMap α
- Data.IntMap.Unicode: (∆) :: IntMap α -> IntMap α -> IntMap α
- Data.IntMap.Unicode: (∈) :: Int -> IntMap α -> Bool
- Data.IntMap.Unicode: (∉) :: Int -> IntMap α -> Bool
- Data.IntMap.Unicode: (∋) :: IntMap α -> Int -> Bool
- Data.IntMap.Unicode: (∌) :: IntMap α -> Int -> Bool
- Data.IntMap.Unicode: (∖) :: IntMap α -> IntMap β -> IntMap α
- Data.IntMap.Unicode: (∩) :: IntMap α -> IntMap β -> IntMap α
- Data.IntMap.Unicode: (∪) :: IntMap α -> IntMap α -> IntMap α
- Data.Map.Unicode: (∅) :: Map k α
- Data.Map.Unicode: (∆) :: Ord k => Map k α -> Map k α -> Map k α
- Data.Map.Unicode: (∈) :: Ord k => k -> Map k α -> Bool
- Data.Map.Unicode: (∉) :: Ord k => k -> Map k α -> Bool
- Data.Map.Unicode: (∋) :: Ord k => Map k α -> k -> Bool
- Data.Map.Unicode: (∌) :: Ord k => Map k α -> k -> Bool
- Data.Map.Unicode: (∖) :: Ord k => Map k α -> Map k β -> Map k α
- Data.Map.Unicode: (∩) :: Ord k => Map k α -> Map k β -> Map k α
- Data.Map.Unicode: (∪) :: Ord k => Map k α -> Map k α -> Map k α
+ Data.IntMap.Lazy.Unicode: (∅) :: IntMap α
+ Data.IntMap.Lazy.Unicode: (∆) :: IntMap α -> IntMap α -> IntMap α
+ Data.IntMap.Lazy.Unicode: (∈) :: Int -> IntMap α -> Bool
+ Data.IntMap.Lazy.Unicode: (∉) :: Int -> IntMap α -> Bool
+ Data.IntMap.Lazy.Unicode: (∋) :: IntMap α -> Int -> Bool
+ Data.IntMap.Lazy.Unicode: (∌) :: IntMap α -> Int -> Bool
+ Data.IntMap.Lazy.Unicode: (∖) :: IntMap α -> IntMap β -> IntMap α
+ Data.IntMap.Lazy.Unicode: (∩) :: IntMap α -> IntMap β -> IntMap α
+ Data.IntMap.Lazy.Unicode: (∪) :: IntMap α -> IntMap α -> IntMap α
+ Data.IntMap.Strict.Unicode: (∅) :: IntMap α
+ Data.IntMap.Strict.Unicode: (∆) :: IntMap α -> IntMap α -> IntMap α
+ Data.IntMap.Strict.Unicode: (∈) :: Int -> IntMap α -> Bool
+ Data.IntMap.Strict.Unicode: (∉) :: Int -> IntMap α -> Bool
+ Data.IntMap.Strict.Unicode: (∋) :: IntMap α -> Int -> Bool
+ Data.IntMap.Strict.Unicode: (∌) :: IntMap α -> Int -> Bool
+ Data.IntMap.Strict.Unicode: (∖) :: IntMap α -> IntMap β -> IntMap α
+ Data.IntMap.Strict.Unicode: (∩) :: IntMap α -> IntMap β -> IntMap α
+ Data.IntMap.Strict.Unicode: (∪) :: IntMap α -> IntMap α -> IntMap α
+ Data.Map.Lazy.Unicode: (∅) :: Map k α
+ Data.Map.Lazy.Unicode: (∆) :: Ord k => Map k α -> Map k α -> Map k α
+ Data.Map.Lazy.Unicode: (∈) :: Ord k => k -> Map k α -> Bool
+ Data.Map.Lazy.Unicode: (∉) :: Ord k => k -> Map k α -> Bool
+ Data.Map.Lazy.Unicode: (∋) :: Ord k => Map k α -> k -> Bool
+ Data.Map.Lazy.Unicode: (∌) :: Ord k => Map k α -> k -> Bool
+ Data.Map.Lazy.Unicode: (∖) :: Ord k => Map k α -> Map k β -> Map k α
+ Data.Map.Lazy.Unicode: (∩) :: Ord k => Map k α -> Map k β -> Map k α
+ Data.Map.Lazy.Unicode: (∪) :: Ord k => Map k α -> Map k α -> Map k α
+ Data.Map.Strict.Unicode: (∅) :: Map k α
+ Data.Map.Strict.Unicode: (∆) :: Ord k => Map k α -> Map k α -> Map k α
+ Data.Map.Strict.Unicode: (∈) :: Ord k => k -> Map k α -> Bool
+ Data.Map.Strict.Unicode: (∉) :: Ord k => k -> Map k α -> Bool
+ Data.Map.Strict.Unicode: (∋) :: Ord k => Map k α -> k -> Bool
+ Data.Map.Strict.Unicode: (∌) :: Ord k => Map k α -> k -> Bool
+ Data.Map.Strict.Unicode: (∖) :: Ord k => Map k α -> Map k β -> Map k α
+ Data.Map.Strict.Unicode: (∩) :: Ord k => Map k α -> Map k β -> Map k α
+ Data.Map.Strict.Unicode: (∪) :: Ord k => Map k α -> Map k α -> Map k α
Files
- Data/IntMap/Lazy/Unicode.hs +134/−0
- Data/IntMap/Strict/Unicode.hs +134/−0
- Data/IntMap/Unicode.hs +4/−124
- Data/IntSet/Unicode.hs +1/−1
- Data/Map/Lazy/Unicode.hs +133/−0
- Data/Map/Strict/Unicode.hs +133/−0
- Data/Map/Unicode.hs +4/−123
- Data/Sequence/Unicode.hs +1/−1
- Data/Set/Unicode.hs +1/−1
- LICENSE +1/−1
- containers-unicode-symbols.cabal +8/−3
+ Data/IntMap/Lazy/Unicode.hs view
@@ -0,0 +1,134 @@+{-# LANGUAGE NoImplicitPrelude, UnicodeSyntax #-}++{-|+Module : Data.IntMap.Lazy.Unicode+Copyright : 2009–2012 Roel van Dijk+License : BSD3 (see the file LICENSE)+Maintainer : Roel van Dijk <vandijk.roel@gmail.com>+-}++module Data.IntMap.Lazy.Unicode+ ( (∈), (∋), (∉), (∌)+ , (∅)+ , (∪), (∖), (∆), (∩)+ ) where+++-------------------------------------------------------------------------------+-- Imports+-------------------------------------------------------------------------------++-- from base:+import Data.Bool ( Bool )+import Data.Int ( Int )+import Data.Function ( flip )++-- from containers:+import Data.IntMap.Lazy ( IntMap+ , member, notMember+ , empty+ , union, difference, intersection+ )+++-------------------------------------------------------------------------------+-- Fixities+-------------------------------------------------------------------------------++infix 4 ∈+infix 4 ∋+infix 4 ∉+infix 4 ∌+infixl 6 ∪+infixr 6 ∩+infixl 9 ∖+infixl 9 ∆+++-------------------------------------------------------------------------------+-- Symbols+-------------------------------------------------------------------------------++{-|+(∈) = 'member'++U+2208, ELEMENT OF+-}+(∈) ∷ Int → IntMap α → Bool+(∈) = member+{-# INLINE (∈) #-}++{-|+(∋) = 'flip' (∈)++U+220B, CONTAINS AS MEMBER+-}+(∋) ∷ IntMap α → Int → Bool+(∋) = flip (∈)+{-# INLINE (∋) #-}++{-|+(∉) = 'notMember'++U+2209, NOT AN ELEMENT OF+-}+(∉) ∷ Int → IntMap α → Bool+(∉) = notMember+{-# INLINE (∉) #-}++{-|+(∌) = 'flip' (∉)++U+220C, DOES NOT CONTAIN AS MEMBER+-}+(∌) ∷ IntMap α → Int → Bool+(∌) = flip (∉)+{-# INLINE (∌) #-}++{-|+(∅) = 'empty'++U+2205, EMPTY SET+-}+(∅) ∷ IntMap α+(∅) = empty+{-# INLINE (∅) #-}++{-|+(∪) = 'union'++U+222A, UNION+-}+(∪) ∷ IntMap α → IntMap α → IntMap α+(∪) = union+{-# INLINE (∪) #-}++{-|+(∖) = 'difference'++U+2216, SET MINUS+-}+(∖) ∷ IntMap α → IntMap β → IntMap α+(∖) = difference+{-# INLINE (∖) #-}++{-|+Symmetric difference++a ∆ b = (a ∖ b) ∪ (b ∖ a)++U+2206, INCREMENT+-}+(∆) ∷ IntMap α → IntMap α → IntMap α+a ∆ b = (a ∖ b) ∪ (b ∖ a)+{-# INLINE (∆) #-}++{-|+(∩) = 'intersection'++U+2229, INTERSECTION+-}+(∩) ∷ IntMap α → IntMap β → IntMap α+(∩) = intersection+{-# INLINE (∩) #-}+
+ Data/IntMap/Strict/Unicode.hs view
@@ -0,0 +1,134 @@+{-# LANGUAGE NoImplicitPrelude, UnicodeSyntax #-}++{-|+Module : Data.IntMap.Lazy.Unicode+Copyright : 2009–2012 Roel van Dijk+License : BSD3 (see the file LICENSE)+Maintainer : Roel van Dijk <vandijk.roel@gmail.com>+-}++module Data.IntMap.Strict.Unicode+ ( (∈), (∋), (∉), (∌)+ , (∅)+ , (∪), (∖), (∆), (∩)+ ) where+++-------------------------------------------------------------------------------+-- Imports+-------------------------------------------------------------------------------++-- from base:+import Data.Bool ( Bool )+import Data.Int ( Int )+import Data.Function ( flip )++-- from containers:+import Data.IntMap.Strict ( IntMap+ , member, notMember+ , empty+ , union, difference, intersection+ )+++-------------------------------------------------------------------------------+-- Fixities+-------------------------------------------------------------------------------++infix 4 ∈+infix 4 ∋+infix 4 ∉+infix 4 ∌+infixl 6 ∪+infixr 6 ∩+infixl 9 ∖+infixl 9 ∆+++-------------------------------------------------------------------------------+-- Symbols+-------------------------------------------------------------------------------++{-|+(∈) = 'member'++U+2208, ELEMENT OF+-}+(∈) ∷ Int → IntMap α → Bool+(∈) = member+{-# INLINE (∈) #-}++{-|+(∋) = 'flip' (∈)++U+220B, CONTAINS AS MEMBER+-}+(∋) ∷ IntMap α → Int → Bool+(∋) = flip (∈)+{-# INLINE (∋) #-}++{-|+(∉) = 'notMember'++U+2209, NOT AN ELEMENT OF+-}+(∉) ∷ Int → IntMap α → Bool+(∉) = notMember+{-# INLINE (∉) #-}++{-|+(∌) = 'flip' (∉)++U+220C, DOES NOT CONTAIN AS MEMBER+-}+(∌) ∷ IntMap α → Int → Bool+(∌) = flip (∉)+{-# INLINE (∌) #-}++{-|+(∅) = 'empty'++U+2205, EMPTY SET+-}+(∅) ∷ IntMap α+(∅) = empty+{-# INLINE (∅) #-}++{-|+(∪) = 'union'++U+222A, UNION+-}+(∪) ∷ IntMap α → IntMap α → IntMap α+(∪) = union+{-# INLINE (∪) #-}++{-|+(∖) = 'difference'++U+2216, SET MINUS+-}+(∖) ∷ IntMap α → IntMap β → IntMap α+(∖) = difference+{-# INLINE (∖) #-}++{-|+Symmetric difference++a ∆ b = (a ∖ b) ∪ (b ∖ a)++U+2206, INCREMENT+-}+(∆) ∷ IntMap α → IntMap α → IntMap α+a ∆ b = (a ∖ b) ∪ (b ∖ a)+{-# INLINE (∆) #-}++{-|+(∩) = 'intersection'++U+2229, INTERSECTION+-}+(∩) ∷ IntMap α → IntMap β → IntMap α+(∩) = intersection+{-# INLINE (∩) #-}+
Data/IntMap/Unicode.hs view
@@ -1,134 +1,14 @@-{-# LANGUAGE NoImplicitPrelude, UnicodeSyntax #-}+{-# LANGUAGE NoImplicitPrelude #-} {-| Module : Data.IntMap.Unicode-Copyright : 2009–2011 Roel van Dijk+Copyright : 2009–2012 Roel van Dijk License : BSD3 (see the file LICENSE) Maintainer : Roel van Dijk <vandijk.roel@gmail.com> -} module Data.IntMap.Unicode- ( (∈), (∋), (∉), (∌)- , (∅)- , (∪), (∖), (∆), (∩)+ ( module Data.IntMap.Lazy.Unicode ) where ------------------------------------------------------------------------------------ Imports------------------------------------------------------------------------------------ from base:-import Data.Bool ( Bool )-import Data.Int ( Int )-import Data.Function ( flip )---- from containers:-import Data.IntMap ( IntMap- , member, notMember- , empty- , union, difference, intersection- )------------------------------------------------------------------------------------- Fixities----------------------------------------------------------------------------------infix 4 ∈-infix 4 ∋-infix 4 ∉-infix 4 ∌-infixl 6 ∪-infixr 6 ∩-infixl 9 ∖-infixl 9 ∆------------------------------------------------------------------------------------- Symbols----------------------------------------------------------------------------------{-|-(∈) = 'member'--U+2208, ELEMENT OF--}-(∈) ∷ Int → IntMap α → Bool-(∈) = member-{-# INLINE (∈) #-}--{-|-(∋) = 'flip' (∈)--U+220B, CONTAINS AS MEMBER--}-(∋) ∷ IntMap α → Int → Bool-(∋) = flip (∈)-{-# INLINE (∋) #-}--{-|-(∉) = 'notMember'--U+2209, NOT AN ELEMENT OF--}-(∉) ∷ Int → IntMap α → Bool-(∉) = notMember-{-# INLINE (∉) #-}--{-|-(∌) = 'flip' (∉)--U+220C, DOES NOT CONTAIN AS MEMBER--}-(∌) ∷ IntMap α → Int → Bool-(∌) = flip (∉)-{-# INLINE (∌) #-}--{-|-(∅) = 'empty'--U+2205, EMPTY SET--}-(∅) ∷ IntMap α-(∅) = empty-{-# INLINE (∅) #-}--{-|-(∪) = 'union'--U+222A, UNION--}-(∪) ∷ IntMap α → IntMap α → IntMap α-(∪) = union-{-# INLINE (∪) #-}--{-|-(∖) = 'difference'--U+2216, SET MINUS--}-(∖) ∷ IntMap α → IntMap β → IntMap α-(∖) = difference-{-# INLINE (∖) #-}--{-|-Symmetric difference--a ∆ b = (a ∖ b) ∪ (b ∖ a)--U+2206, INCREMENT--}-(∆) ∷ IntMap α → IntMap α → IntMap α-a ∆ b = (a ∖ b) ∪ (b ∖ a)-{-# INLINE (∆) #-}--{-|-(∩) = 'intersection'--U+2229, INTERSECTION--}-(∩) ∷ IntMap α → IntMap β → IntMap α-(∩) = intersection-{-# INLINE (∩) #-}-+import Data.IntMap.Lazy.Unicode
Data/IntSet/Unicode.hs view
@@ -2,7 +2,7 @@ {-| Module : Data.IntSet.Unicode-Copyright : 2009–2011 Roel van Dijk+Copyright : 2009–2012 Roel van Dijk License : BSD3 (see the file LICENSE) Maintainer : Roel van Dijk <vandijk.roel@gmail.com> -}
+ Data/Map/Lazy/Unicode.hs view
@@ -0,0 +1,133 @@+{-# LANGUAGE NoImplicitPrelude, UnicodeSyntax #-}++{-|+Module : Data.Map.Lazy.Unicode+Copyright : 2009–2012 Roel van Dijk+License : BSD3 (see the file LICENSE)+Maintainer : Roel van Dijk <vandijk.roel@gmail.com>+-}++module Data.Map.Lazy.Unicode+ ( (∈), (∋), (∉), (∌)+ , (∅)+ , (∪), (∖), (∆), (∩)+ ) where+++-------------------------------------------------------------------------------+-- Imports+-------------------------------------------------------------------------------++-- from base:+import Data.Bool ( Bool )+import Data.Ord ( Ord )+import Data.Function ( flip )++-- from containers:+import Data.Map.Lazy ( Map+ , member, notMember+ , empty+ , union, difference, intersection+ )+++-------------------------------------------------------------------------------+-- Fixities+-------------------------------------------------------------------------------++infix 4 ∈+infix 4 ∋+infix 4 ∉+infix 4 ∌+infixl 6 ∪+infixr 6 ∩+infixl 9 ∖+infixl 9 ∆+++-------------------------------------------------------------------------------+-- Symbols+-------------------------------------------------------------------------------++{-|+(∈) = 'member'++U+2208, ELEMENT OF+-}+(∈) ∷ Ord k ⇒ k → Map k α → Bool+(∈) = member+{-# INLINE (∈) #-}++{-|+(∋) = 'flip' (∈)++U+220B, CONTAINS AS MEMBER+-}+(∋) ∷ Ord k ⇒ Map k α → k → Bool+(∋) = flip (∈)+{-# INLINE (∋) #-}++{-|+(∉) = 'notMember'++U+2209, NOT AN ELEMENT OF+-}+(∉) ∷ Ord k ⇒ k → Map k α → Bool+(∉) = notMember+{-# INLINE (∉) #-}++{-|+(∌) = 'flip' (∉)++U+220C, DOES NOT CONTAIN AS MEMBER+-}+(∌) ∷ Ord k ⇒ Map k α → k → Bool+(∌) = flip (∉)+{-# INLINE (∌) #-}++{-|+(∅) = 'empty'++U+2205, EMPTY SET+-}+(∅) ∷ Map k α+(∅) = empty+{-# INLINE (∅) #-}++{-|+(∪) = 'union'++U+222A, UNION+-}+(∪) ∷ Ord k ⇒ Map k α → Map k α → Map k α+(∪) = union+{-# INLINE (∪) #-}++{-|+(∖) = 'difference'++U+2216, SET MINUS+-}+(∖) ∷ Ord k ⇒ Map k α → Map k β → Map k α+(∖) = difference+{-# INLINE (∖) #-}++{-|+Symmetric difference++a ∆ b = (a ∖ b) ∪ (b ∖ a)++U+2206, INCREMENT+-}+(∆) ∷ Ord k ⇒ Map k α → Map k α → Map k α+a ∆ b = (a ∖ b) ∪ (b ∖ a)+{-# INLINE (∆) #-}++{-|+(∩) = 'intersection'++U+2229, INTERSECTION+-}+(∩) ∷ Ord k ⇒ Map k α → Map k β → Map k α+(∩) = intersection+{-# INLINE (∩) #-}
+ Data/Map/Strict/Unicode.hs view
@@ -0,0 +1,133 @@+{-# LANGUAGE NoImplicitPrelude, UnicodeSyntax #-}++{-|+Module : Data.Map.Strict.Unicode+Copyright : 2009–2012 Roel van Dijk+License : BSD3 (see the file LICENSE)+Maintainer : Roel van Dijk <vandijk.roel@gmail.com>+-}++module Data.Map.Strict.Unicode+ ( (∈), (∋), (∉), (∌)+ , (∅)+ , (∪), (∖), (∆), (∩)+ ) where+++-------------------------------------------------------------------------------+-- Imports+-------------------------------------------------------------------------------++-- from base:+import Data.Bool ( Bool )+import Data.Ord ( Ord )+import Data.Function ( flip )++-- from containers:+import Data.Map.Strict ( Map+ , member, notMember+ , empty+ , union, difference, intersection+ )+++-------------------------------------------------------------------------------+-- Fixities+-------------------------------------------------------------------------------++infix 4 ∈+infix 4 ∋+infix 4 ∉+infix 4 ∌+infixl 6 ∪+infixr 6 ∩+infixl 9 ∖+infixl 9 ∆+++-------------------------------------------------------------------------------+-- Symbols+-------------------------------------------------------------------------------++{-|+(∈) = 'member'++U+2208, ELEMENT OF+-}+(∈) ∷ Ord k ⇒ k → Map k α → Bool+(∈) = member+{-# INLINE (∈) #-}++{-|+(∋) = 'flip' (∈)++U+220B, CONTAINS AS MEMBER+-}+(∋) ∷ Ord k ⇒ Map k α → k → Bool+(∋) = flip (∈)+{-# INLINE (∋) #-}++{-|+(∉) = 'notMember'++U+2209, NOT AN ELEMENT OF+-}+(∉) ∷ Ord k ⇒ k → Map k α → Bool+(∉) = notMember+{-# INLINE (∉) #-}++{-|+(∌) = 'flip' (∉)++U+220C, DOES NOT CONTAIN AS MEMBER+-}+(∌) ∷ Ord k ⇒ Map k α → k → Bool+(∌) = flip (∉)+{-# INLINE (∌) #-}++{-|+(∅) = 'empty'++U+2205, EMPTY SET+-}+(∅) ∷ Map k α+(∅) = empty+{-# INLINE (∅) #-}++{-|+(∪) = 'union'++U+222A, UNION+-}+(∪) ∷ Ord k ⇒ Map k α → Map k α → Map k α+(∪) = union+{-# INLINE (∪) #-}++{-|+(∖) = 'difference'++U+2216, SET MINUS+-}+(∖) ∷ Ord k ⇒ Map k α → Map k β → Map k α+(∖) = difference+{-# INLINE (∖) #-}++{-|+Symmetric difference++a ∆ b = (a ∖ b) ∪ (b ∖ a)++U+2206, INCREMENT+-}+(∆) ∷ Ord k ⇒ Map k α → Map k α → Map k α+a ∆ b = (a ∖ b) ∪ (b ∖ a)+{-# INLINE (∆) #-}++{-|+(∩) = 'intersection'++U+2229, INTERSECTION+-}+(∩) ∷ Ord k ⇒ Map k α → Map k β → Map k α+(∩) = intersection+{-# INLINE (∩) #-}
Data/Map/Unicode.hs view
@@ -1,133 +1,14 @@-{-# LANGUAGE NoImplicitPrelude, UnicodeSyntax #-}+{-# LANGUAGE NoImplicitPrelude #-} {-| Module : Data.Map.Unicode-Copyright : 2009–2011 Roel van Dijk+Copyright : 2009–2012 Roel van Dijk License : BSD3 (see the file LICENSE) Maintainer : Roel van Dijk <vandijk.roel@gmail.com> -} module Data.Map.Unicode- ( (∈), (∋), (∉), (∌)- , (∅)- , (∪), (∖), (∆), (∩)+ ( module Data.Map.Strict.Unicode ) where ------------------------------------------------------------------------------------ Imports------------------------------------------------------------------------------------ from base:-import Data.Bool ( Bool )-import Data.Ord ( Ord )-import Data.Function ( flip )---- from containers:-import Data.Map ( Map- , member, notMember- , empty- , union, difference, intersection- )------------------------------------------------------------------------------------- Fixities----------------------------------------------------------------------------------infix 4 ∈-infix 4 ∋-infix 4 ∉-infix 4 ∌-infixl 6 ∪-infixr 6 ∩-infixl 9 ∖-infixl 9 ∆------------------------------------------------------------------------------------- Symbols----------------------------------------------------------------------------------{-|-(∈) = 'member'--U+2208, ELEMENT OF--}-(∈) ∷ Ord k ⇒ k → Map k α → Bool-(∈) = member-{-# INLINE (∈) #-}--{-|-(∋) = 'flip' (∈)--U+220B, CONTAINS AS MEMBER--}-(∋) ∷ Ord k ⇒ Map k α → k → Bool-(∋) = flip (∈)-{-# INLINE (∋) #-}--{-|-(∉) = 'notMember'--U+2209, NOT AN ELEMENT OF--}-(∉) ∷ Ord k ⇒ k → Map k α → Bool-(∉) = notMember-{-# INLINE (∉) #-}--{-|-(∌) = 'flip' (∉)--U+220C, DOES NOT CONTAIN AS MEMBER--}-(∌) ∷ Ord k ⇒ Map k α → k → Bool-(∌) = flip (∉)-{-# INLINE (∌) #-}--{-|-(∅) = 'empty'--U+2205, EMPTY SET--}-(∅) ∷ Map k α-(∅) = empty-{-# INLINE (∅) #-}--{-|-(∪) = 'union'--U+222A, UNION--}-(∪) ∷ Ord k ⇒ Map k α → Map k α → Map k α-(∪) = union-{-# INLINE (∪) #-}--{-|-(∖) = 'difference'--U+2216, SET MINUS--}-(∖) ∷ Ord k ⇒ Map k α → Map k β → Map k α-(∖) = difference-{-# INLINE (∖) #-}--{-|-Symmetric difference--a ∆ b = (a ∖ b) ∪ (b ∖ a)--U+2206, INCREMENT--}-(∆) ∷ Ord k ⇒ Map k α → Map k α → Map k α-a ∆ b = (a ∖ b) ∪ (b ∖ a)-{-# INLINE (∆) #-}--{-|-(∩) = 'intersection'--U+2229, INTERSECTION--}-(∩) ∷ Ord k ⇒ Map k α → Map k β → Map k α-(∩) = intersection-{-# INLINE (∩) #-}+import Data.Map.Strict.Unicode
Data/Sequence/Unicode.hs view
@@ -2,7 +2,7 @@ {-| Module : Data.Sequence.Unicode-Copyright : 2009–2011 Roel van Dijk+Copyright : 2009–2012 Roel van Dijk License : BSD3 (see the file LICENSE) Maintainer : Roel van Dijk <vandijk.roel@gmail.com> -}
Data/Set/Unicode.hs view
@@ -2,7 +2,7 @@ {-| Module : Data.Set.Unicode-Copyright : 2009–2011 Roel van Dijk+Copyright : 2009–2012 Roel van Dijk License : BSD3 (see the file LICENSE) Maintainer : Roel van Dijk <vandijk.roel@gmail.com> -}
LICENSE view
@@ -1,4 +1,4 @@-Copyright 2009–2011 Roel van Dijk+Copyright 2009–2012 Roel van Dijk All rights reserved.
containers-unicode-symbols.cabal view
@@ -1,11 +1,11 @@ name: containers-unicode-symbols-version: 0.3.0.7+version: 0.3.1 cabal-version: >=1.6 build-type: Simple stability: provisional author: Roel van Dijk <vandijk.roel@gmail.com> maintainer: Roel van Dijk <vandijk.roel@gmail.com>-copyright: 2009—2011 Roel van Dijk <vandijk.roel@gmail.com>+copyright: 2009—2012 Roel van Dijk <vandijk.roel@gmail.com> license: BSD3 license-file: LICENSE category:@@ -28,11 +28,16 @@ library exposed-modules: Data.IntMap.Unicode+ , Data.IntMap.Lazy.Unicode+ , Data.IntMap.Strict.Unicode , Data.IntSet.Unicode , Data.Map.Unicode+ , Data.Map.Lazy.Unicode+ , Data.Map.Strict.Unicode , Data.Sequence.Unicode , Data.Set.Unicode build-depends: base >= 3.0.3.1 && < 5 , base-unicode-symbols >= 0.1.1 && < 0.3- , containers < 0.5+ , containers >= 0.5 && < 0.6+ ghc-options: -Wall