Defining sorting criteria in SortedDictionary about algorithm

[daniel-jonathan]

Here is an issue for your feature request: #7. Thank you!

[daniel-jonathan]

The SortedDictionary is sorted by its key value. So if you want to access it in descending order, you can access it backwards. For example:

let n = dict.count
for i in 1..<n {
    let e = dict[n - i]
    // do something with `e`
}

Something like that should work. If you need, please reopen the issue. All the best!

[andreadelfante]

Yes, I use SortedDictionary.reversed() to get an array of tuple..but i wanna reduce my algorithm complexity, trying to perform only one iteration. It could be useful implementing a custom comparable closure, like TreeMap in Java.

[daniel-jonathan]

That is a good idea, I will look into that.