additionnal SymbolMap constructor to avoid using the expensive `inser…

…t` method in a loop. more efficient `LazySubsets` constructor. #3335
tidyverse · Apr 25, 2018 · d21159a · d21159a
1 parent fbbf157
commit d21159a
Show file tree

Hide file tree

Showing 2 changed files with 8 additions and 3 deletions.
diff --git a/inst/include/dplyr/Result/LazySubsets.h b/inst/include/dplyr/Result/LazySubsets.h
@@ -9,7 +9,7 @@ namespace dplyr {
 
 class LazySubsets : public ILazySubsets {
 public:
-  LazySubsets(const DataFrame& df) : nr(df.nrows()) {
+  LazySubsets(const DataFrame& df) : symbol_map(df.size(), df.names()), summary_map(), data(df.size()), nr(df.nrows()) {
     int nvars = df.size();
     if (nvars) {
       CharacterVector names = df.names();
@@ -18,8 +18,7 @@ class LazySubsets : public ILazySubsets {
         if (Rf_inherits(column, "matrix")) {
           stop("matrix as column is not supported");
         }
-        symbol_map.insert(names[i]);
-        data.push_back(df[i]);
+        data[i] = df[i];
       }
     }
   }

diff --git a/inst/include/tools/SymbolMap.h b/inst/include/tools/SymbolMap.h
@@ -25,6 +25,12 @@ class SymbolMap {
 public:
   SymbolMap(): lookup(), names() {}
 
+  SymbolMap(int n, const CharacterVector& names_): lookup(n), names((SEXP)names_) {
+    for (int i = 0; i < n; i++) {
+      lookup.insert(std::make_pair(names_[i], i));
+    }
+  }
+
   SymbolMap(const SymbolVector& names_): lookup(), names(names_) {}
 
   SymbolMapIndex insert(const SymbolString& name) {