Zoey Riordan

updated the code to get rid of dynamic dispatch and restore the original API, but now there are more failures and it actually performs worse :/. I suspect I messed...

I've spent some time optimizing this and I still can't get it faster than the dynamic dispatch implementation of transformations. @newpavlov you're better at optimization than me is there anything...

I have the last field in the transformation set as a small optimization. We're guaranteed to have at least one transformation so it removes one bounds check.

Making transformations general over pixel type has some issues. The first commit in this PR used that and ran into a problem: the last field of the second header is...

It's probably worth it to evaluate what information needs to be exposed to the user. The reason I exposed transformation data is that I sorely missed having it available when...

I had considered using enum for the transformations but it makes the code quite ugly since each operation begins with a match expression. I think the correct thing to do...

As for explicit simd I'm not sure how we would approach that. All the operations tend to be on small sets of data and the flif standard unfortunately makes each...

Looks like there is some SIMD going on in the main repo, although I haven't dug in far enough to see what its used for primarily.

I thought about that option. A better model may be to use some sort of push model for data so we can be given a partial buffer at any given...

As @nmccarty said, this issue is outside the scope of what bincode is intended for. It sounds like in your case you are serializing and transmitting the game state every...