Reimplement managed raster class in C++

setup.py

@@ -20,9 +20,18 @@
 # access to a pre-Mavericks mac, so hopefully this won't break on someone's
 # older system.  Tested and it works on Mac OSX Catalina.
 compiler_and_linker_args = []
-if platform.system() == 'Darwin':
-    compiler_and_linker_args = ['-stdlib=libc++']
-
+include_dirs = [numpy.get_include(), 'src/natcap/invest/managed_raster']
+if platform.system() == 'Windows':
+    compiler_args = ['/std:c++20']
+    library_dirs = [f'{os.environ["CONDA_PREFIX"]}/Library/lib']
+    include_dirs.append(f'{os.environ["CONDA_PREFIX"]}/Library/include')
+else:
+    library_dirs = []
+    compiler_args = []
+    compiler_and_linker_args = ['-stdlib=libc++', '-std=c++20']
+    library_dirs = [subprocess.run(
+        ['gdal-config', '--libs'], capture_output=True, text=True
+    ).stdout.split()[0][2:]]  # get the first argument which is the library path
 
 class build_py(_build_py):
     """Command to compile translation message catalogs before building."""
@@ -50,13 +59,14 @@ def run(self):
         Extension(
             name=f'natcap.invest.{package}.{module}',
             sources=[f'src/natcap/invest/{package}/{module}.pyx'],
-            include_dirs=[numpy.get_include()] + ['src/natcap/invest/managed_raster'],
-            extra_compile_args=compiler_args + compiler_and_linker_args,
+            include_dirs=include_dirs,
+            extra_compile_args=compiler_args + package_compiler_args + compiler_and_linker_args,
             extra_link_args=compiler_and_linker_args,
             language='c++',
+            libraries=['gdal'],
+            library_dirs=library_dirs,
             define_macros=[("NPY_NO_DEPRECATED_API", "NPY_1_7_API_VERSION")]
-        ) for package, module, compiler_args in [
-            ('managed_raster', 'managed_raster', []),
+        ) for package, module, package_compiler_args in [
             ('delineateit', 'delineateit_core', []),
             ('recreation', 'out_of_core_quadtree', []),
             # clang-14 defaults to -ffp-contract=on, which causes the

src/natcap/invest/managed_raster/LRUCache.h

@@ -8,66 +8,72 @@
 using namespace std;
 
 template <class KEY_T, class VAL_T,
-    typename ListIter = typename list< pair<KEY_T,VAL_T> >::iterator,
-    typename MapIter = typename map<KEY_T, ListIter>::iterator > class LRUCache{
-private:
-    // item_list keeps track of the order of which elements have been accessed
-    // element at begin is most recent, element at end is least recent.
-    // first element in the pair is its key while the second is the element
-    list< pair<KEY_T,VAL_T> > item_list;
-    // item_map maps an element's key to its location in the `item_list`
-    // used to make lookups O(log n) time
-    map<KEY_T, ListIter> item_map;
-    size_t cache_size;
-private:
-    void clean(list< pair<KEY_T, VAL_T> > &removed_value_list){
-        while(item_map.size()>cache_size){
-            ListIter last_it = item_list.end(); last_it --;
-            removed_value_list.push_back(
-                make_pair(last_it->first, last_it->second));
-            item_map.erase(last_it->first);
-            item_list.pop_back();
-        }
-    };
-public:
-    LRUCache(int cache_size_):cache_size(cache_size_){
-            ;
-    };
+  typename ListIter = typename list<pair<KEY_T,VAL_T>>::iterator,
+  typename MapIter = typename map<KEY_T, ListIter>::iterator> class LRUCache {
+ private:
+  // item_list keeps track of the order of which elements have been accessed
+  // element at begin is most recent, element at end is least recent.
+  // first element in the pair is its key while the second is the element
+  list<pair<KEY_T,VAL_T>> item_list;
+  // item_map maps an element's key to its location in the `item_list`
+  // used to make lookups O(log n) time
+  map<KEY_T, ListIter> item_map;
+  size_t cache_size;
 
-    ListIter begin() {
-        return item_list.begin();
+  void clean(list<pair<KEY_T, VAL_T>> &removed_value_list) {
+    while(item_map.size() > cache_size) {
+      ListIter last_it = item_list.end();
+      last_it--;
+      removed_value_list.push_back(
+        make_pair(last_it->first, last_it->second));
+      item_map.erase(last_it->first);
+      item_list.pop_back();
     }
+  };
+ public:
+  LRUCache(int cache_size_):cache_size(cache_size_) {
+      ;
+  };
 
-    ListIter end() {
-        return item_list.end();
+  ListIter begin() {
+    return item_list.begin();
+  }
+
+  ListIter end() {
+    return item_list.end();
+  }
+
+  // Insert a new key-value pair into the cache.
+  void put(
+      const KEY_T &key, const VAL_T &val,
+      list<pair<KEY_T, VAL_T>> &removed_value_list) {
+    MapIter it = item_map.find(key);
+    if(it != item_map.end()){
+      // it's already in the cache, delete the location in the item
+      // list and in the lookup map
+      item_list.erase(it->second);
+      item_map.erase(it);
     }
+    // insert a new item in the front since it's most recently used
+    item_list.push_front(make_pair(key, val));
+    // record its iterator in the map
+    item_map.insert(make_pair(key, item_list.begin()));
+    // possibly remove any elements that have exceeded the cache size
+    return clean(removed_value_list);
+  };
+
+  // Return whether a key exists in the cache.
+  bool exist(const KEY_T &key) {
+    return (item_map.count(key) > 0);
+  };
 
-    void put(
-            const KEY_T &key, const VAL_T &val,
-            list< pair<KEY_T, VAL_T> > &removed_value_list) {
-        MapIter it = item_map.find(key);
-        if(it != item_map.end()){
-            // it's already in the cache, delete the location in the item
-            // list and in the lookup map
-            item_list.erase(it->second);
-            item_map.erase(it);
-        }
-        // insert a new item in the front since it's most recently used
-        item_list.push_front(make_pair(key,val));
-        // record its iterator in the map
-        item_map.insert(make_pair(key, item_list.begin()));
-        // possibly remove any elements that have exceeded the cache size
-        return clean(removed_value_list);
-    };
-    bool exist(const KEY_T &key){
-        return (item_map.count(key)>0);
-    };
-    VAL_T& get(const KEY_T &key){
-        MapIter it = item_map.find(key);
-        assert(it!=item_map.end());
-        // move the element to the front of the list
-        item_list.splice(item_list.begin(), item_list, it->second);
-        return it->second->second;
-    };
+  // Return the cached value associated with a key.
+  VAL_T& get(const KEY_T &key) {
+    MapIter it = item_map.find(key);
+    assert(it != item_map.end());
+    // move the element to the front of the list
+    item_list.splice(item_list.begin(), item_list, it->second);
+    return it->second->second;
+  };
 };
 #endif