diff options
author | pboutill <pboutill@85f007b7-540e-0410-9357-904b9bb8a0f7> | 2012-12-19 00:13:21 +0000 |
---|---|---|
committer | pboutill <pboutill@85f007b7-540e-0410-9357-904b9bb8a0f7> | 2012-12-19 00:13:21 +0000 |
commit | 32b7a0cc9c8302febd7639d22c80554fa4ec8d88 (patch) | |
tree | c5798518db283d05d83d399802c5d50b093b417f /plugins/nsatz | |
parent | 7a30e5bbcfb2dc3e7b7bf0cf2cd4e27eab31dcfb (diff) |
Array.create is deprecated
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@16104 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'plugins/nsatz')
-rw-r--r-- | plugins/nsatz/nsatz.ml4 | 2 | ||||
-rw-r--r-- | plugins/nsatz/polynom.ml | 12 |
2 files changed, 7 insertions, 7 deletions
diff --git a/plugins/nsatz/nsatz.ml4 b/plugins/nsatz/nsatz.ml4 index 34be7244d..7b42fc5ba 100644 --- a/plugins/nsatz/nsatz.ml4 +++ b/plugins/nsatz/nsatz.ml4 @@ -427,7 +427,7 @@ let remove_list_tail l i = let remove_zeros zero lci = let n = List.length (List.hd lci) in let m=List.length lci in - let u = Array.create m false in + let u = Array.make m false in let rec utiles k = if k>=m then () diff --git a/plugins/nsatz/polynom.ml b/plugins/nsatz/polynom.ml index a610c8461..ce70a0ffb 100644 --- a/plugins/nsatz/polynom.ml +++ b/plugins/nsatz/polynom.ml @@ -133,7 +133,7 @@ let x n = Prec (n,[|cf0;cf1|]) let monome v n = match n with 0->Pint coef1; - |_->let tmp = Array.create (n+1) (Pint coef0) in + |_->let tmp = Array.make (n+1) (Pint coef0) in tmp.(n)<-(Pint coef1); Prec (v, tmp) @@ -191,7 +191,7 @@ let norm p = match p with if !n<0 then Pint coef0 else if !n=0 then a.(0) else if !n=d then p - else (let b=Array.create (!n+1) (Pint coef0) in + else (let b=Array.make (!n+1) (Pint coef0) in for i=0 to !n do b.(i)<-a.(i);done; Prec(x,b)) @@ -243,7 +243,7 @@ let rec plusP p q = Prec (x,p2)) else (let n=max (deg x p) (deg x q) in - let r=Array.create (n+1) (Pint coef0) in + let r=Array.make (n+1) (Pint coef0) in for i=0 to n do r.(i)<- plusP (coef x i p) (coef x i q); done; @@ -277,13 +277,13 @@ let rec vars=function (* multiply p by v^n, v >= max_var p *) let multx n v p = match p with - Prec (x,p1) when x=v -> let p2= Array.create ((Array.length p1)+n) (Pint coef0) in + Prec (x,p1) when x=v -> let p2= Array.make ((Array.length p1)+n) (Pint coef0) in for i=0 to (Array.length p1)-1 do p2.(i+n)<-p1.(i); done; Prec (x,p2) |_ -> if equal p (Pint coef0) then (Pint coef0) - else (let p2=Array.create (n+1) (Pint coef0) in + else (let p2=Array.make (n+1) (Pint coef0) in p2.(n)<-p; Prec (v,p2)) @@ -320,7 +320,7 @@ let deriv v p = let d = Array.length p1 -1 in if d=1 then p1.(1) else - (let p2 = Array.create d (Pint coef0) in + (let p2 = Array.make d (Pint coef0) in for i=0 to d-1 do p2.(i)<- multP (Pint (coef_of_int (i+1))) p1.(i+1); done; |