public void Get_Index_Of_Entry()
        {
            var bsc = new BinarySearchSt <string, int>();

            bsc.Add("b", 1);
            bsc.Add("c", 2);
            bsc.Add("a", 3);
            bsc.Add("f", 4);

            Assert.That(bsc.Rank("a"), Is.EqualTo(0));
            Assert.That(bsc.Rank("b"), Is.EqualTo(1));
            Assert.That(bsc.Rank("c"), Is.EqualTo(2));
            Assert.That(bsc.Rank("f"), Is.EqualTo(3));
        }
        public void Range()
        {
            var bsc = new BinarySearchSt <string, int>();

            bsc.Add("b", 1);
            bsc.Add("c", 2);
            bsc.Add("a", 3);
            bsc.Add("f", 4);

            Assert.That(
                bsc.Range("b", "g"),
                Is.EquivalentTo(new[] { "b", "c", "f" })
                );
        }
        public void Add_Multiple_Entries()
        {
            const int NrOfItems = 5;
            var       bsc       = new BinarySearchSt <int, string>();

            for (int i = 0; i < NrOfItems; i++)
            {
                bsc.Add(i, i.ToString());
            }

            Assert.That(bsc.Count, Is.EqualTo(NrOfItems));
        }
Exemplo n.º 4
0
        public static void BinarySearchStDemo()
        {
            BinarySearchSt <char, int> bsst = new BinarySearchSt <char, int>(5);

            //char ch = 'b';
            //int num = 1;

            //for (int i = 0; i < bsst.Capacity; i++)
            //{
            //    Console.WriteLine(ch + " " + num);
            //    bsst.Add(ch++, num++);

            //}

            bsst.Add('c', 2);
            bsst.Add('f', 5);
            bsst.Add('b', 1);
            bsst.Add('d', 3);
            bsst.Add('e', 4);

            Console.WriteLine(bsst.Count);
            Console.WriteLine("Min, should be b: " + bsst.Min());
            Console.WriteLine("Max, should be f: " + bsst.Max());

            bsst.RemoveMin();
            bsst.RemoveMax();

            Console.WriteLine("Min, should be c: " + bsst.Min());
            Console.WriteLine("Max, should be e: " + bsst.Max());

            bsst.Add('b', 1);
            bsst.Add('f', 5);

            Console.WriteLine("Select index 2, should be d: " + bsst.Select(2));
            Console.WriteLine("Select index 4, should be f: " + bsst.Select(4));

            Console.WriteLine("Ceiling b, should be b: " + bsst.Ceiling('b'));
            Console.WriteLine("Ceiling a, should be b: " + bsst.Ceiling('a'));
            Console.WriteLine("Ceiling g, should be null: " + bsst.Ceiling('g'));
            Console.WriteLine("Ceiling d, should be d: " + bsst.Ceiling('d'));

            Console.WriteLine("Floor e, should be e: " + bsst.Floor('e'));
            Console.WriteLine("Floor a, should be null: " + bsst.Floor('a'));
            Console.WriteLine("Floor g, should be f: " + bsst.Floor('g'));

            Console.WriteLine("Range b & f: ");
            var range = bsst.Range('b', 'f');

            //Console.WriteLine("Range a & f: ");
            //array = bsst.Range('a', 'f');

            //Console.WriteLine("Range e & h: ");
            //array = bsst.Range('e', 'h');

            //Console.WriteLine("Range b & c: ");
            //array = bsst.Range('b', 'c');

            //Console.WriteLine("Range g & h: ");
            //array = bsst.Range('g', 'h');

            Console.WriteLine("Range a & g: ");
            range = bsst.Range('a', 'g');

            foreach (var item in range)
            {
                Console.Write(item + " ");
            }
        }