-
-
Notifications
You must be signed in to change notification settings - Fork 108
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
Odd behavior #12
Comments
The algorithm works in the following way:
In your case, the max tree height is 2. And the amount of leafs on the lower height is 1 ( You can play around with (avy-subdiv 100 6)
;; =>
;; (6 6 6 10 36 36) In this case, there are 100 candidates, and 6 decision keys. The first three branches contain 6 candidates, which means their leafs are on level 2. The next three branches have their leafs on level 3, with the fourth branch left with some free space. |
I see. Not sure many people would understand the behaviour, but it makes sense. Maybe you should document it with more examples in the README? |
Added a wiki page for this. |
What's the supposed behavior when looking for something? Should you get all possible single letter triggers before they start becoming multi-letter?
See this screenshot to understand what I mean.
The text was updated successfully, but these errors were encountered: