scgraph 3.2.1__tar.gz → 3.2.2__tar.gz

{scgraph-3.2.1 → scgraph-3.2.2}/CMakeLists.txt

@@ -49,7 +49,11 @@ else()
     # OPTIMIZATION FLAGS
     # -----------------------------
     set(CMAKE_BUILD_TYPE Release)
-    set(CMAKE_CXX_FLAGS_RELEASE "-O3 -march=native -DNDEBUG")
+    if(MSVC)
+        set(CMAKE_CXX_FLAGS_RELEASE "/O2 /DNDEBUG")
+    else()
+        set(CMAKE_CXX_FLAGS_RELEASE "-O3 -march=native -DNDEBUG")
+    endif()
 
     # -----------------------------
     # Find Packages

{scgraph-3.2.1 → scgraph-3.2.2}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: scgraph
-Version: 3.2.1
+Version: 3.2.2
 Summary: Determine an approximate distance and route between two points on earth.
 Author-Email: Connor Makowski <conmak@mit.edu>
 License-Expression: MIT

{scgraph-3.2.1 → scgraph-3.2.2}/build/cp314-cp314-linux_x86_64/CMakeFiles/CheckCXX/CMakeLists.txt

@@ -1,4 +1,4 @@
-cmake_minimum_required(VERSION 4.3.1)
+cmake_minimum_required(VERSION 4.3.2)
 set(CMAKE_MODULE_PATH "")
 
 project(CheckCXX LANGUAGES CXX)

{scgraph-3.2.1 → scgraph-3.2.2}/pyproject.toml

@@ -26,7 +26,7 @@ include = [
 
 [project]
 name = "scgraph"
-version = "3.2.1"
+version = "3.2.2"
 description = "Determine an approximate distance and route between two points on earth."
 authors = [
     {name="Connor Makowski", email="conmak@mit.edu"}

{scgraph-3.2.1 → scgraph-3.2.2}/scgraph/cpp/bindings/graph_bindings.cpp

@@ -10,6 +10,9 @@
 #include <nanobind/stl/tuple.h>
 #include <nanobind/stl/shared_ptr.h>
 #include <nanobind/operators.h>
+#include <string>
+#include <stdexcept>
+#include <memory>
 #include "../src/graph.hpp"
 #include "../src/contraction_hierarchies.hpp"
 #include "../src/transit_node_routing.hpp"

{scgraph-3.2.1 → scgraph-3.2.2}/scgraph/cpp/src/contraction_hierarchies.hpp

@@ -5,6 +5,7 @@
 #include <string>
 #include <functional>
 #include <optional>
+#include <tuple>
 #include "graph_utils.hpp"
 
 class CHGraph {

{scgraph-3.2.1 → scgraph-3.2.2}/scgraph/cpp/src/graph.cpp

@@ -6,6 +6,8 @@
 #include <stdexcept>
 #include <algorithm>
 #include <iostream>
+#include <cmath>
+#include <functional>
 
 // Constructor
 Graph::Graph(const std::vector<std::unordered_map<int, double>>& graph_data, bool validate)

{scgraph-3.2.1 → scgraph-3.2.2}/scgraph/cpp/src/graph.hpp

@@ -1,4 +1,6 @@
 #pragma once
+#include <vector>
+#include <unordered_map>
 #include <set>
 #include <functional>
 #include <optional>

{scgraph-3.2.1 → scgraph-3.2.2}/scgraph/cpp/src/graph_utils.cpp

@@ -1,6 +1,7 @@
 #include "graph_utils.hpp"
 #include <stdexcept>
 #include <algorithm>
+#include <string>
 
 std::set<int> get_origin_ids(const std::variant<int, std::set<int>>& origin_id) {
     if (std::holds_alternative<int>(origin_id)) {

{scgraph-3.2.1 → scgraph-3.2.2}/scgraph/cpp/src/transit_node_routing.cpp

@@ -3,6 +3,7 @@
 #include <algorithm>
 #include <limits>
 #include <iostream>
+#include <functional>
 
 TNRGraph::TNRGraph(const std::vector<std::unordered_map<int, double>>& graph,
                    int num_transit_nodes,

{scgraph-3.2.1 → scgraph-3.2.2}/scgraph/cpp/src/transit_node_routing.hpp

@@ -4,6 +4,7 @@
 #include <utility>
 #include <set>
 #include <optional>
+#include <functional>
 #include "contraction_hierarchies.hpp"
 
 class TNRGraph : public CHGraph {