21 #include "StSvtHybridCluster.hh"
29 numberOfMembers = NULL;
38 numberOfClusters = c.numberOfClusters;
39 numberOfMembers =c.numberOfMembers;
40 memberInfo =c.memberInfo;
44 StSvtHybridCluster::~StSvtHybridCluster()
46 delete[] numberOfMembers;
48 for(
int clu = 0; clu < numberOfClusters; clu++)
49 delete[] memberInfo[clu];
58 numberOfClusters = cluFinder -> ClusterIndex();
60 numberOfMembers =
new int[numberOfClusters];
64 for(
int clu = 0; clu < numberOfClusters; clu++)
66 numberOfMembers[clu] = cluFinder -> ClusterMembers(clu);
70 for(
int mem = 0; mem < numberOfMembers[clu]; mem++)
72 memberInfo[clu][mem].listAnode = cluFinder -> ClusterListAnode(clu,mem);
73 int listanode = memberInfo[clu][mem].listAnode;
74 memberInfo[clu][mem].actualAnode = cluFinder ->ClusterActualAnode(listanode);
82 int StSvtHybridCluster::getNumberOfClusters()
84 return numberOfClusters;
88 int StSvtHybridCluster::getNumberOfMembers(
int clu)
90 return numberOfMembers[clu];
95 for(
int i=0; i<numberOfClusters;i++)
98 numOfMem = numberOfMembers[i];
100 *memInfo = memberInfo[i];
109 if(clu >= 0 && clu <= numberOfClusters) {
110 return memberInfo[clu];