The examples I saw for sorting OrderedTable were for the key, not sorting by
the value, so I'm not sure if what I need can be done with an OrderedTable.
Thanks, I'll probably just a seq of tuples.
I have a table:
> my_table: Table[int, string]
How do I sort by the table by the value field?
It could be that the optimizer somehow realizes that your loop will never do
anything meaningful and never runs it.
When performing benchmarks previously in C/C++ I noticed that lookup operations
on vectors were extremely fast, so fast that I thought that perhaps the code
didn't run. All of these tests only performed a simple operation(s) in a loop,
similar to what you are doing. I think it has to do with
Ok, but the general idea is the same, of using an underscore to differentiate
code from the typical meaning. To me it's easier to read than those quotes the
DSL currently uses.
What does a multi-line where clause look like? I couldn't find an example,
especially of a complex where clause, possibly using exists as one of the lines.
It's a pity the from keyword needs to be in single quotation marks. I was
trying to think of an alternative (e.g. source), but then it
A link to an article I wrote:
[https://onlinetechinfo.com/concurrency-and-parallelism-in-nim](https://onlinetechinfo.com/concurrency-and-parallelism-in-nim)
(with lots of links).
Concurrency and parallelism in Nim isn't bad actually:
[https://onlinetechinfo.com/concurrency-and-parallelism-in-nim](https://onlinetechinfo.com/concurrency-and-parallelism-in-nim)/
I wrote an article on the pros and cons of Nim in general:
[https://onlinetechinfo.com/pros-and-cons-of-nim](https://onlinetechinfo.com/pros-and-cons-of-nim)
My opinion is that Nim can handle what you're asking about. The community is
small, but very active and helpful (if you do run into
I'm using Chronicles for logging:
[https://github.com/status-im/nim-chronicles](https://github.com/status-im/nim-chronicles)
Does anyone know how to configure the colors used in logging to the terminal?
Thanks.
Is there a structure or library that I can use for a thread-safe cache? Keys
will be strings.
I have just been researching something similar for string slices. I found this
RFC:
[https://github.com/nim-lang/RFCs/issues/12](https://github.com/nim-lang/RFCs/issues/12)
which lead me to this issue:
[https://github.com/nim-lang/RFCs/issues/178](https://github.com/nim-lang/RFCs/issues/178).
I've tried to summarize the state of Nim's concurrency and parallelism in this
blog post:
[https://onlinetechinfo.com/concurrency-and-parallelism-in-nim/](https://onlinetechinfo.com/concurrency-and-parallelism-in-nim/).
Some of it was based on this discussion.
Are you using Jester or another web framework?
What about: Nim is fast by default?
I've changed that sentence to reflect that C-like performance is always
attainable.
I've started a new blog with three articles on Nim so far:
[https://onlinetechinfo.com/tag/nim](https://onlinetechinfo.com/tag/nim)/
The articles include the top reasons to use Nim, some disadvantages of Nim (for
now) and avoiding Nim gotchas. I will be adding more content during my journey
When compiling Nim how do I specify where to locate the OpenSSL libraries? This
is for the Unix build (I'm building on Mac OS).
My issue goes back to a SIGILL when running Nimble, I've opened an issue here:
19 matches
Mail list logo
