diff options
| author | def <dennis@felsin9.de> | 2015-02-01 18:29:01 +0100 |
|---|---|---|
| committer | def <dennis@felsin9.de> | 2015-02-01 18:29:01 +0100 |
| commit | 1ae4d535cd8ed6b797cf0525eaab9e0c889e0c6d (patch) | |
| tree | eaf2460ac515a4e58e87d328cb2f948a7c1f35e6 /lib/pure/hashes.nim | |
| parent | 903ca78289dc0460e07bd449a972a4d203d9a09b (diff) | |
| download | Nim-1ae4d535cd8ed6b797cf0525eaab9e0c889e0c6d.tar.gz | |
Add nextPermutation and prevPermutation
Fits best into algorithm module I guess. These are the most general ways, an iterator could easily be implemented from this. Same algorithm as in Rust: http://web.mit.edu/rust-lang_v0.11/doc/src/collections/var/tmp/alexp/rust/rust-0.11.0/src/libcollections/slice.rs.html#644
Diffstat (limited to 'lib/pure/hashes.nim')
0 files changed, 0 insertions, 0 deletions