C# (CSharp) Algorithms.Chapter3_Search LinearProbingHashST Examples

Example #1

        void Resize(int size)
        {
            LinearProbingHashST <TKey, TValue> table = new LinearProbingHashST <TKey, TValue>(size);

            for (int i = 0; i < tableSize; i++)
            {
                if (Keys[i] != null)
                {
                    table.Put(Keys[i], Values[i]);
                }
            }

            Keys           = table.Keys;
            Values         = table.Values;
            this.tableSize = size;
        }

Example #2

File: SparseVector.cs Project: NanaseRuri/Algorithms

 public SparseVector()
 {
     st = new LinearProbingHashST <int, double>();
 }