From b56da6f08c4f59b562a102671ac3deb135b0538a Mon Sep 17 00:00:00 2001
From: Chris Dyer <cdyer@cs.cmu.edu>
Date: Sun, 13 May 2012 16:18:43 -0700
Subject: fast creg training code for univariate linear and logistic regression

---
 utils/fast_sparse_vector.h | 16 +++++++++++++---
 1 file changed, 13 insertions(+), 3 deletions(-)

(limited to 'utils/fast_sparse_vector.h')

diff --git a/utils/fast_sparse_vector.h b/utils/fast_sparse_vector.h
index af832950..68caa704 100644
--- a/utils/fast_sparse_vector.h
+++ b/utils/fast_sparse_vector.h
@@ -7,8 +7,6 @@
 // important: indexes are integers
 // important: iterators may return elements in any order
 
-#include "config.h"
-
 #include <cmath>
 #include <cstring>
 #include <climits>
@@ -16,8 +14,9 @@
 #include <cassert>
 #include <vector>
 
-#include <boost/static_assert.hpp>
+#include "config.h"
 
+#include <boost/static_assert.hpp>
 #if HAVE_BOOST_ARCHIVE_TEXT_OARCHIVE_HPP
 #include <boost/serialization/map.hpp>
 #endif
@@ -119,6 +118,17 @@ class FastSparseVector {
     std::memcpy(this, &other, sizeof(FastSparseVector));
     if (is_remote_) data_.rbmap = new std::map<int, T>(*data_.rbmap);
   }
+  FastSparseVector(std::pair<int, T>* first, std::pair<int, T>* last) {
+    const ptrdiff_t n = last - first;
+    if (n <= LOCAL_MAX) {
+      is_remote_ = false;
+      local_size_ = n;
+      std::memcpy(data_.local, first, sizeof(std::pair<int, T>) * n);
+    } else {
+      is_remote_ = true;
+      data_.rbmap = new std::map<int, T>(first, last);
+    }
+  }
   void erase(int k) {
     if (is_remote_) {
       data_.rbmap->erase(k);
-- 
cgit v1.2.3