Changes between Version 2 and Version 3 of BOOK_SEARCH_R0


Ignore:
Timestamp:
07/22/09 14:05:30 (16 years ago)
Author:
mitex
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • BOOK_SEARCH_R0

    v2 v3  
    11[[BackLinksMenu]] 
    22 
    3 [[TicketQuery(summary=TASK_NAME_HERE, 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|)]] 
     3[[TicketQuery(summary=BOOK_SEARCH_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|)]] 
    44 
    55= Analysis = 
     
    1313Typical scenario: 
    1414 
    15  * Text is typed in the field at the top of the palette 
    16  * Enter is hit 
    17  * A list of all occurrences in text are provided in the palette 
    18  * All occurrences are highlighted in the text 
    19  * To go to one of them, it is clicked in the list 
     15 * Text is typed in the field at the top of the palette. 
     16 * Enter is hit. 
     17 * A list of all occurrences in text are provided in the palette. 
     18 * All occurrences are highlighted in the text. 
     19 * To go to one of them, it is clicked in the list. 
    2020 * Clicking on a result displays the page of the book with the match. 
    2121 * The caret is positioned at the beginning of the match. 
     
    3131  * and three (or less, applying the same rule) words after the match. 
    3232  * If occurrences are more than 100, only first 100 should be displayed. 
    33  *  
    3433 
    3534== Task result == 
     
    4039 * Use the {{{firstSelectedItem}}} property in {{{ListPalette}}}. 
    4140 * Extend {{{ListPaletteItem}}} and implement there the logic for displaying a given match. 
     41 * A hash-search algorithm can be used when searching larger fragments. 
    4242 
    4343== Related ==