let insert (#a:eqtype) (#f:cmp a) (x:a) (s:ordset a f) = union #a #f (singleton #a #f x) s
let insert (#a: eqtype) (#f: cmp a) (x: a) (s: ordset a f) =
union #a #f (singleton #a #f x) s
FStar.OrdSetProps.fst.checked
prims.fst.checked FStar.Pervasives.fsti.checked FStar.OrdSet.fsti.checked
FStar.OrdSetProps.fst
Prims.eqtype FStar.OrdSet.cmp FStar.OrdSet.ordset FStar.OrdSet.union FStar.OrdSet.singleton
(*
   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.OrdSetProps
 
open FStar.OrdSet
 
val fold: #a:eqtype -> #b:Type -> #f:cmp a -> (a -> b -> Tot b) -> s:ordset a f -> b
          -> Tot b (decreases (size s))
let rec fold (#a:eqtype) (#b:Type) #f g s x =
  if s = empty then x
  else
    let Some e = choose s in
    let a_rest = fold g (remove e s) x in
    g e a_rest

(**********)
val insert : x: a -> s: FStar.OrdSet.ordset a f -> FStar.OrdSet.ordset a f
x: a -> s: FStar.OrdSet.ordset a f -> FStar.OrdSet.ordset a f