This article is missing information about Nim's history, language design, tools, and paradigms.(June 2019) |
![]() | This article may be too technical for most readers to understand.(January 2024) |
![]() The Nim crown logo | |
Paradigms | Multi-paradigm: compiled, concurrent, procedural, imperative, functional, object-oriented, meta |
---|---|
Designed by | Andreas Rumpf |
Developer | Nim Lang Team [1] |
First appeared | 2008 |
Stable release | |
Typing discipline | Static, [3] strong, [4] inferred, structural |
Scope | Lexical |
Implementation language | Pascal (2005–2008) Nim (2008–present, self-hosted) |
Platform | IA-32, x86-64, ARM, Aarch64, RISC-V, PowerPC ... [5] |
OS | Cross-platform [6] |
License | MIT License [7] ![]() |
Filename extensions | .nim, .nims, .nimble |
Website | nim-lang |
Influenced by | |
Ada, Modula-3, Lisp, C++, Object Pascal, Python, Oberon, Rust, ParaSail [8] |
Nim is a general-purpose, multi-paradigm, statically typed, compiled high-level system programming language, [9] designed and developed by a team around Andreas Rumpf. Nim is designed to be "efficient, expressive, and elegant", [10] supporting metaprogramming, functional, message passing, [11] procedural, and object-oriented programming styles by providing several features such as compile time code generation, algebraic data types, a foreign function interface (FFI) with C, C++, Objective-C, and JavaScript, and supporting compiling to those same languages as intermediate representations.
Nim is statically typed. [12] It supports compile-time metaprogramming features such as syntactic macros and term rewriting macros. [13] Term rewriting macros enable library implementations of common data structures, such as bignums and matrices, to be implemented efficiently and with syntactic integration, as if they were built-in language facilities. [14] Iterators are supported and can be used as first class entities, [13] as can functions, allowing for the use of functional programming methods. Object-oriented programming is supported by inheritance and multiple dispatch. Functions can be generic and overloaded, and generics are further enhanced by Nim's support for type classes. Operator overloading is also supported. [13] Nim includes multiple tunable memory management strategies, including tracing garbage collection, reference counting, and fully manual systems, with the default being deterministic reference counting with optimizations via move semantics and cycle collection via trial deletion. [15]
[Nim] ... presents a most original design that straddles Pascal and Python and compiles to C code or JavaScript. [16]
— Andrew Binstock, editor-in-chief of Dr. Dobb's Journal, 2014
As of August 2023 [update] , Nim compiles to C, C++, JavaScript, Objective-C, [17] and LLVM. [18]
![]() | This section needs expansion. You can help by adding to it. (February 2018) |
Branch | Version | Release date [19] |
---|---|---|
0.x | 0.10.2 | 2014-12-29 |
0.11.2 | 2015-05-04 | |
0.12.0 | 2015-10-27 | |
0.13.0 | 2016-01-18 | |
0.14.2 | 2016-06-09 | |
0.15.2 | 2016-10-23 | |
0.16.0 | 2017-01-08 | |
0.17.2 | 2017-09-07 | |
0.18.0 | 2018-03-01 | |
0.19.6 | 2019-05-13 | |
0.20.2 | 2019-06-17 | |
1.0 | 1.0.0 | 2019-09-23 |
1.0.10 | 2020-10-27 | |
1.2 | 1.2.0 | 2020-04-03 |
1.2.18 | 2022-02-09 | |
1.4 | 1.4.0 | 2020-10-16 |
1.4.8 | 2021-05-25 | |
1.6 | 1.6.0 | 2021-10-19 |
1.6.20 | 2024-04-16 | |
2.0 | 2.0.0 | 2023-08-01 |
2.0.8 | 2024-07-03 | |
Legend: Old version Older version, still maintained Latest version | ||
For each 0.x branch, only the latest point release is listed. For later branches, the first and the latest point release is listed. |
Nim's initial development was started in 2005 by Andreas Rumpf. It was originally named Nimrod when the project was made public in 2008. [20] : 4–11
The first version of the Nim compiler was written in Pascal using the Free Pascal compiler. [21] In 2008, a version of the compiler written in Nim was released. [22] The compiler is free and open-source software, and is being developed by a community of volunteers working with Andreas Rumpf. [23] The language was officially renamed from Nimrod to Nim with the release of version 0.10.2 in December 2014. [24] On September 23, 2019, version 1.0 of Nim was released, signifying the maturing of the language and its toolchain. On August 1st, 2023, version 2.0 of Nim was released, signifying the completion, stabilization of, and switch to the ARC/ORC memory model. [25]
![]() | This section needs expansion. You can help by adding to it. (February 2018) |
The syntax of Nim resembles that of Python. [26] Code blocks and nesting statements are identified through use of whitespace, according to the offside-rule. Many keywords are identical to their Python equivalents, which are mostly English keywords, whereas other programming languages usually use punctuation. With the goal of improving upon its influence languages, even though Nim supports indentation-based syntax like Python, it introduced additional flexibility. For example, a single statement may span multiple lines if a comma or binary operator is at the end of each line. Nim also supports user-defined operators.
Unlike Python, Nim implements (native) static typing. Nim's type system allows for easy type conversion, casting, and provides syntax for generic programming. Nim notably provides type classes which can stand in for multiple types, and provides several such type classes 'out of the box'. Type classes allow working with several types as if they were a single type. For example:
openarray
– Represents arrays of different sizes, sequences, and stringsSomeSignedInt
– Represents all the signed integer typesSomeInteger
– Represents all the Integer types, signed or notSomeOrdinal
– Represents all the basic countable and ordered types, except of non integer numberThis code sample demonstrates the use of typeclasses in Nim]
# Let's declare a function that takes any type of number and displays its double# In Nim functions with side effect are called "proc"proctimesTwo(i:SomeNumber)=echoi*2
# Let's write another function that takes any ordinal type, and returns# the double of the input in its original type, if it is a number;# or returns the input itself otherwise.# We use a generic Type(T), and precise that it can only be an OrdinalfunctwiceIfIsNumber[T:SomeOrdinal](i:T):T=whenTisSomeNumber:# A `when` is an `if` evaluated during compile timeresult=i*2# You can also write `return i * 2`else:# If the Ordinal is not a number it is converted to int,# multiplied by two, and reconverted to its based typeresult=(i.int*2).T
echotwiceIfIsNumber(67)# Passes an int to the function
echo twiceIfIsNumber(67u8) # Passes an uint8
echotwiceIfIsNumber(true)# Passes a bool (Which is also an Ordinal)
According to the language creator, Nim was conceived to combine the best parts of Ada typing system, Python flexibility, and powerful Lisp macro system. [27]
Nim was influenced by specific characteristics of existing languages, including the following:
Nim supports Uniform Function Call Syntax (UFCS) [28] and identifier equality, which provides a large degree of flexibility in use.
For example, each of these lines print "hello world", just with different syntax:
echo"hello world"echo("hello world")"hello world".echo()"hello world".echoecho("hello"," world")"hello".echo(" world")"hello".echo" world"
Nim is almost fully style-insensitive; two identifiers are considered equal if they only differ by capitalization and underscores, as long as the first characters are identical. This is to enable a mixture of styles across libraries: one user can write a library using snake_case as a convention, and it can be used by a different user in a camelCase style without issue. [29]
constuseHttps=trueassertuseHttps==useHttpsassertuseHTTPS==useHttpsassertuse_https==useHttps
The stropping feature allows the use of any name for variables or functions, even when the names are reserved words for keywords. An example of stropping is the ability to define a variable named if
, without clashing with the keyword if
. Nim's implementation of this is achieved via backticks, allowing any reserved word to be used as an identifier. [30]
typeType=object`int`:intlet`object`=Type(`int`:9)assert`object`isTypeassert`object`.`int`==9var`var`=42let`let`=8assert`var`+`let`==50const`assert`=trueassert`assert`
The Nim compiler emits fast, optimized C code by default. It defers compiling-to-object code to an external C compiler [31] to leverage existing compiler optimization and portability. Many C compilers are supported, including Clang, Microsoft Visual C++ (MSVC), MinGW, and GNU Compiler Collection (GCC). The Nim compiler can also emit C++, Objective-C, and JavaScript code to allow easy interfacing with application programming interfaces (APIs) written in those languages; [9] developers can simply write in Nim, then compile to any supported language. This also allows writing applications for iOS and Android. There is also an unofficial LLVM backend, allowing use of the Nim compiler in a stand-alone way. [18]
The Nim compiler is self-hosting, meaning it is written in the Nim language. [32] The compiler supports cross-compiling, so it is able to compile software for any of the supported operating systems, no matter the development machine. This is useful for compiling applications for embedded systems, and for uncommon and obscure computer architectures.[ citation needed ]
By default, the Nim compiler creates a debug build. [33] With the option -d:release
a release build can be created, which is optimized for speed and contains fewer runtime checks. [33] With the option -d:danger
all runtime checks can be disabled, if maximum speed is desired. [33]
Nim supports multiple memory management strategies, including the following: [34]
--mm:arc
– Automatic reference counting (ARC) with move semantics optimizations, offers a shared heap. It offers fully deterministic performance for hard realtime systems. [35] Reference cycles may cause memory leaks: these may be dealt with by manually annotating {.acyclic.}
pragmas or by using --mm:orc
.--mm:orc
– Same as --mm:arc
but adds a cycle collector (the "O") based on "trial deletion". [36] The cycle collector only analyzes types if they are potentially cyclic.--mm:refc
– Standard deferred reference counting based garbage collector with a simple mark-and-sweep backup GC in order to collect cycles. Heaps are thread-local.--mm:markAndSweep
– Simple mark-and-sweep based garbage collector. Heaps are thread-local.--mm:boehm
– Boehm based garbage collector, it offers a shared heap.--mm:go
– Go's garbage collector, useful for interoperability with Go. Offers a shared heap.--mm:none
– No memory management strategy nor a garbage collector. Allocated memory is simply never freed, unless manually freed by the developer's code.As of Nim 2.0, ORC is the default GC. [37]
Many tools are bundled with the Nim install package, including:
Nimble is the standard package manager used by Nim to package Nim modules. [38] It was initially developed by Dominik Picheta, who is also a core Nim developer. Nimble has been included as Nim's official package manager since Oct 27, 2015, the v0.12.0 release. [39]
Nimble packages are defined by .nimble
files, which contain information about the package version, author, license, description, dependencies, and more. [20] : 132 These files support a limited subset of the Nim syntax called NimScript, with the main limitation being the access to the FFI. These scripts allow changing of test procedure, or for custom tasks to be written.
The list of packages is stored in a JavaScript Object Notation (JSON) file which is freely accessible in the nim-lang/packages repository on GitHub. This JSON file provides Nimble with a mapping between the names of packages and their Git or Mercurial repository URLs.
Nimble comes with the Nim compiler. Thus, it is possible to test the Nimble environment by running: nimble -v
. This command will reveal the version number, compiling date and time, and Git hash of nimble. Nimble uses the Git package, which must be available for Nimble to function properly. The Nimble command-line is used as an interface for installing, removing (uninstalling), and upgrading–patching module packages. [20] : 130–131
c2nim is a source-to-source compiler (transcompiler or transpiler) meant to be used on C/C++ headers to help generate new Nim bindings. [40] The output is human-readable Nim code that is meant to be edited by hand after the translation process.
koch is a maintenance script that is used to build Nim, and provide HTML documentation. [41]
nimgrep is a generic tool for manipulating text. It is used to search for regex, peg patterns, and contents of directories, and it can be used to replace tasks. It is included to assist with searching Nim's style-insensitive identifiers. [42]
nimsuggest is a tool that helps any source code editor query a .nim
source file to obtain useful information like definition of symbols or suggestions for completions. [43]
niminst is a tool to generate an installer for a Nim program. [44] It creates .msi installers for Windows via Inno Setup, and install and uninstall scripts for Linux, macOS, and Berkeley Software Distribution (BSD).
nimpretty is a source code beautifier, used to format code according to the official Nim style guide. [45]
Testament is an advanced automatic unit tests runner for Nim tests. Used in developing Nim, it offers process isolation tests, generates statistics about test cases, supports multiple targets and simulated Dry-Runs, has logging, can generate HTML reports, can skip tests from a file, and more.
Some notable tools not included in the Nim distribution include:
choosenim was developed by Dominik Picheta, creator of the Nimble package manager, as a tool to enable installing and using multiple versions of the Nim compiler. It downloads any Nim stable or development compiler version from the command line, enabling easy switching between them. [46]
nimpy is a library that enables convenient Python integration in Nim programs. [47]
pixie is a feature-rich 2D graphics library, similar to Cairo or the Skia. It uses SIMD acceleration to speed-up image manipulation drastically. It supports many image formats, blending, masking, blurring, and can be combined with the boxy library to do hardware accelerated rendering.
nimterop is a tool focused on automating the creation of C/C++ wrappers needed for Nim's foreign function interface. [48]
Pure libraries are modules written in Nim only. They include no wrappers to access libraries written in other programming languages.
Impure libraries are modules of Nim code which depend on external libraries that are written in other programming languages such as C.
The Nim standard library includes modules for all basic tasks, including: [49]
A Nim program can use any library which can be used in a C, C++, or JavaScript program. Language bindings exist for many libraries, including GTK, [50] [51] Qt QML, [52] wxWidgets, [53] SDL 2, [54] [55] Raylib, [56] Godot, [57] UE5, [58] Cairo, [59] OpenGL, [60] Vulkan, [61] WinAPI, [62] zlib, libzip, OpenSSL and cURL. [63] Nim works with PostgreSQL, MySQL, and SQLite databases.
There are open source tools of various degree of support that can be used to interface Nim with Lua, [64] Julia, [65] Rust, [66] C#, [67] and Python [68] programming languages or transpile Nim to TypeScript. [69]
The "Hello, World!" program in Nim:
echo("Hello, World!")# Procedures can be called with no parenthesesecho"Hello, World!"
Another version of "Hello World" can be accomplished by calling the write
function with the stdout
stream:
stdout.write("Hello, World!\n")write(stdout,"Hello, World!\n")
Several implementations of the Fibonacci function, showcasing implicit returns, default parameters, iterators, recursion, and while loops:
procfib(n:Natural):Natural=ifn<2:returnnelse:returnfib(n-1)+fib(n-2)funcfib2(n:int,a=0,b=1):int=ifn==0:aelse:fib2(n-1,b,a+b)iteratorfib3:int=vara=0varb=1whiletrue:yieldaswapa,bb+=a
Program to calculate the factorial of a positive integer using the iterative approach, showcasing try/catch error handling and for loops:
importstd/strutilsvarn=0try:stdout.write"Input positive integer number: "n=stdin.readline.parseIntexceptValueError:raisenewException(ValueError,"You must enter a positive number")varfact=1foriin2..n:fact=fact*iechofact
Using the module math from Nim's standard library:
importstd/mathechofac(x)
A simple demonstration showing the implicit result variable and the use of iterators.
procreverse(s:string):string=foriincountdown(s.high,0):result.adds[i]letstr1="Reverse This!"echo"Reversed: ",reverse(str1)
One of Nim's more exotic features is the implicit result
variable. Every procedure in Nim with a non-void return type has an implicit result variable that represents the value to be returned. In the for loop we see an invocation of countdown
which is an iterator. If an iterator is omitted, the compiler will attempt to use an items
iterator, if one is defined for the type specified.
Using GTK 3 with GObject introspection through the gintro module:
importgintro/[gtk,glib,gobject,gio]procappActivate(app:Application)=letwindow=newApplicationWindow(app)window.title="GTK3 application with gobject introspection"window.defaultSize=(400,400)showAll(window)procmain=letapp=newApplication("org.gtk.example")connect(app,"activate",appActivate)discardrun(app)main()
This code requires the gintro module to work, which is not part of the standard library. To install the module gintro and many others you can use the tool nimble, which comes as part of Nim. To install the gintro module with nimble you do the following:
nimble install gintro
Functional programming is supported in Nim through first-class functions and code without side effects via the noSideEffect
pragma or the func
keyword. [70] Nim will perform side effect analysis and raise compiling errors for code that does not obey the contract of producing no side effects when compiled with the experimental feature strictFuncs
, planned to become the default in later versions. [71]
Contrary to purely functional programming languages, Nim is a multi-paradigm programming language, so functional programming restrictions are opt-in on a function-by-function basis.
Nim supports first-class functions by allowing functions to be stored in variables or passed anonymously as parameters to be invoked by other functions. [72] The std/sugar
module provides syntactic sugar for anonymous functions in type declarations and instantiation.
importstd/[sequtils,sugar]letpowersOfTwo=@[1,2,4,8,16,32,64,128,256]procfilter[T](s:openArray[T],pred:T->bool):seq[T]=result=newSeq[T]()foriin0..<s.len:ifpred(s[i]):result.add(s[i])echopowersOfTwo.filter(proc(x:int):bool=x>32)# syntactic sugar for the above, provided as a macro from std/sugarechopowersOfTwo.filter(x=>x>32)procgreaterThan32(x:int):bool=x>32echopowersOfTwo.filter(greaterThan32)
Side effects of functions annotated with the noSideEffect
pragma are checked, and the compiler will refuse to compile functions failing to meet those. Side effects in Nim include mutation, global state access or modification, asynchronous code, threaded code, and IO. Mutation of parameters may occur for functions taking parameters of var
or ref
type: this is expected to fail to compile with the currently-experimental strictFuncs
in the future. [73] The func
keyword introduces a shortcut for a noSideEffect
pragma. [74]
<syntaxhighlight lang="nim" class="" id="" style="background:none; border:none; color:inherit; padding: 0px 0px;" inline="1">func binarySearch[T](a: openArray[T]; elem: T): int</syntaxhighlight> # is short for... <syntaxhighlight lang="nim" class="" id="" style="background:none; border:none; color:inherit; padding: 0px 0px;" inline="1">proc binarySearch[T](a: openArray[T]; elem: T): int</syntaxhighlight> {.noSideEffect.} {.experimental: "strictFuncs".} <syntaxhighlight lang="nim" class="" id="" style="background:none; border:none; color:inherit; padding: 0px 0px;" inline="1">type</syntaxhighlight> <syntaxhighlight lang="nim" class="" id="" style="background:none; border:none; color:inherit; padding: 0px 0px;" inline="1">Node = ref object</syntaxhighlight> <syntaxhighlight lang="nim" class="" id="" style="background:none; border:none; color:inherit; padding: 0px 0px;" inline="1">le, ri: Node</syntaxhighlight> <syntaxhighlight lang="nim" class="" id="" style="background:none; border:none; color:inherit; padding: 0px 0px;" inline="1">data: string</syntaxhighlight> <syntaxhighlight lang="nim" class="" id="" style="background:none; border:none; color:inherit; padding: 0px 0px;" inline="1">func len(n: Node): int =</syntaxhighlight> # valid: len does not have side effects <syntaxhighlight lang="nim" class="" id="" style="background:none; border:none; color:inherit; padding: 0px 0px;" inline="1">var it = n</syntaxhighlight> <syntaxhighlight lang="nim" class="" id="" style="background:none; border:none; color:inherit; padding: 0px 0px;" inline="1">while it != nil:</syntaxhighlight> <syntaxhighlight lang="nim" class="" id="" style="background:none; border:none; color:inherit; padding: 0px 0px;" inline="1">inc result</syntaxhighlight> <syntaxhighlight lang="nim" class="" id="" style="background:none; border:none; color:inherit; padding: 0px 0px;" inline="1">it = it.ri</syntaxhighlight> <syntaxhighlight lang="nim" class="" id="" style="background:none; border:none; color:inherit; padding: 0px 0px;" inline="1">func mut(n: Node) =</syntaxhighlight> <syntaxhighlight lang="nim" class="" id="" style="background:none; border:none; color:inherit; padding: 0px 0px;" inline="1">let m = n # is the statement that connected the mutation to the parameter</syntaxhighlight> <syntaxhighlight lang="nim" class="" id="" style="background:none; border:none; color:inherit; padding: 0px 0px;" inline="1">m.data = "yeah" # the mutation is here</syntaxhighlight> <syntaxhighlight lang="nim" class="" id="" style="background:none; border:none; color:inherit; padding: 0px 0px;" inline="1"># Error: 'mut' can have side effects</syntaxhighlight> <syntaxhighlight lang="nim" class="" id="" style="background:none; border:none; color:inherit; padding: 0px 0px;" inline="1"># an object reachable from 'n' is potentially mutated</syntaxhighlight>
Uniform function call syntax allows for the chaining of arbitrary functions, perhaps best exemplified with the std/sequtils
library. [75]
importstd/[sequtils,sugar]letnumbers=@[1,2,3,4,5,6,7,8,7,6,5,4,3,2,1]# a and b are special identifiers in the foldr macroechonumbers.filter(x=>x>3).deduplicate.foldr(a+b)# 30
Nim has support for product types via the object
type, and for sum types via object variants: raw representations of tagged unions, with an enumerated type tag that must be safely matched upon before fields of variants can be accessed. [76] These types can be composed algebraically. Structural pattern matching is available, but regulated to macros in various third-party libraries. [77]
importstd/tablestypeValue=uint64Ident=stringExprKind=enumLiteral,Variable,Abstraction,ApplicationExpr=refobjectcasekind:ExprKindofLiteral:litIdent:ValueofVariable:varIdent:IdentofAbstraction:paramAbs:IdentfuncAbs:ExprofApplication:funcApp,argApp:Exprfunceval(expr:Expr,context:varTable[Ident,Value]):Value=caseexpr.kindofLiteral:returnexpr.litIdentofVariable:returncontext[expr.varIdent]ofApplication:caseexpr.funcApp.kindofAbstraction:context[expr.funcApp.paramAbs]=expr.argApp.eval(context)returnexpr.funcAbs.eval(context)else:raisenewException(ValueError,"Invalid expression!")else:raisenewException(ValueError,"Invalid expression!")
Despite being primarily an imperative and functional language, Nim supports various features for enabling object-oriented paradigms. [78] [79]
Nim supports limited inheritance by use of ref objects
and the of
keyword. [79] To enable inheritance, any initial ("root") object must inherit from RootObj
. Inheritance is of limited use within idiomatic Nim code: with the notable exception of Exceptions. [80]
typeAnimal=refobjectofRootObjname:stringage:inttypeDog=refobjectofAnimaltypeCat=refobjectofAnimalvaranimals:seq[Animal]=@[]animals.add(Dog(name:"Sparky",age:10))animals.add(Cat(name:"Mitten",age:10))forainanimals:assertaofAnimal
Subtyping relations can also be queried with the of
keyword. [79]
Nim's uniform function call syntax enables calling ordinary functions with syntax similar to method call invocations in other programming languages. This is functional for "getters": and Nim also provides syntax for the creation of such "setters" as well. Objects may be made public on a per-field basis, providing for encapsulation.
typeSocket*=refobjecthost:int# private, lacks export marker# getter of host addressprochost*(s:Socket):int=s.host# setter of host addressproc`host=`*(s:varSocket,value:int)=s.host=valuevars:Socketnewsasserts.host==0# same as host(s), s.host()s.host=34# same as `host=`(s, 34)
Static dispatch is preferred, more performant, and standard even among method-looking routines. [79] Nonetheless, if dynamic dispatch is so desired, Nim provides the method
keyword for enabling dynamic dispatch on reference types.
importstd/strformattypePerson=refobjectofRootObjname:stringStudent=refobjectofPersonTeacher=refobjectofPersonmethodintroduce(a:Person)=raisenewException(CatchableError,"Method without implementation override")methodintroduce(a:Student)=echo&"I am a student named {a.name}!"methodintroduce(a:Teacher)=echo&"I am a teacher named {a.name}!"letpeople:seq[Person]=@[Teacher(name:"Alice"),Student(name:"Bob")]forpersoninpeople:person.introduce()
Nim supports simple substitution on the abstract syntax tree via its templates.
templategenType(name,fieldname:untyped,fieldtype:typedesc)=typename=objectfieldname:fieldtypegenType(Test,foo,int)varx=Test(foo:4566)echo(x.foo)# 4566
The genType
is invoked at compile-time and a Test
type is created.
Nim supports both constrained and unconstrained generic programming. Generics may be used in procedures, templates and macros. Unconstrained generic identifiers (T
in this example) are defined after the routine's name in square brackets. Constrained generics can be placed on generic identifiers, or directly on parameters.
procaddThese[T](a,b:T):T=a+bechoaddThese(1,2)# 3 (of int type)echoaddThese(uint81,uint82)# 3 (of uint8 type)# we don't want to risk subtracting unsigned numbers!procsubtractThese[T:SomeSignedInt|float](a,b:T):T=a-bechosubtractThese(1,2)# -1 (of int type)importstd/sequtils# constrained generics can also be directly on the parametersproccompareThese[T](a,b:string|seq[T]):bool=for(i,j)inzip(a,b):ifi!=j:returnfalse
One can further clarify which types the procedure will accept by specifying a type class (in the example above, SomeSignedInt
). [81]
Macros can rewrite parts of the code at compile-time. Nim macros are powerful and can operate on the abstract syntax tree before or after semantic checking. [82]
Here's a simple example that creates a macro to call code twice:
importstd/macrosmacrotwice(arg:untyped):untyped=result=quotedo:`arg``arg`twiceecho"Hello world!"
The twice
macro in this example takes the echo statement in the form of an abstract syntax tree as input. In this example we decided to return this syntax tree without any manipulations applied to it. But we do it twice, hence the name of the macro. The result is that the code gets rewritten by the macro to look like the following code at compile time:
echo"Hello world!"echo"Hello world!"
Nim's FFI is used to call functions written in the other programming languages that it can compile to. This means that libraries written in C, C++, Objective-C, and JavaScript can be used in the Nim source code. One should be aware that both JavaScript and C, C++, or Objective-C libraries cannot be combined in the same program, as they are not as compatible with JavaScript as they are with each other. Both C++ and Objective-C are based on and compatible with C, but JavaScript is incompatible, as a dynamic, client-side web-based language. [20] : 226
The following program shows the ease with which external C code can be used directly in Nim.
procprintf(formatstr:cstring){.header:"<stdio.h>", varargs.}printf("%s %d\n","foo",5)
In this code the printf
function is imported into Nim and then used.
Basic example using 'console.log' directly for the JavaScript compiling target:
proclog(args:any){.importjs:"console.log(@)", varargs.}log(42,"z",true,3.14)
The JavaScript code produced by the Nim compiler can be executed with Node.js or a web browser.
![]() | This section needs expansion. You can help by adding to it. (June 2019) |
To activate threading support in Nim, a program should be compiled with --threads:on
command line argument. Each thread has a separate garbage collected heap and sharing of memory is restricted, which helps with efficiency and stops race conditions by the threads.
importstd/locksvarthr:array[0..4,Thread[tuple[a,b:int]]]L:LockprocthreadFunc(interval:tuple[a,b:int]){.thread.}=foriininterval.a..interval.b:acquire(L)# lock stdoutechoirelease(L)initLock(L)foriin0..high(thr):createThread(thr[i],threadFunc,(i*10,i*10+5))joinThreads(thr)
Nim also has a channels
module that simplifies passing data between threads.
importstd/ostypeCalculationTask=objectid*:intdata*:intCalculationResult=objectid*:intresult*:intvartask_queue:Channel[CalculationTask]varresult_queue:Channel[CalculationResult]procworkerFunc(){.thread.}=result_queue.open()whiletrue:vartask=task_queue.recv()result_queue.send(CalculationResult(id:task.id,result:task.data*2))varworkerThread:Thread[void]createThread(workerThread,workerFunc)task_queue.open()task_queue.send(CalculationTask(id:1,data:13))task_queue.send(CalculationTask(id:2,data:37))whiletrue:echo"got result: ",repr(result_queue.recv())
![]() | This section needs expansion. You can help by adding to it. (June 2019) |
Asynchronous IO is supported either via the asyncdispatch
module in the standard library or the external chronos
library. [83] Both libraries add async/await syntax via the macro system, without need for special language support. An example of an asynchronous HTTP server:
importstd/[asynchttpserver,asyncdispatch]# chronos could also be alternatively used in place of asyncdispatch,# with no other changes.varserver=newAsyncHttpServer()proccb(req:Request){.async.}=awaitreq.respond(Http200,"Hello World")waitForserver.serve(Port(8080),cb)
Nim has an active community on the self-hosted, self-developed official forum. [84] Further, the project uses a Git repository, bug tracker, RFC tracker, and wiki hosted by GitHub, where the community engages with the language. [85] There are also official online chat rooms, bridged between IRC, Matrix, Discord, Gitter, and Telegram. [86]
The first Nim conference, NimConf, took place on June 20, 2020. It was held digitally due to COVID-19, with an open call for contributor talks in the form of YouTube videos. [87] The conference began with language overviews by Nim developers Andreas Rumpf and Dominik Picheta. Presentation topics included talks about web frameworks, mobile development, Internet of things (IoT) devices, and game development, including a talk about writing Nim for Game Boy Advance. [88] NimConf 2020 is available as a YouTube playlist. [89] NimConf 2021 occurred the following year, was also held digitally, and included talks about game development, REPLs, real-time operating systems, Nim in the industry, object-relational mapping (ORM), fuzzing, language design, and graphics libraries. [90]
In addition to official conferences, Nim has been featured at various other conventions. A presentation on Nim was given at the O'Reilly Open Source Convention (OSCON) in 2015. [91] [92] [93] Four speakers represented Nim at FOSDEM 2020, including the creator of the language, Andreas Rumpf. [94] At FOSDEM 2022, Nim hosted their own developer room virtually due to the COVID-19 pandemic. [95] Talks were held on concurrency, embedded programming, programming for GPUs, entity-component systems, game development, rules engines, Python interop, and metaprogramming. [96]
D, also known as dlang, is a multi-paradigm system programming language created by Walter Bright at Digital Mars and released in 2001. Andrei Alexandrescu joined the design and development effort in 2007. Though it originated as a re-engineering of C++, D is now a very different language drawing inspiration from other high-level programming languages, notably Java, Python, Ruby, C#, and Eiffel.
In mathematics and computer science, a higher-order function (HOF) is a function that does at least one of the following:
In computer programming, a function object is a construct allowing an object to be invoked or called as if it were an ordinary function, usually with the same syntax. In some languages, particularly C++, function objects are often called functors.
In mathematics and in computer programming, a variadic function is a function of indefinite arity, i.e., one which accepts a variable number of arguments. Support for variadic functions differs widely among programming languages.
In computer science, function composition is an act or mechanism to combine simple functions to build more complicated ones. Like the usual composition of functions in mathematics, the result of each function is passed as the argument of the next, and the result of the last one is the result of the whole.
Scala is a strong statically typed high-level general-purpose programming language that supports both object-oriented programming and functional programming. Designed to be concise, many of Scala's design decisions are intended to address criticisms of Java.
Haxe is a high-level cross-platform programming language and compiler that can produce applications and source code for many different computing platforms from one code-base. It is free and open-source software, released under an MIT License. The compiler, written in OCaml, is released under the GNU General Public License (GPL) version 2.
C++11 is a version of the ISO/IEC 14882 standard for the C++ programming language. C++11 replaced the prior version of the C++ standard, called C++03, and was later replaced by C++14. The name follows the tradition of naming language versions by the publication year of the specification, though it was formerly named C++0x because it was expected to be published before 2010.
In computer programming, an anonymous function is a function definition that is not bound to an identifier. Anonymous functions are often arguments being passed to higher-order functions or used for constructing the result of a higher-order function that needs to return a function. If the function is only used once, or a limited number of times, an anonymous function may be syntactically lighter than using a named function. Anonymous functions are ubiquitous in functional programming languages and other languages with first-class functions, where they fulfil the same role for the function type as literals do for other data types.
Vala is an object-oriented programming language with a self-hosting compiler that generates C code and uses the GObject system.
The syntax and semantics of PHP, a programming language, form a set of rules that define how a PHP program can be written and interpreted.
Go is a statically typed, compiled high-level programming language designed at Google by Robert Griesemer, Rob Pike, and Ken Thompson. It is syntactically similar to C, but also has memory safety, garbage collection, structural typing, and CSP-style concurrency. It is often referred to as Golang because of its former domain name, golang.org
, but its proper name is Go.
Nemerle is a general-purpose, high-level, statically typed programming language designed for platforms using the Common Language Infrastructure (.NET/Mono). It offers functional, object-oriented, aspect-oriented, reflective and imperative features. It has a simple C#-like syntax and a powerful metaprogramming system.
Seed7 is an extensible general-purpose programming language designed by Thomas Mertes. It is syntactically similar to Pascal and Ada. Along with many other features, it provides an extension mechanism. Seed7 supports introducing new syntax elements and their semantics into the language, and allows new language constructs to be defined and written in Seed7. For example, programmers can introduce syntax and semantics of new statements and user defined operator symbols. The implementation of Seed7 differs significantly from that of languages with hard-coded syntax and semantics.
Parallel Specification and Implementation Language (ParaSail) is an object-oriented parallel programming language. Its design and ongoing implementation is described in a blog and on its official website.
In computer programming, the async/await pattern is a syntactic feature of many programming languages that allows an asynchronous, non-blocking function to be structured in a way similar to an ordinary synchronous function. It is semantically related to the concept of a coroutine and is often implemented using similar techniques, and is primarily intended to provide opportunities for the program to execute other code while waiting for a long-running, asynchronous task to complete, usually represented by promises or similar data structures. The feature is found in C#, C++, Python, F#, Hack, Julia, Dart, Kotlin, Rust, Nim, JavaScript, and Swift.
Swift is a high-level general-purpose, multi-paradigm, compiled programming language created by Chris Lattner in 2010 for Apple Inc. and maintained by the open-source community. Swift compiles to machine code and uses an LLVM-based compiler. Swift was first released in June 2014 and the Swift toolchain has shipped in Xcode since version 6, released in 2014.
Uniform Function Call Syntax (UFCS) or Uniform Call Syntax (UCS) or sometimes Universal Function Call Syntax is a programming language feature in D, Nim, Koka, and Effekt that allows any function to be called using the syntax for method calls, by using the receiver as the first parameter and the given arguments as the remaining parameters. The same technique is used in the AviSynth scripting language under the name "OOP notation".
Ballerina is an open source general-purpose programming language designed by WSO2 for cloud-era application programmers.
Zig is an imperative, general-purpose, statically typed, compiled system programming language designed by Andrew Kelley. It is intended as a successor to the language C, with the intent of being even smaller and simpler to program in, while offering more function. It is free and open-source software, released under an MIT License.
{{cite web}}
: Missing or empty |title=
(help){{cite web}}
: CS1 maint: numeric names: authors list (link)