/usr/include/GVec.hh is in libgff-dev 1.0-1build1.
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 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 | //---------------------------------------------------------------------------
/*
Sortable collection of pointers to objects
*/
#ifndef _GVec_HH
#define _GVec_HH
#include "GBase.h"
#define GVEC_INDEX_ERR "GVec error: invalid index: %d\n"
#if defined(NDEBUG) || defined(NODEBUG) || defined(_NDEBUG) || defined(NO_DEBUG)
#define TEST_INDEX(x)
#else
#define TEST_INDEX(x) \
if (x<0 || x>=fCount) GError(GVEC_INDEX_ERR, x)
#endif
#define GVEC_CAPACITY_ERR "GVec error: invalid capacity: %d\n"
#define GVEC_COUNT_ERR "GVec error: invalid count: %d\n"
#define MAXLISTSIZE INT_MAX-1
#define FREEDATA (fFreeProc!=NULL)
template<class T> struct IsPrimitiveType {
enum { VAL = 0 };
};
template<> struct IsPrimitiveType<bool> { enum { VAL = 1 }; };
template<> struct IsPrimitiveType<void*> { enum { VAL = 1 }; };
template<> struct IsPrimitiveType<float> { enum { VAL = 1 }; };
template<> struct IsPrimitiveType<double> { enum { VAL = 1 }; };
template<> struct IsPrimitiveType<int> { enum { VAL = 1 }; };
template<> struct IsPrimitiveType<unsigned int> { enum { VAL = 1 }; };
template<> struct IsPrimitiveType<char> { enum { VAL = 1 }; };
template<> struct IsPrimitiveType<unsigned char> { enum { VAL = 1 }; };
template<> struct IsPrimitiveType<short> { enum { VAL = 1 }; };
template<> struct IsPrimitiveType<unsigned short> { enum { VAL = 1 }; };
template<> struct IsPrimitiveType<long> { enum { VAL = 1 }; };
template<> struct IsPrimitiveType<unsigned long> { enum { VAL = 1 }; };
template<> struct IsPrimitiveType<long long> { enum { VAL = 1 }; };
template<> struct IsPrimitiveType<unsigned long long> { enum { VAL = 1 }; };
/*
template<> struct IsPrimitiveType<int64_t> { enum { VAL = 1 }; };
template<> struct IsPrimitiveType<uint64_t> { enum { VAL = 1 }; };
template<> struct IsPrimitiveType<int32_t> { enum { VAL = 1 }; };
template<> struct IsPrimitiveType<uint32_t> { enum { VAL = 1 }; };
template<> struct IsPrimitiveType<int16_t> { enum { VAL = 1 }; };
template<> struct IsPrimitiveType<uint16_t> { enum { VAL = 1 }; };
template<> struct IsPrimitiveType<int8_t> { enum { VAL = 1 }; };
template<> struct IsPrimitiveType<uint8_t> { enum { VAL = 1 }; };
*/
template <class OBJ> int DefLTCompareProc(const pointer p1, const pointer p2) {
const OBJ& o1 = *((OBJ*) p1);
const OBJ& o2 = *((OBJ*) p2);
if (o1 < o2) return -1;
else return ((o2 < o1) ? 1 : 0 );
}
//basic template for array of objects;
//so it doesn't require comparison operators to be defined
template <class OBJ> class GVec {
protected:
OBJ* fArray;
int fCount;
int fCapacity;
void qSort(int L, int R, GCompareProc* cmpFunc);
public:
GVec(int init_capacity=2);
GVec(int init_count, const OBJ init_val);
GVec(GVec<OBJ>& array); //copy constructor
const GVec<OBJ>& operator=(GVec<OBJ>& array); //copy operator
virtual ~GVec();
void Insert(int idx, OBJ item) { Insert(idx, &item); }
void Insert(int idx, OBJ* item);
void idxInsert(int idx, OBJ& item) { Insert(idx, &item); }
void Grow();
void Grow(int idx, OBJ& item); //grow and add/insert item copy
void Reverse(); //WARNING: will break the sort order if SORTED!
int Add(OBJ* item); // simply append to the end of fArray, reallocating as needed
int Add(OBJ& item) { return Add(&item); }
int cAdd(OBJ item) { return Add(&item); } //all these will CREATE a new OBJ and COPY to it
// // using OBJ copy operator=
// -- stack/queue usage:
//int Push(OBJ& item) { return Add(&item); }
int Push(OBJ& item) { return Add(&item); }
int cPush(OBJ item) { return Add(&item); }
OBJ Pop();// Stack use; removes and returns a copy of the last item
OBJ Shift(); //Queue use: removes and returns a copy of the first item
void Add(GVec<OBJ>& list); //append copies of all items from another list
OBJ& Get(int idx) {
TEST_INDEX(idx);
return fArray[idx];
}
inline OBJ& operator[](int i) {
TEST_INDEX(i);
return fArray[i];
}
OBJ& Last() {
TEST_INDEX(fCount-1);
return fArray[fCount-1];
}
OBJ& First() {
TEST_INDEX(0);
return fArray[0];
}
void Clear();
void Delete(int index);
void Replace(int idx, OBJ& item); //Put, use operator= to copy
void Exchange(int idx1, int idx2);
void Swap(int idx1, int idx2) { Exchange(idx1, idx2); }
int Capacity() { return fCapacity; }
//this will reject identical items in sorted lists only!
void setCapacity(int NewCapacity);
int Count() { return fCount; }
void setCount(int NewCount); // will trim or expand the array as needed
void setCount(int NewCount, OBJ* v); //same as setCount() but new objects are set to v
void setCount(int NewCount, OBJ v);
void Resize(int NewCount) { setCount(NewCount); }
//void Resize(int NewCount, OBJ* v) { setCount(NewCount, v); }
void Resize(int NewCount, OBJ v) { setCount(NewCount, &v); }
//void Move(int curidx, int newidx);
bool isEmpty() { return fCount==0; }
bool notEmpty() { return fCount>0; }
void Sort(GCompareProc* cmpFunc);
void Sort();
};
//---- template for dynamic array of object pointers
//---- it's faster than GVec<OBJ*> and has item deallocation awareness
template <class OBJ> class GPVec {
protected:
OBJ** fList; //pointer to an array of pointers to objects
int fCount; //total number of entries in list
int fCapacity; //current allocated size
GFreeProc* fFreeProc; //useful for deleting objects
//---
void Expand();
void Grow();
void Grow(int idx, OBJ* newitem);
void qSort(int L, int R, GCompareProc* cmpFunc);
public:
static void DefaultFreeProc(pointer item) {
delete (OBJ*)item;
}
virtual ~GPVec();
GPVec(int init_capacity=2, bool free_elements=true); //also the default constructor
GPVec(bool free_elements);
GPVec(GPVec<OBJ>& list); //copy constructor?
GPVec(GPVec<OBJ>* list); //kind of a copy constructor
const GPVec<OBJ>& operator=(GPVec<OBJ>& list);
OBJ* Get(int i);
OBJ* operator[](int i) { return this->Get(i); }
void Reverse(); //reverse pointer array; WARNING: will break the sort order if sorted!
void freeItem(int idx); //calls fFreeProc (or DefaultFreeProc) on fList[idx] and sets NULL there, doesn't pack!
//it will free even if fFreeProc is NULL!
void setFreeItem(GFreeProc *freeProc) { fFreeProc=freeProc; }
void setFreeItem(bool doFree) {
if (doFree) fFreeProc=DefaultFreeProc;
else fFreeProc=NULL;
}
// -- stack usage:
int Push(OBJ* item) { return Add(item); }
OBJ* Pop();// Stack use; removes and returns last item,but does NOT FREE it
OBJ* Shift(); //Queue use: removes and returns first item, but does NOT FREE it
void deallocate_item(OBJ*& item); //forcefully call fFreeProc or delete on item
void Clear();
void Exchange(int idx1, int idx2);
void Swap(int idx1, int idx2) { Exchange(idx1, idx2); }
OBJ* First() { return (fCount>0)?fList[0]:NULL; }
OBJ* Last() { return (fCount>0)?fList[fCount-1]:NULL;}
bool isEmpty() { return fCount==0; }
bool notEmpty() { return fCount>0; }
int Capacity() { return fCapacity; }
int Count() { return fCount; }
void setCapacity(int NewCapacity);
void setCount(int NewCount); //the same as setCapacity() but the new item range is filled with NULLs
int Add(OBJ* item); //simply append the pointer copy
void Add(GPVec<OBJ>& list); //add all pointers from another list
void Insert(int idx, OBJ* item);
void Move(int curidx, int newidx);
void Put(int idx, OBJ* item);
void Pack();
void Delete(int index); //also frees the item if fFreeProc!=NULL, and shifts the successor items
void Forget(int idx); //simply places a NULL at fList[idx], nothing else
int RemovePtr(pointer item); //always use linear search to find the pointer! calls Delete() if found
int IndexOf(pointer item); //a linear search for pointer address!
void Sort(GCompareProc* cmpFunc);
void Sort();
};
//-------------------- TEMPLATE IMPLEMENTATION-------------------------------
template <class OBJ> GVec<OBJ>::GVec(int init_capacity) {
fCount=0;
fCapacity=0;
fArray=NULL;
setCapacity(init_capacity);
}
template <class OBJ> GVec<OBJ>::GVec(int init_count, const OBJ init_val) {
fCount=0;
fCapacity=0;
fArray=NULL;
setCapacity(init_count);
fCount = init_count;
for (int i=0;i<fCount;i++)
fArray[i]=init_val;
}
template <class OBJ> GVec<OBJ>::GVec(GVec<OBJ>& array) { //copy constructor
this->fCount=array.fCount;
this->fCapacity=array.fCapacity;
this->fArray=NULL;
if (this->fCapacity>0) {
if (IsPrimitiveType<OBJ>::VAL) {
GMALLOC(fArray, fCapacity*sizeof(OBJ));
memcpy(fArray, array.fArray, fCount*sizeof(OBJ));
}
else {
fArray=new OBJ[this->fCapacity]; //]()
// uses OBJ operator=
for (int i=0;i<this->fCount;i++) fArray[i]=array[i];
}
}
this->fCount=array.fCount;
}
template <class OBJ> const GVec<OBJ>& GVec<OBJ>::operator=(GVec<OBJ>& array) {
if (&array==this) return *this;
Clear();
fCapacity=array.fCapacity;
fCount=array.fCount;
if (fCapacity>0) {
if (IsPrimitiveType<OBJ>::VAL) {
GMALLOC(fArray, fCapacity*sizeof(OBJ));
memcpy(fArray, array.fArray, fCount*sizeof(OBJ));
}
else {
fArray=new OBJ[this->fCapacity]; // ]()
// uses OBJ operator=
for (int i=0;i<fCount;i++) {
fArray[i]=array.fArray[i];
}
}
}
return *this;
}
template <class OBJ> GVec<OBJ>::~GVec() {
this->Clear();
}
template <class OBJ> void GVec<OBJ>::setCapacity(int NewCapacity) {
if (NewCapacity < fCount || NewCapacity > MAXLISTSIZE)
GError(GVEC_CAPACITY_ERR, NewCapacity);
//error: NewCapacity MUST be > fCount
//if you want to shrink it use Resize() or setCount()
if (NewCapacity!=fCapacity) {
if (NewCapacity==0) {
if (IsPrimitiveType<OBJ>::VAL) {
GFREE(fArray);
} else {
delete[] fArray;
fArray=NULL;
}
}
else {
if (IsPrimitiveType<OBJ>::VAL) {
GREALLOC(fArray, NewCapacity*sizeof(OBJ));
} else {
OBJ* oldArray=fArray;
//fArray=new OBJ[NewCapacity]();
fArray=new OBJ[NewCapacity];
for (int i=0;i<this->fCount;i++) {
fArray[i] = oldArray[i];
}// we need operator= here
//wouldn't be faster to use memcpy instead?
//memcpy(fArray, oldArray, fCount*sizeof(OBJ));
if (oldArray) delete[] oldArray;
}
}
fCapacity=NewCapacity;
}
}
template <class OBJ> void GVec<OBJ>::Clear() {
fCount=0;
if (IsPrimitiveType<OBJ>::VAL) {
GFREE(fArray);
}
else {
delete[] fArray;
fArray=NULL;
}
fCapacity=0;
}
template <class OBJ> void GVec<OBJ>::Grow() {
int delta = (fCapacity>8) ? (fCapacity>>2) : 1 ;
setCapacity(fCapacity + delta);
}
template <class OBJ> void GVec<OBJ>::Reverse() {
int l=0;
int r=fCount-1;
OBJ c;
while (l<r) {
c=fArray[l];fArray[l]=fArray[r];
fArray[r]=c;
l++;r--;
}
}
template <class OBJ> void GVec<OBJ>::Grow(int idx, OBJ& item) {
int delta = (fCapacity>8) ? (fCapacity>>2) : 1 ;
int NewCapacity=fCapacity+delta;
if (NewCapacity <= fCount || NewCapacity >= MAXLISTSIZE)
GError(GVEC_CAPACITY_ERR, NewCapacity);
//error: capacity not within range
//if (NewCapacity!=fCapacity) {
if (idx==fCount) { //append item
//GREALLOC(fArray, NewCapacity*sizeof(OBJ));
setCapacity(NewCapacity);
fArray[idx]=item;
}
else { //insert item at idx
OBJ* newList;
if (IsPrimitiveType<OBJ>::VAL) {
GMALLOC(newList, NewCapacity*sizeof(OBJ));
//copy data before idx
memcpy(&newList[0],&fArray[0], idx*sizeof(OBJ));
newList[idx]=item;
//copy data after idx
memmove(&newList[idx+1],&fArray[idx], (fCount-idx)*sizeof(OBJ));
//..shouldn't do this:
memset(&newList[fCount+1], 0, (NewCapacity-fCount-1)*sizeof(OBJ));
//data copied:
GFREE(fArray);
} else {
newList=new OBJ[NewCapacity]; //]()
// operator= required!
for (int i=0;i<idx;i++) {
newList[i]=fArray[i];
}
newList[idx]=item;
//copy data after idx
//memmove(&newList[idx+1],&fArray[idx], (fCount-idx)*sizeof(OBJ));
for (int i=idx+1;i<=fCount;i++) {
newList[i]=fArray[i-1];
}
delete[] fArray;
}
fArray=newList;
fCapacity=NewCapacity;
}
fCount++;
}
template <class OBJ> int GVec<OBJ>::Add(OBJ* item) {
if (item==NULL) return -1;
if (fCount==fCapacity) Grow();
fArray[fCount] = *item; //OBJ::operator= must copy OBJ properly!
fCount++;
return fCount-1;
}
template <class OBJ> void GVec<OBJ>::Add(GVec<OBJ>& list) {
if (list.Count()==0) return;
//simply copy
setCapacity(fCapacity+list.fCount);
if (IsPrimitiveType<OBJ>::VAL) {
memcpy( &fArray[fCount], list.fArray, list.fCount*sizeof(OBJ));
}
else {
for (int i=0;i<list.fCount;i++)
fArray[fCount+i]=list.fArray[i];
}
fCount+=list.fCount;
}
//Stack usage:
template <class OBJ> OBJ GVec<OBJ>::Pop() {
if (fCount<=0) GError("Error: invalid GVec::Pop() operation!\n");
fCount--;
//OBJ o(fArray[fCount]); //copy constructor
//o=fList[fCount];
//fArray[fCount]=NULL;
return fArray[fCount]; //copy of the last element (copy constructor called)
}
//Queue usage:
template <class OBJ> OBJ GVec<OBJ>::Shift() {
if (fCount<=0) GError("Error: invalid GVec::Shift() operation!\n");
fCount--;
OBJ o(fArray[0]); //copy constructor
if (fCount>0)
memmove(&fArray[0], &fArray[1], (fCount)*sizeof(OBJ));
//fList[fCount]=NULL; //not that it matters..
return o;
}
template <class OBJ> void GVec<OBJ>::Insert(int idx, OBJ* item) {
//idx must be the new position this new item must have
//so the allowed range is [0..fCount]
//the old idx item all the above will be shifted to idx+1
if (idx<0 || idx>fCount) GError(GVEC_INDEX_ERR, idx);
if (fCount==fCapacity) { //need to resize the array
Grow(idx, *item); //expand and also copy/move data and insert the new item
return;
}
//move data around to make room for the new item
if (idx<fCount) {
//copy after-idx items (shift up)
if (IsPrimitiveType<OBJ>::VAL) {
memmove(&fArray[idx+1],&fArray[idx], (fCount-idx)*sizeof(OBJ));
}
else {
for (int i=fCount; i>idx; i--) {
fArray[i]=fArray[i-1];
}
}
}
fArray[idx]=*item;
fCount++;
}
/*template <class OBJ> void GVec<OBJ>::Move(int curidx, int newidx) { //swap
if (curidx!=newidx || newidx>=fCount)
GError(GVEC_INDEX_ERR, newidx);
OBJ tmp=fArray[curidx]; //copy constructor here
fArray[curidx]=fArray[newidx];
fArray[newidx]=tmp;
}*/
template <class OBJ> void GVec<OBJ>::Replace(int idx, OBJ& item) {
TEST_INDEX(idx);
fArray[idx]=item;
}
template <class OBJ> void GVec<OBJ>::Exchange(int idx1, int idx2) {
TEST_INDEX(idx1);
TEST_INDEX(idx2);
OBJ item=fArray[idx1];
fArray[idx1]=fArray[idx2];
fArray[idx2]=item;
}
template <class OBJ> void GVec<OBJ>::Delete(int index) {
TEST_INDEX(index);
fCount--;
if (IsPrimitiveType<OBJ>::VAL) {
if (index<fCount)
//move higher elements if any (shift down)
memmove(&fArray[index], &fArray[index+1], (fCount-index)*sizeof(OBJ));
}
else {
while (index<fCount) {
fArray[index]=fArray[index+1];
index++;
}
}
}
template <class OBJ> void GVec<OBJ>::setCount(int NewCount) {
if (NewCount<0 || NewCount > MAXLISTSIZE)
GError(GVEC_COUNT_ERR, NewCount);
//if (NewCount > fCapacity) setCapacity(NewCount);
while(NewCount > fCapacity) Grow();
fCount = NewCount; //new items will be populated by the default object constructor(!)
}
template <class OBJ> void GVec<OBJ>::setCount(int NewCount, OBJ* v) {
if (NewCount<0 || NewCount > MAXLISTSIZE)
GError(GVEC_COUNT_ERR, NewCount);
while (NewCount > fCapacity) Grow();
if (NewCount>fCount) {
for (int i=fCount;i<NewCount;i++)
fArray[i]=*v;
}
fCount = NewCount;
}
template <class OBJ> void GVec<OBJ>::setCount(int NewCount, OBJ v) {
if (NewCount<0 || NewCount > MAXLISTSIZE)
GError(GVEC_COUNT_ERR, NewCount);
while (NewCount > fCapacity) Grow();
if (NewCount>fCount) {
for (int i=fCount;i<NewCount;i++)
fArray[i]=v;
}
fCount = NewCount;
}
template <class OBJ> void GVec<OBJ>::qSort(int l, int r, GCompareProc* cmpFunc) {
int i, j;
OBJ p,t;
do {
i = l; j = r;
p = this->fArray[(l + r) >> 1];
do {
while (cmpFunc(&(this->fArray[i]), &p) < 0) i++;
while (cmpFunc(&(this->fArray[j]), &p) > 0) j--;
if (i <= j) {
t = this->fArray[i];
this->fArray[i] = this->fArray[j];
this->fArray[j] = t;
i++; j--;
}
} while (i <= j);
if (l < j) qSort(l, j, cmpFunc);
l = i;
} while (i < r);
}
template <class OBJ> void GVec<OBJ>::Sort(GCompareProc* cmpFunc) {
if (cmpFunc==NULL) {
GMessage("Warning: NULL compare function given, useless Sort() call.\n");
return;
}
if (this->fArray!=NULL && this->fCount>0)
qSort(0, this->fCount-1, cmpFunc);
}
template <class OBJ> void GVec<OBJ>::Sort() {
GCompareProc* cmpFunc = DefLTCompareProc<OBJ>;
Sort(cmpFunc);
}
//~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
//*=> GPVec implementation
template <class OBJ> GPVec<OBJ>::GPVec(GPVec& list) { //copy constructor
fCount=list.fCount;
fCapacity=list.fCapacity;
fList=NULL;
if (fCapacity>0) {
GMALLOC(fList, fCapacity*sizeof(OBJ*));
}
fFreeProc=list.fFreeProc;
fCount=list.fCount;
memcpy(fList, list.fList, fCount*sizeof(OBJ*));
//for (int i=0;i<list.Count();i++) Add(list[i]);
}
template <class OBJ> GPVec<OBJ>::GPVec(GPVec* plist) { //another copy constructor
fCount=0;
fCapacity=plist->fCapacity;
fList=NULL;
if (fCapacity>0) {
GMALLOC(fList, fCapacity*sizeof(OBJ*));
}
fFreeProc=plist->fFreeProc;
fCount=plist->fCount;
memcpy(fList, plist->fList, fCount*sizeof(OBJ*));
//for (int i=0;i<list->fCount;i++) Add(plist->Get(i));
}
template <class OBJ> const GPVec<OBJ>& GPVec<OBJ>::operator=(GPVec& list) {
if (&list!=this) {
Clear();
fFreeProc=list.fFreeProc;
//Attention: the object *POINTERS* are copied,
// but the actual object content is NOT duplicated
//for (int i=0;i<list.Count();i++) Add(list[i]);
fCount=list.fCount;
GMALLOC(fList, fCapacity*sizeof(OBJ*));
memcpy(fList, list.fList, fCount*sizeof(OBJ*));
}
return *this;
}
template <class OBJ> void GPVec<OBJ>::Add(GPVec<OBJ>& list) {
if (list.Count()==0) return;
//simply copy the pointers! -- the objects will be shared
setCapacity(fCapacity+list.fCount);
memcpy( & (fList[fCount]), list.fList, list.fCount*sizeof(OBJ*));
fCount+=list.fCount;
}
template <class OBJ> void GPVec<OBJ>::Reverse() {
int l=0;
int r=fCount-1;
OBJ* c;
while (l<r) {
c=fList[l];fList[l]=fList[r];
fList[r]=c;
l++;r--;
}
}
template <class OBJ> GPVec<OBJ>::GPVec(int init_capacity, bool free_elements) {
fCount=0;
fCapacity=0;
fList=NULL;
fFreeProc=(free_elements) ? DefaultFreeProc : NULL;
if (init_capacity>0)
setCapacity(init_capacity);
}
template <class OBJ> GPVec<OBJ>::GPVec(bool free_elements) {
fCount=0;
fCapacity=0;
fList=NULL;
fFreeProc=(free_elements) ? DefaultFreeProc : NULL;
}
template <class OBJ> GPVec<OBJ>::~GPVec() {
this->Clear();//this will free the items if fFreeProc is defined
}
template <class OBJ> void GPVec<OBJ>::setCapacity(int NewCapacity) {
if (NewCapacity < fCount || NewCapacity > MAXLISTSIZE)
GError(GVEC_CAPACITY_ERR, NewCapacity);
//error: capacity not within range
if (NewCapacity!=fCapacity) {
if (NewCapacity==0) {
GFREE(fList);
}
else {
GREALLOC(fList, NewCapacity*sizeof(OBJ*));
}
fCapacity=NewCapacity;
}
}
template <class OBJ> void GPVec<OBJ>::deallocate_item(OBJ* &item) {
if (item==NULL) return;
if (FREEDATA) {
(*fFreeProc)(item);
item=NULL;
}
else {
delete item;
item=NULL;
}
}
template <class OBJ> void GPVec<OBJ>::Clear() {
if (FREEDATA) {
for (int i=0; i<fCount; i++) {
(*fFreeProc)(fList[i]);
}
}
GFREE(fList);
fCount=0;
fCapacity=0;
}
template <class OBJ> void GPVec<OBJ>::Exchange(int idx1, int idx2) {
TEST_INDEX(idx1);
TEST_INDEX(idx2);
OBJ* item=fList[idx1];
fList[idx1]=fList[idx2];
fList[idx2]=item;
}
template <class OBJ> void GPVec<OBJ>::Expand() {
if (fCount==fCapacity) Grow();
//return this;
}
template <class OBJ> OBJ* GPVec<OBJ>::Get(int idx) {
TEST_INDEX(idx);
return fList[idx];
}
template <class OBJ> void GPVec<OBJ>::Grow() {
/*
int delta;
if (fCapacity > 64 ) {
delta = (fCapacity > 0xFFF) ? 0x100 : (fCapacity>>4);
}
else {
delta = (fCapacity>8) ? (fCapacity>>2) : 1 ;
}
*/
int delta = (fCapacity>8) ? (fCapacity>>2) : 1;
setCapacity(fCapacity + delta);
}
template <class OBJ> void GPVec<OBJ>::Grow(int idx, OBJ* newitem) {
/*
int delta;
if (fCapacity > 64 ) {
delta = (fCapacity > 0xFFF) ? 0x100 : (fCapacity>>4);
}
else {
delta = (fCapacity>8) ? (fCapacity>>2) : 1 ;
}
*/
int delta = (fCapacity>8) ? (fCapacity>>2) : 1 ;
int NewCapacity=fCapacity+delta;
if (NewCapacity <= fCount || NewCapacity > MAXLISTSIZE)
GError(GVEC_CAPACITY_ERR, NewCapacity);
//error: capacity not within range
//if (NewCapacity!=fCapacity) {
/*if (NewCapacity==0) {
GFREE(fList);
}
else {//add the new item
*/
if (idx==fCount) {
GREALLOC(fList, NewCapacity*sizeof(OBJ*));
fList[idx]=newitem;
}
else {
OBJ** newList;
GMALLOC(newList, NewCapacity*sizeof(OBJ*));
//copy data before idx
memcpy(&newList[0],&fList[0], idx*sizeof(OBJ*));
newList[idx]=newitem;
//copy data after idx
memmove(&newList[idx+1],&fList[idx], (fCount-idx)*sizeof(OBJ*));
memset(&newList[fCount+1], 0, (NewCapacity-fCount-1)*sizeof(OBJ*));
//data copied:
GFREE(fList);
fList=newList;
}
fCount++;
fCapacity=NewCapacity;
}
template <class OBJ> int GPVec<OBJ>::IndexOf(pointer item) {
int result=-1;
for (int i=0;i<fCount;i++) {
if (item==(pointer)fList[i]) return i;
}
return -1;
}
template <class OBJ> int GPVec<OBJ>::Add(OBJ* item) {
int result;
if (item==NULL) return -1;
result = fCount;
if (result==fCapacity) this->Grow();
fList[result]=item;
fCount++;
return fCount-1;
}
template <class OBJ> void GPVec<OBJ>::Insert(int idx, OBJ* item) {
//idx can be [0..fCount] so an item can be actually added
if (idx<0 || idx>fCount) GError(GVEC_INDEX_ERR, idx);
if (fCount==fCapacity) {
Grow(idx, item);
return;
}
if (idx<fCount)
memmove(&fList[idx+1], &fList[idx], (fCount-idx)*sizeof(OBJ*));
fList[idx]=item;
fCount++;
}
template <class OBJ> void GPVec<OBJ>::Move(int curidx, int newidx) { //s
//BE_UNSORTED; //cannot do that in a sorted list!
if (curidx!=newidx || newidx>=fCount)
GError(GVEC_INDEX_ERR, newidx);
OBJ* p;
p=Get(curidx);
//this is a delete:
fCount--;
if (curidx<fCount)
memmove(&fList[curidx], &fList[curidx+1], (fCount-curidx)*sizeof(OBJ*));
//-this was instead of delete
Insert(newidx, p);
}
template <class OBJ> void GPVec<OBJ>::Put(int idx, OBJ* item) {
//WARNING: this will never free the replaced item!
TEST_INDEX(idx);
fList[idx]=item;
}
template <class OBJ> void GPVec<OBJ>::Forget(int idx) {
TEST_INDEX(idx);
fList[idx]=NULL; //user should free that somewhere else
}
template <class OBJ> void GPVec<OBJ>::freeItem(int idx) {
TEST_INDEX(idx);
if (fFreeProc!=NULL) {
(*fFreeProc)(fList[idx]);
}
else this->DefaultFreeProc(fList[idx]);
fList[idx]=NULL;
}
template <class OBJ> void GPVec<OBJ>::Delete(int index) {
TEST_INDEX(index);
if (fFreeProc!=NULL && fList[index]!=NULL) {
(*fFreeProc)(fList[index]); //freeItem
}
fList[index]=NULL;
fCount--;
if (index<fCount) //move higher elements if any
memmove(&fList[index], &fList[index+1], (fCount-index)*sizeof(OBJ*));
}
//Stack usage:
template <class OBJ> OBJ* GPVec<OBJ>::Pop() {
if (fCount<=0) return NULL;
fCount--;
OBJ* o=fList[fCount];
fList[fCount]=NULL;
return o;
}
//Queue usage:
template <class OBJ> OBJ* GPVec<OBJ>::Shift() {
if (fCount<=0) return NULL;
fCount--;
OBJ* o=fList[0];
if (fCount>0)
memmove(&fList[0], &fList[1], (fCount)*sizeof(OBJ*));
fList[fCount]=NULL; //not that it matters..
return o;
}
//linear search for the pointer address
template <class OBJ> int GPVec<OBJ>::RemovePtr(pointer item) {
if (item==NULL) return -1;
for (int i=0;i<fCount;i++)
if ((pointer)fList[i] == item) {
Delete(i);
return i;
}
return -1; //not found
}
template <class OBJ> void GPVec<OBJ>::Pack() {
for (int i=fCount-1; i>=0; i--)
if (fList[i]==NULL) Delete(i); //shift rest of fList content accordingly
}
template <class OBJ> void GPVec<OBJ>::setCount(int NewCount) {
if (NewCount<0 || NewCount > MAXLISTSIZE)
GError(GVEC_COUNT_ERR, NewCount);
if (NewCount > fCapacity) setCapacity(NewCount);
if (NewCount > fCount) //pad with NULL pointers
memset(& fList[fCount], 0, (NewCount - fCount) * sizeof(OBJ*));
fCount = NewCount;
}
template <class OBJ> void GPVec<OBJ>::qSort(int L, int R, GCompareProc* cmpFunc) {
int I, J;
OBJ* P;
OBJ* T;
do {
I = L;
J = R;
P = this->fList[(L + R) >> 1];
do {
while (cmpFunc(this->fList[I], P) < 0) I++;
while (cmpFunc(this->fList[J], P) > 0) J--;
if (I <= J) {
T = this->fList[I];
this->fList[I] = this->fList[J];
this->fList[J] = T;
I++;
J--;
}
}
while (I <= J);
if (L < J) qSort(L, J, cmpFunc);
L = I;
}
while (I < R);
}
template <class OBJ> void GPVec<OBJ>::Sort(GCompareProc* cmpFunc) {
if (cmpFunc==NULL) {
GMessage("Warning: NULL compare function given, useless Sort() call.\n");
return;
}
if (this->fList!=NULL && this->fCount>0)
qSort(0, this->fCount-1, cmpFunc);
}
template <class OBJ> void GPVec<OBJ>::Sort() {
GCompareProc* cmpFunc = DefLTCompareProc<OBJ>;
Sort(cmpFunc);
}
//---------------------------------------------------------------------------
#endif
|