- From: Kevin Doughty via GitHub <sysbot+gh@w3.org>
- Date: Wed, 15 Nov 2023 14:49:40 +0000
- To: public-css-archive@w3.org
There is no time complexity issue. Converting from an array to a set, testing membership, then converting back to an array is O(3n) which is still linear. There are no leaks, that’s the point of animating to zero. When finished memory can be freed without using a fill mode. What remains to be solved appear to be trivialities. What gets passed to the sort function? Are they elements, IDs, data attributes, or something else? I guess there should be a different sort function per pseudo element for SPAs, but I haven’t looked at that in detail. I’m sorry that I was the one to solve this as the bias seems to be against me and not the proposed algorithm, but there is no other solution except not allowing View Transitions to handle interruption at all, which is inferior and embarassingly backwards looking. -- GitHub Notification of comment by KevinDoughty Please view or discuss this issue at https://github.com/w3c/csswg-drafts/issues/9578#issuecomment-1812678263 using your GitHub account -- Sent via github-notify-ml as configured in https://github.com/w3c/github-notify-ml-config
Received on Wednesday, 15 November 2023 14:49:42 UTC