Im wondering what Julians mainly intend or promise when they offer a bang! version of a function:
- Less memory usage?
- Better runtime performance?
- In-place mutation? (my guess)
It feels like that most of the time all of three intentions are satisfied, but I’ve seen algorithms, where the in-place mutation prevents a better runtime performance. To assess those situations it would be great to have clarity on what to expect from the bang!