Github user mxm commented on the pull request:
https://github.com/apache/flink/pull/344#issuecomment-71616952
@StephanEwen Yes, that was on purpose. The previous two data structures
(`HashMap` and `Queue`) are now replaced by the `LinkedHashMap` which serves
the same functionality. It might not be obvious but the `LinkedHashMap`
preserves the order of the inserted items. From
`scala.collection.mutable.LinkedHashMap`:
> This class implements mutable maps using a hashtable.
> The iterator and all traversal methods of this class visit elements in
the order they were inserted.
That's why `graphs.iterator.next()` always returns the least recently
inserted item.
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at [email protected] or file a JIRA ticket
with INFRA.
---
