Fix crush

Author: noti0na1

library/src/scala/collection/mutable/LinkedHashSet.scala

@@ -58,7 +58,7 @@ class LinkedHashSet[A]
    * - Every bucket is sorted in ascendant hash order
    * - The sum of the lengths of all buckets is equal to contentSize.
    */
-  private[this] var table = new Array[Entry](tableSizeFor(LinkedHashSet.defaultinitialSize))
+  private[this] var table = new Array[Entry | Null](tableSizeFor(LinkedHashSet.defaultinitialSize))
 
   private[this] var threshold: Int = newThreshold(table.length)
 
@@ -278,7 +278,7 @@ class LinkedHashSet[A]
               n = next
             }
             lastLow.next = null
-            if (old ne preLow.next) table(i) = preLow.next.nn
+            if (old ne preLow.next) table(i) = preLow.next
             if (preHigh.next ne null) {
               table(i + oldlen) = preHigh.next
               lastHigh.next = null

library/src/scala/collection/mutable/RedBlackTree.scala

@@ -56,10 +56,10 @@ private[collection] object RedBlackTree {
   object Node {
 
     @`inline` def apply[A, B](key: A, value: B, red: Boolean,
-                            left: Node[A, B], right: Node[A, B], parent: Node[A, B]): Node[A, B] =
+                            left: Node[A, B], right: Node[A, B], parent: Node[A, B] | Null): Node[A, B] =
       new Node(key, value, red, left, right, parent)
 
-    @`inline` def leaf[A, B](key: A, value: B, red: Boolean, parent: Node[A, B]): Node[A, B] =
+    @`inline` def leaf[A, B](key: A, value: B, red: Boolean, parent: Node[A, B] | Null): Node[A, B] =
       new Node(key, value, red, null, null, parent)
 
     def unapply[A, B](t: Node[A, B]) = Some((t.key, t.value, t.left, t.right, t.parent))
@@ -202,7 +202,7 @@ private[collection] object RedBlackTree {
 
     if (cmp == 0) y.nn.value = value
     else {
-      val z = Node.leaf(key, value, red = true, y.nn)
+      val z = Node.leaf(key, value, red = true, y)
 
       if (y eq null) tree.root = z
       else if (cmp < 0) y.left = z