Github user liancheng commented on the pull request:
https://github.com/apache/spark/pull/7239#issuecomment-119284223
@SaintBacchus As for the semantics of the `take` method, I think it's OK
since we are using `LinkedHashMap` here:
> Hash table and linked list implementation of the `Map` interface, with
predictable iteration order. This implementation differs from `HashMap` in
that it maintains a doubly-linked list running through all of its entries. This
linked list defines the iteration ordering, which is normally the order in
which keys were inserted into the map (insertion-order). Note that insertion
order is not affected if a key is re-inserted into the map. (A key `k` is
reinserted into a map m if `m.put(k, v)` is invoked when `m.containsKey(k)`
would return true immediately prior to the invocation.)
---
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.
---
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
