Formatting

Author: Grufoony

src/dsm/headers/Graph.hpp

@@ -207,9 +207,7 @@ namespace dsm {
     }
     /// @brief Get the graph's street map
     /// @return A std::unordered_map containing the graph's streets
-    std::unordered_map<Id, std::unique_ptr<Street>>& streetSet() {
-      return m_streets;
-    }
+    std::unordered_map<Id, std::unique_ptr<Street>>& streetSet() { return m_streets; }
     /// @brief Get a street from the graph
     /// @param source The source node
     /// @param destination The destination node

src/dsm/headers/Node.hpp

@@ -52,25 +52,19 @@ namespace dsm {
     void setId(Id id) { m_id = id; }
     /// @brief Set the node's coordinates
     /// @param coords A std::pair containing the node's coordinates (lat, lon)
-    void setCoords(std::pair<double, double> coords) {
-      m_coords = std::move(coords);
-    }
+    void setCoords(std::pair<double, double> coords) { m_coords = std::move(coords); }
     /// @brief Set the node's capacity
     /// @param capacity The node's capacity
     virtual void setCapacity(Size capacity) { m_capacity = capacity; }
     /// @brief Set the node's transport capacity
     /// @param capacity The node's transport capacity
-    virtual void setTransportCapacity(Size capacity) {
-      m_transportCapacity = capacity;
-    }
+    virtual void setTransportCapacity(Size capacity) { m_transportCapacity = capacity; }
     /// @brief Get the node's id
     /// @return Id The node's id
     Id id() const { return m_id; }
     /// @brief Get the node's coordinates
     /// @return std::optional<std::pair<double, double>> A std::pair containing the node's coordinates
-    const std::optional<std::pair<double, double>>& coords() const {
-      return m_coords;
-    }
+    const std::optional<std::pair<double, double>>& coords() const { return m_coords; }
     /// @brief Get the node's capacity
     /// @return Size The node's capacity
     Size capacity() const { return m_capacity; }
@@ -146,9 +140,7 @@ namespace dsm {
     ///        If a street has priority, it means that the agents that are on that street
     ///        have priority over the agents that are on the other streets.
     /// @return std::set<Id> A std::set containing the node's street priorities
-    virtual const std::set<Id>& streetPriorities() const {
-      return m_streetPriorities;
-    };
+    virtual const std::set<Id>& streetPriorities() const { return m_streetPriorities; };
     /// @brief Get the node's agent ids
     /// @return std::set<Id> A std::set containing the node's agent ids
     const std::multimap<int16_t, Id>& agents() { return m_agents; };

src/dsm/headers/Street.hpp

@@ -110,9 +110,7 @@ namespace dsm {
     /// @brief Set the street's node pair
     /// @param node1 The source node of the street
     /// @param node2 The destination node of the street
-    void setNodePair(Id node1, Id node2) {
-      m_nodePair = std::make_pair(node1, node2);
-    }
+    void setNodePair(Id node1, Id node2) { m_nodePair = std::make_pair(node1, node2); }
     /// @brief Set the street's node pair
     /// @param node1 The source node of the street
     /// @param node2 The destination node of the street
@@ -158,14 +156,10 @@ namespace dsm {
     const std::set<Id>& waitingAgents() const { return m_waitingAgents; }
     /// @brief Get the street's queue
     /// @return dsm::queue<Size>, The street's queue
-    const dsm::queue<Size>& queue(size_t index) const {
-      return m_exitQueues[index];
-    }
+    const dsm::queue<Size>& queue(size_t index) const { return m_exitQueues[index]; }
     /// @brief Get the street's queues
     /// @return std::vector<dsm::queue<Size>> The street's queues
-    const std::vector<dsm::queue<Size>>& exitQueues() const {
-      return m_exitQueues;
-    }
+    const std::vector<dsm::queue<Size>>& exitQueues() const { return m_exitQueues; }
     /// @brief Get the street's node pair
     /// @return std::pair<Id, Id>, The street's node pair
     const std::pair<Id, Id>& nodePair() const { return m_nodePair; }
@@ -177,9 +171,7 @@ namespace dsm {
     double density() const { return nAgents() / (m_len * m_nLanes); }
     /// @brief Get the street's normalized density
     /// @return double, The street's normalized density
-    double normDensity() const {
-      return nAgents() / static_cast<double>(m_capacity);
-    }
+    double normDensity() const { return nAgents() / static_cast<double>(m_capacity); }
     /// @brief Check if the street is full
     /// @return bool, True if the street is full, false otherwise
     bool isFull() const { return nAgents() == m_capacity; }