Abstract:
A user interface is disclosed that facilitates easy find and display operations that search through the memory of a pointer based computing system. The user interface includes searching methods that are particularly well suited for use in a computer system in which the contents of the memory are divided into a plurality of searchable application files that are each capable of containing a plurality of records. In one aspect of the invention an improved find dialog box is disclosed. In another aspect, a method of selecting local verses global searches together with a method of conducting the chosen search and processing user inputs in response to the search results is disclosed. Additionally, an improved interface for displaying the results of various searches is described.

Description:
This application is a continuation of a co-pending application Ser. No. 08/001,121, filed Jan. 5, 1993 which in turn is a continuation-in-part of application Ser. No. 07/889,660, filed May 27, 1992, and both of which are assigned to the assignee of the present application, and both of which are hereby incorporated by reference in their entirety. 
    
    
     BACKGROUND OF THE INVENTION 
     The present invention relates generally to searching for information in a computer data base and displaying the search result. More particularly, a user interface particularly suited for searching the memory in a pointer based computer systems disclosed. 
     The use and popularity of pointer and pen based computer systems, including pen-based, stylus-based, track ball, and mouse driven systems has been increasing dramatically in recent years. This increased popularity is typically attributed to the ease of use of such machines, when compared to traditional computing systems that utilize only a keyboard as an input device. 
     A pen-based computer system is a small, often hand held, computer system in which the primary method for inputting data includes a stylus or &#34;pen&#34;. A typical pen-based computer system is housed in a generally rectangular enclosure, and has a dual-function display assembly providing a viewing screen along one of the planar sides of the enclosure. The dual-function display assembly serves as both an input device and an output device. When operating as an input device, the display assembly senses the position of the tip of the stylus on the viewing screen and provides positional information to the computer&#39;s central processing unit (CPU). Some display assemblies can also sense the pressure of the stylus on the screen to provide further information to the CPU. When operating as an output device, the display assembly presents computer-generated images on the screen. 
     The dual-function display assembly of a pen-based computer system permits users to operate the computer as a computerized notepad. For example, graphical images can be input into the pen-based computer by merely moving the stylus on the surface of the screen. As the CPU senses the position and movement of the stylus, it generates a corresponding image on the screen to create the illusion that the stylus is drawing the image directly upon the screen. With suitable recognition software, text and numeric information can also be entered into the pen based computer system in a similar fashion. 
     Besides serving as a notepad, pen-based computers can provide a number of useful functions, such as serving as an address book, an appointment calendar, a to-do list, etc. These functions can be tightly integrated with the operating system of the computer, permitting information input into one function to impact upon another function. 
     Users of pointer and pen based computer systems often want to be able to find and display information stored in memory even though they may not remember the exact file that the information is stored in and/or the file location. It is therefore desirable that a technique be available for searching the memory of such systems and for displaying the results of that search in formats useful to the user. 
     SUMMARY OF THE INVENTION 
     Accordingly, it is an object of the present invention to provide a searching method and user interface which is particularly well suited for use in pointer based computer systems. 
     To achieve the foregoing and other objects and in accordance with the purpose of the present invention, a method for searching the contents of memory associated with a computer system and displaying the search results on a display screen associated with the computer system is disclosed. The method is particularly well suited for use in a system in which the contents of the memory include a plurality of searchable application files that are each capable of containing a plurality of records. In one preferred aspect of the invention the method includes the steps of receiving a find command from a user and displaying a find dialog box on the display screen in response to the find command. A search string selection is then received and displayed in the find dialog box. At some point a determination is made as to whether the user desires to utilize a global search mode or a local search mode and thereafter, the desired search using the selected search string is executed. When the local search mode is selected, a search is made through the particular application file that is currently active. When the global search mode is selected, a search is made through each of the searchable application files and a list is made of the application files searched and the number of records within each application file that contain the search string. After the search has been executed, at least a portion of the search results are displayed and any subsequent user inputs are processed. 
     In a second preferred aspect of the invention, the results displayed after a global search include a summary indicating each of the application files in which the search string was found and an indication of the number of records within each such application file that include the search string. 
     In a third preferred aspect of the invention, a find dialog box is displayed on the display screen after the find command is received. The find dialog box has a global search icon displayed therein and also displays the search string when it is received. A determination as to whether to conduct a global search or a local search is then made based on whether the global icon is selected or not. The global icon can be selected and unselected by sequentially clicking thereon using a pointing device. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     The invention, together with further objects and advantages thereof, may best be understood by reference to the following description taken in conjunction with the accompanying drawings in which: 
     FIG. 1 is a block diagram of a computer system in accordance with the present invention. 
     FIG. 2 is a top plan view of the screen, case and keypad of the computer system of FIG. 1. 
     FIG. 3 illustrates a representative screen display for the display assembly shown in FIG. 2 when a find box is opened. 
     FIG. 4 illustrates a representative screen display with a search string entered and displaying a summary of the number of hits in each file after a global search. 
     FIG. 5 illustrates a representative screen display when the address file summary shown in FIG. 4 is expanded. 
     FIG. 6 illustrates the screen display after a search in the notepad with the results displayed in full page display format. 
     FIG. 7 illustrates the screen display after a local search in the Calendar file with the results displayed in overview mode. 
     FIG. 8 is a flow diagram illustrating a method of conducting a Find operation. 
     FIG. 9 is a flow diagram illustrating a method of executing, displaying and processing a global search. 
     FIG. 10 is a flow diagram illustrating a method of executing, displaying and processing a local search. 
     FIG. 11 is a flow diagram illustrating a method of searching through multiple application files and making a list of target files identified by file and record numbers. 
     FIG. 12 is a flow diagram illustrating a method of displaying the results of a global search. 
     FIG. 13 is a flow diagram illustrating a method for processing a user input after a global search has been conducted and is displayed. 
     FIG. 14 is a flow diagram illustrating a method of processing a user input after a local search has been conducted and is displayed 
     FIG. 15 is a flow diagram illustrating a method of scrolling the display of a local search. 
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS 
     The present invention is particularly well suited for pointer based computer systems such as the pen-based, stylus-based and mouse-based systems that are currently popular. For the purposes of illustration, the invention will be described in connection with a pen=based system. 
     As shown in FIG. 1, a pen-based computer system 10 in accordance with the present invention includes a central processing unit (CPU) 12, read only memory (ROM) 14, random access memory (RAM) 16, input/output (I/O) circuitry 18, and a display assembly 20. The pen-based computer system 10 may also optionally include a mass storage unit 22 such as a disk drive unit or nonvolatile memory such as flash memory, a keypad 24 arranged as an array of input buttons, a serial port, another I/O port and a clock 26. 
     The CPU 12 is preferably a commercially available, single chip microprocessor. While CPU 12 can be a complex instruction set computer (CISC) chip, it is preferable that CPU 12 be one of the commercially available, reduced instruction set computer (RISC) chips which are known to be of generally higher performance than CISC chips. CPU 12 is coupled to ROM 14 by a unidirectional data bus 28. ROM 14 contains the basic operating system for the pen-based computer system 10. CPU 12 is connected to RAM 16 by a bidirectional data bus 30 to permit the use of RAM 16 as scratch pad memory. ROM 14 and RAM 16 are also coupled to CPU 12 by appropriate control and address busses, as is well known to those skilled in the art. CPU 12 is also coupled to the I/O circuitry 18 by bidirectional data bus 32 to permit data transfers with peripheral devices. 
     I/O circuitry 18 typically includes a number of latches, registers and direct memory access (DMA) controllers. The purpose of I/O circuitry 18 is to provide an interface between CPU 12 and such peripheral devices as display assembly 20, mass storage 22, the keypad 24, a serial port and an I/O port. Keypad 24, the serial port, and the I/O port are each coupled to the I/O circuitry 18 by a suitable data bus. 
     Clock 26 provides a series of clock pulses and is typically coupled to an interrupt port of CPU 12 by the data line 34. The clock pulses are used to time various functions and events relating to the computer system 10. The clock 26 can be eliminated and the clock function replace by a software clock running on CPU 12, but this tends to be a wasteful use of CPU processing power. In the present invention, clock 26 provides clock pulses at 60 hertz (Hz). 
     Display assembly 20 of pen-based computer system 10 is both an input and an output device. Accordingly, it is coupled to I/O circuitry 18 by a bi-directional data bus 36. When operating as an output device, the display assembly 20 receives data from I/O circuitry 18 via bus 36 and displays that data on a suitable screen. The screen for display assembly 20 is preferably a liquid crystal display (LCD) of the type commercially available from a variety of manufacturers. The input device of display assembly 20 is preferably a thin, clear membrane which covers the LCD display and which is sensitive to the position of a stylus 38 on its surface. These position sensitive membranes are also readily available on the commercial market. Combination display assemblies such as display assembly 20 which include both the LCD and the input membrane are commercially available from such vendors as Scriptel Corporation of Columbus, Ohio. 
     The keypad 24 can comprise an array of switches. In the present embodiment, the keypad 24 comprises mechanical buttons which overlie the bottom edge of the membrane which covers the LCD display. When the buttons are depressed, the membrane senses the pressure and communicates that fact to the CPU 12 via I/O circuitry 18. 
     Other types of pointing devices can also be used in conjunction with the present invention. While the method of the present invention is described in the context of a pen-based system, other pointing devices such as a computer mouse, a track ball, or a tablet can be used to manipulate a pointer on a screen of a general purpose computer. Therefore, as used herein, the terms &#34;pointer&#34;, &#34;pointing device&#34;, &#34;pointing means&#34;, and the like will refer to any mechanism or device for pointing to a particular location on a screen of a computer display. 
     Some type of mass storage 22 is generally considered desirable. However, the mass storage 22 can be eliminated by providing a sufficient amount of RAM 16 to store user application programs and data. In that case, the RAM 16 could be provided with a backup battery to prevent the loss of data even when the pen-based computer system 10 is turned off. However, it is generally desirable to have some type of long term storage 22 such as a commercially available miniature hard disk drive, or nonvolatile memory such as flash memory or battery backed RAM, PC-data cards or the like. 
     In operation, information is input into the pen-based computer system 10 by &#34;writing&#34; on the screen of display assembly 20 with the stylus 38. Information concerning the location of the stylus 38 on the screen of the display assembly 20 is input into the CPU 12 via I/O circuitry 18. Typically, this information comprises the Cartesian (i.e. X &amp; Y) coordinates of a pixel of the screen of display assembly 20 over which the tip of the stylus is positioned. Commercially available combination display assemblies such as the aforementioned assemblies available from Scriptel Corporation include appropriate circuitry to provide the stylus location information as digitally encoded data to the I/O circuitry of the present invention. The CPU 12 then processes the data under control of an operating system and possibly an application program stored in ROM 14 and/or RAM 16. The CPU 12 next produces data which is output to the display assembly 20 to produce appropriate images on its screen. 
     In FIG. 2, the pen-based computer system 10 is shown housed within a generally rectangular enclosure 40. The CPU 12, ROM 14, RAM 16, I/O circuitry 18, mass storage 22, and clock 26 are preferably fully enclosed within the enclosure 40. The display assembly 20 is mostly enclosed within the enclosure 40, but a viewing screen 42 of the display assembly is exposed to the user. As used herein, the term &#34;screen&#34; will refer to the portion of the display assembly 20 which can display an image that can be viewed by a user. Also accessible to the user is the keypad 24. 
     Upon power-up, pen based computer system 10 displays on screen 42 an initial note area N including a breaker bar B and a number of guidelines 44. The breaker bar B preferably includes the date of creation 46 of the note N, a note number 48 and a &#34;router&#34; button 50 which allows notes to be dispatched to a printer, facsimile, the trash, etc. The optional guidelines 44 aid a user in entering text, graphics, and data into the pen-based computer system 10. 
     In this preferred embodiment, the keypad 24 is not a part of the screen 42 but rather, is a permanent array of input buttons coupled to the CPU 12 by I/O circuitry 18. Alternatively, the keypad 24 could comprise &#34;soft buttons&#34; generated at a convenient location on the screen 42, in which case a &#34;button&#34; would be activated by touching the stylus to the screen over the image of the button. The keypad 24 preferably includes a number of dedicated function buttons 52, a pair of scroll buttons 54A, 54B and an overview button 55. The operation of the scroll buttons 54A and 54B, and other aspects of computer system 10 are discussed in greater detail in copending U.S. patent application Ser. No. 07/868,013, filed Apr. 13, 1992 on behalf of Tchao et al. and entitled &#34;Method for Manipulating Notes on a Computer Display&#34;. That application is assigned to the assignee of the present application and its disclosure is hereby incorporated by reference in its entirety. 
     The function buttons 52 include an address button 63, a calendar button 64, a drawer button 65, a find button 66, an undo button 67, and an assist button 68. The overview button 55 has a variety of functions in different applications. However, as it applies to the present invention, it functions primarily to change the display mode. 
     The screen illustrated in FIG. 2 is referred to as the &#34;notepad&#34;, and is an application program running under the operating system of the pen based computer system 10. In this preferred embodiment, the notepad is a special or &#34;base&#34; application which is always available beneath higher level applications. The notepad application, like other applications, runs within a widow, which in this instance comprises the entire viewing screen 42. Therefore, as used herein, a &#34;window&#34; is the entire screen or any portion of an entire screen which is dedicated to a particular application program. 
     A status bar 56 is provided at the bottom of the notepad application. The status bar 56 is provided with a number of active areas including a real time clock 57, a view button 58, a font button 59, a formulas button 60, a text button 61, a graphics button 62, and a nib button 70. Co-pending application Ser. No. 07/976,970 filed Nov. 16, 1992 on behalf of Foster et al., entitled &#34;Status Bar for Application Windows&#34; and assigned to the assignee of the present invention describes the operation of the status bar, and is hereby incorporated herein by reference in its entirety. 
     As described in the above referenced application by Tchao et al., in one suitable embodiment of the present invention, a notepad application program is launched when the computer system 10 is turned on. The address button 63 can then be used to launch an address book application program. That is, when the address button 63 is depressed, a suitable address book application program is opened and a suitable address book dialog box is displayed on screen 42. Similarly, the calendar button 64 launches a calendar application program when depressed. 
     The undo button 66 will undo the latest user action when depressed and will redo the action if depressed a second time without the intervention of any additional user actions. The assist button gives the user access to a help menu which is designed to provide operating instructions to the user that may be helpful when the user is unsure of how to operate the computing system. 
     A &#34;drawer&#34;, which is opened by pressing the drawer button 65 is used to store other application programs, tools, access buttons to external ROM cards, communications applications, and other items that can be utilized by the user. When the drawer is &#34;opened&#34;, a drawer dialog box 95 is displayed on the screen 42. When the dialog box 95 is opened, the user can than launch any application stored therein merely by tapping on the associated icon that is displayed within the drawer dialog box 95. Thus, the icons serve as &#34;soft buttons&#34; which may be activated by tapping the screen at a location corresponding to the displayed position of the icon. Of course, in alternative embodiments, the applications that are accessed by hardwired keypad buttons can be varied widely. For example, additional keys could be added, existing keys removed, and/or the above described keys could be used to launch different applications. 
     It is noted that within this application reference will often be made to &#34;tapping&#34;, &#34;clicking on&#34;, &#34;pressing&#34; or otherwise selecting an object. These words are intended to interchangeably refer to the act of selecting the object. The term tapping is generally used in reference to the physical act of touching the stylus to the screen, which is a suitable method of selecting objects in a pen-based computing system. The term &#34;clicking on&#34; is intended to be broader in scope and is intended to cover not only tapping, but also the action of selecting an object using a button associated with a mouse or track ball as well as the selection of an object using any other pointer device. 
     Within each application, there are a number of records that make up an application file. In one suitable embodiment, each page (sereenful) of text constitutes a separate record, with each record being given a record number that is unique within that application file. Thus, for example, within the calendar application file, there may initially be thirty records. These records would be given record numbers zero to twenty nine respectively. 
     If a particular record is deleted, no attempt is made to muse that number. Rather, the record is treated as though it has no information in it. When new records are added, they are simply given the next higher record number. Thus, in the above example, the next record that is added (the thirty first record) would be given the record number thirty. In the described example, this would be true regardless of whether (for example) records numbers six and twelve had been deleted. The total number of records within a particular application file (f) is stored in memory. For the purposes of this application, the stored value representative of the total number of records within an application file (f) will be labeled &#34;#files(f)&#34;. 
     The reason for this numbering system is to facilitate a docking system that permits the synchronization of the hand held pen based computer with a master station. However, such synchronization is not necessary to the present invention and it should be appreciated that a wide variety of record numbering and/or renumbering schemes could be used. Thus, if desired, a renumbering system could be implemented that renumbers certain records when a particular record is deleted. Alternatively, the record numbers of the deleted files could be reused in future records. 
     Each application file (f) is also given a unique application file number. Thus, by way of example, the notepad application file may be assigned the value &#34;zero&#34;, the calendar application file may be assigned the value &#34;one&#34;, the address application file &#34;two&#34; and so forth. 
     The &#34;Find&#34; button 66 is used to initiate a search for information. When the Find button is depressed, the CPU 12 causes a Find dialog box 72 to be displayed on the display screen 42 as seen in FIG. 3. The find box 72 includes a find line 73 which includes the prompt word &#34;Find:&#34; and a row of dots that make up a line. At an area near the end of the row of dots, a &#34;global&#34; icon 75 is displayed. 
     Once the Find dialog box 72 has been displayed, the user may enter a string of characters to be searched into the find line adjacent the &#34;Find:&#34; prompt. The string of characters may be entered by using the stylus 38 to &#34;write&#34; on the screen 42. Suitable character recognition software is then used to translate the written characters into text information that is understandable to the CPU 12. Alternatively, if information is already highlighted before the Find button 66 is selected, the highlighted information is used as the search string. 
     There are two types of searches that may be conducted. The first is referred to a &#34;local&#34; search mode, which searches only through the data base of the application that is currently active. The second is a &#34;global&#34; search mode which searches through the data bases of all of the application flies that are suitable for searching. It should be appreciated that all of the application files may not be suitable for searching. For example, many types of graphics applications may not be suitable for searching. 
     If the user does nothing either before or after entering the search string, the search mode will default to the &#34;local&#34; search mode. The global search mode may be selected by tapping the stylus 38 on the screen 42 at the position of the global icon 75. When the global mode is selected, the global icon 75 is highlighted. The global mode can be unselected (i.e. the local mode can be reselected) by tapping a second time on the global icon 75. This removes the highlighting and reverts the search mode to the &#34;local&#34; mode. Thus, the search mode can be switched back and forth between the local and global modes merely be repetitive tapping of the global icon 75. In the embodiment shown, the global icon has the appearance of a globe, although of course a wide variety of graphical representations can be used as the global icon. 
     FIG. 4 shows the screen 42 with a search string &#34;electrician&#34; entered in the find line 73. After the search string has been entered, the CPU waits a predetermined length of time to insure that the user does not wish to modify the search string. By way of example, suitable waiting times may be in the range of one to two seconds. If the predetermined length of time expires without the receipt of any user inputs, a search is conducted. If the global search mode is selected, then a global search is conducted. If the global search mode is not selected, then a local search is done. 
     Referring next to FIG. 4, the results that will be displayed at the conclusion of a global search will be described. Initially, a summary box 77 is displayed with a header bar that displays the text &#34;List of &#34;[search string]. . . &#34;&#34;, wherein the actual search string is written between the quotes. In the example shown in FIG. 4, the search string is &#34;electrician&#34;. Below the header bar, each of the application files searched is identified, together with an indication of the number of record (hits) that the search string was detected in within that particular application file. As seen in FIG. 4, a small icon is used as the identifier for each of the searched files. The small icon identifiers are arranged in a column near the left side of screen 42. 
     An indication of the number of records in which the search suing was found in each application file is provided to the fight of their associated icons. Thus, by way of example, suppose that two hits were recorded in the address book and 12 hits were recorded in the calendar. In this situation, a suitable message such as &#34;2 items&#34; is printed to the right of the address book identifier 78 and a suitable message such as &#34;12 items&#34; is printed next to the calendar identifier 79. If no hits are found in a particular application, the message beside the associated indicator would be &#34;0 items&#34;, although in an alternative embodiment, such listings could be eliminated entirely. 
     To see an expanded view of hits within a selected application file, the user merely taps the screen 42 at the location of the small icon identifier associated with the selected application file. When a particular application file is expanded, a row is provided for each hit and a short (one line) entry from the corresponding record. Continuing with the &#34;electrician&#34; example, the address book entry may be expanded as shown in FIG. 5 by tapping the address book identifier 78. A column of markers 81 that in the embodiment shown take the form of enlarged dots then appear beneath the address book indicator 78, with one marker being provided for each &#34;hit&#34; within the address book. Then, in a row beside the marker, a short extract such as the first few words of the record or a the sentence that includes the search suing is displayed. The remaining indicators 79, 80 are then displayed below the last of the displayed address book records. 
     If there are a large number of entries from an expanded application file, then there may be more hits than can be displayed at one time. In such cases, the additional hits can be displayed by using the scroll buttons 54A, 54B. In order to collapse an expanded entry (i.e. to eliminate the expanded view of all of the records in a particular application file), the user merely taps a second time on the associated indicator. 
     In order to view a particular entry, that is indicated in the expanded display, the user merely taps on the marker associated therewith. In such a case, the entire record (which may be a full screen of text) associated with the selected entry is displayed on the screen as seen in FIG. 6. At the bottom of the screen, the find box 95 remains, and a small counter 82 appears in the bottom center of the find box that indicates the hit number, and the total number of hits within the associated application file. This is done by writing &#34;X of Y&#34;, where X is the hit number, and Y is the total number of hits within the associated application file. 
     When the system is in the full page display mode, the next (or previous) entries can be viewed by pressing the scroll button 54B (or 54A) respectively. In the full display mode, the scroll buttons 54A, 54B page the display. That is, each time a scroll button is depressed, the next (previous) page of information is displayed, rather than simply the next (previous) line of information. As indicated above, in the described embodiment, each page of text is considered an independent record. Therefore, pressing the scroll buttons permits the user to scroll through the records. Of course, in alternative embodiments, line by line scrolling could be provided. 
     If the scroll down button 54B is depressed when the last record is being viewed, then the display effectively wraps around. That is, the first record is displayed. Similarly, if the scroll up button 54A is depressed when the first record is being viewed, then the display wraps in the other direction such that the last record is displayed. 
     The find operation can be terminated merely by pressing the find button 66 while the find box 72 is opened. Since the find box 72 is always open during the execution and displaying of a search, the find operation may be terminated at any time. Thus, the find function can be both initiated and terminated by sequentially pressing the find button 66. 
     If the user wishes to conduct a second search after the first search has been concluded, then the existing search string can be erased and a new search string substituted in its place. Alternatively, the find operation may be terminated and then restarted as an entirely new operation by pressing the find button 66 twice. In the described embodiment, a new search can be conducted merely by writing a new search string into the find box 72. That is, when an new word or phrase is written into the find box 72 it is treated as the search string to the exclusion of the current search string. However, in alternative embodiments, the new word could be used to narrow the scope of the existing search. In such an arrangement, a delete gesture would be used to erase the original search string when desired. 
     In the described embodiment, an expanded display mode as seen in FIG. 5 is displayed after an indicator is tapped. However, in an alternative preferred embodiment, the expanded display mode is skipped and the full page display mode is entered. With this arrangement, the overview button 55 can alternatively be used to provide the expanded display mode as seen in FIG. 5, or it can provide an overview as discussed below with respect to the description of the local search interface. In the latter case, the expanded display mode may be skipped entirely. 
     Referring next to FIGS. 6 and 7, the screen display that occurs after a local search will be described. As indicated above, if a global search is not specifically requested by selecting the global icon 75, then a local search will be performed in the active application file. Therefore, by way of example, if the user wishes to conduct a local search in the calendar application file, the first step is to open the calendar by pressing the calendar button 64. Thereafter, the find button is pressed and the find box 72 appears at the bottom of the display screen 42. The user is then free to write the desired search string in the find box and as previously described, a search will be automatically performed once a short break occurs after the search string has been entered. Assuming that the user has not tapped on the global icon, the search will be a local search. 
     In a local search, the initial display mode is the full page display mode. Thus, the full text of the first record that contains the search screen will appear on the screen. Like in the full page display mode of the global search, the find box 95 remains at the bottom of the screen 42 and a small counter 82 appears at the bottom center of the find box. The counter 82 indicates the hit number, and the total number of hits within the associated application file. Paging through the hits in the full display mode is exactly the same as the paging previously described with respect to paging through the hits in a particular application file after a global search has been performed. Accordingly, the next (or previous) entries can be viewed by pressing the scroll buttons 54B (or 54A) respectively. In the full display mode, the scroll buttons 54A, 54B page the display. That is, each time a scroll button is depressed, the next (previous) page of information is displayed, rather than simply the next (previous) line of information. When an end record (i.e. the first or last record) is being viewed and the user taps a scroll button in a direction that would be outside the record list, the display will wrap around to the opposite end of the hit record list. Thus, the user can readily scroll back and forth among the pages that contain the target text in the current application file by simply tapping the scroll buttons 54A and 54B. 
     To view an overview of the items found in a local search, the user merely taps the overview button 55 located between the scroll arrow buttons 54A and 54B. The overview mode in a local search is somewhat different than the expanded summary mode discussed above in relation to a global search. Specifically, in the local overview mode, a summary of the entire application file is presented with the occurrences of the target text highlighted. This is different than the expanded summary of a global search where only a summary of the hits is provided. The format of the local search summary is preferably the same as the format of the application&#39;s overview apart from the searching protocol. By way of example, a representative overview of a local search of a To Do list is shown in FIG. 7. 
     The global icon 75 always remains in the find box 72. Therefore, the scope of the search may be broadened to all of the application files merely by tapping on the global icon 75. When the user taps on the global icon 75 after a local search has been performed, the system will automatically conduct a global search using the current search string. Alternatively, if the user taps on a button (such as address button 63 or calendar button 64) after a local search has been performed in a different application file, then a local search is conducted in the newly selected application file. 
     Referring next to FIGS. 8-15, suitable algorithms for executing various find operations will be described. As seen in FIG. 8, the process begins at step 100. Then in step 102, the CPU determines whether a FIND operation has been requested. That is, has Find button 66 been selected. If not, the CPU performs other tasks until a find operation is requested. Thus, for the purposes of the find and display algorithm, the CPU effectively waits at step 102 until the Find button 66 is selected. Once the find button has been selected, the find box 72 is displayed in step 104. In the embodiment shown in FIGS. 3-7, the find box is displayed at the bottom side of the screen 42. 
     In step 106, the CPU 12 determines whether there is a current text selection. If so, in step 108, the current text selection is chosen as the search string and is thus displayed in find box 72 after the prompt &#34;Find:&#34;. On the other hand, if there is not a current text selection, the system waits for the user to input a search string in step 109. After the user inputs a search string, the CPU waits a designated period of time (for example one second) to make sure that the user has completed the entry of the search string. If the user writes additional text during the waiting period, then the waiting period is restarted. When the waiting step has expired in step 109 or once the highlighted text string has been input in step 108, the process moves to step 111. 
     In step 111, the CPU determines whether or not the find mode is global. This is accomplished by determining whether the global icon 75 is selected. If global icon 75 has been selected then a global search is executed in step 120. If the global icon 75 has not been selected, then a local search is executed in step 140. The search results are then displayed and may be viewed by the user and processed in conjunction with various user inputs. Thereafter, when the search summaries are dismissed, the process returns to the beginning at step 100. 
     Referring next to FIG. 9, the global search process 120 will be described in more detail. Initially, in step 122, a search is performed through each of the application files and a list is made of each application file (target file) having an occurrence of the search string together with an indication of the number of occurrences of the search string (hits) within each application. This process will be described in more detail below with reference to FIG. 11. After the search has been performed, a summary of the search is displayed in step 124. An example of this summary display is shown in FIG. 4. A more detailed explanation of the algorithm for displaying the summary will be provided below with reference to FIG. 12. 
     After the summary of the search results has been displayed, any user inputs are processed in conjunction with the summary in step 126. The user input processing steps are described in more detail below with reference to FIG. 13. After any such user inputs have been processed, the CPU determines whether the find operation has been terminated in step 128. If so, the find procedure is completed and the logic returns to the start 100 where it waits for the next FIND operation to be requested as described above with reference to FIG. 8. The find operation may be terminated simply by pressing the find button 66. In an alternative embodiment, the find operation may also be terminated by tapping a close button provided in the find box (such as at the upper right hand corner of the find box). If the find operation has not been terminated, the logic returns to step 126 where it processes new user inputs (if any). Thus, a loop between steps 126 and 128 is formed until the find operation is terminated or a new search string is entered. 
     Referring next to FIG. 10, the local search algorithm will be described. Conceptually, the local search algorithm resembles the global search algorithm, however the mechanics of the search and the displayed items vary somewhat. Initially, in step 142 a search is performed in the selected application and a list is made of the occurrences of the search string (hits) within the application. The results of the search are then displayed in step 144. The initial display mode for a local search is the full record display mode with the occurrences of target text (search string) highlighted. Therefore, the first record that is found is displayed. Also, the indication of the displayed hit number and the total number of hits discovered during the search is displayed at the bottom center of the Find dialog box 72. 
     After the initial record display, and any user inputs are processed in step 146. The details of the user input processing step 146 will be described in more detail below with reference to FIG. 14. After the user inputs have been processed, the CPU determines whether the find operation has been terminated in step 148. Again, the termination of a find operation occurs when find button 66 is pressed. Like in the global search sequence, the search is completed and the logic returns to starting point 100 when the find operation is terminated. On the other hand, when the find operation has not been terminated, the logic returns to step 146 where it processes new user inputs (if any). Thus, a loop between steps 146 and 148 is formed until the find operation is terminated. 
     Referring next to FIG. 11 a suitable search algorithm for the global searching step 122 will be described. In this algorithm, &#34;f&#34; is a counter for application files, &#34;#files&#34; is a variable that indicates the total number of application files that have searchable data, and &#34;hits[f]&#34; is an array that stores the number of hits in each application file (f). Similarly, &#34;r&#34; is a counter for records in a particular file, &#34;h&#34; is a counter for hits within a particular file, and &#34;#records(f)&#34; is an indication of the total number of records in the particular file (f) being searched. &#34;Hit ID[f,h]&#34; identifies each hit by file number and record number, while &#34;TotalHits&#34; is a variable that indicates the cumulative total number of hits. 
     The searching function begins in step 151 by clearing the value TotalHits and the two dimensional array Hit ID[f,h]. Steps 153-157 form a first loop that insure that each of the application files is searched. The loop begins in step 153 with &#34;f&#34; being set to zero so that application number zero is searched. A file loop is thus started to insure that each of the applications (files) is searched. The application files are searched serially from the first identified application file f(0) to the final application file. Thus the total number of applications searched will be all of the applications that have searchable data bases. That is, the value &#34;#files&#34;. In step 155, the values Hits(f) and h are set to zero and the display mode for the summary of file (f) is set to collapsed (i.e. not expanded). 
     Thereafter, in steps 157-165 a second loop is formed which insures that each record in the current file (f) will be searched. The second loop begins at step 157 where the value &#34;r&#34; is set to zero. Then, in step 159 the CPU determines whether the designated search string is located in record (r), which in the initial case is record (0) since &#34;r&#34; is set at zero. This is accomplished using a conventional find comparison routine. In step 161 the routine determines whether the designated search string was found. If not, the logic returns to step 157 where the value of counter &#34;r&#34; is incremented by one. Thereafter, the next record (i.e. record (1)) is searched and the loop of steps 157, 159 and 161 is continued until either the search string is found, or all of the records in the first application file (file(0)) are searched. 
     When a search string is detected in step 161, the hit is recorded in step 163. Thus, the hits counter [hits(f)] for file &#34;f&#34; is incremented by one and the record in which the search string was found [record (f,r)] is saved as its associated hit record, Hit ID (f,h). Thus, by way of example, if the first record having the designated search string is record number 4 in application file number 0, then Hit ID (0,0) would store the fifth record (record 4) of file (0). After the hit has been recorded in step 163, the counter &#34;h&#34; and the value &#34;TotalHits&#34; are each incremented by one in step 165. Thereafter, the logic returns to step 157 where the counter &#34;r&#34; is incremented and the record searching loop is continued. This record searching loop is continued until the counter &#34;r&#34; reaches the number of records &#34;#records&#34; in file (f), at which time all of the records in the designated file (f) have been searched. 
     After all of the records in a particular file have been searched, the logic returns to step 153 where the counter &#34;f&#34; is incremented by one. If additional application files remain to be searched, the counter &#34;h&#34; and value Hits(f) are cleared in step 157 and the previously described record searching loop of steps 157-165 is repeated for the next application file. This process is then repeated until the value of counter &#34;f&#34; equals the total number of application files &#34;#files&#34;. At that point, all of the records in all of the application files have been searched and the logic moves on to the search summary display step 124. 
     Referring next to FIG. 12, the search summary display step 124 will be described. The search summary display process begins at step 168 where the global summary box is drawn together with an indication of the search string as shown in FIG. 4. Thereafter, in step 170 a summary display loop is initiated. Initially a counter &#34;f&#34; is set to zero. Then in step 172 the indicator for application file &#34;f&#34; is drawn. Thus, by way of example if application file f(0) is the address book, an address book indicator 78 that may take the form of a small icon is drawn initially. After the indicator is drawn, the value of Hits(f) and the word &#34;item(s)&#34; are written in sequential order. Actually the word &#34;items&#34; is written in all cases except when the value of Hits(f) is one. In that case, the word &#34;item&#34; is used. 
     After the appropriate summary information for application file &#34;f&#34; has been written, the CPU determines whether the &#34;Expand&#34; function for application &#34;f&#34; has been activated in step 174. The &#34;Expand&#34; function is activated by clicking on the indicator (e.g. 78, 79, 80 etc.) associated with file &#34;f&#34;. Since the value of Expand (f) is set to &#34;collapsed&#34; (non-activated) during the initial global search, in at least the initial summary display the &#34;Expand&#34; function will not be activated for any of the summaries. However, since the same display code is used to display &#34;expanded&#34; summaries, step 174 is included. 
     If the &#34;Expand&#34; function has not been activated, the logic returns to step 170 where the counter &#34;f&#34; is incremented by one and the process of steps 170-174 is repeated until the summaries for all of the suitable data files have been written. Note that when the value of counter &#34;f&#34; is incremented in step 170 such that it reaches the number of searchable data files &#34;#files&#34;, all of the summaries have been displayed and the logic moves on to user input processing step 126. 
     If, in step 174, the CPU determines that the &#34;Expand&#34; function has been activated for a particular application file, a one line overview of each of the hits in that file are displayed below the associated summary as seen under the address book entry in FIG. 5. Of course, the actual amount of information displayed within the expanded summary can be varied extensively in accordance with the needs of a particular system. Alteratively, the user could be given control over the amount of information displayed. 
     Expanded summaries of the various hits that occurred in a particular application file (f) are displayed sequentially during a loop created by steps 177 and 179. Specifically, in step 177 a loop is created and a counter &#34;h&#34; is set to zero. Then, in step 179, an expanded summary of hit record number (h) in file (f) is drawn. That is, an expanded summary of Hit ID[f,h] is drawn. Naturally the first expanded summary would be the summary for Hit ID[f,0]. After each expanded summary has been written, the logic returns to step 177 where the counter &#34;h&#34; is incremented and the next record is displayed in step 179. This loop is continued until the value of counter &#34;h&#34; reaches the value of Hits(f), at which point the loop is terminated and the logic returns to step 170 to display the next file summary. 
     Turning next to FIG. 13, the user input processing step 126 will be described. First, in step 181, the CPU checks to determine whether the upwards scroll button 54A has been pressed. If so, in step 183, the summary is scrolled so long as it extends more than one page. If the summary does not extend more than one page, no scrolling occurs. If the upwards scroll button 54A has not been pressed, then the process moves to step 185 where the CPU checks to determine whether the downwards scroll button 54B has been pressed. If so, the summary is scrolled downwards. Again, scrolling only occurs when the summary extends more than one page. 
     When neither of the scroll arrows has been selected, then the CPU moves to step 189 where it checks to determine whether any of the small file indicator icons has been tapped. If so, in step 190, the value &#34;Expand (f)&#34; where (f) is set to &#34;expanded&#34; if it is currently collapsed, or to &#34;collapsed&#34; if it is currently expanded. Then the logic moves to step 124 where the display routine is reexecuted. By way of example, FIG. 4 shows a summary wherein all of the file displays are collapsed, whereas, FIG. 5 shows a summary wherein the address list display is expanded, while the remaining file displays remain collapsed. 
     If none of the application files indicators have been selected, then in step 192 the CPU checks to determine whether any of the expanded record extracts have been selected. If so, the selected record is displayed and the display mode is switched to the full page display mode in step 194. By way of example, FIG. 6 shows a fully displayed record. 
     If none of the record extracts have been selected, then in step 198, the CPU determines whether a new search string has been entered into the find box 72. If so, the logic goes to step 111 (FIG. 8) and a new search is performed using the new search string. 
     If a new search string has not been entered, the logic moves to step 128 where is checks to see whether the find button 66 has been selected. If so, the find operation is terminated, the find dialog box 72 is removed from the screen 42 and the logic returns to step 100 to process other user inputs until the next find operation is requested by tapping find button 66. On the other hand, when the find button 66 has not been selected, the logic will loop back to the beginning of the user processing routine (step 181) and the aforementioned steps will be repeated, Similarly, after any of the user input processing steps 183 (scroll up), 185 (scroll down), 190 (expand/collapse), and 194 (display record),the logic will loop back to the beginning of the user processing routine at step 181. 
     In a preferred embodiment, the computer system is capable of executing other normal operations while the find box 72 is displayed. If a selected operation requires display space on screen 42, then the summary box 77 may be written over. However, the find box 72 will remain displayed until it is actually dismissed. In alternative embodiments, the act of executing other normal operations or selected operations can serve to terminate the find operation. 
     Turning next to FIG. 14, a suitable algorithm for processing user inputs (step 146) within a local search will be described. Initially, in step 249, the value &#34;f&#34; is set to the current application number and the value &#34;Last Index[f]&#34; is set to zero (0). Then in step 250, the CPU checks to determine whether the upwards scroll button 54A has been pressed. If so, in step 251, the value &#34;Direction [f]&#34; is set to one (1) and then the logic moves to the scrolling algorithm as discussed below with respect to FIG. 15. If the upwards scroll button 54A has not been pressed, then the process moves to step 253 where the CPU checks to determine whether the downwards scroll button 54B has been pressed. If so, in step 254 the value &#34;Direction [f]&#34; is set to negative one (-1) and the logic again moves to the scrolling algorithm discussed below with respect to FIG. 15. 
     When neither of the scroll arrows has been selected, the CPU moves to step 256 where it checks to determine whether the global icon 75 has been selected. If so, the find mode is set to &#34;global&#34; and the logic moves to step 120 (see FIG. 9), where a global search is performed on the current search string. If not, the CPU 12 moves to step 259 where it determines whether the overview button 55 has been selected. If so, (and the current display mode is the full page display mode) in step 260 an overview of the search results is displayed as seen in FIG. 7. On the other hand, if the current display mode in step 260 is the overview display mode, then the display mode will switch back to the full page display mode. If the overview button 55 has not been pressed, the logic moves to step 262 where it determines whether a new search string has been entered in find box 72. If so, a new search is performed using the new search string and the logic returns to step 111. 
     If a new search string has not been entered, then the logic moves to step 264 148, where it determines whether the find button 66 has been tapped. If the find button 66 has been selected, the find operation is terminated, the find dialog box 72 is dismissed and the logic returns to step 100 to process other user inputs until the next find operation is requested by tapping find button 66. When the find button 66 has not been selected, the logic loops back to step 250 to process any further user inputs. This loop will continue until the user inputs a command that causes the logic to exit the loop. 
     In embodiments where a new local search will be performed after a new application file has been selected, an additional step is added between step 262 and 248. In this step the logic would determine whether a new application has been selected. If so, a local search would be performed in the newly selected application. This is accomplished by having the logic return to step 111 is a new application has been selected. 
     Referring next to FIG. 15, the scrolling operation that occurs when either scroll button 54A or 54B is pressed will be described. As indicated above, when the selection of a scroll button is observed in either step 250 or step 253, the value &#34;Direction[f]&#34; is set in steps 251 or 254 respectively. The value &#34;Direction[f]&#34; is set to one (1) when the scroll down button 54B is selected and is set to negative one (-1) when the scroll up button 54A is selected. Then, in step 270, the value &#34;r&#34; is set to the value &#34;last index[f]&#34;. Thereafter, in step 272, the value &#34;r&#34; is either incremented or decremented (depending upon the direction of the scroll arrow selected) by setting the value &#34;r&#34; equal to the old value &#34;r&#34; plus the value &#34;Direction[f]&#34;, which is either plus or minus one (+1). 
     Thereafter, in step 274, the CPU 12 checks to determine whether the new value &#34;r&#34; is less than zero. If so, in step 275, the value of &#34;r&#34; is reset to the value &#34;#Records in File&#34; minus one. This covers the situation where the current record is the first record in the file and the user has hit the scroll up button 54A. Effectively, the record list wraps around to the last record in the current application file (f). If the value of &#34;r&#34; detected in step 274 is not less than zero, then in step 277 the CPU checks to determine whether the value &#34;r&#34; is greater than or equal to the value &#34;#Records in File&#34;. If so, the value of &#34;r&#34; is reset to zero (0) in step 278. This covers the situation where the current record is the last record in the file and the user has selected the scroll down arrow 54B. 
     When the value &#34;r&#34; is not greater than or equal to the value &#34;#Records in File&#34; in step 277, or after the value &#34;r&#34; has been reset in either step 275 or step 278, then in step 280, a search is preformed to look for the search string in Record (r). Then in step 281 the CPU determines whether an occurrence of the search string was found. If the search string is not found, the logic returns to step 272 where the counter is again incremented or decremented. Therefore, a loop between steps 272 and 281 is formed and will be repeated until the next record having the search string therein is found. 
     Once an occurrence of the search string is detected in step 281, the value &#34;Last Index [f]&#34; is set to &#34;r&#34; in step 283. The record &#34;r&#34; in application file &#34;f&#34; is displayed in step 284 and the actual occurrence(s) of the search string in record &#34;r&#34; is (are) highlighted in step 285. Thereafter, in step 287, the CPU determines whether there is room to display another record. If so, the value &#34;r&#34; is incremented by one in step 288 and the logic returns to step 284 where it displays the next record. Thus, a loop is formed between steps 284 and 287 until the screen display is full. When the screen display is full, the logic returns to step 250 where it begins to look for the next user input. It is noted that when the full display mode is in use, each record is likely to occupy the full screen. 
     Therefore, the first time the process comes to step 287 it would determine that there is not rom to display the next record (r+1), therefore, it would immediately revert to step 250. On the other hand, when an overview display mode is in use, the first time the process comes to step 287 there will likely be room to display the next record and the process will loop back to step 284. 
     Although only a one embodiment of the present invention with some variations has been described in detail herein, it should be understood that the present invention may be embodied in many other specific forms without departing from the spirit or scope of the invention. For example, the computer system, on which the described find and display task are executed may be varied widely. Similarly, the commands may be entered via keyboard entries, soft buttons on the screen, menu items, voice entry or any other input mechanism. Additionally, the contents, structure and/or formats of the stored application files and records, as well as the nature of the display formats may all be varied widely. Further, the algorithms described are exemplary in nature and may be widely varied within the scope of the invention. From the foregoing, it should be apparent that the present examples are to be considered as illustrative and not restrictive and the invention is not to be limited to the details given herein, but may be modified within the scope of the appended claims.