demo9.cs

Data Structures and Algorithms with Object-Oriented Design Patterns in C# 这本书的范例代码dll自己反编译的source

namespace Opus6
{
    using System;
    using System.Drawing;
    using System.Windows.Forms;

    [Version("$Id: Demo9.cs,v 1.4 2001/11/04 20:49:34 brpreiss Exp $"), Copyright("Copyright (c) 2001 by Bruno R. Preiss, P.Eng.")]
    public class Demo9 : TTY
    {
        public Demo9()
        {
            this.args = new string[] { "2048", "123", "7" };
        }

        public Demo9(string[] args) : this()
        {
            this.args = args;
        }

        public static void Main(params string[] args)
        {
            Form form1 = new Form();
            form1.Size = new Size(490, 380);
            form1.Controls.Add(new Demo9(args));
            Application.Run(form1);
        }

        public override void Run()
        {
            Demo9.Test(this.args);
        }

        public static void Test(params string[] args)
        {
            if (args.Length != 3)
            {
                Opus6.Console.WriteLine("usage: Demo9 size seed mask");
            }
            else
            {
                int num1 = Convert.ToInt32(args[0]);
                int num2 = Convert.ToInt32(args[1]);
                int num3 = Convert.ToInt32(args[2]);
                if ((num3 & 4) != 0)
                {
                    AbstractSorter.TestSorter(new StraightInsertionSorter(), num1, num2);
                    AbstractSorter.TestSorter(new BinaryInsertionSorter(), num1, num2);
                    AbstractSorter.TestSorter(new BubbleSorter(), num1, num2);
                    AbstractSorter.TestSorter(new StraightSelectionSorter(), num1, num2);
                }
                if ((num3 & 2) != 0)
                {
                    AbstractSorter.TestSorter(new MedianOfThreeQuickSorter(), num1, num2);
                    AbstractSorter.TestSorter(new HeapSorter(), num1, num2);
                    AbstractSorter.TestSorter(new TwoWayMergeSorter(), num1, num2);
                }
                if ((num3 & 1) != 0)
                {
                    AbstractSorter.TestSorter(new BucketSorter(0x400), num1, num2, 0x400);
                    AbstractSorter.TestSorter(new RadixSorter(), num1, num2);
                }
            }
        }


        private string[] args;
    }
}