12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061(**************************************************************************)(* *)(* OCamlFormat *)(* *)(* Copyright (c) Facebook, Inc. and its affiliates. *)(* *)(* This source code is licensed under the MIT license found in *)(* the LICENSE file in the root directory of this source tree. *)(* *)(**************************************************************************)(** Precedence levels of Ast terms. *)typet=|Low|Semi|LessMinus|ColonEqual|As|Comma|MinusGreater|BarBar|AmperAmper|InfixOp0|InfixOp1|ColonColon|InfixOp2|InfixOp3|InfixOp4|UMinus|Apply|HashOp|Dot|High|Atomicletcompare:t->t->int=Poly.compareletequalab=compareab=0letto_string=function|Low->"Low"|Semi->"Semi"|LessMinus->"LessMinus"|ColonEqual->"ColonEqual"|As->"As"|Comma->"Comma"|MinusGreater->"MinusGreater"|BarBar->"BarBar"|AmperAmper->"AmperAmper"|InfixOp0->"InfixOp0"|InfixOp1->"InfixOp1"|ColonColon->"ColonColon"|InfixOp2->"InfixOp2"|InfixOp3->"InfixOp3"|InfixOp4->"InfixOp4"|UMinus->"UMinus"|Apply->"Apply"|Dot->"Dot"|HashOp->"HashOp"|High->"High"|Atomic->"Atomic"