| | 1 | [[BackLinksMenu]] |
| | 2 | |
| | 3 | [[TicketQuery(summary=PRO_LIB_MODEL_PRO_LISTS_R0, format=table, col=summary|owner|status|type|component|priority|effort|importance, rows=description|analysis_owners|analysis_reviewers|analysis_score|design_owners|design_reviewers|design_score|implementation_owners|implementation_reviewers|implementation_score|test_owners|test_reviewers|test_score|)]] |
| | 4 | |
| | 5 | = Analysis = |
| | 6 | |
| | 7 | == Overview == |
| | 8 | The current search capabilities of ProLists are not sufficient - it's very slow for large collections. So we need a way to optimize this search. |
| | 9 | |
| | 10 | == Task requirements == |
| | 11 | * Provide a way to optimize search in ProList |
| | 12 | * This should not break the current use of ProLib |
| | 13 | * It will be good if these new search capabilities can be used with the current use of ProList and there will be no need for refactor |
| | 14 | |
| | 15 | == Task result == |
| | 16 | The result should be code and documentation |
| | 17 | |
| | 18 | == Implementation idea == |
| | 19 | Use a map for categorizing the elements of the list by keys. This way required values (that are searched) will be returned by Map#get(key) |
| | 20 | |
| | 21 | == Related == |
| | 22 | |
| | 23 | == How to demo == |
| | 24 | Show some code, documentation and introduce the new functionality to the others |
| | 25 | |
| | 26 | = Design = |
| | 27 | ^(Describe your design here.)^ |
| | 28 | |
| | 29 | = Implementation = |
| | 30 | ^(Describe and link the implementation results here (from the wiki or the repository).)^ |
| | 31 | |
| | 32 | = Testing = |
| | 33 | ^(Place the testing results here.)^ |
| | 34 | |
| | 35 | = Comments = |
| | 36 | ^(Write comments for this or later revisions here.) |
