ListDictionary.cs source code in C# .NET

                        Code:
                         / DotNET / DotNET / 8.0 / untmp / whidbey / REDBITS / ndp / fx / src / CompMod / System / Collections / Specialized / ListDictionary.cs / 1 / ListDictionary.cs
                        
                        
                            //------------------------------------------------------------------------------ 
// 
//     Copyright (c) Microsoft Corporation.  All rights reserved.
// 
//----------------------------------------------------------------------------- 

namespace System.Collections.Specialized { 
 
    using System.Collections;
    using Microsoft.Win32; 

    /// 
    ///  
    ///    This is a simple implementation of IDictionary using a singly linked list. This 
    ///    will be smaller and faster than a Hashtable if the number of elements is 10 or less.
    ///    This should not be used if performance is important for large numbers of elements. 
    ///   
    /// 
    [Serializable] 
    public class ListDictionary: IDictionary {
        DictionaryNode head;
        int version;
        int count; 
        IComparer comparer;
        [NonSerialized] 
        private Object _syncRoot; 

        ///  
        ///    [To be supplied.]
        /// 
        public ListDictionary() {
        } 

        ///  
        ///    [To be supplied.] 
        /// 
        public ListDictionary(IComparer comparer) { 
            this.comparer = comparer;
        }

        ///  
        ///    [To be supplied.]
        ///  
        public object this[object key] { 
            get {
                if (key == null) { 
                    throw new ArgumentNullException("key", SR.GetString(SR.ArgumentNull_Key));
                }
                DictionaryNode node = head;
                if (comparer == null) { 
                    while (node != null) {
                        object oldKey = node.key; 
                        if ( oldKey!= null && oldKey.Equals(key)) { 
                            return node.value;
                        } 
                        node = node.next;
                    }
                }
                else { 
                    while (node != null) {
                        object oldKey = node.key; 
                        if (oldKey != null && comparer.Compare(oldKey, key) == 0) { 
                            return node.value;
                        } 
                        node = node.next;
                    }
                }
                return null; 
            }
            set { 
                if (key == null) { 
                    throw new ArgumentNullException("key", SR.GetString(SR.ArgumentNull_Key));
                } 
                version++;
                DictionaryNode last = null;
                DictionaryNode node;
                for (node = head; node != null; node = node.next) { 
                    object oldKey = node.key;
                    if ((comparer == null) ? oldKey.Equals(key) : comparer.Compare(oldKey, key) == 0) { 
                        break; 
                    }
                    last = node; 
                }
                if (node != null) {
                    // Found it
                    node.value = value; 
                    return;
                } 
                // Not found, so add a new one 
                DictionaryNode newNode = new DictionaryNode();
                newNode.key = key; 
                newNode.value = value;
                if (last != null) {
                    last.next = newNode;
                } 
                else {
                    head = newNode; 
                } 
                count++;
            } 
        }

        /// 
        ///    [To be supplied.] 
        /// 
        public int Count { 
            get { 
                return count;
            } 
        }

        /// 
        ///    [To be supplied.] 
        /// 
        public ICollection Keys { 
            get { 
                return new NodeKeyValueCollection(this, true);
            } 
        }

        /// 
        ///    [To be supplied.] 
        /// 
        public bool IsReadOnly { 
            get { 
                return false;
            } 
        }

        /// 
        ///    [To be supplied.] 
        /// 
        public bool IsFixedSize { 
            get { 
                return false;
            } 
        }

        /// 
        ///    [To be supplied.] 
        /// 
        public bool IsSynchronized { 
            get { 
                return false;
            } 
        }

        /// 
        ///    [To be supplied.] 
        /// 
        public object SyncRoot { 
            get { 
                if( _syncRoot == null) {
                    System.Threading.Interlocked.CompareExchange(ref _syncRoot, new Object(), null); 
                }
                return _syncRoot;
            }
        } 

