libwildmagic-dev 5.13-1ubuntu1 / usr / include / libwildmagic / Wm5RVector.inl

This file is indexed.

/usr/include/libwildmagic/Wm5RVector.inl is in libwildmagic-dev 5.13-1ubuntu1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below. 

  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
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
// Geometric Tools, LLC
// Copyright (c) 1998-2014
// Distributed under the Boost Software License, Version 1.0.
// http://www.boost.org/LICENSE_1_0.txt
// http://www.geometrictools.com/License/Boost/LICENSE_1_0.txt
//
// File Version: 5.0.1 (2011/03/27)

//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
RVector<VSIZE,ISIZE>::RVector ()
{
    // For efficiency in construction of large arrays of vectors, the
    // default constructor does not initialize the vector.
}
//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
RVector<VSIZE,ISIZE>::RVector (const RVector& vec)
{
    for (int i = 0; i < VSIZE; ++i)
    {
        mTuple[i] = vec.mTuple[i];
    }
}
//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
inline RVector<VSIZE,ISIZE>::operator const Rational<ISIZE>* () const
{
    return mTuple;
}
//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
inline RVector<VSIZE,ISIZE>::operator Rational<ISIZE>* ()
{
    return mTuple;
}
//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
inline const Rational<ISIZE>& RVector<VSIZE,ISIZE>::operator[] (int i) const
{
    assertion(0 <= i && i < VSIZE, "Invalid input.\n");
    return mTuple[i];
}
//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
inline Rational<ISIZE>& RVector<VSIZE,ISIZE>::operator[] (int i)
{
    assertion(0 <= i && i < VSIZE, "Invalid input.\n");
    return mTuple[i];
}
//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
RVector<VSIZE,ISIZE>& RVector<VSIZE,ISIZE>::operator= (const RVector& vec)
{
    for (int i = 0; i < VSIZE; ++i)
    {
        mTuple[i] = vec.mTuple[i];
    }
    return *this;
}
//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
bool RVector<VSIZE,ISIZE>::operator== (const RVector& vec) const
{
    for (int i = 0; i < VSIZE; ++i)
    {
        if (mTuple[i] != vec.mTuple[i])
        {
            return false;
        }
    }
    return true;
}
//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
bool RVector<VSIZE,ISIZE>::operator!= (const RVector& vec) const
{
    return !operator==(vec);
}
//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
int RVector<VSIZE,ISIZE>::CompareArrays (const RVector& vec) const
{
    for (int i = 0; i < VSIZE; ++i)
    {
        if (mTuple[i] < vec.mTuple[i])
        {
            return -1;
        }
        if (mTuple[i] > vec.mTuple[i])
        {
            return +1;
        }
    }
    return 0;
}
//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
bool RVector<VSIZE,ISIZE>::operator< (const RVector& vec) const
{
    return CompareArrays(vec) < 0;
}
//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
bool RVector<VSIZE,ISIZE>::operator<= (const RVector& vec) const
{
    return CompareArrays(vec) <= 0;
}
//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
bool RVector<VSIZE,ISIZE>::operator> (const RVector& vec) const
{
    return CompareArrays(vec) > 0;
}
//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
bool RVector<VSIZE,ISIZE>::operator>= (const RVector& vec) const
{
    return CompareArrays(vec) >= 0;
}
//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
RVector<VSIZE,ISIZE> RVector<VSIZE,ISIZE>::operator+ (const RVector& vec)
    const
{
    RVector<VSIZE,ISIZE> sum;
    for (int i = 0; i < VSIZE; ++i)
    {
        sum.mTuple[i] = mTuple[i] + vec.mTuple[i];
    }
    return sum;
}
//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
RVector<VSIZE,ISIZE> RVector<VSIZE,ISIZE>::operator- (const RVector& vec)
    const
{
    RVector<VSIZE,ISIZE> diff;
    for (int i = 0; i < VSIZE; ++i)
    {
        diff.mTuple[i] = mTuple[i] - vec.mTuple[i];
    }
    return diff;
}
//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
RVector<VSIZE,ISIZE> RVector<VSIZE,ISIZE>::operator*
    (const Rational<ISIZE>& scalar) const
{
    RVector<VSIZE,ISIZE> prod;
    for (int i = 0; i < VSIZE; ++i)
    {
        prod.mTuple[i] = scalar*mTuple[i];
    }
    return prod;
}
//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
RVector<VSIZE,ISIZE> RVector<VSIZE,ISIZE>::operator/
    (const Rational<ISIZE>& scalar) const
{
    assertion(scalar != 0, "Division by zero\n");

    RVector<VSIZE,ISIZE> div;
    for (int i = 0; i < VSIZE; ++i)
    {
        div.mTuple[i] = mTuple[i]/scalar;
    }

    return div;
}
//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
RVector<VSIZE,ISIZE> RVector<VSIZE,ISIZE>::operator- () const
{
    RVector<VSIZE,ISIZE> neg;
    for (int i = 0; i < VSIZE; ++i)
    {
        neg.mTuple[i] = -mTuple[i];
    }
    return neg;
}
//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
RVector<VSIZE,ISIZE> operator* (const Rational<ISIZE>& scalar,
    const RVector<VSIZE,ISIZE>& vec)
{
    RVector<VSIZE,ISIZE> prod;
    for (int i = 0; i < VSIZE; ++i)
    {
        prod[i] = scalar*vec[i];
    }
    return prod;
}
//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
RVector<VSIZE,ISIZE>& RVector<VSIZE,ISIZE>::operator+= (const RVector& vec)
{
    for (int i = 0; i < VSIZE; ++i)
    {
        mTuple[i] += vec.mTuple[i];
    }
    return *this;
}
//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
RVector<VSIZE,ISIZE>& RVector<VSIZE,ISIZE>::operator-= (const RVector& vec)
{
    for (int i = 0; i < VSIZE; ++i)
    {
        mTuple[i] -= vec.mTuple[i];
    }
    return *this;
}
//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
RVector<VSIZE,ISIZE>& RVector<VSIZE,ISIZE>::operator*=
    (const Rational<ISIZE>& scalar)
{
    for (int i = 0; i < VSIZE; ++i)
    {
        mTuple[i] *= scalar;
    }
    return *this;
}
//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
RVector<VSIZE,ISIZE>& RVector<VSIZE,ISIZE>::operator/=
    (const Rational<ISIZE>& scalar)
{
    assertion(scalar != 0, "Division by zero\n");

    for (int i = 0; i < VSIZE; ++i)
    {
        mTuple[i] /= scalar;
    }
    return *this;
}
//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
Rational<ISIZE> RVector<VSIZE,ISIZE>::SquaredLength () const
{
    Rational<ISIZE> sqrLen = 0;
    for (int i = 0; i < VSIZE; ++i)
    {
        sqrLen += mTuple[i]*mTuple[i];
    }
    return sqrLen;
}
//----------------------------------------------------------------------------
template <int VSIZE, int ISIZE>
Rational<ISIZE> RVector<VSIZE,ISIZE>::Dot (const RVector& vec) const
{
    Rational<ISIZE> dot = 0;
    for (int i = 0; i < VSIZE; ++i)
    {
        dot += mTuple[i]*vec.mTuple[i];
    }
    return dot;
}
//----------------------------------------------------------------------------

APT Browse - Built by Thomas Orozco.