38 for (
int i = 0; i < nTurn; i++) {
46 :fTurn(0), nTurn(5), maxNTracks(0), nTracks(0)
48 for(
int i=0;i<nTurn;i++)
57 for (
int i = 0; i < nTurn; i++) {
68 return (
this==&right);
72 return (
this!=&right);
77 for (
int i = 0; i < nTurn; i++) {
95 fTurn = (fTurn+1) % nTurn;
101 return aStackedTrack;
133 if (dy1 > 0 || dy1 > dy2 ||
135 stacks[iDest]->
GetNTrack() < 50 && energies[iDest] < energies[fTurn])) {
139 if (nTracks > maxNTracks) maxNTracks = nTracks;
144 for (
int i = 0; i < nTurn; i++) {
154 for (
int i = 0; i < nTurn; i++) {