From b9130af8447268e859278cbe696ba38ae864c9b8 Mon Sep 17 00:00:00 2001
From: Etienne Kneuss <ekneuss@gmail.com>
Date: Wed, 22 Apr 2015 17:16:57 +0200
Subject: [PATCH] Size should be a bigint, otherwise we have overflows in large
trees
---
testcases/verification/datastructures/RedBlackTree.scala | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/testcases/verification/datastructures/RedBlackTree.scala b/testcases/verification/datastructures/RedBlackTree.scala
index eb998becb..dec88b97b 100644
--- a/testcases/verification/datastructures/RedBlackTree.scala
+++ b/testcases/verification/datastructures/RedBlackTree.scala
@@ -14,7 +14,7 @@ object RedBlackTree {
case Node(_, l, v, r) => content(l) ++ Set(v) ++ content(r)
}
- def size(t : Tree) : Int = t match {
+ def size(t : Tree) : BigInt = t match {
case Empty() => 0
case Node(_, l, v, r) => size(l) + 1 + size(r)
}
--
GitLab