kotlin {
    target("src/**/*.kt")
    targetExclude("**/kotlinTemplates/**/*.kt")
    ktlint()
    suppressLintsFor {
      step = "ktlint"
      shortCode = "standard:mixed-condition-operators"
    }
  }
  kotlinGradle {
    target("*.kts")
    ktlint()
  }

type OpFactor struct {
	Op    string  `parser:"@(\"+\" | \"-\")"`
	Right *MultOp `parser:"@@"`
}

// MultOp represents a single term followed by an optional sequence of
// terms separated by *, / or % operators.
type MultOp struct {
	Left  *UnaryTerm     `parser:"@@"`
	Right []*OpUnaryTerm `parser:"(@@)*"`
}

// OpUnaryTerm represents the right side of *, / or % binary operations.
type OpUnaryTerm struct {

## 6. Implementation Status

- Full AWS S3 [SELECT SQL](https://docs.aws.amazon.com/AmazonS3/latest/dev/s3-glacier-select-sql-reference-select.html) syntax is supported.
- All [operators](https://docs.aws.amazon.com/AmazonS3/latest/dev/s3-glacier-select-sql-reference-operators.html) are supported.
- All aggregation, conditional, type-conversion and string functions are supported.
- JSON path expressions such as `FROM S3Object[*].path` are not yet evaluated.

	case int64:
		v.value = -x
	}
}

// Value comparison functions: we do not expose them outside the
// module. Logical operators "<", ">", ">=", "<=" work on strings and
// numbers. Equality operators "=", "!=" work on strings,
// numbers and booleans.

// Supported comparison operators
const (
	opLt    = "<"
	opLte   = "<="
	opGt    = ">"
	opGte   = ">="
	opEq    = "="
	opIneq  = "!="

	macroName                             // name of macro that should not be expanded
)

// IsRegisterShift reports whether the token is one of the ARM register shift operators.
func IsRegisterShift(r ScanToken) bool {
	return ROT <= r && r <= LSH // Order looks backwards because these are negative.
}

func (t ScanToken) String() string {
	switch t {
	case scanner.EOF:
		return "EOF"

Multiplication operators bind strongest, followed by addition
operators, comparison operators, <code>&amp;&amp;</code> (logical AND),
and finally <code>||</code> (logical OR):
</p>

<pre class="grammar">
Precedence    Operator
    5             *  /  %  &lt;&lt;  &gt;&gt;  &amp;  &amp;^
    4             +  -  |  ^
    3             ==  !=  &lt;  &lt;=  &gt;  &gt;=

    // Should write a benchmark to test that!
    Map<Element, Element> map = mapToTest;
    Element[] queries = this.queries;

    // Allows us to use & instead of %, acting on hearsay that division
    // operators (/%) are disproportionately expensive; should test this too!
    int mask = queries.length - 1;

    boolean dummy = false;
    for (int i = 0; i < reps; i++) {
      dummy ^= map.get(queries[i & mask]) != null;

     * Returns the access mask associated with this ACE. Use the
     * constants for <code>FILE_READ_DATA</code>, <code>FILE_WRITE_DATA</code>,
     * <code>READ_CONTROL</code>, <code>GENERIC_ALL</code>, etc with bitwise
     * operators to determine which bits of the mask are on or off.
     *
     * @return the access mask
     */
    int getAccessMask();

    /**
     * Returns the 'Apply To' text for inheritance of ACEs on

            return baseQuery;
        }
        return baseQuery + " sort:" + sortField;
    }

    /**
     * Appends a query string to the query buffer with proper formatting.
     * Handles OR operators and wraps complex queries in parentheses when necessary.
     *
     * @param queryBuf the StringBuilder to append to
     * @param query the query string to append
     */

     * Returns the access mask accociated with this ACE. Use the
     * constants for <code>FILE_READ_DATA</code>, <code>FILE_WRITE_DATA</code>,
     * <code>READ_CONTROL</code>, <code>GENERIC_ALL</code>, etc with bitwise
     * operators to determine which bits of the mask are on or off.
     * @return the access mask for this ACE
     */
    public int getAccessMask() {
        return access;
    }

    /**