diff options
| author | Mart Lubbers | 2015-03-03 12:09:15 +0100 |
|---|---|---|
| committer | Mart Lubbers | 2015-03-03 12:09:15 +0100 |
| commit | 61948c672d3a98027383e4bcc6b95d2db492f974 (patch) | |
| tree | 28d9c156ed48dc4d730786d603f76bcaee335ba8 /week4/mart/StdSet.icl | |
| parent | Ik begrijp deze opgave niet echt... (diff) | |
StdSet werkend
Diffstat (limited to 'week4/mart/StdSet.icl')
| -rw-r--r-- | week4/mart/StdSet.icl | 56 |
1 files changed, 56 insertions, 0 deletions
diff --git a/week4/mart/StdSet.icl b/week4/mart/StdSet.icl new file mode 100644 index 0000000..a14e6ba --- /dev/null +++ b/week4/mart/StdSet.icl @@ -0,0 +1,56 @@ +implementation module StdSet
+
+import StdEnv
+import StdClass
+
+:: Set a = Set [a]
+
+toSet :: [a] -> Set a | Eq a
+toSet s = Set (removeDup s)
+
+fromSet :: (Set a) -> [a]
+fromSet (Set s) = s
+
+isEmptySet :: (Set a) -> Bool
+isEmptySet s = isEmpty (fromSet s)
+
+isDisjoint :: (Set a) (Set a) -> Bool | Eq a
+isDisjoint s1 s2 = nrOfElements (intersection s1 s2) == 0
+
+isSubset :: (Set a) (Set a) -> Bool | Eq a
+isSubset s1 s2 = nrOfElements s1 == nrOfElements (intersection s1 s2)
+
+isStrictSubset :: (Set a) (Set a) -> Bool | Eq a
+isStrictSubset s1 s2 = isSubset s1 s2 && nrOfElements s1 < nrOfElements s2
+
+memberOfSet :: a (Set a) -> Bool | Eq a
+memberOfSet a (Set []) = False
+memberOfSet a (Set [x:xs]) = a == x || memberOfSet a (Set xs)
+
+union :: (Set a) (Set a) -> Set a | Eq a
+union (Set s1) (Set s2) = toSet (s1 ++ s2)
+
+intersection :: (Set a) (Set a) -> Set a | Eq a
+intersection (Set s1) s2 = Set [e \\ e <- s1 | memberOfSet e s2]
+
+nrOfElements :: (Set a) -> Int
+nrOfElements s = length (fromSet s)
+
+without :: (Set a) (Set a) -> Set a | Eq a
+without (Set s1) s2 = Set [e \\ e <- s1 | not (memberOfSet e s2)]
+
+product :: (Set a) (Set b) -> Set (a,b)
+product (Set s1) (Set s2) = Set [(e1, e2) \\ e1 <- s1, e2 <- s2]
+
+instance zero (Set a)
+where zero = Set []
+
+instance == (Set a) | Eq a
+where (==) s1 s2 = isSubset s1 s2 && isSubset s2 s1
+
+powerSet :: (Set a) -> Set (Set a)
+powerSet (Set a) = Set [(Set x) \\ x <- powerSet2 a]
+where
+ powerSet2 :: [a] -> [[a]]
+ powerSet2 [] = [[]]
+ powerSet2 [e:xs] = (powerSet2 xs) ++ [[e:x] \\ x <- powerSet2 xs]
|