Tidy.Precedence

data QualifiedOperator

Constructors

• QualifiedOperator (Maybe ModuleName) OperatorNamespace Operator

Instances

• Eq QualifiedOperator
• Ord QualifiedOperator

data OperatorNamespace

Constructors

• OperatorType
• OperatorValue

Instances

• Eq OperatorNamespace
• Ord OperatorNamespace

data OperatorTree op a

Constructors

• OpList (OperatorTree op a) Precedence (OperatorChain op a)
• OpPure a

type OperatorChain op a = NonEmptyArray (Tuple op (OperatorTree op a))

type Precedence = Int

type PrecedenceMap = Map (Maybe ModuleName) (Map (Tuple OperatorNamespace Operator) Precedence)

defaultPrecedence :: Precedence

toOperatorTree :: forall op a. PrecedenceMap -> (op -> QualifiedOperator) -> a -> NonEmptyArray (Tuple op a) -> OperatorTree op a

remapOperators :: forall e. PrecedenceMap -> Module e -> PrecedenceMap

insertOperator :: QualifiedOperator -> Precedence -> PrecedenceMap -> PrecedenceMap

lookupOperator :: QualifiedOperator -> PrecedenceMap -> Maybe Precedence

remapOperatorTo :: Maybe ModuleName -> QualifiedOperator -> PrecedenceMap -> PrecedenceMap

remapModuleTo :: Maybe ModuleName -> ModuleName -> PrecedenceMap -> PrecedenceMap

remapModuleToHiding :: forall f. Foldable f => f QualifiedOperator -> Maybe ModuleName -> ModuleName -> PrecedenceMap -> PrecedenceMap