        ///  
        ///    [To be supplied.] 
        /// 
        public ICollection Values { 
            get {
                return new NodeKeyValueCollection(this, false);
            }
        } 

        ///  
        ///    [To be supplied.] 
        /// 
        public void Add(object key, object value) { 
            if (key == null) {
                throw new ArgumentNullException("key", SR.GetString(SR.ArgumentNull_Key));
            }
            version++; 
            DictionaryNode last = null;
            DictionaryNode node; 
            for (node = head; node != null; node = node.next) { 
                object oldKey = node.key;
                if ((comparer == null) ? oldKey.Equals(key) : comparer.Compare(oldKey, key) == 0) { 
                    throw new ArgumentException(SR.GetString(SR.Argument_AddingDuplicate));
                }
                last = node;
            } 
            // Not found, so add a new one
            DictionaryNode newNode = new DictionaryNode(); 
            newNode.key = key; 
            newNode.value = value;
            if (last != null) { 
                last.next = newNode;
            }
            else {
                head = newNode; 
            }
            count++; 
        } 

        ///  
        ///    [To be supplied.]
        /// 
        public void Clear() {
            count = 0; 
            head = null;
            version++; 
        } 

        ///  
        ///    [To be supplied.]
        /// 
        public bool Contains(object key) {
            if (key == null) { 
                throw new ArgumentNullException("key", SR.GetString(SR.ArgumentNull_Key));
            } 
            for (DictionaryNode node = head; node != null; node = node.next) { 
                object oldKey = node.key;
                if ((comparer == null) ? oldKey.Equals(key) : comparer.Compare(oldKey, key) == 0) { 
                    return true;
                }
            }
            return false; 
        }
 
        ///  
        ///    [To be supplied.]
        ///  
        public void CopyTo(Array array, int index)  {
            if (array==null)
                throw new ArgumentNullException("array");
            if (index < 0) 
                throw new ArgumentOutOfRangeException("index", SR.GetString(SR.ArgumentOutOfRange_NeedNonNegNum));
 
            if (array.Length - index < count) 
                throw new ArgumentException(SR.GetString(SR.Arg_InsufficientSpace));
 
            for (DictionaryNode node = head; node != null; node = node.next) {
                array.SetValue(new DictionaryEntry(node.key, node.value), index);
                index++;
            } 
        }
 
        ///  
        ///    [To be supplied.]
        ///  
        public IDictionaryEnumerator GetEnumerator() {
            return new NodeEnumerator(this);
        }
 
        IEnumerator IEnumerable.GetEnumerator() {
            return new NodeEnumerator(this); 
        } 

        ///  
        ///    [To be supplied.]
        /// 
        public void Remove(object key) {
            if (key == null) { 
                throw new ArgumentNullException("key", SR.GetString(SR.ArgumentNull_Key));
            } 
            version++; 
            DictionaryNode last = null;
            DictionaryNode node; 
            for (node = head; node != null; node = node.next) {
                object oldKey = node.key;
                if ((comparer == null) ? oldKey.Equals(key) : comparer.Compare(oldKey, key) == 0) {
                    break; 
                }
                last = node; 
            } 
            if (node == null) {
                return; 
            }
            if (node == head) {
                head = node.next;
            } else { 
                last.next = node.next;
            } 
            count--; 
        }
 
        private class NodeEnumerator : IDictionaryEnumerator {
            ListDictionary list;
            DictionaryNode current;
            int version; 
            bool start;
 
 
            public NodeEnumerator(ListDictionary list) {
                this.list = list; 
                version = list.version;
                start = true;
                current = null;
            } 

            public object Current { 
                get { 
                    return Entry;
                } 
            }

            public DictionaryEntry Entry {
                get { 
                    if (current == null) {
                        throw new InvalidOperationException(SR.GetString(SR.InvalidOperation_EnumOpCantHappen)); 
                    } 
                    return new DictionaryEntry(current.key, current.value);
                } 
            }

