Nim - This repository contains the Nim compiler, Nim's stdlib, tools, and documentation. (mirror)

	Commit message (Collapse)	Author	Age	Files	Lines
*	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
\|
*	year 2012 for most copyright headers	Araq	2012-01-02	1	-1/+1
\|
*	implemented write access to s[i] for macros	Araq	2011-06-21	1	-3/+3
\|
*	bugfixes; field discriminant checks; linearScanEnd, unroll, shallow pragmas	Araq	2011-03-23	1	-0/+0
\|
*	distinction between re.replace and re.replacef; speed improvements for re module	Araq	2011-03-06	1	-1/+1
\|
*	various bugfixes for generics; added generic sort proc	Araq	2011-03-03	1	-0/+101