-
Notifications
You must be signed in to change notification settings - Fork 90
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[Feature Request] Grouping Similar Elements #80
Comments
Here's how the algorithm works right now:
I think trying to create various group combinations for elements and looking for their selectors would add too much complexity. The problem is, that with each additional combination the total number of selectors that need to be generated and tested grows exponentially. If I will come up with some smart solution for this, I'll try to implement it. But I really don't want to brute-force this, because I'm afraid it will become a performance issue. |
When a very different element is added to a group of very similar elements, the result tends to become the fallback instead of "grouping" similar elements. For example below, the simplest selector is
[aaa], [ddd]
. Regardless of the arrangements of the children, the selector should still be the same.Output:
The text was updated successfully, but these errors were encountered: