Draft: FPGATrackSim: first pass at binning implementation for matrix gen

(Except it doesn't actually work at the moment, more debugging is needed)

Eventually, the point of this branch is to use the FPGATrackSimBinning package when running matrix generation to first bin the hits associated with a truth track. The binning is needed to assign realistic logical layers to hits, since the matrix generation will require that there be exactly one hit per "layer" where "layer" here is the logical layer created by the binning. I implemented this by invoking FPGATrackSimBinning, and then looping over all the bins that have at least nhits >= (nLayers - maxWC), meaning 3 for a 5-layer configuration.

So the intended sequence is:

• Find hits that match a truth track
• Bin them to get layers
• Loop over bins, select bins that pass the matrix generation filtering criteria
• Take those hits and run them through the full inside out algorithm to see if we find a road
• If we find a road, then calculate the covariance matrix and use that road to produce fit constants

CC @lipeles

Trigger/EFTracking/FPGATrackSim/FPGATrackSimAlgorithms/CMakeLists.txt

@@ -15,7 +15,7 @@ atlas_add_library( FPGATrackSimAlgorithmsLib
    src/*.cxx
    PUBLIC_HEADERS FPGATrackSimAlgorithms
    INCLUDE_DIRS ${ROOT_INCLUDE_DIRS}  ${ONNXRUNTIME_INCLUDE_DIRS}
-   LINK_LIBRARIES ${ROOT_LIBRARIES} AthenaBaseComps AthenaMonitoringKernelLib GaudiKernel FPGATrackSimBanksLib FPGATrackSimConfToolsLib FPGATrackSimHoughLib FPGATrackSimInputLib FPGATrackSimLRTLib FPGATrackSimMapsLib FPGATrackSimObjectsLib FPGATrackSimSGInputLib  ${ONNXRUNTIME_LIBRARIES}
+   LINK_LIBRARIES ${ROOT_LIBRARIES} AthenaBaseComps AthenaMonitoringKernelLib GaudiKernel FPGATrackSimBanksLib FPGATrackSimBinningLib FPGATrackSimConfToolsLib FPGATrackSimHoughLib FPGATrackSimInputLib FPGATrackSimLRTLib FPGATrackSimMapsLib FPGATrackSimObjectsLib FPGATrackSimSGInputLib  ${ONNXRUNTIME_LIBRARIES}
    PRIVATE_LINK_LIBRARIES FPGATrackSimBanksLib FPGATrackSimConfToolsLib )
  
 # Component(s) in the package: