BlessTests.Util.RedBlackTreeTests.RBSearchTest C# (CSharp) Method

	public void RBSearchTest()
	{
		RedBlackTree<int, string> rb = new RedBlackTree<int, string>();
		
		for (int i = 0; i < 10000; i += 2) {
			rb.Insert(i, i.ToString());
		}
		
		for (int i = 0; i < 10000; i++) {
			IList<string> result = rb.Search(i);
			if ( i % 2 == 0)
				Assert.AreEqual(i.ToString(), result[0], i.ToString());
			else
				Assert.AreEqual(0, result.Count, i.ToString());
		}
		

	}