utils.h

// Copyright 2018-2019 Delft University of Technology
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
 
#pragma once
 
#include <string>
#include <memory>
#include <utility>
#include <vector>
#include <algorithm>
#include <optional>
#include <fstream>
#include <unordered_map>
 
namespace cerata {
 
std::string version();
 
std::string ToUpper(std::string str);
std::string ToLower(std::string str);
 
std::string ToString(const std::unordered_map<std::string, std::string> &meta);
 
struct Named {
 public:
  explicit Named(std::string name) : name_(std::move(name)) {}
  [[nodiscard]] std::string name() const { return name_; }
  void SetName(std::string name) { name_ = std::move(name); }
 
  virtual ~Named() = default;
 private:
  std::string name_;
};
 
template<typename T>
bool Contains(const std::vector<std::shared_ptr<T>> &list, const std::shared_ptr<T> &item) {
  return std::find(std::begin(list), std::end(list), item) != std::end(list);
}
 
template<typename T>
bool Contains(const std::vector<std::weak_ptr<T>> &list, const std::weak_ptr<T> &item) {
  return std::find(std::begin(list), std::end(list), item) != std::end(list);
}
 
template<typename T>
bool Contains(const std::vector<T *> &list, T *item) {
  return std::find(std::begin(list), std::end(list), item) != std::end(list);
}
 
template<typename T>
void Append(std::vector<T> *list_a, const std::vector<T> &list_b) {
  list_a->insert(list_a->end(), list_b.begin(), list_b.end());
}
 
template<typename T>
std::vector<T> Merge(std::initializer_list<std::vector<T>> lists) {
  std::vector<T> result;
  for (const auto &l : lists) {
    result.insert(result.end(), l.begin(), l.end());
  }
  return result;
}
 
template<typename T, typename U>
std::vector<T> Merge(std::initializer_list<std::unordered_map<T, U>> lists) {
  std::vector<T> result;
  for (const auto &l : lists) {
    result.insert(result.end(), l.begin(), l.end());
  }
  return result;
}
 
template<typename T>
bool Remove(std::vector<std::shared_ptr<T>> *list, const std::shared_ptr<T> &item) {
  auto it = std::find(std::begin(*list), std::end(*list), item);
  if (it != std::end(*list)) {
    list->erase(it);
    return true;
  } else {
    return false;
  }
}
 
template<typename T>
std::vector<T *> ToRawPointers(const std::vector<std::shared_ptr<T>> &list) {
  std::vector<T *> result;
  for (auto &value : list) {
    result.push_back(value.get());
  }
  return result;
}
 
template<typename T>
std::vector<T *> ToRawPointers(const std::vector<std::unique_ptr<T>> &list) {
  std::vector<T *> result;
  for (auto &value : list) {
    result.push_back(value.get());
  }
  return result;
}
 
template<typename T, typename U>
std::vector<T *> As(const std::vector<U *> &vec) {
  std::vector<T *> result;
  for (auto &value : vec) {
    result.push_back(dynamic_cast<T *>(value));
  }
  return result;
}
 
template<typename T>
std::vector<T> Unique(const std::vector<T> &vec) {
  auto result = vec;
  auto last = std::unique(result.begin(), result.end());
  result.erase(last, result.end());
  return vec;
}
 
template<typename T>
void FilterDuplicates(std::vector<T> *vec) {
  auto last = std::unique(vec->begin(), vec->end());
  vec->erase(last, vec->end());
}
 
template<typename T>
std::string ToString() {
  return "UNKOWN TYPE";
}
 
void CreateDir(const std::string &dir_name);
 
bool FileExists(const std::string &name);
 
}  // namespace cerata