When you apply a new snapshot to UICollectionViewDiffableDataSource, how does it compute the inserts, deletes, and moves? And why do item identifiers have to be Hashable?
It matches the identifier sets by hash to extract deletes, inserts, and moves in close to O(n) (a Heckel style approach). The identifier is the item's identity, so it has to be Hashable.
UIKitMultiple choiceAdvanced
Which statements about using UICollectionViewDiffableDataSource are correct? Pick all…
#hashable #collectionview
CS fundamentals and algorithmsShort answerBasics
If you had to implement a hash map yourself, how would you build it?
#hashable
CS fundamentals and algorithmsMultiple choiceBasics
What problem does this type cause when you put it in a Set? …
#hashable
CS fundamentals and algorithmsShort answerExpert
You're writing a custom vertical layout (a UICollectionViewLayout subclass) where every…
#collectionview