HEL/FunProg-Scala
HEL/FunProg-Scala
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

added assignment 3 ex 3.1

Browse Source
This commit is contained in:
Louis Heredero 2025-03-04 17:47:54 +01:00
parent 3d87c132b9
commit 529e6967c4
Signed by: HEL
GPG Key ID: 8D83DE470F8544E7
1 changed files with 14 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
src/Assignment3/IntSet.sc
View File

@ -4,6 +4,7 @@ abstract class IntSet() {
def foreach(f: Int => Unit): Unit
def union(other: IntSet): IntSet
def intersect(other: IntSet): IntSet
def excl(x: Int): IntSet
}
class NonEmpty(elem: Int, left: IntSet, right: IntSet) extends IntSet() {
@ -37,6 +38,12 @@ class NonEmpty(elem: Int, left: IntSet, right: IntSet) extends IntSet() {
base.union(this.left.intersect(other))
.union(this.right.intersect(other))
}
def excl(x: Int): IntSet = {
if (x < elem) new NonEmpty(elem, this.left.excl(x), this.right)
else if (x > elem) new NonEmpty(elem, this.left, this.right.excl(x))
else this.left.union(this.right)
}
}
object Empty extends IntSet() {
@ -47,6 +54,7 @@ object Empty extends IntSet() {
def foreach(f: Int => Unit): Unit = {}
def union(other: IntSet): IntSet = other
def intersect(other: IntSet): IntSet = Empty
def excl(x: Int): IntSet = this
}
val t1 = Empty
@ -68,4 +76,9 @@ s.foreach(println)
val s2 = Empty.add(3).add(4).add(6).add(2)
s.union(s2)
s.intersect(s2)
s.intersect(s2)
s2.excl(0)
s2.excl(6)
s2.excl(2)
s2.excl(4)