aboutsummaryrefslogtreecommitdiff
path: root/lib/bigint.ml
diff options
context:
space:
mode:
authorletouzey2012-07-30 13:45:33 +0000
committerletouzey2012-07-30 13:45:33 +0000
commit00f429861cc6bae9110d82aac2512fe5e55342bc (patch)
treed553d4078538a4b893d26ef789f234cf86739004 /lib/bigint.ml
parentb272730e00933e1542ee7209597ea1d35a001033 (diff)
Bigint: avoid dependency over Pp
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@15664 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'lib/bigint.ml')
-rw-r--r--lib/bigint.ml6
1 files changed, 0 insertions, 6 deletions
diff --git a/lib/bigint.ml b/lib/bigint.ml
index 7fce6b815d..1985eceb81 100644
--- a/lib/bigint.ml
+++ b/lib/bigint.ml
@@ -6,10 +6,6 @@
(* * GNU Lesser General Public License Version 2.1 *)
(************************************************************************)
-(*i*)
-open Pp
-(*i*)
-
(***************************************************)
(* Basic operations on (unbounded) integer numbers *)
(***************************************************)
@@ -348,8 +344,6 @@ let is_strictly_pos n = is_strictly_pos (ints_of_z n)
let is_neg_or_zero n = is_neg_or_zero (ints_of_z n)
let is_pos_or_zero n = is_pos_or_zero (ints_of_z n)
-let pr_bigint n = str (to_string n)
-
(* spiwack: computes n^m *)
(* The basic idea of the algorithm is that n^(2m) = (n^2)^m *)
(* In practice the algorithm performs :