C# (CSharp) DataStructre LinkedList1 Examples

Example #1

        public void Remove(Key key)
        {
            LinkedList1 <Key> list = hashtable[Hash(key)];

            if (list.Contains(key))
            {
                list.Remove(key);
                N--;
            }
        }

Example #2

 public HashST1(int M)
 {
     this.M    = M;
     N         = 0;
     hashtable = new LinkedList1 <Key> [M];
     for (int i = 0; i < M; i++)
     {
         hashtable[i] = new LinkedList1 <Key>();
     }
 }

Example #3

        public void Add(Key key)
        {
            LinkedList1 <Key> list = hashtable[Hash(key)];

            if (list.Contains(key))
            {
                return;
            }
            else
            {
                list.AddFirst(key);
                N++;
            }
        }

Example #4

File: LinkedList1Stack.cs Project: promiselife/Collection

 public LinkedList1Stack()
 {
     list = new LinkedList1 <E>();
 }

Example #5

        public bool Contains(Key key)
        {
            LinkedList1 <Key> list = hashtable[Hash(key)];

            return(list.Contains(key));
        }

Example #6

File: LinkedList1Queue.cs Project: promiselife/Collection

 public LinkedList1Queue()
 {
     list = new LinkedList1 <E>();
 }

Example #7

 public LinkedList1Set()
 {
     list = new LinkedList1 <E>();
 }