Summary: This allows easily defining lexicographic orders as a composition of other orders. For example, the natural ordering on `int * string` pairs can be written: ``` Ord.Infix.((Int.compare >|= fst) @? (String.compare >|= snd)) ``` The `@?` name is chosen as a hybrid between `@@` which denotes function composition and `<?>` which is the infix operator of `Containers.Ord` for defining lexicographic orders. Differential Revision: D29441161 fbshipit-source-id: ae9143cdcmaster
parent
37aa0159ea
commit
7bb2e678e3
Loading…
Reference in new issue