From 3d87c132b9e40841190e88355cb28daca8d51f78 Mon Sep 17 00:00:00 2001
From: LordBaryhobal <lordbaryhobal@gmail.com>
Date: Tue, 4 Mar 2025 16:36:32 +0100
Subject: [PATCH] added assignment 3 ex 2

---
 src/Assignment3/IntSet.sc | 20 ++++++++++++++++++++
 1 file changed, 20 insertions(+)

diff --git a/src/Assignment3/IntSet.sc b/src/Assignment3/IntSet.sc
index 93ed73c..5314980 100644
--- a/src/Assignment3/IntSet.sc
+++ b/src/Assignment3/IntSet.sc
@@ -2,6 +2,8 @@ abstract class IntSet() {
   def add(x: Int): IntSet
   def contains(x: Int): Boolean
   def foreach(f: Int => Unit): Unit
+  def union(other: IntSet): IntSet
+  def intersect(other: IntSet): IntSet
 }
 
 class NonEmpty(elem: Int, left: IntSet, right: IntSet) extends IntSet() {
@@ -23,6 +25,18 @@ class NonEmpty(elem: Int, left: IntSet, right: IntSet) extends IntSet() {
     f(elem)
     right.foreach(f)
   }
+
+  def union(other: IntSet): IntSet =
+    this.left.union(right)
+             .union(other)
+             .add(this.elem)
+
+  def intersect(other: IntSet): IntSet = {
+    val base = if (other.contains(this.elem)) Empty.add(this.elem)
+               else Empty
+    base.union(this.left.intersect(other))
+        .union(this.right.intersect(other))
+  }
 }
 
 object Empty extends IntSet() {
@@ -31,6 +45,8 @@ object Empty extends IntSet() {
   override def toString = "-"
 
   def foreach(f: Int => Unit): Unit = {}
+  def union(other: IntSet): IntSet = other
+  def intersect(other: IntSet): IntSet = Empty
 }
 
 val t1 = Empty
@@ -49,3 +65,7 @@ s.foreach(println)
 // 2, 3, 4, 7,
 // Because a BST is always sorted
 
+val s2 = Empty.add(3).add(4).add(6).add(2)
+
+s.union(s2)
+s.intersect(s2)
\ No newline at end of file