OOPSE/libmdtools/Exclude.cpp

#include <cstdlib>

#include "Exclude.hpp"


Exclude::Exclude( int theIndex ){ 
  exI = theIndex*2;
  exJ = theIndex*2 + 1;
}

void Exclude::createArray( int the_nExcludes ){
  
  nExcludes = the_nExcludes;
  exPairs = new int[nExcludes*2];
}

void Exclude::destroyArray( void ){
  delete[] exPairs;
}

void Exclude::setPair( int i, int j ){
  exPairs[exI] = i;
  exPairs[exJ] = j;
}

void Exclude::addExcludePairs(int nAdded, int* AexPairs) {
  int nNew = nExcludes + nAdded;
  
  int* new_exPairs = new int[nNew*2];
  int i, j;

  for (i = 0; i < 2*nExcludes; i++) {
    new_exPairs[i] = exPairs[i];
  }

  for (i=0; i < 2*nAdded; i++) {
    j = i + 2*nExcludes;
    new_exPairs[j] = AexPairs[i];
  }

  delete[] exPairs;

  exPairs = new_exPairs;

  nExcludes = nNew;
}

void Exclude::deleteExcludePair(int theIndex) {
  deleteRange(theIndex, theIndex);
}

void Exclude::deleteRange(int startIndex, int stopIndex) {

  int nNew = nExcludes - (stopIndex - startIndex + 1);
  int* new_exPairs = new int[nNew*2];
  int i, j;

  for (i=0; i < 2*startIndex; i++) {
    new_exPairs[i] = exPairs[i];
  }
  for(i=2*(stopIndex+1); i < 2*nExcludes; i++) {
    j = i-2*startIndex + 1;
    new_exPairs[j] = exPairs[i];
  }

  delete[] exPairs;
  
  exPairs = new_exPairs;
  nExcludes = nNew;
}
Revision:	412
Committed:	Wed Mar 26 21:50:33 2003 UTC (21 years, 3 months ago) by mmeineke
File size:	1286 byte(s)
Log Message:	still working on the SimSetup routine. also fixed some things in Exclude.hpp
#	User	Rev	Content
1	mmeineke	408	#include <cstdlib>
2
3			#include "Exclude.hpp"
4
5
6	gezelter	410
7			Exclude::Exclude( int theIndex ){
8			exI = theIndex*2;
9			exJ = theIndex*2 + 1;
10	mmeineke	408	}
11
12	mmeineke	412	void Exclude::createArray( int the_nExcludes ){
13
14			nExcludes = the_nExcludes;
15	gezelter	410	exPairs = new int[nExcludes*2];
16	mmeineke	408	}
17
18	gezelter	410	void Exclude::destroyArray( void ){
19			delete[] exPairs;
20	mmeineke	408	}
21
22			void Exclude::setPair( int i, int j ){
23	gezelter	410	exPairs[exI] = i;
24			exPairs[exJ] = j;
25			}
26	mmeineke	408
27	gezelter	410	void Exclude::addExcludePairs(int nAdded, int* AexPairs) {
28			int nNew = nExcludes + nAdded;
29
30			int* new_exPairs = new int[nNew*2];
31			int i, j;
32
33			for (i = 0; i < 2*nExcludes; i++) {
34			new_exPairs[i] = exPairs[i];
35			}
36
37			for (i=0; i < 2*nAdded; i++) {
38			j = i + 2*nExcludes;
39			new_exPairs[j] = AexPairs[i];
40			}
41
42			delete[] exPairs;
43
44			exPairs = new_exPairs;
45
46			nExcludes = nNew;
47	mmeineke	408	}
48	gezelter	410
49			void Exclude::deleteExcludePair(int theIndex) {
50			deleteRange(theIndex, theIndex);
51			}
52
53			void Exclude::deleteRange(int startIndex, int stopIndex) {
54
55			int nNew = nExcludes - (stopIndex - startIndex + 1);
56			int* new_exPairs = new int[nNew*2];
57			int i, j;
58
59			for (i=0; i < 2*startIndex; i++) {
60			new_exPairs[i] = exPairs[i];
61			}
62			for(i=2(stopIndex+1); i < 2nExcludes; i++) {
63			j = i-2*startIndex + 1;
64			new_exPairs[j] = exPairs[i];
65			}
66
67			delete[] exPairs;
68
69			exPairs = new_exPairs;
70			nExcludes = nNew;
71			}