@@ -84,7 +84,7 @@ class HashSet[T](initialCapacity: Int = 8, capacityMultiple: Int = 2) extends Mu
8484 var idx = firstIndex(x)
8585 var e : T | Null = entryAt(idx)
8686 while e != null do
87- if isEqual(e.uncheckedNN , x) then return e
87+ if isEqual(e, x) then return e
8888 idx = nextIndex(idx)
8989 e = entryAt(idx)
9090 null
@@ -102,8 +102,7 @@ class HashSet[T](initialCapacity: Int = 8, capacityMultiple: Int = 2) extends Mu
102102 var idx = firstIndex(x)
103103 var e : T | Null = entryAt(idx)
104104 while e != null do
105- // TODO: remove uncheckedNN when explicit-nulls is enabled for regule compiling
106- if isEqual(e.uncheckedNN, x) then return e.uncheckedNN
105+ if isEqual(e, x) then return e
107106 idx = nextIndex(idx)
108107 e = entryAt(idx)
109108 addEntryAt(idx, x)
@@ -115,20 +114,20 @@ class HashSet[T](initialCapacity: Int = 8, capacityMultiple: Int = 2) extends Mu
115114 var idx = firstIndex(x)
116115 var e : T | Null = entryAt(idx)
117116 while e != null do
118- if isEqual(e.uncheckedNN , x) then
117+ if isEqual(e, x) then
119118 var hole = idx
120119 while
121120 idx = nextIndex(idx)
122121 e = entryAt(idx)
123122 e != null
124123 do
125- val eidx = index(hash(e.uncheckedNN ))
124+ val eidx = index(hash(e))
126125 if isDense
127126 || index(eidx - (hole + 1 )) > index(idx - (hole + 1 ))
128127 // entry `e` at `idx` can move unless `index(hash(e))` is in
129128 // the (ring-)interval [hole + 1 .. idx]
130129 then
131- setEntry(hole, e.uncheckedNN )
130+ setEntry(hole, e)
132131 hole = idx
133132 table(hole) = null
134133 used -= 1
@@ -156,7 +155,7 @@ class HashSet[T](initialCapacity: Int = 8, capacityMultiple: Int = 2) extends Mu
156155 var idx = 0
157156 while idx < oldTable.length do
158157 val e : T | Null = oldTable(idx).asInstanceOf [T | Null ]
159- if e != null then addOld(e.uncheckedNN )
158+ if e != null then addOld(e)
160159 idx += 1
161160
162161 protected def growTable (): Unit =
0 commit comments