/usr/include/NTL/vector.h is in libntl-dev 6.2.1-1.
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 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 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 | #ifndef NTL_vector__H
#define NTL_vector__H
#include <NTL/tools.h>
struct _ntl_VectorHeader {
long length;
long alloc;
long init;
long fixed;
};
union _ntl_AlignedVectorHeader {
_ntl_VectorHeader h;
double x1;
long x2;
char *x3;
};
#define NTL_VECTOR_HEADER_SIZE (sizeof(_ntl_AlignedVectorHeader))
#define NTL_VEC_HEAD(p) (& (((_ntl_AlignedVectorHeader *) p)[-1].h))
struct _ntl_vector_placement {
void *p;
};
inline _ntl_vector_placement _ntl_vector_placement_fn(void *p)
{
_ntl_vector_placement x;
x.p = p;
return x;
}
inline void *operator new(NTL_SNS size_t, _ntl_vector_placement x) { return x.p; }
// All of this monkey business is to avoid possible clashes with
// a "placement new" operator which may or may not be defined
// in a standard header file....why wasn't this just built
// into the language to begin with?
#ifndef NTL_RANGE_CHECK
#define NTL_RANGE_CHECK_CODE
#define NTL_RANGE_CHECK_CODE1(i)
#else
#define NTL_RANGE_CHECK_CODE if (l__i < 0 || !_vec__rep || l__i >= NTL_VEC_HEAD(_vec__rep)->length) RangeError(l__i);
#define NTL_RANGE_CHECK_CODE1(i) if ((i) < 0 || !_vec__rep || (i) >= NTL_VEC_HEAD(_vec__rep)->length) RangeError(i);
#endif
// vectors are allocated in chunks of this size
#ifndef NTL_VectorMinAlloc
#define NTL_VectorMinAlloc (4)
#endif
// vectors are always expanded by at least this ratio
#ifndef NTL_VectorExpansionRatio
#define NTL_VectorExpansionRatio (1.2)
#endif
// controls initialization during input
#ifndef NTL_VectorInputBlock
#define NTL_VectorInputBlock 50
#endif
NTL_OPEN_NNS
template<class T>
void BlockConstruct(T* p, long n)
{
for (long i = 0; i < n; i++)
(void) new(_ntl_vector_placement_fn(&p[i])) T;
}
template<class T>
void BlockConstructFromVec(T* p, long n, const T* q)
{
for (long i = 0; i < n; i++)
(void) new(_ntl_vector_placement_fn(&p[i])) T(q[i]);
}
template<class T>
void BlockConstructFromObj(T* p, long n, const T& q)
{
for (long i = 0; i < n; i++)
(void) new(_ntl_vector_placement_fn(&p[i])) T(q);
}
template<class T>
void BlockDestroy(T* p, long n)
{
for (long i = 0; i < n; i++)
p[i].~T();
}
template<class T>
class Vec {
public:
T *_vec__rep;
void RangeError(long i) const;
Vec() : _vec__rep(0) { }
Vec(INIT_SIZE_TYPE, long n) : _vec__rep(0) { SetLength(n); }
Vec(const Vec<T>& a) : _vec__rep(0) { *this = a; }
Vec<T>& operator=(const Vec<T>& a);
~Vec();
void kill();
void SetMaxLength(long n);
void FixLength(long n);
void QuickSetLength(long n) { NTL_VEC_HEAD(_vec__rep)->length = n; }
void SetLength(long n) {
if (_vec__rep && !NTL_VEC_HEAD(_vec__rep)->fixed &&
n >= 0 && n <= NTL_VEC_HEAD(_vec__rep)->init)
NTL_VEC_HEAD(_vec__rep)->length = n;
else
DoSetLength(n);
}
void SetLength(long n, const T& a) {
if (_vec__rep && !NTL_VEC_HEAD(_vec__rep)->fixed &&
n >= 0 && n <= NTL_VEC_HEAD(_vec__rep)->init)
NTL_VEC_HEAD(_vec__rep)->length = n;
else
DoSetLength(n, a);
}
long length() const
{ return (!_vec__rep) ? 0 : NTL_VEC_HEAD(_vec__rep)->length; }
long MaxLength() const
{ return (!_vec__rep) ? 0 : NTL_VEC_HEAD(_vec__rep)->init; }
long allocated() const
{ return (!_vec__rep) ? 0 : NTL_VEC_HEAD(_vec__rep)->alloc; }
long fixed() const
{ return _vec__rep && NTL_VEC_HEAD(_vec__rep)->fixed; }
T& operator[](long i)
{
NTL_RANGE_CHECK_CODE1(i)
return _vec__rep[i];
}
const T& operator[](long i) const
{
NTL_RANGE_CHECK_CODE1(i)
return _vec__rep[i];
}
T& RawGet(long i)
{
return _vec__rep[i];
}
const T& RawGet(long i) const
{
return _vec__rep[i];
}
T& operator()(long i) { return (*this)[i-1]; }
const T& operator()(long i) const { return (*this)[i-1]; }
const T* elts() const { return _vec__rep; }
T* elts() { return _vec__rep; }
Vec(Vec<T>& x, INIT_TRANS_TYPE)
{ _vec__rep = x._vec__rep; x._vec__rep = 0; }
long position(const T& a) const;
long position1(const T& a) const;
void swap(Vec<T>& y);
void append(const T& a);
void append(const Vec<T>& w);
// Some compatibility with vec_GF2
const T& get(long i) const
{ return (*this)[i]; }
void put(long i, const T& a)
{ (*this)[i] = a; }
// Some STL compatibility
typedef T value_type;
typedef value_type& reference;
typedef const value_type& const_reference;
typedef value_type *iterator;
typedef const value_type *const_iterator;
const T* data() const { return elts(); }
T* data() { return elts(); }
T* begin() { return elts(); }
const T* begin() const { return elts(); }
T* end() {
if (elts())
return elts() + length();
else
return 0;
}
const T* end() const {
if (elts())
return elts() + length();
else
return 0;
}
T& at(long i) {
if ((i) < 0 || !_vec__rep || (i) >= NTL_VEC_HEAD(_vec__rep)->length)
RangeError(i);
return _vec__rep[i];
}
const T& at(long i) const {
if ((i) < 0 || !_vec__rep || (i) >= NTL_VEC_HEAD(_vec__rep)->length)
RangeError(i);
return _vec__rep[i];
}
private:
void DoSetLength(long n);
void DoSetLength(long n, const T& a);
void AdjustLength(long n) { if (_vec__rep) NTL_VEC_HEAD(_vec__rep)->length = n; }
void AdjustAlloc(long n) { if (_vec__rep) NTL_VEC_HEAD(_vec__rep)->alloc = n; }
void AdjustMaxLength(long n) { if (_vec__rep) NTL_VEC_HEAD(_vec__rep)->init = n; }
void AllocateTo(long n); // reserves space for n items, also checking
void Init(long n); // make sure first n entries are initialized
void Init(long n, const T* src); // same, but use src
void Init(long n, const T& src); // same, but use src
};
#if (!defined(NTL_CLEAN_PTR))
template<class T>
long Vec<T>::position(const T& a) const
{
if (!_vec__rep) return -1;
long num_alloc = NTL_VEC_HEAD(_vec__rep)->alloc;
long num_init = NTL_VEC_HEAD(_vec__rep)->init;
if (&a < _vec__rep || &a >= _vec__rep + num_alloc) return -1;
long res = (&a) - _vec__rep;
if (res < 0 || res >= num_alloc ||
_vec__rep + res != &a) return -1;
if (res >= num_init)
Error("position: reference to uninitialized object");
return res;
}
template<class T>
long Vec<T>::position1(const T& a) const
{
if (!_vec__rep) return -1;
long len = NTL_VEC_HEAD(_vec__rep)->length;
if (&a < _vec__rep || &a >= _vec__rep + len) return -1;
long res = (&a) - _vec__rep;
if (res < 0 || res >= len ||
_vec__rep + res != &a) return -1;
return res;
}
#else
template<class T>
long Vec<T>::position(const T& a) const
{
if (!_vec__rep) return -1;
long num_alloc = NTL_VEC_HEAD(_vec__rep)->alloc;
long num_init = NTL_VEC_HEAD(_vec__rep)->init;
long res;
res = 0;
while (res < num_alloc && _vec__rep + res != &a) res++;
if (res >= num_alloc) return -1;
if (res >= num_init)
Error("position: reference to uninitialized object");
return res;
}
template<class T>
long Vec<T>::position1(const T& a) const
{
if (!_vec__rep) return -1;
long len = NTL_VEC_HEAD(_vec__rep)->length;
long res;
res = 0;
while (res < len && _vec__rep + res != &a) res++;
if (res >= len) return -1;
return res;
}
#endif
template<class T>
void Vec<T>::AllocateTo(long n)
{
long m;
if (n < 0) {
Error("negative length in vector::SetLength");
}
if (NTL_OVERFLOW(n, sizeof(T), 0))
Error("excessive length in vector::SetLength");
if (_vec__rep && NTL_VEC_HEAD(_vec__rep)->fixed) {
if (NTL_VEC_HEAD(_vec__rep)->length == n)
return;
else
Error("SetLength: can't change this vector's length");
}
if (n == 0) {
return;
}
if (!_vec__rep) {
m = ((n+NTL_VectorMinAlloc-1)/NTL_VectorMinAlloc) * NTL_VectorMinAlloc;
char *p = (char *) NTL_SNS_MALLOC(m, sizeof(T), sizeof(_ntl_AlignedVectorHeader));
if (!p) {
Error("out of memory in vector::SetLength()");
}
_vec__rep = (T *) (p + sizeof(_ntl_AlignedVectorHeader));
NTL_VEC_HEAD(_vec__rep)->length = 0;
NTL_VEC_HEAD(_vec__rep)->alloc = m;
NTL_VEC_HEAD(_vec__rep)->init = 0;
NTL_VEC_HEAD(_vec__rep)->fixed = 0;
}
else if (n > NTL_VEC_HEAD(_vec__rep)->alloc) {
m = max(n, long(NTL_VectorExpansionRatio*NTL_VEC_HEAD(_vec__rep)->alloc));
m = ((m+NTL_VectorMinAlloc-1)/NTL_VectorMinAlloc) * NTL_VectorMinAlloc;
char *p = ((char *) _vec__rep) - sizeof(_ntl_AlignedVectorHeader);
p = (char *) NTL_SNS_REALLOC(p, m, sizeof(T), sizeof(_ntl_AlignedVectorHeader));
if (!p) {
Error("out of memory in vector::SetLength()");
}
_vec__rep = (T *) (p + sizeof(_ntl_AlignedVectorHeader));
NTL_VEC_HEAD(_vec__rep)->alloc = m;
}
}
template<class T>
void Vec<T>::Init(long n)
{
long num_init = MaxLength();
if (n <= num_init) return;
BlockConstruct(_vec__rep + num_init, n-num_init);
AdjustMaxLength(n);
}
template<class T>
void Vec<T>::Init(long n, const T *src)
{
long num_init = MaxLength();
if (n <= num_init) return;
BlockConstructFromVec(_vec__rep + num_init, n-num_init, src);
AdjustMaxLength(n);
}
template<class T>
void Vec<T>::Init(long n, const T& src)
{
long num_init = MaxLength();
if (n <= num_init) return;
BlockConstructFromObj(_vec__rep + num_init, n-num_init, src);
AdjustMaxLength(n);
}
template<class T>
void Vec<T>::DoSetLength(long n)
{
AllocateTo(n);
Init(n);
AdjustLength(n);
}
template<class T>
void Vec<T>::DoSetLength(long n, const T& a)
{
// if vector gets moved, we have to worry about
// a aliasing a vector element
const T *src = &a;
long pos = -1;
if (n >= allocated()) pos = position(a);
AllocateTo(n);
if (pos != -1) src = elts() + pos;
Init(n, *src);
AdjustLength(n);
}
template<class T>
void Vec<T>::SetMaxLength(long n)
{
long OldLength = length();
SetLength(n);
SetLength(OldLength);
}
template<class T>
void Vec<T>::FixLength(long n)
{
if (_vec__rep) Error("FixLength: can't fix this vector");
if (n < 0) Error("FixLength: negative length");
if (n > 0)
SetLength(n);
else {
char *p = (char *) NTL_SNS_MALLOC(0, sizeof(T), sizeof(_ntl_AlignedVectorHeader));
if (!p) {
Error("out of memory in vector::FixLength()");
}
_vec__rep = (T *) (p + sizeof(_ntl_AlignedVectorHeader));
NTL_VEC_HEAD(_vec__rep)->length = 0;
NTL_VEC_HEAD(_vec__rep)->init = 0;
NTL_VEC_HEAD(_vec__rep)->alloc = 0;
}
NTL_VEC_HEAD(_vec__rep)->fixed = 1;
}
template<class T>
Vec<T>& Vec<T>::operator=(const Vec<T>& a)
{
if (this == &a) return *this;
long len = length();
long init = MaxLength();
long src_len = a.length();
const T *src = a.elts();
AllocateTo(src_len);
T *dst = elts();
if (src_len <= init) {
long i;
for (i = 0; i < src_len; i++)
dst[i] = src[i];
}
else {
long i;
for (i = 0; i < init; i++)
dst[i] = src[i];
Init(src_len, src+init);
}
AdjustLength(src_len);
return *this;
}
template<class T>
Vec<T>::~Vec()
{
if (!_vec__rep) return;
BlockDestroy(_vec__rep, NTL_VEC_HEAD(_vec__rep)->init);
NTL_SNS free(((char *) _vec__rep) - sizeof(_ntl_AlignedVectorHeader));
}
template<class T>
void Vec<T>::kill()
{
if (!_vec__rep) return;
if (NTL_VEC_HEAD(_vec__rep)->fixed) Error("can't kill this vector");
BlockDestroy(_vec__rep, NTL_VEC_HEAD(_vec__rep)->init);
NTL_SNS free(((char *) _vec__rep) - sizeof(_ntl_AlignedVectorHeader));
_vec__rep = 0;
}
template<class T>
void Vec<T>::RangeError(long i) const
{
NTL_SNS cerr << "index out of range in vector: ";
NTL_SNS cerr << i;
if (!_vec__rep)
NTL_SNS cerr << "(0)";
else
NTL_SNS cerr << "(" << NTL_VEC_HEAD(_vec__rep)->length << ")";
Error("");
}
template<class T>
void Vec<T>::swap(Vec<T>& y)
{
T* t;
long xf = fixed();
long yf = y.fixed();
if (xf != yf ||
(xf && NTL_VEC_HEAD(_vec__rep)->length != NTL_VEC_HEAD(y._vec__rep)->length))
Error("swap: can't swap these vectors");
t = _vec__rep;
_vec__rep = y._vec__rep;
y._vec__rep = t;
}
template<class T>
void swap(Vec<T>& x, Vec<T>& y)
{
x.swap(y);
}
template<class T>
void Vec<T>::append(const T& a)
{
long len = length();
long init = MaxLength();
long src_len = 1;
// if vector gets moved, we have to worry about
// a aliasing a vector element
const T *src = &a;
long pos = -1;
if (len >= allocated()) pos = position(a);
AllocateTo(len+src_len);
long i;
T *dst = elts();
if (pos != -1) src = dst + pos;
if (len+src_len <= init) {
for (i = 0; i < src_len; i++)
dst[i+len] = src[i];
}
else {
for (i = 0; i < init-len; i++)
dst[i+len] = src[i];
Init(src_len+len, src+init-len);
}
AdjustLength(len+src_len);
}
template<class T>
void append(Vec<T>& v, const T& a)
{
v.append(a);
}
template<class T>
void Vec<T>::append(const Vec<T>& w)
{
long len = length();
long init = MaxLength();
long src_len = w.length();
AllocateTo(len+src_len);
const T *src = w.elts();
T *dst = elts();
if (len+src_len <= init) {
long i;
for (i = 0; i < src_len; i++)
dst[i+len] = src[i];
}
else {
long i;
for (i = 0; i < init-len; i++)
dst[i+len] = src[i];
Init(src_len+len, src+init-len);
}
AdjustLength(len+src_len);
}
template<class T>
void append(Vec<T>& v, const Vec<T>& w)
{
v.append(w);
}
template<class T>
NTL_SNS istream & operator>>(NTL_SNS istream& s, Vec<T>& a)
{
Vec<T> ibuf;
long c;
long n;
if (!s) Error("bad vector input");
c = s.peek();
while (IsWhiteSpace(c)) {
s.get();
c = s.peek();
}
if (c != '[') {
Error("bad vector input");
}
n = 0;
ibuf.SetLength(0);
s.get();
c = s.peek();
while (IsWhiteSpace(c)) {
s.get();
c = s.peek();
}
while (c != ']' && !IsEOFChar(c)) {
if (n % NTL_VectorInputBlock == 0) ibuf.SetMaxLength(n + NTL_VectorInputBlock);
n++;
ibuf.SetLength(n);
if (!(s >> ibuf[n-1])) Error("bad vector input");
c = s.peek();
while (IsWhiteSpace(c)) {
s.get();
c = s.peek();
}
}
if (IsEOFChar(c)) Error("bad vector input");
s.get();
a = ibuf;
return s;
}
template<class T>
NTL_SNS ostream& operator<<(NTL_SNS ostream& s, const Vec<T>& a)
{
long i, n;
n = a.length();
s << '[';
for (i = 0; i < n; i++) {
s << a[i];
if (i < n-1) s << " ";
}
s << ']';
return s;
}
template<class T>
long operator==(const Vec<T>& a, const Vec<T>& b)
{
long n = a.length();
if (b.length() != n) return 0;
const T* ap = a.elts();
const T* bp = b.elts();
long i;
for (i = 0; i < n; i++) if (ap[i] != bp[i]) return 0;
return 1;
}
template<class T>
long operator!=(const Vec<T>& a, const Vec<T>& b)
{ return !(a == b); }
// conversions
template<class T, class S>
void conv(Vec<T>& x, const Vec<S>& a)
{
long n = a.length();
x.SetLength(n);
for (long i = 0; i < n; i++)
conv(x[i], a[i]);
}
NTL_CLOSE_NNS
#endif
|