We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
It would be great if the Span Memory supported linq;
IMHO this would improve the developer experience when slicing/dicing data while preventing heap allocations
The text was updated successfully, but these errors were encountered:
while preventing heap allocations
It's quite rare to hear someone talk about using LINQ to avoid heap allocations. Can you clarify how that would work?
Sorry, something went wrong.
I was thinking eg. a where, orderby could return a linked list of pointers to the readonly span/memory; but not sure if it possible ?
That would require allocations.
If someone wants to use LINQ with Memory<T>, they can do so via MemoryMarshal.ToEnumerable(). Given that, I'm going to close this. Thanks.
Memory<T>
MemoryMarshal.ToEnumerable()
You can use eager computations for Span using LinqFaster https://github.com/jackmott/LinqFaster
No branches or pull requests
It would be great if the Span Memory supported linq;
IMHO this would improve the developer experience when slicing/dicing
data while preventing heap allocations
The text was updated successfully, but these errors were encountered: