Filter.cc

Go to the documentation of this file.

#include "DetectorDescription/DDCMS/interface/Filter.h"
#include <functional>
#include <regex>
#include <iostream>

using namespace std;

namespace cms {
  namespace dd {

    bool compareEqual(string_view node, string_view name) {
      if(!isRegex(name)) {
        return (name == node);
      } else {
    if(name.front() != node.front())
      return false;
        regex pattern({name.data(), name.size()});
        return regex_match(begin(node), end(node), pattern);
      }
    }

    bool accepted(vector<string_view> const& names, string_view node) {
      return (find_if(begin(names), end(names),
              [&](const auto& n) -> bool { return compareEqual(node, n); })
          != end(names));
    }

    int contains(string_view input, string_view needle) {
      auto const& it = search(begin(input), end(input),
                  default_searcher(begin(needle), end(needle)));
      if(it != end(input)) {
    return (it - begin(input));
      }
      return -1;
    }

    bool isRegex(string_view input) {
      return ((contains(input, "*") != -1) ||
              (contains(input, ".") != -1));
    }

    string_view realTopName(string_view input) {
      string_view v = input;
      auto first = v.find_first_of("//");
      v.remove_prefix(min(first+2, v.size()));
      return v;
    }
    
    vector<string_view>
    split(string_view str, const char* delims) {
      vector<string_view> ret;
      
      string_view::size_type start = 0;
      auto pos = str.find_first_of(delims, start);
      while(pos != string_view::npos) {
    if(pos != start) {
      ret.emplace_back(str.substr(start, pos - start));
    }
    start = pos + 1;
    pos = str.find_first_of(delims, start);
      }
      if(start < str.length())
    ret.emplace_back(str.substr(start, str.length() - start));
      return ret;
    }
  }
}