chainedhashtable.cs

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

namespace Opus6
{
    using System;
    using System.Collections;

    [Copyright("Copyright (c) 2001 by Bruno R. Preiss, P.Eng."), Version("$Id: ChainedHashTable.cs,v 1.5 2001/10/28 19:50:09 brpreiss Exp $")]
    public class ChainedHashTable : AbstractHashTable
    {
        public ChainedHashTable(int length)
        {
            this.array = new LinkedList[length];
            for (int num1 = 0; num1 < length; num1++)
            {
                this.array[num1] = new LinkedList();
            }
        }

        public override void Accept(Visitor visitor)
        {
            for (int num1 = 0; num1 < this.Length; num1++)
            {
                for (LinkedList.Element element1 = this.array[num1].Head; element1 != null; element1 = element1.Next)
                {
                    visitor.Visit(element1.Datum);
                    if (visitor.IsDone)
                    {
                        return;
                    }
                }
            }
        }

        public override int CompareTo(object arg)
        {
            throw new MethodNotImplementedException();
        }

        public override ComparableObject Find(ComparableObject obj)
        {
            for (LinkedList.Element element1 = this.array[base.H(obj)].Head; element1 != null; element1 = element1.Next)
            {
                ComparableObject obj1 = (ComparableObject) element1.Datum;
                if (obj == obj1)
                {
                    return obj1;
                }
            }
            return null;
        }

        public override IEnumerator GetEnumerator()
        {
            return new Opus6.ChainedHashTable.Enumerator(this);
        }

        public override void Insert(ComparableObject obj)
        {
            this.array[base.H(obj)].Append(obj);
            base.count++;
        }

        public override bool IsMember(ComparableObject obj)
        {
            for (LinkedList.Element element1 = this.array[base.H(obj)].Head; element1 != null; element1 = element1.Next)
            {
                ComparableObject obj1 = (ComparableObject) element1.Datum;
                if (obj == obj1)
                {
                    return true;
                }
            }
            return false;
        }

        public static void Main()
        {
            Opus6.Console.WriteLine("ChainedHashTable Test");
            HashTable table1 = new ChainedHashTable(0x39);
            AbstractHashTable.TestHashTable(table1);
        }

        public override void Purge()
        {
            for (int num1 = 0; num1 < this.array.Length; num1++)
            {
                this.array[num1].Purge();
            }
            base.count = 0;
        }

        public override void Withdraw(ComparableObject obj)
        {
            this.array[base.H(obj)].Extract(obj);
            base.count--;
        }


        public override int Length
        {
            get
            {
                return this.array.Length;
            }
        }


        protected LinkedList[] array;


        private class Enumerator : IEnumerator
        {
            internal Enumerator(ChainedHashTable hashtable)
            {
                this.element = null;
                this.position = -1;
                this.hashtable = hashtable;
            }

            public bool MoveNext()
            {
                if (this.element != null)
                {
                    this.element = this.element.Next;
                }
                if (this.element == null)
                {
                    this.position++;
                    while (this.position < this.hashtable.Length)
                    {
                        this.element = this.hashtable.array[this.position].Head;
                        if (this.element != null)
                        {
                            break;
                        }
                        this.position++;
                    }
                    if (this.position == this.hashtable.Length)
                    {
                        this.position = -1;
                    }
                }
                return (this.element != null);
            }

            public void Reset()
            {
                this.element = null;
                this.position = -1;
            }


            public object Current
            {
                get
                {
                    if (this.element == null)
                    {
                        throw new InvalidOperationException();
                    }
                    return this.element.Datum;
                }
            }


            private LinkedList.Element element;
            private ChainedHashTable hashtable;
            private int position;
        }
    }
}