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
use an array to store presenter dependencies and keep them sorted
sorted_set stopped working in Ruby after internal Set changes (changes description: https://bugs.ruby-lang.org/issues/21216, https://rubyreferences.github.io/rubychanges/4.0.html#set).
Set subclasses cannot use `@hash` anymore, which breaks the way `sorted_set` works (it replaces `@hash` with a red-black tree from `rbtree`).
We need to preserve an ordered list of dependencies to build the same cache key every time (introduced in this commit: e132533).
Since these lists are pretty short, and updates of these lists don’t happen on a hot path, an array that preserves the order is good enough. We will maintain uniqueness and sort order in both methods that update this array.
0 commit comments