            public object Key {
                get { 
                    if (current == null) {
                        throw new InvalidOperationException(SR.GetString(SR.InvalidOperation_EnumOpCantHappen)); 
                    } 
                    return current.key;
                } 
            }

            public object Value {
                get { 
                    if (current == null) {
                        throw new InvalidOperationException(SR.GetString(SR.InvalidOperation_EnumOpCantHappen)); 
                    } 
                    return current.value;
                } 
            }

            public bool MoveNext() {
                if (version != list.version) { 
                    throw new InvalidOperationException(SR.GetString(SR.InvalidOperation_EnumFailedVersion));
                } 
                if (start) { 
                    current = list.head;
                    start = false; 
                }
                else if(current != null) {
                    current = current.next;
                } 
                return (current != null);
            } 
 
            public void Reset() {
                if (version != list.version) { 
                    throw new InvalidOperationException(SR.GetString(SR.InvalidOperation_EnumFailedVersion));
                }
                start = true;
                current = null; 
            }
 
        } 

 
        private class NodeKeyValueCollection : ICollection {
            ListDictionary list;
            bool isKeys;
 
            public NodeKeyValueCollection(ListDictionary list, bool isKeys) {
                this.list = list; 
                this.isKeys = isKeys; 
            }
 
            void ICollection.CopyTo(Array array, int index)  {
                if (array==null)
                    throw new ArgumentNullException("array");
                if (index < 0) 
                    throw new ArgumentOutOfRangeException("index", SR.GetString(SR.ArgumentOutOfRange_NeedNonNegNum));
                for (DictionaryNode node = list.head; node != null; node = node.next) { 
                    array.SetValue(isKeys ? node.key : node.value, index); 
                    index++;
                } 
            }

            int ICollection.Count {
                get { 
                    int count = 0;
                    for (DictionaryNode node = list.head; node != null; node = node.next) { 
                        count++; 
                    }
                    return count; 
                }
            }

            bool ICollection.IsSynchronized { 
                get {
                    return false; 
                } 
            }
 
            object ICollection.SyncRoot {
                get {
                    return list.SyncRoot;
                } 
            }
 
            IEnumerator IEnumerable.GetEnumerator() { 
                return new NodeKeyValueEnumerator(list, isKeys);
            } 


            private class NodeKeyValueEnumerator: IEnumerator {
                ListDictionary list; 
                DictionaryNode current;
                int version; 
                bool isKeys; 
                bool start;
 
                public NodeKeyValueEnumerator(ListDictionary list, bool isKeys) {
                    this.list = list;
                    this.isKeys = isKeys;
                    this.version = list.version; 
                    this.start = true;
                    this.current = null; 
                } 

                public object Current { 
                    get {
                        if (current == null) {
                            throw new InvalidOperationException(SR.GetString(SR.InvalidOperation_EnumOpCantHappen));
                        } 
                        return isKeys ? current.key : current.value;
                    } 
                } 

                public bool MoveNext() { 
                    if (version != list.version) {
                        throw new InvalidOperationException(SR.GetString(SR.InvalidOperation_EnumFailedVersion));
                    }
                    if (start) { 
                        current = list.head;
                        start = false; 
                    } 
                    else {
                        current = current.next; 
                    }
                    return (current != null);
                }
 
                public void Reset() {
                    if (version != list.version) { 
                        throw new InvalidOperationException(SR.GetString(SR.InvalidOperation_EnumFailedVersion)); 
                    }
                    start = true; 
                    current = null;
                }
            }
        } 

        [Serializable] 
        private class DictionaryNode { 
            public object key;
            public object value; 
            public DictionaryNode next;
        }
    }
}
Link Menu

Network programming in C#, Network Programming in VB.NET, Network Programming in .NET
This book is available now!
Buy at Amazon US or
Buy at Amazon UK
ListDictionary.cs source code in C# .NET

Source code for the .NET framework in C#

Code:

Link Menu
