There isn't direct support for Android yet, but since Nim compiles to C, you
could use the Android NDK. [See this thread](https://forum.nim-lang.org/t/3575).
> [https://www.youtube.com/watch?v=pXhcPJK5cMc](https://www.youtube.com/watch?v=pXhcPJK5cMc)
There is a port of docopt to Nim:
[https://github.com/docopt/docopt.nim](https://github.com/docopt/docopt.nim)
Think of this forum as a minimalist server API (with a little bit of HTML
parsing).
Write your own client libraries, tools, JSON / FUSE / SQL interfaces, vim /
emacs / WordPerfect integrations, and bots.
The biggest thing that would reduce compile time is putting the compiler on a
(quantum?) supercomputer in the cloud...
[https://www.youtube.com/watch?v=pXhcPJK5cMc](https://www.youtube.com/watch?v=pXhcPJK5cMc)
I'll leave it at that.
Enum are mutually exclusive but you can create predefined sets from the enums.
Regarding compile-time defines, my main issue is that a lot are hidden.
There is this wiki documentation:
**I want to write a game like:**
* * *
* Wolfenstein 3D
* Doom
* Duke Nukem 3D
* * *
**Can I recreate these games with Nim, but for Android OS?**
@timothee - @amalek beat me to the punch, but user-visible compilation time is
very sensitive to backend compiler/gcc options. Consider two invocations
compiling my [cligen](https://github.com/c-blake/cligen) test suite (30
programs with somewhat complex macros running at compile-time):
As tewtzel59 said, Nim usually compiles to C (and I guess that's what most
people who program in Nim use). Even if modules were to be added to C, it
wouldn't happen before
2022[[1](http://www.open-std.org/JTC1/SC22/WG14/www/docs/n2086.htm)], which is
when the new standard will probably be
...and there is count in sequtils:
[https://nim-lang.org/docs/sequtils.html#count,openArray[T],T](https://nim-lang.org/docs/sequtils.html#count,openArray\[T\],T)
The biggest and most pressing issue wrt compilation speed is the unfinished
`--symbolFiles` feature. "symbolfiles" has become my term for "incremental
compilation", its latest incarnation uses a database to store intermediate
compilation fragments on a module granularity. Only modules that have
use fill proc,
[https://nim-lang.org/docs/algorithm.html#fill,openArray[T],Natural,Natural,T](https://nim-lang.org/docs/algorithm.html#fill,openArray\[T\],Natural,Natural,T)
I have this code where I'm setting all the bytes in `seg` to `0`.
for b in s_row..s_row+KB-1: seg[b] = 0
Can I do something like: `seg[a..b] = 0`
Then I have this code that counts all the `0` in `seg`
for k in 0..Kn-1: (if seg[s_row+k] == 0: sum += 1)
Is
In the last few months I haven't really kept up with the C++ world, so I hadn't
heard of this new feature. I see it was in fact proposed way back in 2014?
(According to Wikipedia)...
Anyway, for this to work, several things must be considered
* What about **C**? Nim often compiles to C, not
14 matches
Mail list logo
