[SWINGX-1233] TreeSearchable: enhance to allow searching below collapsed nodes Created: 01/Dec/09 Updated: 10/Dec/12
|Remaining Estimate:||Not Specified|
|Time Spent:||Not Specified|
|Original Estimate:||Not Specified|
Operating System: All
title says it all: currently it searches by rows, that is visible/expanded nodes only.
now the first should be fine, how about the second?
|Comment by kleopatra [ 01/Dec/09 ]|
|Comment by kleopatra [ 15/Feb/12 ]|
hmm ... now have correct duplication direction?
|Comment by kleopatra [ 22/Feb/12 ]|
Interesting input in all of them, will sumarize in the end
|Comment by kleopatra [ 08/Mar/12 ]|
At the end of the day, it turned out that I asked the wrong question (or right question in a wrong context : the "problem" arose by an assumed solution, the real task to solve is to support a hierarchical search algorithm (right now the AbstractSearchable is heavily skewed on linear search).
Once that will solved, the next question might be how much a framework can do to support concrete hierarchical searchables. Given the variety of custom implementations of TreeModels, that's most probably possible only for the most simple.
Some thoughts that came up in the discussions here and the other forums. In a concrete context, first measure if the traversal is slow: most in-memory models are lightning fast to traverse, nothing needs to be done except using the basic support.
Only if the traversal is the bottleneck (as f.i. in the FileSystemModel implementations of SwingX) additional work is needed:
Whatever the technical option to a slow search, there's the same usability problem to solve: how to present the delay to the end user? And that's an entirely different story, probably even more context/requirement dependent
|Comment by kleopatra [ 10/Dec/12 ]|