What is special about Nim?

Russian Translation by frol, Chinese Translation by JiyinYiyong

The Nim programming language is exciting. While the official tutorial is great, it slowly introduces you to the language. Instead I want to quickly show what you can do with Nim that would be more difficult or impossible in other languages.

I discovered Nim in my quest to find the right tools to write a game, HookRace, the successor of my current DDNet game/mod of Teeworlds. Since I’m busy with other projects for now, this blog is now officially about Nim instead, until I find time to continue developing the game.

Easy to get running

Ok, this part is not exciting yet, but I invite you to follow along with the post:

for i in 0 .. 10 : echo "Hello World" [ 0 .. i ]

If you want to do so, get the Nim compiler. Save this code as hello.nim , compile it with nim c hello and finally run the binary with ./hello . To immediately compile and run, use nim -r c hello . To use an optimized release build instead of a debug build use nim -d:release c hello . With all of these settings you will see the following output:

H He Hel Hell Hello Hello Hello W Hello Wo Hello Wor Hello Worl Hello World

Run regular code at compile time

To implement an efficient CRC32 procedure you need a lookup table. You could compute it at runtime or write it into your code as a magic array. Clearly we don’t want any magic numbers in our code, so we’ll do it at runtime (for now):

import unsigned , strutils type CRC32 * = uint32 const initCRC32 * = CRC32 ( - 1 ) proc createCRCTable (): array [ 256 , CRC32 ] = for i in 0 .. 255 : var rem = CRC32 ( i ) for j in 0 .. 7 : if ( rem and 1 ) > 0 : rem = ( rem shr 1 ) xor CRC32 ( 0xedb88320 ) else : rem = rem shr 1 result [ i ] = rem # Table created at runtime var crc32table = createCRCTable () proc crc32 ( s ): CRC32 = result = initCRC32 for c in s : result = ( result shr 8 ) xor crc32table [ ( result and 0xff ) xor ord ( c ) ] result = not result # String conversion proc $, automatically called by echo proc `$` ( c : CRC32 ): string = int64 ( c ). toHex ( 8 ) echo crc32 ( "The quick brown fox jumps over the lazy dog" )

Great, this works and we get 414FA339 as the output. But it would be even better if we could compute the CRC table at compile time. This is as easy as it gets in Nim, instead of the current crc32table creation we use:

# Table created at compile time const crc32table = createCRCTable ()

Yes, that’s right: All we had to do was replace the var with a const . Beautiful, isn’t it? We can write the exact same code and have it run at runtime and compile time. No template metaprogramming necessary.

Extend the language

Templates and macros can be used to get rid of boilerplate, by transforming your code at compile time.

Templates just replace their invocations with their code at compile-time. We can define our own loops like this:

template times ( x : expr , y : stmt ): stmt = for i in 1 .. x : y 10. times : echo "Hello World"

So the compiler transforms the times-loop to this regular for-loop:

for i in 1 .. 10 : echo "Hello World"

If you’re curious about the 10.times: syntax, it’s just a regular call to times with 10 as the first parameter and the following indented block as the second parameter. Instead you could also write times(10): , see Unified Call Syntax.

Or initialize sequences (variable sized arrays) more comfortably:

template newSeqWith ( len : int , init : expr ): expr = var result = newSeq [ type ( init ) ] ( len ) for i in 0 .. < len : result [ i ] = init result # Create a 2-dimensional sequence of size 20,10 var seq2D = newSeqWith ( 20 , newSeq [ bool ] ( 10 )) import math randomize () # Create a sequence of 20 random integers smaller than 10 var seqRand = newSeqWith ( 20 , random ( 10 )) echo seqRand

Macros go a step further and allow you to analyze and manipulate the AST. There are no list comprehensions in Nim, for example, but it’s possible to add them to the language by using a macro. Now instead of this:

var res : seq [ int ] = @[] for x in 1 .. 10 : if x mod 2 == 0 : res . add ( x ) echo res const n = 20 var result : seq [ tuple [ a , b , c : int ]] = @[] for x in 1 .. n : for y in x .. n : for z in y .. n : if x * x + y * y == z * z : result . add (( x , y , z )) echo result

You can use the future module and write:

import future echo lc [ x | ( x <- 1 .. 10 , x mod 2 == 0 ), int ] const n = 20 echo lc [ ( x , y , z ) | ( x <- 1 .. n , y <- x .. n , z <- y .. n , x * x + y * y == z * z ), tuple [ a , b , c : int ]]

Add your own optimizations to the compiler

Instead of optimizing your code, wouldn’t you prefer to make the compiler smarter? In Nim you can!

var x : int for i in 1 .. 1_000_000_000 : x += 2 * i echo x

This (pretty useless) code can be sped up by teaching the compiler two optimizations:

template optMul {` * `( a , 2 )}( a : int ): int = let x = a x + x template canonMul {` * `( a , b )}( a : int { lit }, b : int ): int = b * a

In the first term rewriting template we specify that a * 2 can be replaced by a + a . In the second one we specify that int s in a multiplication can be swapped if the first is an integer literal, so that we can potentially apply the first template.

More complicated patterns can also be implemented, for example to optimize boolean logic:

template optLog1 { a and a }( a ): auto = a template optLog2 { a and ( b or ( not b ))}( a , b ): auto = a template optLog3 { a and not a }( a : int ): auto = 0 var x = 12 s = x and x # Hint: optLog1(x) --> ’x’ [Pattern] r = ( x and x ) and (( s or s ) or ( not ( s or s ))) # Hint: optLog2(x and x, s or s) --> ’x and x’ [Pattern] # Hint: optLog1(x) --> ’x’ [Pattern] q = ( s and not x ) and not ( s and not x ) # Hint: optLog3(s and not x) --> ’0’ [Pattern]

s gets optimized to x directly, r gets optimized to x in 2 successive pattern applications and q ends up as 0 immediately.

If you want to see how term rewriting templates can be used to avoid allocations with bigints, look for the templates starting with opt in the bigints library:

import bigints var i = 0. initBigInt while true : i += 1 echo i

Bind to your favorite C functions and libraries

Since Nim compiles down to C, foreign function interfaces are fun.

You can easily use your favorite functions from the C standard library:

