aboutsummaryrefslogtreecommitdiff
path: root/src/PushButtonSynthesis
diff options
context:
space:
mode:
authorGravatar jadep <jade.philipoom@gmail.com>2019-04-03 14:45:32 -0400
committerGravatar jadephilipoom <jade.philipoom@gmail.com>2019-04-03 23:34:53 +0100
commitbd34d676010ebf6dd4aa5076537f89572803dd3d (patch)
treebbc634fa51d071a4bd1e55019dc6853ecd936622 /src/PushButtonSynthesis
parentee30e8faf778ac9fd43f1d8d9d6d61cd4e9d8b3f (diff)
partition -> Partition.partition to prevent confusion with List.partition
Diffstat (limited to 'src/PushButtonSynthesis')
-rw-r--r--src/PushButtonSynthesis/BarrettReduction.v4
-rw-r--r--src/PushButtonSynthesis/Primitives.v2
-rw-r--r--src/PushButtonSynthesis/WordByWordMontgomery.v4
3 files changed, 5 insertions, 5 deletions
diff --git a/src/PushButtonSynthesis/BarrettReduction.v b/src/PushButtonSynthesis/BarrettReduction.v
index 42be4b7d4..990a0de03 100644
--- a/src/PushButtonSynthesis/BarrettReduction.v
+++ b/src/PushButtonSynthesis/BarrettReduction.v
@@ -75,7 +75,7 @@ Section rbarrett_red.
Lemma mut_correct :
0 < machine_wordsize ->
- partition (uweight machine_wordsize) (1 + 1) (muLow + 2 ^ machine_wordsize) = [muLow; 1].
+ Partition.partition (uweight machine_wordsize) (1 + 1) (muLow + 2 ^ machine_wordsize) = [muLow; 1].
Proof.
intros; cbn. subst muLow.
assert (0 < 2^machine_wordsize) by ZeroBounds.Z.zero_bounds.
@@ -90,7 +90,7 @@ Section rbarrett_red.
Lemma Mt_correct :
0 < machine_wordsize ->
2^(machine_wordsize - 1) < M < 2^machine_wordsize ->
- partition (uweight machine_wordsize) 1 M = [M].
+ Partition.partition (uweight machine_wordsize) 1 M = [M].
Proof.
intros; cbn. assert (0 < 2^(machine_wordsize-1)) by ZeroBounds.Z.zero_bounds.
rewrite !uweight_S, weight_0; auto using uwprops with lia.
diff --git a/src/PushButtonSynthesis/Primitives.v b/src/PushButtonSynthesis/Primitives.v
index 93c2e4c69..a3df39c25 100644
--- a/src/PushButtonSynthesis/Primitives.v
+++ b/src/PushButtonSynthesis/Primitives.v
@@ -574,7 +574,7 @@ Module CorrectnessStringification.
Ltac stringify ctx correctness fname arg_var_data out_var_data :=
let G := match goal with |- ?G => G end in
let correctness := (eval hnf in correctness) in
- let correctness := (eval cbv [partition WordByWordMontgomery.valid WordByWordMontgomery.small] in correctness) in
+ let correctness := (eval cbv [Partition.partition WordByWordMontgomery.valid WordByWordMontgomery.small] in correctness) in
let correctness := strip_bounds_info correctness in
let arg_var_names := constr:(type.map_for_each_lhs_of_arrow (@ToString.C.OfPHOAS.names_of_var_data) arg_var_data) in
let out_var_names := constr:(ToString.C.OfPHOAS.names_of_base_var_data out_var_data) in
diff --git a/src/PushButtonSynthesis/WordByWordMontgomery.v b/src/PushButtonSynthesis/WordByWordMontgomery.v
index ebf250664..ea67f8b9c 100644
--- a/src/PushButtonSynthesis/WordByWordMontgomery.v
+++ b/src/PushButtonSynthesis/WordByWordMontgomery.v
@@ -103,9 +103,9 @@ Section __.
end.
Let n_bytes := bytes_n machine_wordsize 1 n.
Let prime_upperbound_list : list Z
- := partition (uweight machine_wordsize) n (s-1).
+ := Partition.partition (uweight machine_wordsize) n (s-1).
Let prime_bytes_upperbound_list : list Z
- := partition (weight 8 1) n_bytes (s-1).
+ := Partition.partition (weight 8 1) n_bytes (s-1).
Let upperbounds : list Z := prime_upperbound_list.
Definition prime_bound : ZRange.type.option.interp (base.type.Z)
:= Some r[0~>m-1]%zrange.