module Misc
where
+import Data.List (intersect)
+
-- | The standard factorial function. See
-- <http://www.willamette.edu/~fruehr/haskell/evolution.html> for
| z <- [0..zsize]]
where
zsize = (length m) - 1
- ysize = (length $ head m)- 1
- xsize = (length $ head $ head m) - 1
+ ysize = length (head m) - 1
+ xsize = length (head $ head m) - 1
-- | Takes a list, and returns True if its elements are pairwise
-- equal. Returns False otherwise.
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 == []