Add solution for "Day 8: Resonant Collinearity", part 1

include/aoc/Point2.hpp

@@ -34,6 +34,7 @@ class Point2
     Point2(const int x, const int y);
     bool operator==(const Point2& rhs) const;
     bool operator!=(const Point2& rhs) const;
+    bool operator<(const Point2& rhs) const;
     Point2 operator+(const Point2& rhs) const;
     Point2 operator-(const Point2& rhs) const;
     Point2 operator*(const int rhs) const;

include/aoc/ResonantCollinearity.hpp

@@ -0,0 +1,38 @@
+// Solutions to the Advent Of Code 2024.
+// Copyright (C) 2025  Stefan Müller
+//
+// This program is free software: you can redistribute it and/or modify it under
+// the terms of the GNU General Public License as published by the Free Software
+// Foundation, either version 3 of the License, or (at your option) any later
+// version.
+//
+// This program is distributed in the hope that it will be useful, but WITHOUT
+// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
+// FOR A PARTICULAR PURPOSE.  See the GNU General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License along with
+// this program.  If not, see <http://www.gnu.org/licenses/>.
+
+#pragma once
+
+#include <map>
+#include <set>
+#include <vector>
+
+#include <aoc/LinesSolver.hpp>
+#include <aoc/Point2.hpp>
+
+class ResonantCollinearity
+    : public LinesSolver
+{
+public:
+    virtual const std::string getPuzzleName() const override;
+    virtual const std::string getInputFileName() const override;
+    virtual void finish() override;
+private:
+    static constexpr char getEmptyChar();
+    std::map<char, std::vector<Point2>> antennas_{};
+    std::set<Point2> antinodes_{};
+    void addNewAntenna(Point2&& newPosition);
+    void addNewAntinode(Point2&& newPosition);
+};