lucenenet-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From nightowl...@apache.org
Subject [lucenenet] 05/20: Lucene.Net.Support.HashMap, Lucene.Net.Support.LinkedHashMap: Corrected documentation - TreeDictionary doesn't allow duplicate keys.
Date Tue, 03 Dec 2019 14:03:35 GMT
This is an automated email from the ASF dual-hosted git repository.

nightowl888 pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/lucenenet.git

commit aa630a0510e8aaf1d851ff5555c27e400e486988
Author: Shad Storhaug <shad@shadstorhaug.com>
AuthorDate: Wed Oct 30 23:29:52 2019 +0700

    Lucene.Net.Support.HashMap, Lucene.Net.Support.LinkedHashMap: Corrected documentation
- TreeDictionary doesn't allow duplicate keys.
---
 src/Lucene.Net/Support/HashMap.cs       | 2 +-
 src/Lucene.Net/Support/LinkedHashMap.cs | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/Lucene.Net/Support/HashMap.cs b/src/Lucene.Net/Support/HashMap.cs
index f01b6ee..75fe996 100644
--- a/src/Lucene.Net/Support/HashMap.cs
+++ b/src/Lucene.Net/Support/HashMap.cs
@@ -64,7 +64,7 @@ namespace Lucene.Net.Support
     /// <list type="bullet">
     ///     <item><description><see cref="LinkedHashMap{TKey, TValue}"/>
- use when you need to preserve entry insertion order. Keys are nullable.</description></item>
     ///     <item><description><see cref="SortedDictionary{TKey, TValue}"/>
- use when you need natural sort order. Keys must be unique.</description></item>
-    ///     <item><description><see cref="TreeDictionary{K, V}"/> - use
when you need natural sort order. Keys may contain duplicates.</description></item>
+    ///     <item><description><see cref="TreeDictionary{K, V}"/> - use
when you need natural sort order. Keys are nullable.</description></item>
     ///     <item><description><see cref="LurchTable{TKey, TValue}"/> -
use when you need to sort by most recent access or most recent update. Works well for LRU
caching.</description></item>
     /// </list>
     /// </remarks>
diff --git a/src/Lucene.Net/Support/LinkedHashMap.cs b/src/Lucene.Net/Support/LinkedHashMap.cs
index 6019f6e..cd83197 100644
--- a/src/Lucene.Net/Support/LinkedHashMap.cs
+++ b/src/Lucene.Net/Support/LinkedHashMap.cs
@@ -54,7 +54,7 @@ namespace Lucene.Net.Support
     /// <list type="bullet">
     ///     <item><description><see cref="LinkedHashMap{TKey, TValue}"/>
- use when you need to preserve entry insertion order. Keys are nullable.</description></item>
     ///     <item><description><see cref="SortedDictionary{TKey, TValue}"/>
- use when you need natural sort order. Keys must be unique.</description></item>
-    ///     <item><description><see cref="TreeDictionary{K, V}"/> - use
when you need natural sort order. Keys may contain duplicates.</description></item>
+    ///     <item><description><see cref="TreeDictionary{K, V}"/> - use
when you need natural sort order. Keys are nullable.</description></item>
     ///     <item><description><see cref="LurchTable{TKey, TValue}"/> -
use when you need to sort by most recent access or most recent update. Works well for LRU
caching.</description></item>
     /// </list>
     /// </remarks>


Mime
View raw message