The intended “searchQuick” (sQuick) is an application to enable a user to search a set of books or texts, like an encyclopedia, or some other topical book collection offline built in the open source platform Pharo 4.0.
After the GUI was designed with minimal features, the next task was to develop the cardinal search function.
Indubitably, a well-run search application/engine requires indexing.
Search Application/Engine Indexing basically collects, parses and stores data to facilitate fast and accurate information retrieval.
That being, the index for sQuick was built using the Dictionary data structure in Pharo which works like HashTable of other programming languages/platforms.
index := Dictionary new.
Pharo describes a Dictionary as: “I represent a set of elements that can be viewed from one of the two perspectives: a set of associations, or a container of values that are extremely named where the name can be any object that responds to =. The external name is referred to as the key. I inherit many operations from the Set. “
The contents of the text files present in the current Pharo image were split at whitespaces and added to the index along with the corresponding file title.
tokens := ‘ ‘ split: aDocument contents.
The method #indexFiles was used to iterate over all the text files in the current Pharo image to index all the files before the searching begins.
Dictionary Entries after File Content Indexing
The #queryString method has been temporarily build using #includesSubstring which matches the user input string with all the entries of the index and gives the result in an array form with #tally output as the number of search results.
Various test methods are now built to inspect the functioning of the methods designed. Continuous debugging is being done to check out and remove errors, if any 😉
- Improve the indexing technique
- Explore methods to quicken the search functionality
- Integrate the search routine with the GUI already built
- Design more test cases to develop a bug-free application
Stay tuned for more…
Post any queries , will be happy to help 🙂