1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd">
<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
<title>~/ntl-11.4.2/doc/vec_ZZ_p.cpp.html</title>
<meta name="Generator" content="Vim/8.0">
<meta name="plugin-version" content="vim7.4_v2">
<meta name="syntax" content="cpp">
<meta name="settings" content="use_css,pre_wrap,no_foldcolumn,expand_tabs,prevent_copy=">
<meta name="colorscheme" content="macvim">
<style type="text/css">
<!--
pre { white-space: pre-wrap; font-family: monospace; color: #000000; background-color: #ffffff; }
body { font-family: monospace; color: #000000; background-color: #ffffff; }
* { font-size: 1em; }
.String { color: #4a708b; }
.PreProc { color: #1874cd; }
.Statement { color: #b03060; font-weight: bold; }
.Comment { color: #0000ee; font-style: italic; }
.Type { color: #008b00; font-weight: bold; }
-->
</style>
<script type='text/javascript'>
<!--
-->
</script>
</head>
<body>
<pre id='vimCodeElement'>
<span class="Comment">/*</span><span class="Comment">*************************************************************************\</span>
<span class="Comment">MODULE: vec_ZZ_p</span>
<span class="Comment">SUMMARY:</span>
<span class="Comment">Provides vectors over ZZ_p, along with some related operations.</span>
<span class="Comment">\*************************************************************************</span><span class="Comment">*/</span>
<span class="PreProc">#include </span><span class="String"><NTL/ZZ_p.h></span>
<span class="PreProc">#include </span><span class="String"><NTL/vec_ZZ.h></span>
<span class="PreProc">#include </span><span class="String"><NTL/vector.h></span>
<span class="Type">typedef</span> Vec<ZZ_p> vec_ZZ_p; <span class="Comment">// backward compatibility</span>
<span class="Type">void</span> mul(vec_ZZ_p& x, <span class="Type">const</span> vec_ZZ_p& a, <span class="Type">const</span> ZZ_p& b);
<span class="Type">void</span> mul(vec_ZZ_p& x, <span class="Type">const</span> vec_ZZ_p& a, <span class="Type">long</span> b);
<span class="Type">void</span> mul(vec_ZZ_p& x, <span class="Type">const</span> ZZ_p& a, <span class="Type">const</span> vec_ZZ_p& b);
<span class="Type">void</span> mul(vec_ZZ_p& x, <span class="Type">long</span> a, <span class="Type">const</span> vec_ZZ_p& b);
<span class="Comment">// x = a * b</span>
<span class="Type">void</span> add(vec_ZZ_p& x, <span class="Type">const</span> vec_ZZ_p& a, <span class="Type">const</span> vec_ZZ_p& b);
<span class="Comment">// x = a + b</span>
<span class="Type">void</span> sub(vec_ZZ_p& x, <span class="Type">const</span> vec_ZZ_p& a, <span class="Type">const</span> vec_ZZ_p& b);
<span class="Comment">// x = a - b</span>
<span class="Type">void</span> clear(vec_ZZ_p& x);
<span class="Comment">// x = 0 (length unchanged)</span>
<span class="Type">void</span> negate(vec_ZZ_p& x, <span class="Type">const</span> vec_ZZ_p& a);
<span class="Comment">// x = -a</span>
<span class="Type">long</span> IsZero(<span class="Type">const</span> vec_ZZ_p& a);
<span class="Comment">// test if a is the zero vector</span>
<span class="Type">void</span> InnerProduct(ZZ_p& x, <span class="Type">const</span> vec_ZZ_p& a, <span class="Type">const</span> vec_ZZ_p& b);
<span class="Comment">// x = sum_{i=0}^{n-1} a[i]*b[i], where n = min(a.length(),</span>
<span class="Comment">// b.length())</span>
<span class="Type">void</span> InnerProduct(ZZ_p& x, <span class="Type">const</span> vec_ZZ_p& a, <span class="Type">const</span> vec_ZZ_p& b,
<span class="Type">long</span> offset);
<span class="Comment">// x = sum_{i=offset}^{n-1} a[i]*b[i-offset], where n = min(a.length(),</span>
<span class="Comment">// b.length()+offset)</span>
<span class="Type">void</span> VectorCopy(vec_ZZ_p& x, <span class="Type">const</span> vec_ZZ_p& a, <span class="Type">long</span> n);
vec_ZZ_p VectorCopy(<span class="Type">const</span> vec_ZZ_p& a, <span class="Type">long</span> n);
<span class="Comment">// x = a copy of a of length exactly n.</span>
<span class="Comment">// The input is truncated or padded with zeroes, as necessary.</span>
<span class="Type">void</span> random(vec_ZZ_p& x, <span class="Type">long</span> n); <span class="Comment">// x = random vector of length n</span>
vec_ZZ_p random_vec_ZZ_p(<span class="Type">long</span> n);
<span class="Comment">// operator notation:</span>
vec_ZZ_p <span class="Statement">operator</span>+(<span class="Type">const</span> vec_ZZ_p& a, <span class="Type">const</span> vec_ZZ_p& b);
vec_ZZ_p <span class="Statement">operator</span>-(<span class="Type">const</span> vec_ZZ_p& a, <span class="Type">const</span> vec_ZZ_p& b);
vec_ZZ_p <span class="Statement">operator</span>-(<span class="Type">const</span> vec_ZZ_p& a);
<span class="Comment">// vector/scalar multiplication:</span>
vec_ZZ_p <span class="Statement">operator</span>*(<span class="Type">const</span> vec_ZZ_p& a, <span class="Type">const</span> ZZ_p& b);
vec_ZZ_p <span class="Statement">operator</span>*(<span class="Type">const</span> vec_ZZ_p& a, <span class="Type">long</span> b);
vec_ZZ_p <span class="Statement">operator</span>*(<span class="Type">const</span> ZZ_p& a, <span class="Type">const</span> vec_ZZ_p& b);
vec_ZZ_p <span class="Statement">operator</span>*(<span class="Type">long</span> a, <span class="Type">const</span> vec_ZZ_p& b);
<span class="Comment">// inner product:</span>
ZZ_p <span class="Statement">operator</span>*(<span class="Type">const</span> vec_ZZ_p& a, <span class="Type">const</span> vec_ZZ_p& b);
<span class="Comment">// assignment operator notation:</span>
vec_ZZ_p& <span class="Statement">operator</span>+=(vec_ZZ_p& x, <span class="Type">const</span> vec_ZZ_p& a);
vec_ZZ_p& <span class="Statement">operator</span>-=(vec_ZZ_p& x, <span class="Type">const</span> vec_ZZ_p& a);
vec_ZZ_p& <span class="Statement">operator</span>*=(vec_ZZ_p& x, <span class="Type">const</span> ZZ_p& a);
vec_ZZ_p& <span class="Statement">operator</span>*=(vec_ZZ_p& x, <span class="Type">long</span> a);
<span class="Comment">// Implementation note: the BlockConstruct routine has been customized</span>
<span class="Comment">// for ZZ_p so that when a vec_ZZ_p is grown, space for the needed</span>
<span class="Comment">// elements is allocated in one contiguous chunk. This saves on calls to</span>
<span class="Comment">// malloc and free, and should also yield better locality of reference.</span>
<span class="Comment">// One connsequence of this is that swapping an element of a vec_ZZ_p</span>
<span class="Comment">// with another ZZ_p can not be implemented by pointer swap, and will in</span>
<span class="Comment">// this case be done by copy.</span>
</pre>
</body>
</html>
<!-- vim: set foldmethod=manual : -->
|
