/*
Copyright (c) 2005, Marc Clifton
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this list
of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice, this
list of conditions and the following disclaimer in the documentation and/or other
materials provided with the distribution.
* Neither the name of MyXaml nor the names of its contributors may be
used to endorse or promote products derived from this software without specific
prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
using System;
using System.Collections;
using System.Collections.Generic;
namespace Newtonsoft.Utilities.Collections
{
[Serializable]
public class KeyedList : IDictionary, IList>
{
private readonly Dictionary objectTable = new Dictionary();
private readonly List> objectList = new List>();
///
/// Returns false.
///
public bool IsReadOnly
{
get { return false; }
}
///
/// Returns the number of entries in the KeyedList.
///
public int Count
{
get { return objectList.Count; }
}
///
/// Get/Set the value at the specified index.
///
/// The index.
/// The value.
public KeyValuePair this[int index]
{
get
{
if (index < 0 || index >= Count)
throw new ArgumentOutOfRangeException("index");
return objectList[index];
}
set
{
if (index < 0 || index >= Count)
throw new ArgumentOutOfRangeException("index");
objectList[index] = value;
objectTable[value.Key] = value.Value;
}
}
///
/// Get/Set the value associated with the specified key.
///
/// The key.
/// The associated value.
public virtual V this[K key]
{
get { return objectTable[key]; }
set
{
if (objectTable.ContainsKey(key))
{
objectTable[key] = value;
objectList[IndexOf(key)] = new KeyValuePair(key, value);
}
else
{
Add(key, value);
}
}
}
///
/// Get an unordered list of keys.
/// This collection refers back to the keys in the original Dictionary.
///
public ICollection Keys
{
get { return objectTable.Keys; }
}
///
/// Get an unordered list of values.
/// This collection refers back to the values in the original Dictionary.
///
public ICollection Values
{
get { return objectTable.Values; }
}
///
/// Get the ordered list of keys.
/// This is a copy of the keys in the original Dictionary.
///
public List OrderedKeys
{
get
{
List retList = new List();
foreach (KeyValuePair kvp in objectList)
{
retList.Add(kvp.Key);
}
return retList;
}
}
///
/// Get the ordered list of values.
/// This is a copy of the values in the original Dictionary.
///
public List OrderedValues
{
get
{
List retList = new List();
foreach (KeyValuePair kvp in objectList)
{
retList.Add(kvp.Value);
}
return retList;
}
}
///
/// Returns the key at the specified index.
///
/// The index.
/// The key at the index.
public K GetKey(int index)
{
if (index < 0 || index >= Count)
throw new ArgumentOutOfRangeException("index");
return objectList[index].Key;
}
///
/// Returns the value at the specified index.
///
/// The index.
/// The value at the index.
public V GetValue(int index)
{
if (index < 0 || index >= Count)
throw new ArgumentOutOfRangeException("index");
return objectList[index].Value;
}
///
/// Get the index of a particular key.
///
/// The key to find the index of.
/// The index of the key, or -1 if not found.
public int IndexOf(K key)
{
int ret = -1;
for (int i = 0; i < objectList.Count; i++)
{
if (objectList[i].Key.Equals(key))
{
ret = i;
break;
}
}
return ret;
}
///
/// Given the key-value pair, find the index.
///
/// The key-value pair.
/// The index, or -1 if not found.
public int IndexOf(KeyValuePair kvp)
{
return objectList.IndexOf(kvp);
}
///
/// Gets the Dictionary class backing the KeyedList.
///
public Dictionary ObjectTable
{
get { return objectTable; }
}
///
/// Clears all entries in the KeyedList.
///
public void Clear()
{
objectTable.Clear();
objectList.Clear();
}
///
/// Test if the KeyedList contains the key.
///
/// The key.
/// True if the key is found.
public bool ContainsKey(K key)
{
return objectTable.ContainsKey(key);
}
///
/// Test if the KeyedList contains the key in the key-value pair.
///
/// The key-value pair.
/// True if the key is found.
public bool Contains(KeyValuePair kvp)
{
return objectList.Contains(kvp);
}
///
/// Adds a key-value pair to the KeyedList.
///
/// The key.
/// The associated value.
public void Add(K key, V value)
{
objectTable.Add(key, value);
objectList.Add(new KeyValuePair(key, value));
}
///
/// Adds a key-value pair to the KeyedList.
///
/// The KeyValuePair instance.
public void Add(KeyValuePair kvp)
{
Add(kvp.Key, kvp.Value);
}
///
/// Copy the entire key-value pairs to the KeyValuePair array, starting
/// at the specified index of the target array. The array is populated
/// as an ordered list.
///
/// The KeyValuePair array.
/// The position to start the copy.
public void CopyTo(KeyValuePair[] kvpa, int idx)
{
objectList.CopyTo(kvpa, idx);
}
///
/// Insert the key-value at the specified index.
///
/// The zero-based insert point.
/// The key.
/// The value.
public void Insert(int index, K key, V value)
{
if (index < 0 || index > Count)
throw new ArgumentOutOfRangeException("index");
objectTable.Add(key, value);
objectList.Insert(index, new KeyValuePair(key, value));
}
///
/// Insert the key-value pair at the specified index location.
///
/// The key.
/// The value.
public void Insert(int index, KeyValuePair kvp)
{
if (index < 0 || index > Count)
throw new ArgumentOutOfRangeException("index");
objectTable.Add(kvp.Key, kvp.Value);
objectList.Insert(index, kvp);
}
///
/// Remove the entry.
///
/// The key identifying the key-value pair.
/// True if removed.
public bool Remove(K key)
{
bool found = objectTable.Remove(key);
if (found)
objectList.RemoveAt(IndexOf(key));
return found;
}
///
/// Remove the key in the specified KeyValuePair instance. The Value
/// property is ignored.
///
/// The key-value identifying the entry.
/// True if removed.
public bool Remove(KeyValuePair kvp)
{
bool found = objectList.Remove(kvp);
if (found)
objectTable.Remove(kvp.Key);
return found;
}
///
/// Remove the entry at the specified index.
///
/// The index to the entry to be removed.
public void RemoveAt(int index)
{
if (index < 0 || index >= Count)
throw new ArgumentOutOfRangeException("index");
objectTable.Remove(objectList[index].Key);
objectList.RemoveAt(index);
}
///
/// Attempt to get the value, given the key, without throwing an exception if not found.
///
/// The key indentifying the entry.
/// The value, if found.
/// True if found.
public bool TryGetValue(K key, out V val)
{
return objectTable.TryGetValue(key, out val);
}
///
/// Returns an ordered System.Collections KeyValuePair objects.
///
IEnumerator IEnumerable.GetEnumerator()
{
return objectList.GetEnumerator();
}
///
/// Returns an ordered KeyValuePair enumerator.
///
IEnumerator> IEnumerable>.GetEnumerator()
{
return objectList.GetEnumerator();
}
}
}