| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Fixed algorithm.reversed to work for empty seq's. | Reimer Behrends | 2015-08-14 | 1 | -1/+2 |
| | | |||||
| * | Updated some example code in algorithm | apense | 2015-07-05 | 1 | -7/+7 |
| | | |||||
| * | Add tests for algorithm.reversed | takaomag | 2015-07-02 | 1 | -0/+6 |
| | | |||||
| * | Fix algorithm.reversed to accept non-zero 'first' arg | takaomag | 2015-07-02 | 1 | -5/+5 |
| | | |||||
| * | preparations for more Nimble packages; clear licensing; fixes #2949 | Araq | 2015-06-20 | 1 | -1/+1 |
| | | |||||
| * | Added documentation | apense | 2015-06-18 | 1 | -0/+3 |
| | | | | Now `isSorted` is documented. | ||||
| * | Removed redundant check | apense | 2015-06-18 | 1 | -2/+0 |
| | | | | Loop takes care of it already | ||||
| * | Fixed silly continue | apense | 2015-06-17 | 1 | -5/+2 |
| | | | | The old if/else was weird and unnecessary | ||||
| * | Added `isSorted` proc | apense | 2015-06-17 | 1 | -0/+23 |
| | | | | Linear-time verification that an openarray is sorted. Operates on the same parameters as `sort`. Seems much cheaper for large sorts. | ||||
| * | Merge pull request #2682 from koalazen/refactor_lowerbound_algorithm | Andreas Rumpf | 2015-06-07 | 1 | -7/+17 |
| |\ | | | | | shorten lowerBound in algorithm.nim | ||||
| | * | refactored lowerBound in algorithm.nim | Koala Zen | 2015-05-18 | 1 | -7/+17 |
| | | | |||||
| * | | Merge pull request #2733 from apense/patch-4 | Andreas Rumpf | 2015-05-25 | 1 | -3/+2 |
| |\ \ | | | | | | | Small sequence fix for algorithm.nim | ||||
| | * | | Small sequence fix for algorithm.nim | apense | 2015-05-15 | 1 | -3/+2 |
| | | | | | | | | | | Since #853 was fixed, this should work fine. The `result = @[]` was swapped to the same syntax, too. | ||||
| * | | | Merge pull request #2701 from borisvassilev/fill | Dominik Picheta | 2015-05-16 | 1 | -0/+11 |
| |\ \ \ | |/ / |/| | | Fill array with same values (was issue #2462) | ||||
| | * | | Fill array with same values (was issue #2462) | Boris Vassilev | 2015-05-12 | 1 | -0/+11 |
| | |/ | |||||
| * | | Update algorithm.nim | apense | 2015-05-14 | 1 | -2/+1 |
| | | | |||||
| * | | Corrected sortedByIt example | apense | 2015-05-14 | 1 | -1/+1 |
| |/ | | | `people` needs `var` | ||||
| * | fixes #2568 | Araq | 2015-04-17 | 1 | -2/+2 |
| | | |||||
| * | Use more Natural and Positive numbers in proc parameters | def | 2015-04-06 | 1 | -2/+2 |
| | | | | | | - Didn't go through all modules, only the main ones I thought of - Building the compiler and tests still work | ||||
| * | preparations for dealing with the 'echo $foo' gotcha | Araq | 2015-03-27 | 1 | -3/+3 |
| | | |||||
| * | Better documentation and rename of sortByIt(). | Hans Raaf | 2015-03-11 | 1 | -4/+17 |
| | | |||||
| * | fixes #2220; #2219; breaks #2022; for #2022 callsite needs to be used | Araq | 2015-03-10 | 1 | -14/+16 |
| | | |||||
| * | Move sortByIt to algorithm module and add an example for it | def | 2015-03-03 | 1 | -0/+21 |
| | | |||||
| * | Add sorted proc to algorithm module | def | 2015-02-20 | 1 | -0/+7 |
| | | |||||
| * | Add nextPermutation and prevPermutation | def | 2015-02-01 | 1 | -0/+59 |
| | | | | | | | 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 | ||||
| * | Nimrod renamed to Nim | Araq | 2014-08-28 | 1 | -2/+2 |
| | | |||||
| * | Nimrod renamed to Nim | Araq | 2014-08-28 | 1 | -2/+2 |
| | | |||||
| * | big rename | Araq | 2014-08-28 | 1 | -3/+3 |
| | | |||||
| * | big rename | Araq | 2014-08-27 | 1 | -2/+5 |
| | | |||||
| * | renamefest | Araq | 2014-08-23 | 1 | -3/+3 |
| | | |||||
| * | Fix to included last element in reversed | def | 2014-07-09 | 1 | -2/+2 |
| | | |||||
| * | Add reversed proc | def | 2014-07-09 | 1 | -0/+14 |
| | | |||||
| * | Adds do notation example to algorithm.sort. | Grzegorz Adam Hankiewicz | 2014-06-06 | 1 | -0/+9 |
| | | |||||
| * | fixed doc comment | Charlie Barto | 2014-03-27 | 1 | -4/+5 |
| | | |||||
| * | added usage example for lower bound | Charlie Barto | 2014-03-27 | 1 | -0/+5 |
| | | |||||
| * | made the default comparator for lowerBound unqualified, so the user can ↵ | Charlie Barto | 2014-03-23 | 1 | -1/+1 |
| | | | | | customize via two phase lookup | ||||
| * | added lowerBound function to algorithm library | Charlie Barto | 2014-03-23 | 1 | -0/+24 |
| | | |||||
| * | product more robust against empty input | Simon Hafner | 2014-01-30 | 1 | -0/+1 |
| | | |||||
| * | forgot to export product | Simon Hafner | 2014-01-30 | 1 | -1/+1 |
| | | |||||
| * | added Cartesian product | Simon Hafner | 2014-01-30 | 1 | -0/+32 |
| | | |||||
| * | case consistency part 4 | Araq | 2013-12-27 | 1 | -2/+2 |
| | | |||||
| * | Removes executable bit for text files. | Grzegorz Adam Hankiewicz | 2013-03-16 | 1 | -0/+0 |
| | | |||||
| * | made tests green again | Araq | 2012-09-18 | 1 | -1/+1 |
| | | |||||
| * | preparations for making 'closure' the default calling convention for proc types | Araq | 2012-07-16 | 1 | -2/+2 |
| | | |||||
| * | version 0.8.14 | Araq | 2012-02-09 | 1 | -1/+1 |
| | | |||||
| * | closure implementation: first steps | Araq | 2012-02-04 | 1 | -0/+18 |
| | | |||||
| * | fixed #96 as good as technically possible (debug frames are allocated on the ↵ | Araq | 2012-01-29 | 1 | -2/+2 |
| | | | | | C stack) | ||||
| * | pragma on/off improvements; endb rewritten | Araq | 2012-01-28 | 1 | -2/+4 |
| | | |||||
| * | even more sys assertions | Araq | 2012-01-13 | 1 | -0/+3 |
| | | |||||
| * | more sysasserts for allocator/gc | Araq | 2012-01-12 | 1 | -4/+13 |
| | | |||||