A map of objects whose mapping entries are sequenced based on the order in which they were
added. This data structure has fast O(1) search time, deletion time, and insertion time
Namespace: NHibernate.UtilAssembly: NHibernate (in NHibernate.dll) Version: 3.2.0.4000 (3.2.0.4000)
Syntax
C# |
---|
[SerializableAttribute] public class LinkedHashMap<TKey, TValue> : IDictionary<TKey, TValue>, ICollection<KeyValuePair<TKey, TValue>>, IEnumerable<KeyValuePair<TKey, TValue>>, IEnumerable |
Visual Basic |
---|
<SerializableAttribute> _ Public Class LinkedHashMap(Of TKey, TValue) _ Implements IDictionary(Of TKey, TValue), ICollection(Of KeyValuePair(Of TKey, TValue)), _ IEnumerable(Of KeyValuePair(Of TKey, TValue)), IEnumerable |
Visual C++ |
---|
[SerializableAttribute] generic<typename TKey, typename TValue> public ref class LinkedHashMap : IDictionary<TKey, TValue>, ICollection<KeyValuePair<TKey, TValue>>, IEnumerable<KeyValuePair<TKey, TValue>>, IEnumerable |
Type Parameters
- TKey
[Missing <typeparam name="TKey"/> documentation for "T:NHibernate.Util.LinkedHashMap`2"]
- TValue
[Missing <typeparam name="TValue"/> documentation for "T:NHibernate.Util.LinkedHashMap`2"]
Remarks
This class is not thread safe.
This class is not a really replication of JDK LinkedHashMap{K, V},
this class is an adaptation of SequencedHashMap with generics.