forked from acts-project/acts
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
feat: Support seed from N space points (acts-project#3645)
Future support for seeds created from `N` space points, with `N >= 3`. The seed EDM naturally support the possibility of requiring more than 3 space points, so the Seed class is now templated on both the external space point type and the required number of space points: `Seed<external_spacepoint_t, N>`. By default `N == 3`, and there is a requirement that `N >= 3`. The default values is to avoid a breaking change in the code. This PR requires acts-project#3432
- Loading branch information
1 parent
c93ff9f
commit a45d452
Showing
4 changed files
with
141 additions
and
22 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,105 @@ | ||
| // This file is part of the Acts project. | ||
| // | ||
| // Copyright (C) 2024 CERN for the benefit of the Acts project | ||
| // | ||
| // This Source Code Form is subject to the terms of the Mozilla Public | ||
| // License, v. 2.0. If a copy of the MPL was not distributed with this | ||
| // file, You can obtain one at http://mozilla.org/MPL/2.0/. | ||
|
|
||
| #include <boost/test/unit_test.hpp> | ||
|
|
||
| #include "Acts/EventData/Seed.hpp" | ||
|
|
||
| #include <vector> | ||
|
|
||
| namespace Acts::Test { | ||
|
|
||
| struct SpacePoint {}; | ||
|
|
||
| BOOST_AUTO_TEST_CASE(seed_edm_constructors) { | ||
| std::array<Acts::Test::SpacePoint, 5> storage{}; | ||
| Acts::Seed<Acts::Test::SpacePoint, 5> seed(storage[0], storage[1], storage[2], | ||
| storage[3], storage[4]); | ||
| const std::array<const Acts::Test::SpacePoint*, 5>& sps = seed.sp(); | ||
| for (std::size_t i(0ul); i < 5ul; ++i) { | ||
| BOOST_CHECK_NE(sps[i], nullptr); | ||
| BOOST_CHECK_EQUAL(sps[i], &storage[i]); | ||
| } | ||
|
|
||
| // Copy 1 | ||
| Acts::Seed<Acts::Test::SpacePoint, 5> seedCopy1(seed); | ||
| const std::array<const Acts::Test::SpacePoint*, 5>& spsCopy1 = seedCopy1.sp(); | ||
| for (std::size_t i(0ul); i < 5ul; ++i) { | ||
| BOOST_CHECK_NE(spsCopy1[i], nullptr); | ||
| BOOST_CHECK_EQUAL(spsCopy1[i], sps[i]); | ||
| } | ||
|
|
||
| // Copy 2 | ||
| Acts::Seed<Acts::Test::SpacePoint, 5> seedCopy2{seed}; | ||
| const std::array<const Acts::Test::SpacePoint*, 5>& spsCopy2 = seedCopy2.sp(); | ||
| for (std::size_t i(0ul); i < 5ul; ++i) { | ||
| BOOST_CHECK_NE(spsCopy2[i], nullptr); | ||
| BOOST_CHECK_EQUAL(spsCopy2[i], sps[i]); | ||
| } | ||
|
|
||
| // Collection | ||
| std::vector<Acts::Seed<Acts::Test::SpacePoint, 5>> seeds{seed}; | ||
| // Copy 1 | ||
| std::vector<Acts::Seed<Acts::Test::SpacePoint, 5>> seedsCopy1(seeds); | ||
| BOOST_CHECK_EQUAL(seedsCopy1.size(), seeds.size()); | ||
| // Copy 2 | ||
| std::vector<Acts::Seed<Acts::Test::SpacePoint, 5>> seedsCopy2{seeds}; | ||
| BOOST_CHECK_EQUAL(seedsCopy2.size(), seeds.size()); | ||
| } | ||
|
|
||
| BOOST_AUTO_TEST_CASE(seed_edm_default) { | ||
| std::array<Acts::Test::SpacePoint, 3> storage{}; | ||
| Acts::Seed<Acts::Test::SpacePoint> seed(storage[0], storage[1], storage[2]); | ||
| const std::array<const Acts::Test::SpacePoint*, 3>& sps = seed.sp(); | ||
| for (std::size_t i(0ul); i < 3ul; ++i) { | ||
| BOOST_CHECK_NE(sps[i], nullptr); | ||
| BOOST_CHECK_EQUAL(sps[i], &storage[i]); | ||
| } | ||
|
|
||
| seed.setVertexZ(-1.2f); | ||
| BOOST_CHECK_EQUAL(seed.z(), -1.2f); | ||
|
|
||
| seed.setQuality(345.23f); | ||
| BOOST_CHECK_EQUAL(seed.seedQuality(), 345.23f); | ||
| } | ||
|
|
||
| BOOST_AUTO_TEST_CASE(seed_edm_3d) { | ||
| std::array<Acts::Test::SpacePoint, 3> storage{}; | ||
| Acts::Seed<Acts::Test::SpacePoint, 3> seed(storage[0], storage[1], | ||
| storage[2]); | ||
| const std::array<const Acts::Test::SpacePoint*, 3>& sps = seed.sp(); | ||
| for (std::size_t i(0ul); i < 3ul; ++i) { | ||
| BOOST_CHECK_NE(sps[i], nullptr); | ||
| BOOST_CHECK_EQUAL(sps[i], &storage[i]); | ||
| } | ||
|
|
||
| seed.setVertexZ(-1.2f); | ||
| BOOST_CHECK_EQUAL(seed.z(), -1.2f); | ||
|
|
||
| seed.setQuality(345.23f); | ||
| BOOST_CHECK_EQUAL(seed.seedQuality(), 345.23f); | ||
| } | ||
|
|
||
| BOOST_AUTO_TEST_CASE(seed_edm_4d) { | ||
| std::array<Acts::Test::SpacePoint, 4> storage{}; | ||
| Acts::Seed<Acts::Test::SpacePoint, 4> seed(storage[0], storage[1], storage[2], | ||
| storage[3]); | ||
| const std::array<const Acts::Test::SpacePoint*, 4>& sps = seed.sp(); | ||
| for (std::size_t i(0ul); i < 4ul; ++i) { | ||
| BOOST_CHECK_NE(sps[i], nullptr); | ||
| BOOST_CHECK_EQUAL(sps[i], &storage[i]); | ||
| } | ||
|
|
||
| seed.setVertexZ(-1.2f); | ||
| BOOST_CHECK_EQUAL(seed.z(), -1.2f); | ||
|
|
||
| seed.setQuality(345.23f); | ||
| BOOST_CHECK_EQUAL(seed.seedQuality(), 345.23f); | ||
| } | ||
|
|
||
| } // namespace Acts::Test |