On Fri, Oct 01, 2021 at 06:30:48PM +, Danny Arends via Digitalmars-d-learn
wrote:
[...]
> Is there a sort() algorithm that avoids swapping the items themselves
> and e.g. just returns the indexes so I can reorder the original array
> myself ?
On Friday, 1 October 2021 at 17:53:24 UTC, Steven Schveighoffer
wrote:
I think your struct is different than this, because this only
happens if aliasing is inside the struct being sorted (i.e. it
has pointers). Your presented struct doesn't have pointers, and
the code you linked to is
On 10/1/21 12:44 PM, Danny Arends wrote:
Hey all,
Using a modified 3D A* tile searching algorithm, full code see:
https://github.com/DannyArends/CalderaD/blob/master/src/math/search.d
I get the following AssertError, 'sometimes' but not always on running
the code:
mutation.d(2816): Swap:
Hey all,
Using a modified 3D A* tile searching algorithm, full code see:
https://github.com/DannyArends/CalderaD/blob/master/src/math/search.d
I get the following AssertError, 'sometimes' but not always on
running the code:
mutation.d(2816): Swap: rhs points to lhs.
the first time I hit
