Map fires events in put() and delete(), which is a small amount of extra code and I don't see how inlining will make that faster. Sorting just means using TreeMap instead of HashMap.
To me, that sounds a lot uglier than simply implementing the hash map internally. It's also a lot heavier. Overall, not very elegant.
And the iterations are basically the same, expect that Pivot has a Sequence API, which is a thin wrapper over Collection.
Sequence is used for list-type data. Dictionary is used for maps. A Map in Pivot is a Dictionary that also implements Collection.
Pivot maps iterate over their keys. JDK maps don't even implement java.util.Collection and require calls to keySet(), entrySet(), or values() to iterate.
