Skip to content

dc initialization cleanup, memory allocate lists once #1528

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
baltzell wants to merge 2 commits into
base: development
Choose a base branch
from
Open

dc initialization cleanup, memory allocate lists once #1528

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
3be55fc
do not reinitialize
baltzell Oct 16, 2026
00ffc13
cleanup initialization
baltzell Oct 16, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
41 changes: 12 additions & 29 deletions reconstruction/cvt/src/main/java/org/jlab/rec/cvt/track/Seed.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -260,23 +260,12 @@ else if(tr.sortingMethod ==1) {

public boolean fit(int fitIter, double xb, double yb, double bfield) {

List<Double> X = new ArrayList<>();
List<Double> Y = new ArrayList<>();
List<Double> Z = new ArrayList<>();
List<Double> Rho = new ArrayList<>();
List<Double> ErrZ = new ArrayList<>();
List<Double> ErrRho = new ArrayList<>();
List<Double> ErrRt = new ArrayList<>();
List<Cross> BMTCrossesC = new ArrayList<>();
List<Cross> BMTCrossesZ = new ArrayList<>();
List<Cross> SVTCrosses = new ArrayList<>();

double chisqMax = Double.POSITIVE_INFINITY;

int svtSz = 0;
int bmtZSz = 0;
int bmtCSz = 0;

for (Cross c : this.getCrosses()) {
// reset cross to clear previous track settings on direction and Point
c.reset();
Expand All @@ -290,25 +279,19 @@ else if (c.getDetector()==DetectorType.BMT && c.getType()==BMTType.Z ) {
BMTCrossesZ.add(c);
}
}
svtSz = SVTCrosses.size();
if (BMTCrossesZ != null) {
bmtZSz = BMTCrossesZ.size();
}
if (BMTCrossesC != null) {
bmtCSz = BMTCrossesC.size();
}

int useSVTdipAngEst = 1;
if (bmtCSz >= 2) {
useSVTdipAngEst = 0;
}
((ArrayList<Double>) X).ensureCapacity(svtSz + bmtZSz);
((ArrayList<Double>) Y).ensureCapacity(svtSz + bmtZSz);
((ArrayList<Double>) Z).ensureCapacity(svtSz * useSVTdipAngEst + bmtCSz);
((ArrayList<Double>) Rho).ensureCapacity(svtSz * useSVTdipAngEst + bmtCSz);
((ArrayList<Double>) ErrZ).ensureCapacity(svtSz * useSVTdipAngEst + bmtCSz);
((ArrayList<Double>) ErrRho).ensureCapacity(svtSz * useSVTdipAngEst + bmtCSz); // Try: don't use svt in dipdangle fit determination
((ArrayList<Double>) ErrRt).ensureCapacity(svtSz + bmtZSz);
int svtSz = SVTCrosses.size();
int bmtZSz = BMTCrossesZ.size();
int bmtCSz = BMTCrossesC.size();
int useSVTdipAngEst = bmtCSz >= 2 ? 0 : 1;

List<Double> X = new ArrayList<>(svtSz + bmtZSz);
List<Double> Y = new ArrayList<>(svtSz + bmtZSz);
List<Double> Z = new ArrayList<>(svtSz * useSVTdipAngEst + bmtCSz);
List<Double> Rho = new ArrayList<>(svtSz * useSVTdipAngEst + bmtCSz);
List<Double> ErrZ = new ArrayList<>(svtSz * useSVTdipAngEst + bmtCSz);
List<Double> ErrRho = new ArrayList<>(svtSz * useSVTdipAngEst + bmtCSz);
List<Double> ErrRt = new ArrayList<>(svtSz + bmtZSz);

HelicalTrackFitter fitTrk = new HelicalTrackFitter();
for (int i = 0; i < fitIter; i++) {
Expand Down
Loading