roice3
commented
8 years ago Melinda had some further nice comments on big improvements here, copied below...
I think these and other use cases might be solvable by treating the puzzle set as one big table. There can be columns (tags) for things like "Favorites", "Solved", "Genus", and even "Difficulty". Sorting by column then becomes an easy way to find things. A search box further limits the results. I'm not sure how the tree view would best be supported, but if the basic model is a big table, then all sorts of views are possible, including trees.
One power-user feature I like was suggested by Don which was to remember the order in which columns have been sorted such that the most current sort always does what you expect, but that the previous sort provides the secondary sorting of identical elements, the sort prior to that one does the tertiary sorting, etc. It's not very discoverable, but it's pretty neat once you know how it works.
This was a nice suggestion from Melinda. She writes:
Searching for simple string containment would be more than enough. Probably preparing with String.trim() of white space and String.toLower() for both strings. Just an idea.