You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Mar 30, 2022. It is now read-only.
When a differentiable value uses heap storage and is multiply-referenced, move(along: directions) will first copy, and then update, the storage, which is inefficient. It should instead create new storage initialized with the result.
If you think about the way this plays out for an Array of differentiable values, you'll see that the only choice the Array currently has is to invoke e.move(along: d), in-place, which causes each element with shared storage to be copied and then updated.
The text was updated successfully, but these errors were encountered:
Sign up for freeto subscribe to this conversation on GitHub.
Already have an account?
Sign in.
When a differentiable value uses heap storage and is multiply-referenced,
move(along: directions)
will first copy, and then update, the storage, which is inefficient. It should instead create new storage initialized with the result.If you think about the way this plays out for an
Array
of differentiable values, you'll see that the only choice theArray
currently has is to invokee.move(along: d)
, in-place, which causes each element with shared storage to be copied and then updated.The text was updated successfully, but these errors were encountered: