@helxi I invite you to contribute PR's to
https://github.com/timotheecour/D_vs_nim/ where I discuss feature
parity and how to translate concepts from D to nim wherever it makes

On Fri, Apr 13, 2018 at 4:12 PM, helxi via Digitalmars-d
<digitalmars-d@puremagic.com> wrote:
> On Friday, 10 April 2015 at 18:42:20 UTC, Timothee Cour wrote:
>> Nim looks very promising.
>> Is there any comprehensive comparison against D somewhere (if possible
>> recent) ?
> Nim is way more expressive than D afaik. Consider the following imaginary
> function:
> proc fn[A : int | float; N; B : seq[A] | DoublyLinkedList[A] | array[N, A] |
> set[A]](x: B) : int =
>     return x.len() + 10
> This function takes an argument of type B, which is can be either a vector
> or forward-list or array of (array's length is N, which can be of any
> numeric type) or a set of A. A can be either int or float only.
> Emulating those inline constraints in D would be cumbersome.

Reply via email to