Add the 'disjoint' function.

diff --git a/src/Misc.hs b/src/Misc.hs
index 9dcbac943b41c52f06b5140bfef8636eaafbb3e7..b9220cbbcefa7bf52ea9ec6c76b5f5d09467d4b6 100644 (file)
--- a/src/Misc.hs
+++ b/src/Misc.hs
@@ -3,6 +3,8 @@
 module Misc
 where
 
+import Data.List (intersect)
+
 
 -- | The standard factorial function. See
 --   <http://www.willamette.edu/~fruehr/haskell/evolution.html> for
@@ -57,3 +59,19 @@ all_equal xs =
     where
       first_element  = head xs
       other_elements = tail xs
+
+
+-- | Returns 'True' if the lists xs and ys are disjoint, 'False'
+--   otherwise.
+--
+--   Examples:
+--
+--   >>> disjoint [1,2,3] [4,5,6]
+--   True
+--
+--   >>>  disjoint [1,2,3] [3,4,5]
+--   False
+--
+disjoint :: (Eq a) => [a] -> [a] -> Bool
+disjoint xs ys =
+    intersect xs ys == []