diff options
| author | letouzey | 2012-07-30 13:45:33 +0000 |
|---|---|---|
| committer | letouzey | 2012-07-30 13:45:33 +0000 |
| commit | 00f429861cc6bae9110d82aac2512fe5e55342bc (patch) | |
| tree | d553d4078538a4b893d26ef789f234cf86739004 /lib | |
| parent | b272730e00933e1542ee7209597ea1d35a001033 (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')
| -rw-r--r-- | lib/bigint.ml | 6 | ||||
| -rw-r--r-- | lib/bigint.mli | 4 |
2 files changed, 0 insertions, 10 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 : diff --git a/lib/bigint.mli b/lib/bigint.mli index 92a97bdc8e..34bc8e40fa 100644 --- a/lib/bigint.mli +++ b/lib/bigint.mli @@ -6,8 +6,6 @@ (* * GNU Lesser General Public License Version 2.1 *) (************************************************************************) -open Pp - (** Arbitrary large integer numbers *) type bigint @@ -39,5 +37,3 @@ val is_neg_or_zero : bigint -> bool val neg : bigint -> bigint val pow : bigint -> bigint -> bigint - -val pr_bigint : bigint -> std_ppcmds |