Timeline for Hashing function in Hashtable vs. HashMap?
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 10, 2016 at 4:06 | comment | added | Stephen C | Yes, but it was a bad (i.e. not apropos) example. Jack is clearly talking about "should be the same" with respect to the hashing algorithm. (He's not correct though ...) | |
| Jul 10, 2016 at 3:59 | comment | added | Zoomba | @StephenC I was just giving an example of the case that the fact that some class supersedes another does not necessarily mean they have no implementation difference. | |
| Jul 10, 2016 at 2:40 | comment | added | Gaurava Agarwal | @A.Mashreghi, I can see you have accepted wrong answer.Stephen C has given correct answer. | |
| Jul 10, 2016 at 1:10 | comment | added | Stephen C | @A.Mashreghi - Arguably, that is not a difference in the hashing algorithm. Rather it is a difference in the resizing algorithm. | |
| Jul 10, 2016 at 0:59 | comment | added | Stephen C | Actually, for Java 8 the algorithms are (significantly) different; see my answer. | |
| Jul 10, 2016 at 0:36 | comment | added | dimo414 | @A.Mashreghi that's an implementation detail, why does it concern you? | |
| Jul 10, 2016 at 0:20 | vote | accept | Zoomba | ||
| Jul 10, 2016 at 3:59 | |||||
| Jul 10, 2016 at 0:16 | comment | added | Louis Wasserman | That's not really important in any serious way. | |
| Jul 10, 2016 at 0:10 | comment | added | Zoomba | For example in ArrayList when the capacity is reached the size of the array is multiplied by 1.5; however, in Vector this ratio is 2. So, they are not totally the same. | |
| Jul 10, 2016 at 0:06 | history | answered | Jack | CC BY-SA 3.0 |