java Programming Glossary: buckets

http://stackoverflow.com/questions/1463284/hashset-vs-treeset

and I don't care to mess around with hash functions and buckets in the case of Java . In which cases should I use a HashSet..

In Java, why must equals() and hashCode() be consistent?

http://stackoverflow.com/questions/1678205/in-java-why-must-equals-and-hashcode-be-consistent

this it has a variable number of what are commonly called buckets . The number of buckets can change over time as entries are.. number of what are commonly called buckets . The number of buckets can change over time as entries are added and removed but it.. is always a power of 2. Let's say a given HashMap has 16 buckets. When you call put to add an entry the hashCode of the key is..

Understanding the workings of equals and hashCode in a HashMap

http://stackoverflow.com/questions/1894377/understanding-the-workings-of-equals-and-hashcode-in-a-hashmap

their equality they are put straight into different buckets and the possibility that they are equal isn't even considered...

Why use a prime number in hashCode?

http://stackoverflow.com/questions/3613102/why-use-a-prime-number-in-hashcode

want the number you are multiplying by and the number of buckets you are inserting into to have orthogonal prime factorizations... have orthogonal prime factorizations. Suppose there are 8 buckets to insert into. If the number you are using to multiply by is.. function. 31 is a large enough prime that the number of buckets is unlikely to be divisible by it and in fact modern java HashMap..

How do HashTables deal with collisions?

http://stackoverflow.com/questions/4980757/how-do-hashtables-deal-with-collisions

all full then the hash table can increase the number of buckets that it has and then redistribute all the elements in the table... which if you are lucky might send the objects to different buckets. Java uses both option 1 and 2 in its hash table implementations...

How does a HashMap work in Java?

http://stackoverflow.com/questions/6493605/how-does-a-hashmap-work-in-java

but it illustrates the basic mechanism It has a number of buckets which it uses to store key value pairs in. Each bucket has a.. this then keys that are equal might be stored in different buckets and the hashmap would not be able to find key value pairs because..

Math.random() versus Random.nextInt(int)

http://stackoverflow.com/questions/738629/math-random-versus-random-nextintint

to an int then forces these values into one of six 'buckets' 0 1 2 3 4 5 each bucket corresponding to ranges encompassing.. the die will show itself to be biased towards the larger buckets. You will be waiting a very long time rolling dice for this..

Understanding strange Java hash function

http://stackoverflow.com/questions/9335169/understanding-strange-java-hash-function

the bucket index by combining the hash with the number of buckets you need to have an even distribution of the lower bits of the..