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 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398
|
/**************************************************************************
* *
* Regina - A Normal Surface Theory Calculator *
* Computational Engine *
* *
* Copyright (c) 1999-2011, Ben Burton *
* For further details contact Ben Burton (bab@debian.org). *
* *
* This program is free software; you can redistribute it and/or *
* modify it under the terms of the GNU General Public License as *
* published by the Free Software Foundation; either version 2 of the *
* License, or (at your option) any later version. *
* *
* This program is distributed in the hope that it will be useful, but *
* WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU *
* General Public License for more details. *
* *
* You should have received a copy of the GNU General Public *
* License along with this program; if not, write to the Free *
* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, *
* MA 02110-1301, USA. *
* *
**************************************************************************/
/* end stub */
/*! \file maths/nvector.h
* \brief Provides a fast and generic vector class.
*/
#ifndef __NVECTOR_H
#ifndef __DOXYGEN
#define __NVECTOR_H
#endif
#include <algorithm>
#include <iostream>
#include "regina-core.h"
namespace regina {
/**
* \weakgroup maths
* @{
*/
/**
* An optimised vector class of elements from a given ring T.
* Various mathematical vector operations are available.
*
* This class is intended for serious computation, and as a result it has a
* streamlined implementation with no virtual methods. It can be subclassed,
* but since there are no virtual methods, type information must generally
* be known at compile time. Nevertheless, in many respects, different
* subclasses of NVector<T> can happily interact with one another.
*
* This class is written with bulky types in mind (such as
* arbitrary precision integers), and so creations and operations are kept
* to a minimum.
*
* \warning As of Regina 4.90, this class merges the old functionality of
* NFastVector and the NVector hierarchy from Regina 4.6. As a side-effect,
* the hierarchy has been compressed into just one class (NVectorUnit,
* NVectorMatrix and NVectorDense are gone), elements are always stored as
* dense vectors, and functions are no longer virtual (since the storage
* model is now fixed). The virtual clone() method is gone completely
* (since there are no longer virtual functions you should use the copy
* constructor instead), and the old makeLinComb() method is also gone
* (just use operator *= and addCopies()).
*
* \pre Type T has a copy constructor. That is,
* if \c a and \c b are of type T, then \c a can be initialised to the value
* of \c b using <tt>a(b)</tt>.
* \pre Type T has a default constructor. That is,
* an object of type T can be declared with no arguments. No specific
* default value is required.
* \pre Type T allows for operators <tt>=</tt>, <tt>==</tt>, <tt>+=</tt>,
* <tt>-=</tt> and <tt>*=</tt>.
* \pre Type T has a long integer constructor. That is, if \c a is of type T,
* then \c a can be initialised to a long integer \c l using <tt>a(l)</tt>.
* \pre An element \c t of type T can be written to an output stream
* \c out using the standard expression <tt>out << t</tt>.
*
* \ifacespython Not present.
*/
template <class T>
class NVector {
public:
static T zero;
/**< Zero in the underlying number system.
* This would be \c const if it weren't for the fact that
* some compilers don't like this. It should never be
* modified! */
static T one;
/**< One in the underlying number system.
* This would be \c const if it weren't for the fact that
* some compilers don't like this. It should never be
* modified! */
static T minusOne;
/**< Negative one in the underlying number system.
* This would be \c const if it weren't for the fact that
* some compilers don't like this. It should never be
* modified! */
protected:
T* elements;
/**< The internal array containing all vector elements. */
T* end;
/**< A pointer just beyond the end of the internal array.
The size of the vector can be computed as (end - elements). */
public:
/**
* Creates a new vector.
* Its elements will not be initialised.
*
* @param newVectorSize the number of elements in the new
* vector; this must be strictly positive.
*/
inline NVector(unsigned newVectorSize) :
elements(new T[newVectorSize]), end(elements + newVectorSize) {
}
/**
* Creates a new vector and initialises every element to the
* given value.
*
* @param newVectorSize the number of elements in the new
* vector; this must be strictly positive.
* @param initValue the value to assign to every element of the
* vector.
*/
inline NVector(unsigned newVectorSize, const T& initValue) :
elements(new T[newVectorSize]), end(elements + newVectorSize) {
std::fill(elements, end, initValue);
}
/**
* Creates a new vector that is a clone of the given vector.
*
* @param cloneMe the vector to clone.
*/
inline NVector(const NVector<T>& cloneMe) :
elements(new T[cloneMe.end - cloneMe.elements]),
end(elements + (cloneMe.end - cloneMe.elements)) {
std::copy(cloneMe.elements, cloneMe.end, elements);
}
/**
* Destroys this vector.
*/
inline ~NVector() {
delete[] elements;
}
/**
* Returns the number of elements in the vector.
*
* @return the vector size.
*/
inline unsigned size() const {
return end - elements;
}
/**
* Returns the element at the given index in the vector.
* A constant reference to the element is returned; the element
* may not be altered.
*
* \pre \c index is between 0 and size()-1 inclusive.
*
* @param index the vector index to examine.
* @return the vector element at the given index.
*/
inline const T& operator[](unsigned index) const {
return elements[index];
}
/**
* Sets the element at the given index in the vector to the
* given value.
*
* \pre \c index is between 0 and size()-1 inclusive.
*
* @param index the vector index to examine.
* @param value the new value to assign to the element.
* @return the vector element at the given index.
*/
inline void setElement(unsigned index, const T& value) {
elements[index] = value;
}
/**
* Determines if this vector is equal to the given vector.
*
* \pre This and the given vector have the same size.
*
* @param compare the vector with which this will be compared.
* @return \c true if and only if the this and the given vector
* are equal.
*/
inline bool operator == (const NVector<T>& compare) const {
return std::equal(elements, end, compare.elements);
}
/**
* Sets this vector equal to the given vector.
*
* \pre This and the given vector have the same size.
*
* @param cloneMe the vector whose value shall be assigned to this
* vector.
*/
inline NVector<T>& operator = (const NVector<T>& cloneMe) {
std::copy(cloneMe.elements, cloneMe.end, elements);
return *this;
}
/**
* Adds the given vector to this vector.
*
* \pre This and the given vector have the same size.
*
* @param other the vector to add to this vector.
*/
inline void operator += (const NVector<T>& other) {
T* e = elements;
const T* o = other.elements;
for ( ; e < end; ++e, ++o)
*e += *o;
}
/**
* Subtracts the given vector from this vector.
*
* \pre This and the given vector have the same size.
*
* @param other the vector to subtract from this vector.
*/
inline void operator -= (const NVector<T>& other) {
T* e = elements;
const T* o = other.elements;
for ( ; e < end; ++e, ++o)
*e -= *o;
}
/**
* Multiplies this vector by the given scalar.
*
* @param factor the scalar with which this will be multiplied.
*/
inline void operator *= (const T& factor) {
if (factor == NVector<T>::one)
return;
for (T* e = elements; e < end; ++e)
*e *= factor;
}
/**
* Calculates the dot product of this vector and the given vector.
*
* \pre This and the given vector have the same size.
*
* @param other the vector with which this will be multiplied.
* @return the dot product of this and the given vector.
*/
inline T operator * (const NVector<T>& other) const {
T ans(zero);
const T* e = elements;
const T* o = other.elements;
for ( ; e < end; ++e, ++o)
ans += (*e) * (*o);
return ans;
}
/**
* Negates every element of this vector.
*/
inline void negate() {
for (T* e = elements; e < end; ++e)
*e = -*e;
}
/**
* Returns the norm of this vector.
* This is the dot product of the vector with itself.
*
* @return the norm of this vector.
*/
inline T norm() const {
T ans(zero);
for (const T* e = elements; e < end; ++e)
ans += (*e) * (*e);
return ans;
}
/**
* Returns the sum of all elements of this vector.
*
* @return the sum of the elements of this vector.
*/
inline T elementSum() const {
T ans(zero);
for (const T* e = elements; e < end; ++e)
ans += *e;
return ans;
}
/**
* Adds the given multiple of the given vector to this vector.
*
* \pre This and the given vector have the same size.
*
* @param other the vector a multiple of which will be added to
* this vector.
* @param multiple the multiple of \a other to be added to this
* vector.
*/
void addCopies(const NVector<T>& other, const T& multiple) {
if (multiple == NVector<T>::zero)
return;
if (multiple == NVector<T>::one) {
(*this) += other;
return;
}
if (multiple == NVector<T>::minusOne) {
(*this) -= other;
return;
}
T* e = elements;
const T* o = other.elements;
for ( ; e < end; ++e, ++o)
*e += *o * multiple;
}
/**
* Subtracts the given multiple of the given vector to this vector.
*
* \pre This and the given vector have the same size.
*
* @param other the vector a multiple of which will be
* subtracted from this vector.
* @param multiple the multiple of \a other to be subtracted
* from this vector.
*/
void subtractCopies(const NVector<T>& other, const T& multiple) {
if (multiple == NVector<T>::zero)
return;
if (multiple == NVector<T>::one) {
(*this) -= other;
return;
}
if (multiple == NVector<T>::minusOne) {
(*this) += other;
return;
}
T* e = elements;
const T* o = other.elements;
for ( ; e < end; ++e, ++o)
*e -= *o * multiple;
}
};
/**
* Writes the given vector to the given output stream.
* The vector will be written on a single line with elements separated
* by a single space. No newline will be written.
*
* \ifacespython Not present.
*
* @param out the output stream to which to write.
* @param vector the vector to write.
* @return a reference to \a out.
*/
template <class T>
std::ostream& operator << (std::ostream& out, const NVector<T>& vector) {
unsigned size = vector.size();
if (size == 0)
return out;
out << vector[0];
for (unsigned i=1; i<size; i++)
out << ' ' << vector[i];
return out;
}
template <class T>
T NVector<T>::zero(0L);
/**< Zero in the underlying number system.
* This would be \c const if it weren't for the fact that
* some compilers don't like this. It should never be
* modified! */
template <class T>
T NVector<T>::one(1L);
/**< One in the underlying number system.
* This would be \c const if it weren't for the fact that
* some compilers don't like this. It should never be
* modified! */
template <class T>
T NVector<T>::minusOne(-1L);
/**< Negative one in the underlying number system.
* This would be \c const if it weren't for the fact that
* some compilers don't like this. It should never be
* modified! */
/*@}*/
} // namespace regina
#endif
|