tasks a-s

Task/Set/Haskell/set-1.hs

@@ -0,0 +1,35 @@
+Prelude> import Data.Set
+Prelude Data.Set> empty :: Set Integer -- Empty set
+fromList []
+Prelude Data.Set> let s1 = fromList [1,2,3,4,3] -- Convert list into set
+Prelude Data.Set> s1
+fromList [1,2,3,4]
+Prelude Data.Set> let s2 = fromList [3,4,5,6]
+Prelude Data.Set> union s1 s2 -- Union
+fromList [1,2,3,4,5,6]
+Prelude Data.Set> intersection s1 s2 -- Intersection
+fromList [3,4]
+Prelude Data.Set> s1 \\ s2 -- Difference
+fromList [1,2]
+Prelude Data.Set> s1 `isSubsetOf` s1 -- Subset
+True
+Prelude Data.Set> fromList [3,1] `isSubsetOf` s1
+True
+Prelude Data.Set> s1 `isProperSubsetOf` s1 -- Proper subset
+False
+Prelude Data.Set> fromList [3,1] `isProperSubsetOf` s1
+True
+Prelude Data.Set> fromList [3,2,4,1] == s1 -- Equality
+True
+Prelude Data.Set> s1 == s2
+False
+Prelude Data.Set> 2 `member` s1 -- Membership
+True
+Prelude Data.Set> 10 `notMember` s1
+True
+Prelude Data.Set> size s1 -- Cardinality
+4
+Prelude Data.Set> insert 99 s1 -- Create a new set by inserting
+fromList [1,2,3,4,99]
+Prelude Data.Set> delete 3 s1 -- Create a new set by deleting
+fromList [1,2,4]

Task/Set/Haskell/set-2.hs

@@ -0,0 +1,15 @@
+Prelude> import Data.List
+Prelude Data.List> let s3 = nub [1,2,3,4,3] -- Remove duplicates from list
+Prelude Data.List> s3
+[1,2,3,4]
+Prelude Data.List> let s4 = [3,4,5,6]
+Prelude Data.List> union s3 s4 -- Union
+[1,2,3,4,5,6]
+Prelude Data.List> intersect s3 s4 -- Intersection
+[3,4]
+Prelude Data.List> s3 \\ s4 -- Difference
+[1,2]
+Prelude Data.List> 42 : s3 -- Return new list with element inserted at the beginning
+[42,1,2,3,4]
+Prelude Data.List> delete 3 s3 -- Return new list with first occurrence of element removed
+[1,2,4]