You can also avoid sorting the entire table if you only care about the top 2 or 10 values by using the Nim stdlib's spiffy `heapqueue` module as in [https://github.com/c-blake/cligen/blob/master/examples/newest.nim](https://github.com/c-blake/cligen/blob/master/examples/newest.nim) \-- might be worth adding a `top`/`bottom`/`most` type procs to `heapqueue`.
- Access to Iterators of Sequences schmidh
- Re: Access to Iterators of Sequences Hlaaftana
- Re: Access to Iterators of Sequences schmidh
- Re: Access to Iterators of Sequences jyapayne
- Re: Access to Iterators of Sequences schmidh
- Re: Access to Iterators of Sequences dawkot
- Re: Access to Iterators of Sequences schmidh
- Re: Access to Iterators of Sequenc... cblake