Search Patterns Allowable patterns consist of a sequence of words separated by blanks. Words are typically sequences of alphanumeric characters. Each word must contain at least two alphanumeric characters. Partial words are allowed. All searching is case-insensitive.
Words can also be regular expressions.
The syntax of regular expressions is in general the same as that for agrep . Since the index is word based, a regular expression must match words that appear in the index if it is to be found. There is no size limit for simple patterns. However, regular expressions are currently limited to 30 characters. ANDs and ORs AND means that only modules whose abstracts which contain all of the words in the pattern are to be selected.