val (<=) : #t:Type -> {|totalorder t|} -> t -> t -> bool
let (<=) x y = compare x y <> Gt
val (<=) : #t:Type -> {|totalorder t|} -> t -> t -> bool
let op_Less_Equals x y =
compare x y <> Gt
FStar.Class.TotalOrder.Raw.fst.checked
prims.fst.checked FStar.Tactics.Typeclasses.fsti.checked FStar.Pervasives.Native.fst.checked FStar.Pervasives.fsti.checked FStar.Order.fst.checked
FStar.Class.TotalOrder.Raw.fst
FStar.Class.TotalOrder.Raw.totalorder Prims.op_disEquality FStar.Order.order FStar.Class.TotalOrder.Raw.compare FStar.Order.Gt Prims.bool
(*
   Copyright 2008-2018 Microsoft Research

   Licensed under the Apache License, Version 2.0 (the "License");
   you may not use this file except in compliance with the License.
   You may obtain a copy of the License at

       http://www.apache.org/licenses/LICENSE-2.0

   Unless required by applicable law or agreed to in writing, software
   distributed under the License is distributed on an "AS IS" BASIS,
   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   See the License for the specific language governing permissions and
   limitations under the License.
*)
module FStar.Class.TotalOrder.Raw

open FStar.Order

let flip = function
  | Lt -> Gt
  | Eq -> Eq
  | Gt -> Lt

let raw_comparator (a:Type) = a -> a -> order

class totalorder (a:Type) = {
  compare : raw_comparator a;
}

val (<) : #t:Type -> {|totalorder t|} -> t -> t -> bool
let (<) x y = compare x y = Lt

val (>) : #t:Type -> {|totalorder t|} -> t -> t -> bool
let (>) x y = compare x y = Gt

val (=) : #t:Type -> {|totalorder t|} -> t -> t -> bool
let (=) x y = compare x y = Eq
val (<=) : #t:Type -> {|totalorder t|} -> t -> t -> bool
{| _: FStar.Class.TotalOrder.Raw.totalorder t |} -> x: t -> y: t -> Prims.bool