title: What do you exactly mean by HashMap's iterator is fail-fast and HashTable's enumerator isn't?
body: <p>I was looking up the difference between the two classes and this point came up in a lot of the answers with this blog being the source: 
  <a href="http://javarevisited.blogspot.com/2010/10/difference-between-hashmap-and.html">http://javarevisited.blogspot.com/2010/10/difference-between-hashmap-and.html</a></p>
  
  <p>However I don't completely get it.
  Can someone elaborate this? Perhaps with an example?</p>
  
  <p>Thanks for looking in!</p>