refactor: remove more stdune cruft

ocaml-lsp-server/src/import.ml

@@ -1,22 +1,26 @@
 (* All modules from [Stdune] should be in the struct below. The modules are
    listed alphabetically. Try to keep the order. *)
 
+module Poly = struct
+  let equal = ( = )
+  let compare x y = Ordering.of_int (compare x y)
+  let hash x = Hashtbl.hash x
+end
+
+let sprintf = Printf.sprintf
+
 include struct
   open Stdune
   module Code_error = Code_error
   module Comparable = Comparable
   module Exn_with_backtrace = Exn_with_backtrace
   module Int = Int
   module Table = Table
-  module Tuple = Tuple
   module Unix_env = Env
   module Io = Io
   module Map = Map
   module Monoid = Monoid
   module Pid = Pid
-  module Poly = Poly
-
-  let sprintf = sprintf
 end
 
 include struct

ocaml-lsp-server/src/position.ml

@@ -37,10 +37,7 @@ let ( - ) ({ line; character } : t) (t : t) : t =
 ;;
 
 let abs ({ line; character } : t) : t = { line = abs line; character = abs character }
-
-let compare ({ line; character } : t) (t : t) : Ordering.t =
-  Stdune.Tuple.T2.compare Int.compare Int.compare (line, character) (t.line, t.character)
-;;
+let compare (x : t) (t : t) : Ordering.t = Poly.compare x t
 
 let compare_inclusion (t : t) (r : Lsp.Types.Range.t) =
   match compare t r.start, compare t r.end_ with

ocaml-lsp-server/src/range.ml

@@ -22,7 +22,7 @@ let contains (x : t) (y : t) =
 let compare_size (x : t) (y : t) =
   let dx = Position.(x.end_ - x.start) in
   let dy = Position.(y.end_ - y.start) in
-  Tuple.T2.compare Int.compare Int.compare (dx.line, dy.line) (dx.character, dy.character)
+  Poly.compare (dx.line, dy.line) (dx.character, dy.character)
 ;;
 
 let first_line =