Boolean Search

A Boolean search is one where a specific relationship exists between the keywords you provide.
You can specify that either both must be present (the AND operator) or at least one must be present (the OR operator).
Some examples will help clarify.

Example 1

apple AND pie
If you enter the keyword apple in Keyword 1 and pie in Keyword 2 and select the AND radio button you will retrieve a list of lines which contain both the word apple and pie somewhere in the line.

Example 2

truck OR train
If you enter the keyword truck in Keyword 1 and train in Keyword 2 and select the OR radio button, you will retrieve a list of lines which contain either the word truck or the word train somewhere in the line.

Example 3

apple AND pie OR pizza

If you enter the keyword apple in Keyword 1 and pie in Keyword 2 and select the first AND radio button; then enter pizza in Keyword 3 and select the second OR radio button, you will retrieve a list of lines which contain the word [apple] in addition to either of the words [pie OR pizza].
Hence, the order of precedence is summarised using brackets as: (apple AND (pie OR pizza))
When using all three keywords, the OR relationship will always take precedence ie. the OR'd keyword pair will be grouped together. It is envisaged that this will become customisable in a later release of CatView.