proc printf ( formatstr : cstring ) {. header : "<stdio.h>" , varargs .} printf ( "%s %d

" , "foo" , 5 )

Or use your own code written in C:

void hi ( char * name ) { printf ( "awesome %s

" , name ); }

{. compile : "hi.c" .} proc hi * ( name : cstring ) {. importc .} hi "from Nim"

Or any library you please with the help of c2nim:

proc set_default_dpi * ( dpi : cdouble ) {. cdecl , importc : "rsvg_set_default_dpi" , dynlib : "librsvg-2.so" .}

Control the garbage collector

To achieve soft realtime, you can tell the garbage collector when and for how long it is allowed to run. The main game logic can be implemented like this in Nim, to prevent the garbage collector from causing stutters:

gcDisable () while true : gameLogic () renderFrame () gcStep ( us = leftTime ) sleep ( restTime )

Type safe sets and arrays of enums

Often you want a mathematical set over values you defined yourself. Here’s how you do this in type-safe way:

type FakeTune = enum freeze , solo , noJump , noColl , noHook , jetpack var x : set [ FakeTune ] x . incl freeze x . incl solo x . excl solo echo x + { noColl , noHook } if freeze in x : echo "Here be freeze" var y = { solo , noHook } y . incl 0 # Error: type mismatch

You can’t accidentally add a value of another type. Internally the set works as an efficient bitvector.

The same is possible with arrays, indexing them with your enum:

var a : array [ FakeTune , int ] a [ freeze ] = 100 echo a [ freeze ]

Unified Call Syntax

This is just syntactic sugar, but it’s definitely nice to have. In Python I always forget whether len and append are functions or methods. In Nim I don’t have to remember, because there is no difference. Nim uses Unified Call Syntax, which has now also been proposed for C++ by Herb Sutter and Bjarne Stroustrup.

var xs = @[ 1 , 2 , 3 ] # Procedure call syntax add ( xs , 4_000_000 ) echo len ( xs ) # Method call syntax xs . add ( 0b0101_0000_0000 ) echo xs . len () # Command invocation syntax xs . add 0x06_FF_FF_FF echo xs . len

Good performance

It’s easy to write fast code in Nim, as can be seen in the Longest Path Finding Benchmark, in which Nim is competing with some cute code.

I made some measurements on my machine when the benchmark was first published (Linux x86-64, Intel Core2Quad Q9300 @2.5GHz, state of 2014-12-20):

Lang Time [ms] Memory [KB] Compile Time [ms] Compressed Code [B] Nim 1400 1460 893 486 C++ 1478 2717 774 728 D 1518 2388 1614 669 Rust 1623 2632 6735 934 Java 1874 24428 812 778 OCaml 2384 4496 125 782 Go 3116 1664 596 618 Haskell 3329 5268 3002 1091 LuaJit 3857 2368 - 519 Lisp 8219 15876 1043 1007 Racket 8503 130284 24793 741

Compressed code size with gzip -9 < nim.nim | wc -c . Removed unused functions in Haskell. Compile times are clean compiles, if you have a nimcache with the standard library precompiled it’s only 323 ms for Nim.

Another small benchmark I did, calculating which numbers of the first 100 million are prime, in Python, Nim and C:

Python (runtime: 35.1 s)

def eratosthenes ( n ): sieve = [ 1 ] * 2 + [ 0 ] * ( n - 1 ) for i in range ( int ( n ** 0.5 )): if not sieve [ i ]: for j in range ( i * i , n + 1 , i ): sieve [ j ] = 1 return sieve eratosthenes ( 100000000 )

Nim (runtime: 2.6 s)

import math proc eratosthenes ( n ): auto = result = newSeq [ int8 ] ( n + 1 ) result [ 0 ] = 1 ; result [ 1 ] = 1 for i in 0 .. int sqrt ( float n ): if result [ i ] == 0 : for j in countup ( i * i , n , i ): result [ j ] = 1 discard eratosthenes ( 100_000_000 )

C (runtime: 2.6 s)

#include <stdlib.h> #include <math.h> char * eratosthenes ( int n ) { char * sieve = calloc ( n + 1 , sizeof ( char )); sieve [ 0 ] = 1 ; sieve [ 1 ] = 1 ; int m = ( int ) sqrt (( double ) n ); for ( int i = 0 ; i <= m ; i ++ ) { if ( ! sieve [ i ]) { for ( int j = i * i ; j <= n ; j += i ) sieve [ j ] = 1 ; } } return sieve ; } int main () { eratosthenes ( 100000000 ); }

Compile to JavaScript

You can compile Nim to JavaScript, instead of C. This allows you to write the client as well as the server directly in Nim. Let’s make a small visitor counter on the server that gets displayed in the browser. This is our client.nim :

import htmlgen , dom type Data = object visitors {. importc .}: int uniques {. importc .}: int ip {. importc .}: cstring proc printInfo ( data : Data ) {. exportc .} = var infoDiv = document . getElementById ( "info" ) infoDiv . innerHTML = p ( "You're visitor number " , $ data . visitors , ", unique visitor number " , $ data . uniques , " today. Your IP is " , $ data . ip , "." )

We define a Data type that we use to pass data from the server to client. The printInfo procedure will be called with this data and display it. Compile this with nim js client . The result javascript file ends up in nimcache/client.js .

For the server we need to get the Nimble package manager and run nimble install jester . Now we can use the Jester web framework and write our server.nim :

import jester , asyncdispatch , json , strutils , times , sets , htmlgen , strtabs , httpcore var visitors = 0 uniques = initSet [ string ] () time : TimeInfo routes : get "/" : resp body ( ` div `( id = "info" ), script ( src = "/client.js" , ` type ` = "text/javascript" ), script ( src = "/visitors" , ` type ` = "text/javascript" )) get "/client.js" : const result = staticExec "nim -d:release js client" const clientJS = staticRead "nimcache/client.js" resp clientJS get "/visitors" : let newTime = getTime (). getLocalTime if newTime . monthDay != time . monthDay : visitors = 0 init uniques time = newTime inc visitors let ip = if request . headers . hasKey "X-Forwarded-For" : request . headers [ "X-Forwarded-For" , 0 ] else : request . ip uniques . incl ip let json = % { "visitors" : % visitors , "uniques" : % uniques . len , "ip" : % ip } resp "printInfo( $# )" . format ( json ) runForever ()

The server delivers the main website. It also delivers the client.js , by compiling and reading the client.nim at compile time. The logic is in the /visitors handling. Compile and run with nim -r c server and open http://localhost:5000/ to see the code in effect.

You can see our code in action on the Jester-generated site or inline here:

You don't have JavaScript enabled or something went wrong.

Final words

I hope I could pique your interest in in the Nim programming language.

Note that the language is not completely stable yet. Especially with the more obscure features you may run into bugs. But on the bright side, Nim 1.0 is supposed to be released within the next 3 months! So now is the perfect time to get started with learning Nim.

Bonus: Since Nim compiles to C and only depends on the C standard library you can deploy it nearly everywhere, including x86-64, ARM and Intel Xeon Phi accelerator cards.

For comments use Reddit, Hacker News or ask the Nim community directly on IRC (#nim on freenode). You can reach me personally at [email protected].

Thanks to Andreas Rumpf and Dominik Picheta for proof-reading this post.