query: hash code HashMap
positive_passages.docid: 126
positive_passages.text: How do I compare strings in Java?
negative_passages.docid: 110080
negative_passages.text: How to compare two hashmaps in java?
negative_passages.docid: 878
negative_passages.text: What issues should be considered when overriding equals and hashCode in Java?
negative_passages.docid: 130312
negative_passages.text: Why aren't hash values for "nothing" (empty) defined as all zeros?
negative_passages.docid: 91987
negative_passages.text: Difference between a HashMap and a dictionary ADT
negative_passages.docid: 56094
negative_passages.text: Why use a prime number in hashCode?
negative_passages.docid: 6494
negative_passages.text: Sorting hashmap based on keys
negative_passages.docid: 155463
negative_passages.text: How Do I Choose Between a Hash Table and a Trie (Prefix Tree)?
negative_passages.docid: 41919
negative_passages.text: How does the process of hashing work in Dictionary
negative_passages.docid: 130791
negative_passages.text: What is a good Hash Function?
negative_passages.docid: 102522
negative_passages.text: hash value on directory
negative_passages.docid: 104678
negative_passages.text: C# hashcode for array of ints
negative_passages.docid: 69886
negative_passages.text: Bit-shifting in Effective Java hashCode() implementation
negative_passages.docid: 43473
negative_passages.text: Turning a cipher into a hashing function
negative_passages.docid: 21883
negative_passages.text: Difference between HashSet and HashMap?
negative_passages.docid: 132703
negative_passages.text: Theoretical limit for number of keys (objects) that can be stored in a HashMap?
negative_passages.docid: 101173
negative_passages.text: Testing string equality using hashCode()