Hashtable
E697490
Hashtable is a non-generic collection class in .NET that stores key-value pairs using hash codes to enable fast lookups, insertions, and deletions.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Hashtable canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T7897330 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hashtable Context triple: [System.Collections, containsType, Hashtable]
-
A.
Hash Pipe
"Hash Pipe" is a hard-rocking, riff-driven single by American rock band Weezer, known for its gritty sound and controversial lyrics.
-
B.
DHT
DHT is the abbreviation for the Dick Howser Trophy, an annual award recognizing the top college baseball player in the United States.
-
C.
B-tree
A B-tree is a self-balancing tree data structure that maintains sorted data and allows efficient insertion, deletion, and search operations, commonly used to implement database indexes.
-
D.
Heap
Heap is the surname of Imogen Heap, an English singer-songwriter, producer, and audio engineer known for her innovative electronic music and vocal processing.
-
E.
Whirlpool hash function
Whirlpool is a cryptographic hash function designed by Vincent Rijmen and Paulo S. L. M. Barreto, known for its wide-pipe construction and strong security properties suitable for digital signatures and data integrity.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Hashtable Target entity description: Hashtable is a non-generic collection class in .NET that stores key-value pairs using hash codes to enable fast lookups, insertions, and deletions.
-
A.
Hash Pipe
"Hash Pipe" is a hard-rocking, riff-driven single by American rock band Weezer, known for its gritty sound and controversial lyrics.
-
B.
DHT
DHT is the abbreviation for the Dick Howser Trophy, an annual award recognizing the top college baseball player in the United States.
-
C.
B-tree
A B-tree is a self-balancing tree data structure that maintains sorted data and allows efficient insertion, deletion, and search operations, commonly used to implement database indexes.
-
D.
Heap
Heap is the surname of Imogen Heap, an English singer-songwriter, producer, and audio engineer known for her innovative electronic music and vocal processing.
-
E.
Whirlpool hash function
Whirlpool is a cryptographic hash function designed by Vincent Rijmen and Paulo S. L. M. Barreto, known for its wide-pipe construction and strong security properties suitable for digital signatures and data integrity.
- F. None of above. chosen
Statements (61)
| Predicate | Object |
|---|---|
| instanceOf |
.NET collection class
ⓘ
hash table data structure ⓘ non-generic collection type ⓘ |
| assembly | mscorlib NERFINISHED ⓘ |
| canBeSynchronized | true ⓘ |
| collisionHandling | uses buckets and probing based on hash codes ⓘ |
| defaultLoadFactor | 0.72 ⓘ |
| definedInNamespace | System.Collections NERFINISHED ⓘ |
| hasMethod |
Add(object key, object value)
ⓘ
Clear() ⓘ Contains(object key) ⓘ ContainsKey(object key) ⓘ ContainsValue(object value) ⓘ CopyTo(Array array, int index) ⓘ GetEnumerator() ⓘ GetObjectData(SerializationInfo info, StreamingContext context) ⓘ OnDeserialization(object sender) ⓘ Remove(object key) ⓘ |
| hasProperty |
Comparer
ⓘ
Count ⓘ EqualityComparer NERFINISHED ⓘ IHashCodeProvider NERFINISHED ⓘ IsFixedSize ⓘ IsReadOnly ⓘ IsSynchronized ⓘ Item[object key] indexer ⓘ Keys ⓘ SyncRoot ⓘ Values ⓘ |
| implementsInterface |
ICollection
ⓘ
IDeserializationCallback ⓘ IDictionary ⓘ IEnumerable NERFINISHED ⓘ ISerializable NERFINISHED ⓘ |
| introducedIn | .NET Framework 1.0 NERFINISHED ⓘ |
| isGeneric | false ⓘ |
| isThreadSafe | false ⓘ |
| keyEquality | based on IEqualityComparer or IHashCodeProvider and IComparer ⓘ |
| keyRequirement | keys must be unique ⓘ |
| keyType | System.Object NERFINISHED ⓘ |
| languageBinding |
C#
NERFINISHED
ⓘ
VB.NET NERFINISHED ⓘ |
| nullKeySupport | does not allow null keys ⓘ |
| nullValueSupport | allows null values ⓘ |
| orderingGuarantee | does not preserve insertion order ⓘ |
| partOf |
.NET Base Class Library
NERFINISHED
ⓘ
.NET Framework Class Library NERFINISHED ⓘ |
| platform |
.NET 5+
NERFINISHED
ⓘ
.NET Core NERFINISHED ⓘ .NET Framework NERFINISHED ⓘ |
| recommendedAlternative | System.Collections.Generic.Dictionary<TKey,TValue> ⓘ |
| resizingBehavior | grows as needed when load factor is exceeded ⓘ |
| serializationSupport | binary serialization ⓘ |
| stores | key-value pairs ⓘ |
| supportsOperation |
fast deletion
ⓘ
fast insertion ⓘ fast lookup ⓘ |
| synchronizationMethod | Hashtable.Synchronized(Hashtable) static method NERFINISHED ⓘ |
| usageRecommendation | use for legacy non-generic code ⓘ |
| uses | hash codes for keys ⓘ |
| valueType | System.Object NERFINISHED ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Hashtable Description of subject: Hashtable is a non-generic collection class in .NET that stores key-value pairs using hash codes to enable fast lookups, insertions, and deletions.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.