| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Add algorithm.upperBound (#7851) | Dmitry Atamanov | 2018-05-29 | 1 | -4/+39 |
| | | | | | * Add algorithm.upperBound * Docs updated | ||||
| * | Fixes binarySearch's bug | data-man | 2018-05-23 | 1 | -2/+2 |
| | | |||||
| * | binarySearch became even better | data-man | 2018-05-23 | 1 | -6/+10 |
| | | |||||
| * | Faster binarySearch | data-man | 2018-05-23 | 1 | -0/+6 |
| | | |||||
| * | binarySearch improvements (#7850) | Dmitry Atamanov | 2018-05-20 | 1 | -14/+36 |
| | | |||||
| * | keep algorithm.nim warning free | Araq | 2018-05-18 | 1 | -6/+6 |
| | | |||||
| * | Merge branch 'devel' into araq-parser-fixes | Andreas Rumpf | 2018-05-06 | 1 | -20/+42 |
| |\ | |||||
| | * | remove deprecated stuff from the stdlib; introduce better deprecation warnings | Araq | 2018-05-05 | 1 | -3/+0 |
| | | | |||||
| | * | test binarySearch, fix for search in empty. (#7769) | Arne Döring | 2018-05-04 | 1 | -3/+24 |
| | | | |||||
| | * | Deprecate smart binary search (#7745) | Arne Döring | 2018-05-03 | 1 | -15/+19 |
| | | | | | | | | | | | | | * deprecate smartBinarySearch * changelog entry | ||||
| * | | warn about inconsistent spacing around binary operators; fixes #7582 | Andreas Rumpf | 2018-05-05 | 1 | -1/+1 |
| |/ | |||||
| * | Fix algorithm.fill for empty input | Oscar Nihlgård | 2018-04-04 | 1 | -3/+11 |
| | | |||||
| * | Move algorithm tests away from koch | Oscar Nihlgård | 2018-04-04 | 1 | -0/+13 |
| | | |||||
| * | More flexible lowerBound interface (#7344) | Yuriy Glukhov | 2018-03-16 | 1 | -1/+1 |
| | | |||||
| * | algorithm.nim: change formatting to Nim's defaults | Araq | 2018-03-05 | 1 | -4/+4 |
| | | |||||
| * | fixes #6631 | Andreas Rumpf | 2017-10-30 | 1 | -2/+2 |
| | | |||||
| * | updated algorithm.rotateLeft implementation | Andreas Rumpf | 2017-10-30 | 1 | -2/+2 |
| | | |||||
| * | use doAssert in rotateLeft example | Arne Döring | 2017-08-17 | 1 | -1/+1 |
| | | |||||
| * | fix for feedback on PR | Arne Döring | 2017-08-14 | 1 | -9/+11 |
| | | |||||
| * | allow a negative distance argument. Improved documentation. | Arne Döring | 2017-07-27 | 1 | -8/+22 |
| | | |||||
| * | changed rotate to rotateLeft with slice api | Arne Döring | 2017-07-27 | 1 | -45/+41 |
| | | |||||
| * | fixes for feedback | Arne Döring | 2017-07-27 | 1 | -13/+14 |
| | | |||||
| * | added rotate in algorithm | Arne Döring | 2017-07-27 | 1 | -1/+111 |
| | | |||||
| * | fixes #5625 | Andreas Rumpf | 2017-03-29 | 1 | -7/+9 |
| | | |||||
| * | Fix reverse on empty openArray (#5407) | fenekku | 2017-02-17 | 1 | -1/+1 |
| | | | | Reversing an empty `openArray` would raise a RangeError. For instance for `a: seq[int] = @[]`, we have `a.high` return `-1` but `-1` is not a `Natural`. Leaving the array as-is is the expected behaviour. | ||||
| * | algorithm: sort: fix link in documentation | Simon Ruderich | 2016-09-15 | 1 | -1/+1 |
| | | |||||
| * | Removed the use of .gensym pragma inside stdlib templates | Ruslan Mustakov | 2016-08-23 | 1 | -1/+1 |
| | | |||||
| * | expr and stmt are now deprecated | Andreas Rumpf | 2016-07-30 | 1 | -2/+2 |
| | | |||||
| * | 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 |
| | | |||||