Issue 30 in crisscross: red-black tree bug

[codesite...@google.com]

Issue 30: red-black tree bug
http://code.google.com/p/crisscross/issues/detail?id=30

New issue report by icestudent:
The following code raises an access violation on erasing items.

What steps will reproduce the problem?
RedBlackTree<int,int> *rbtree = new RedBlackTree<int,int>();

int rvals[25] = {937, 615, 354, 214, 776, 752, 121, 55, 945, 961, 488,
891, 841, 190, 398, 612, 348, 531, 714, 476, 697, 869, 67, 703, 313};
for (int i = 0; i < 25; i++) {
int a = rvals[i];
rbtree->insert(a,a);
}

for(int i = 0; i < 25; i++){
rbtree->erase(rvals[i]);
}

What version of the product are you using? On what operating system?
I tested it on the last version (0.7.0) on Windows.

Issue attributes:
Status: New
Owner: ----
Labels: Type-Defect Priority-Medium

--
You received this message because you are listed in the owner
or CC fields of this issue, or because you starred this issue.
You may adjust your issue notification preferences at:
http://code.google.com/hosting/settings

[codesite...@google.com]

Issue 30: red-black tree bug
http://code.google.com/p/crisscross/issues/detail?id=30

Comment #1 by steven.noonan:
The fix is in SVN revision 750. It'll definitely be in the next release.

Thanks for your bug report. I appreciate any stress-testing people can provide.

Issue attribute updates:
Status: Fixed