Issues when creating static library on macOS

Are you linking external libraries and if so did you build those or were they provided? You may be running into a versioning issue; `-mmacosx-version-min` flag may be the culprit. Have you tried building a trivial static lib, exporting a proc or two, just to confirm that nim itself builds the

The Salewski Chess Engine is finally available

Great work! Well done! :) I'll definitely have a better look into the code! I've been a lifelong chess addict (and created some 2-3 chess engine - horrible, all of them - at some point), so... I do get the thrill! Have you tried calculating its ELO or having it play with other engines? In any

The Salewski Chess Engine is finally available

After nearly seven years, the successor of nim-chess4 is finally available: The engine is tiny, simple and fast. A minimal GTK4 and GTK3 frontend is available. Feel free to create a GUI frontend with your favorite toolkit.

Ideas for useful/cute little GUI programs?

> Haha sure. Though would it be possible to add json output to choosenim? > Relying on parsing the text output isn’t great. ahh yeah, that is indeed missing and would be good to have.

Why is nimscript interpreted and why the limitations?

If Nimscript were compiled, it would be nim c.

Nim cross-compiled in OpenEmbedded

Ha ha, I didn't even know what "A/B partition" is! Until now, looked it up. As EasyOS is built from cross-compiled packages, it was easy to build aarch64 packages, and consequently I did create an EasyOS for the rpi4. Getting a bit old though. Mostly I write ash/bash shell scripts, some utiliti

Recursively replace pair of bytes with one byte, within given byte array

I don't know if you have to deal with one large ByteArray or many small ones, but this part of your code (the fastest one) is quite expensive: for j,it in a[i..^1]: result[cntr+j] = it result.setLen(cntr + a[i..^1].len) Run My naive implementation i

What's the preferred way to compile nim to WebAssembly?

Hello! Any progress with this?

Does "pushing" overflowCheck's actually work?

The code that was not working (= that was inside a `{.push overflowChecks:on.}` \- `{.pop.}` block, but was not triggering OverflowDefect's) was mainly `^` and `*=` (but not `*` (!?))... so what I did is: * repeat the implementation of these 2 operations' implementation, within the aforementi

Does "pushing" overflowCheck's actually work?

What I need here is the effect of `--checks:off` with `--overflowChecks:on` but only for very specific parts of the program. So, I thought about leaving the `--overflowChecks:on` part out when compiling and just add `.push`/`.pop` for the error, only when I need it: {.push overflow

Why is nimscript interpreted and why the limitations?

> So theoretically nimscript could be a JIT, which would be pretty cool tbh, I > think there's some work in the llvm backend to do that using LLVM's JIT > infrastructure. Currently the Nim VM and Nimscript are fast as Python according to @Araq, and Python is already fast enough for many purpose

Recursively replace pair of bytes with one byte, within given byte array

Exactly! I just didn't want to bother you with too many details while still maintaining the code roughly as it looks. What I'm experimenting with (and it's still an experiment - at least its implementation - that's why it looks so draft-like) is a bytecode optimizer for Arturo. Basically, Art

Nim cross-compiled in OpenEmbedded

Thanks! It’s great to get a recent Nim recipe for OE. Your Linux distro piques my interest too. It looks like it could make a good basis for building custom embedded Linux OSes without setting up OE yourself. I’m curious are you considering Nim for use in EasyOS tooling? I’d be a big fan of tha

Recursively replace pair of bytes with one byte, within given byte array

As he said: > To be perfectly precise, I'm not even substituting A+B with C; what is > actually going on is substituting a range around A + B, with a range around > C... :-)