sassc 2.2.1 → 2.3.0

data/ext/libsass/src/subset_map.cpp

@@ -1,58 +0,0 @@
-// sass.hpp must go before all system headers to get the
-// __EXTENSIONS__ fix on Solaris.
-#include "sass.hpp"
-
-#include "ast.hpp"
-#include "subset_map.hpp"
-
-namespace Sass {
-
-  void Subset_Map::put(const Compound_Selector_Obj& sel, const SubSetMapPair& value)
-  {
-    if (sel->empty()) throw std::runtime_error("internal error: subset map keys may not be empty");
-    size_t index = values_.size();
-    values_.push_back(value);
-    for (size_t i = 0, S = sel->length(); i < S; ++i)
-    {
-      hash_[(*sel)[i]].push_back(std::make_pair(sel, index));
-    }
-  }
-
-  std::vector<SubSetMapPair> Subset_Map::get_kv(const Compound_Selector_Obj& sel)
-  {
-    SimpleSelectorDict dict(sel->begin(), sel->end()); // XXX Set
-    std::vector<size_t> indices;
-    for (size_t i = 0, S = sel->length(); i < S; ++i) {
-      if (!hash_.count((*sel)[i])) {
-        continue;
-      }
-      const std::vector<std::pair<Compound_Selector_Obj, size_t> >& subsets = hash_[(*sel)[i]];
-      for (const std::pair<Compound_Selector_Obj, size_t>& item : subsets) {
-        bool include = true;
-        for (const Simple_Selector_Obj& it : item.first->elements()) {
-          auto found = dict.find(it);
-          if (found == dict.end()) {
-            include = false;
-            break;
-          }
-        }
-        if (include) indices.push_back(item.second);
-      }
-    }
-    sort(indices.begin(), indices.end());
-    std::vector<size_t>::iterator indices_end = unique(indices.begin(), indices.end());
-    indices.resize(distance(indices.begin(), indices_end));
-
-    std::vector<SubSetMapPair> results;
-    for (size_t i = 0, S = indices.size(); i < S; ++i) {
-      results.push_back(values_[indices[i]]);
-    }
-    return results;
-  }
-
-  std::vector<SubSetMapPair> Subset_Map::get_v(const Compound_Selector_Obj& sel)
-  {
-    return get_kv(sel);
-  }
-
-}

data/ext/libsass/src/subset_map.hpp

@@ -1,76 +0,0 @@
-#ifndef SASS_SUBSET_MAP_H
-#define SASS_SUBSET_MAP_H
-
-#include <map>
-#include <set>
-#include <vector>
-#include <algorithm>
-#include <iterator>
-
-#include "ast_fwd_decl.hpp"
-
-
-// #include <iostream>
-// #include <sstream>
-// template<typename T>
-// std::string vector_to_string(std::vector<T> v)
-// {
-//   std::stringstream buffer;
-//   buffer << "[";
-
-//   if (!v.empty())
-//   {  buffer << v[0]; }
-//   else
-//   { buffer << "]"; }
-
-//   if (v.size() == 1)
-//   { buffer << "]"; }
-//   else
-//   {
-//     for (size_t i = 1, S = v.size(); i < S; ++i) buffer << ", " << v[i];
-//     buffer << "]";
-//   }
-
-//   return buffer.str();
-// }
-
-// template<typename T>
-// std::string set_to_string(set<T> v)
-// {
-//   std::stringstream buffer;
-//   buffer << "[";
-//   typename std::set<T>::iterator i = v.begin();
-//   if (!v.empty())
-//   {  buffer << *i; }
-//   else
-//   { buffer << "]"; }
-
-//   if (v.size() == 1)
-//   { buffer << "]"; }
-//   else
-//   {
-//     for (++i; i != v.end(); ++i) buffer << ", " << *i;
-//     buffer << "]";
-//   }
-
-//   return buffer.str();
-// }
-
-namespace Sass {
-
-  class Subset_Map {
-  private:
-    std::vector<SubSetMapPair> values_;
-    std::map<Simple_Selector_Obj, std::vector<std::pair<Compound_Selector_Obj, size_t> >, OrderNodes > hash_;
-  public:
-    void put(const Compound_Selector_Obj& sel, const SubSetMapPair& value);
-    std::vector<SubSetMapPair> get_kv(const Compound_Selector_Obj& s);
-    std::vector<SubSetMapPair> get_v(const Compound_Selector_Obj& s);
-    bool empty() { return values_.empty(); }
-    void clear() { values_.clear(); hash_.clear(); }
-    const std::vector<SubSetMapPair> values(void) { return values_; }
-  };
-
-}
-
-#endif