[[BackLinksMenu]]

[[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|)]]

= Analysis =

== Overview ==
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.

== Task requirements ==
 * Provide a way to optimize search in ProList
 * This should not break the current use of ProLib
 * 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

== Task result ==
The result should be code and documentation

== Implementation idea ==
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)

== Related ==

[wiki:PRO_LIB_CORE_TUTORIAL]

== How to demo ==
Show some code, documentation and introduce the new functionality to the others

= Design =
^(Describe your design here.)^

= Implementation =
^(Describe and link the implementation results here (from the wiki or the repository).)^

= Testing =
^(Place the testing results here.)^

= Comments =
^(Write comments for this or later revisions here.)