"Infix" is common to arithmetic and logical formulas and uses parentheses () to group operators and operands as well as define their precedence.
- An Infix-notations sentence is constructed as
- [<field>>/](<Infix-Term1> <BinaryOperator> <Infix-Term2> )[:<weight>]
Infix Notation Terms are
- Terms with an optional postfix unary operator and/or an optional field specification prefix: [<Field Name>/]<Term>[<InfixPostfixTermOp>]
- Valid Infix sentences, grouped with ( and ).
- The prefix Field/ is used to specify that the sentence should be a member of the named field, resp. path. It may contain "wildcards" ("Glob Expression Syntax").
- The prefix Field!/ is used to specify that the contents is not in (exclusive to) the field.
- The prefix Field// is used to specify that the terms is in a common instance of the field (container). The expression FOO//(A and B) is equivalent to (A and:FOO B).
- The optional weight (a floating point number) specifies a weighting in the ranking of hits matching the expression.
