266 Int_t AddedDigits = 0;
267 Int_t AddedStripDigitMatches = 0;
274 module = station->GetModule(digit->GetModule());
282 AddedStripDigitMatches++;
287 stripDigitNumberMatch.
AddLink(1.0, idigit);
288 module->SetStripDigitNumberMatchInLayer(digit->GetStripLayer(), digit->GetStripNumber(), stripDigitNumberMatch);
292 cout <<
" Processed strip digits : " << AddedDigits <<
"\n";
294 cout <<
" Added strip digit matches : " << AddedStripDigitMatches <<
"\n";
300 Int_t NCalculatedPoints =
StationSet->CountNProcessedPointsInDetector();
302 cout <<
" Calculated points : " << NCalculatedPoints <<
"\n";
304 cout <<
"BmnCSCHitMaker: " << NCalculatedPoints <<
" hits\n";
306 Int_t clear_matched_points_cnt = 0;
308 map<Int_t, StripCluster> UniqueUpperClusters;
309 map<Int_t, StripCluster> UniqueLowerClusters;
311 for (
Int_t iStation = 0; iStation <
StationSet->GetNStations(); ++iStation) {
315 module = station->GetModule(iModule);
320 for (
size_t iCluster = 0; iCluster < layer.
GetStripClusters().size(); ++iCluster) {
337 Int_t NIntersectionPointsInModule =
module->GetNIntersectionPoints();
340 Int_t NPseudoIntersectionsInModule = 0;
342 for (
Int_t iPoint = 0; iPoint < NIntersectionPointsInModule + NPseudoIntersectionsInModule; ++iPoint) {
349 if (iPoint < NIntersectionPointsInModule) {
352 x =
module->GetIntersectionPointX(iPoint);
353 y =
module->GetIntersectionPointY(iPoint);
354 z =
module->GetZPositionRegistered();
355 x_err =
module->GetIntersectionPointXError(iPoint);
356 y_err =
module->GetIntersectionPointYError(iPoint);
362 x =
module->GetPseudoIntersectionX(iPoint - NIntersectionPointsInModule);
363 y =
module->GetPseudoIntersectionY(iPoint - NIntersectionPointsInModule);
364 z =
module->GetZPositionRegistered();
365 x_err =
module->GetPseudoIntersectionXError(iPoint - NIntersectionPointsInModule);
366 y_err =
module->GetPseudoIntersectionYError(iPoint - NIntersectionPointsInModule);
374 x = -point_transformed.
X();
375 y = point_transformed.
Y();
376 z = point_transformed.
Z();
379 Int_t RefMCIndex = -1;
383 if (iPoint < NIntersectionPointsInModule) {
384 mc_match_hit =
module->GetIntersectionPointMatch(iPoint);
386 mc_match_hit =
module->GetPseudoIntersectionMatch(iPoint - NIntersectionPointsInModule);
389 Int_t most_probably_index = -1;
394 clear_matched_points_cnt++;
395 for (
Int_t ilink = 0; ilink < n_links; ilink++) {
398 if (weight > max_weight) {
400 most_probably_index = index;
404 RefMCIndex = most_probably_index;
418 if (iPoint < NIntersectionPointsInModule) {
426 iPoint - NIntersectionPointsInModule));
437 cout <<
" glob(x:y:z) = ( " << x <<
" : " << y <<
" : " << z <<
"\n";
438 cout <<
" hit(x:y:z) = ( " << hit->GetX() <<
" : " << hit->GetY() <<
" : " << hit->GetZ() <<
"\n";
489 FairRootManager::Instance()->SetUseFairLinks(
kTRUE);
491 if (iPoint < NIntersectionPointsInModule) {
492 hitMatch =
module->GetIntersectionPointMatch(iPoint);
494 hitMatch =
module->GetPseudoIntersectionMatch(iPoint - NIntersectionPointsInModule);
498 hit->AddLink(FairLink(-1, lnk.GetIndex(), lnk.GetWeight()));
499 FairRootManager::Instance()->SetUseFairLinks(
kFALSE);
526 cout <<
" N clear matches with MC-points = " << clear_matched_points_cnt <<
"\n";