def-

24 ms·

211.
by def- 12y ago
Metaprogramming: http://rosettacode.org/wiki/Metaprogramming#Nimrod My bignum library for Nim (not well tested yet): https://github.com/def-/bigints Complex numbers: http://nim-lang.org
212.
by def- 12y ago
I'm currently working with the Xeon Phi and there you basically have to use Intel's C, C++ or Fortran compiler if you want good performance out of the box. Since Nim compiles to C I can write code that gets auto-vectorized and -op
213.
by def- 12y ago
https://en.wikipedia.org/wiki/Wikipedia:Articles_for_deletio... > Lacks reliable independent secondary sources to establish notability as required by WP:GNG. Every source is WP:PRIMARY. Every one of them. Googling t
214.
by def- 12y ago
The nice thing is that all 4 are valid Nim.
215.
by def- 12y ago
Nim has the advantage of compiling to/through C, for which compilers have been optimized for a long time.
216.
by def- 12y ago
The release is happening today, so I posted a bit early. Some parts, like the binaries, are not online yet. There are tutorials for newcomers: http://nim-lang.org/tut1.html https://nim-by-example.github.io/
217.
Nim (formerly Nimrod) 0.10.2 released(nim-lang.org)
199 points by def- 12y ago|140 comments
218.
by def- 12y ago
The Nim compiler itself is written in Nim: https://github.com/Araq/Nim There is Jester, a framework for web applications: https://github.com/dom96/jester HastyScribe looks pretty nice as well: ht
219.
by def- 12y ago
Nim: http://nim-lang.org/ https://nim-by-example.github.io/
220.
by def- 12y ago
Nim was also in the benchmark on the frontpage yesterday: https://news.ycombinator.com/item?id=8778041
221.
by def- 12y ago
I think the Nim code is also pretty readable: https://github.com/def-/LPATHBench/blob/master/nim.nim And Nim doesn't look bad in the other statistics (on an x86_64 Intel Core2Quad Q9300): Lang
222.
I missed Nim(goran.krampe.se)
6 points by def- 12y ago|0 comments
223.
by def- 12y ago
Related: http://www.dataorienteddesign.com/dodmain/dodmain.html
224.
by def- 12y ago
At least in the devel branch type classes seem to be working: type Comparable = generic x, y (x < y) is bool This creates a Comparable typeclass, which can then be instantiated: type Foo = tuple[a, b: int] proc `<`(x
225.
by def- 12y ago
In Nimrod it's easy to piggyback on C, which has the most extensive ecosystem of all languages.
226.
by def- 12y ago
The standard library is pretty nice though: http://nimrod-lang.org/lib.html I spent a few days solving Rosetta Code tasks and was surprised how easy most were using the existing libraries: http://rosettacode.org&
227.
by def- 12y ago
For general C/Nimrod interop see these Rosetta Code tasks: http://rosettacode.org/wiki/Call_a_foreign-language_function... http://rosettacode.org/wiki/Call_a_function_in_a_shared_libr... htt
228.
by def- 12y ago
I guess so. This is only viable if you have enough time for garbage collection.
229.
by def- 12y ago
Also, the GC can be controlled, so you can set exactly when it is allowed to run, something like this for a game: gcDisable() while true: gameLogic() renderFrame() gcStep(us = leftTime) sleep(restTime) http:/&
230.
Nimrod by Example(nimrod-by-example.github.io)
171 points by def- 12y ago|71 comments