util.h

Go to the documentation of this file.

#ifndef LSST_GAUSS2D_FIT_UTIL_H
#define LSST_GAUSS2D_FIT_UTIL_H
 
#include <algorithm>
#include <memory>
#include <set>
#include <sstream>
#include <stdexcept>
#include <string>
#include <vector>
 
namespace lsst::gauss2d::fit {
 
template <typename T>
struct IsCloseResult {
    const bool isclose;
    const double diff_abs;
    const T margin;
 
    std::string str() const {
        std::stringstream ss;
        ss.precision(5);
        ss << "isclose=" << isclose << " from diff=" << diff_abs << " <= margin=" << margin;
        return ss.str();
    }
    std::string str() const  {…}
};
struct IsCloseResult {…};
 
template <typename T>
IsCloseResult<T> isclose(T a, T b, T rtol = 1e-5, T atol = 1e-8) {
    const T diff_abs = std::abs(a - b);
    const T margin = atol + rtol * std::abs(b);
    return IsCloseResult<T>{diff_abs <= margin, diff_abs, margin};
}
IsCloseResult<T> isclose(T a, T b, T rtol = 1e-5, T atol = 1e-8) {…}
 
// The rest of these functions are mainly intended to make printing container members easier
template <template <typename...> class Map, class Key, class Value>
std::set<Key> map_keys(const Map<Key, Value>& map) {
    std::set<Key> result;
    for (const auto& it : map) {
        result.insert(it.first);
    }
    return result;
}
std::set<Key> map_keys(const Map<Key, Value>& map) {…}
 
template <template <typename...> class Map, class Key, class Value>
std::set<std::reference_wrapper<const Key>> map_keys_ref_const(
        const Map<std::reference_wrapper<const Key>, Value, std::less<const Key>>& map) {
    std::set<std::reference_wrapper<const Key>> result;
    for (const auto& it : map) result.insert(it.first.get());
    return result;
}
std::set<std::reference_wrapper<const Key>> map_keys_ref_const( {…}
 
template <template <typename...> class Map, class Key, class Value>
std::set<std::shared_ptr<const Value>> map_values_shared_ptr_const(
        const Map<Key, std::shared_ptr<const Value>>& map) {
    std::set<std::shared_ptr<const Value>> result;
    for (const auto& it : map) result.insert(it.second);
    return result;
}
std::set<std::shared_ptr<const Value>> map_values_shared_ptr_const( {…}
 
template <template <typename...> class Map, class Key, class Value>
std::set<std::reference_wrapper<const Value>> map_values_ref_const(
        const Map<Key, std::reference_wrapper<const Value>>& map) {
    std::set<std::reference_wrapper<const Value>> result;
    for (const auto& it : map) result.insert(it.second);
    return result;
}
std::set<std::reference_wrapper<const Value>> map_values_ref_const( {…}
 
// Builds a new vector with only unique elements, preserving order
// Note: std::unique only removes consecutive identical elements
// Also, this returns a new vector, potentially copying elements
template <typename T>
std::vector<T> nonconsecutive_unique(const std::vector<T>& vec) {
    std::set<T> set{};
    std::vector<T> rval{};
    rval.reserve(vec.size());
    for (const auto& elem : vec) {
        auto result = set.insert(elem);
        if (result.second) rval.push_back(elem);
    }
    return rval;
}
std::vector<T> nonconsecutive_unique(const std::vector<T>& vec) {…}
 
/*
template <typename T>
std::string str_ptr(const T* obj) {
    return (obj == nullptr) ? "None" : obj->str();
}
 
template <typename T>
std::string str_iter_ptr(const T& container) {
    std::string str = "[";
    for (const auto& obj : container) str += str_ptr(obj) + ",";
    return str.substr(0, str.size() - 1) + "]";
}
 
*/
template <template <typename...> class Container, class Value>
Container<Value> head_iter(const Container<Value>& container, size_t n) {
    return Container<Value>(container.begin(), container.begin() + n);
}
Container<Value> head_iter(const Container<Value>& container, size_t n) {…}
 
template <template <typename...> class Container, class Value>
Container<Value> tail_iter(const Container<Value>& container, size_t n) {
    return Container<Value>(container.end() - n, container.end());
}
Container<Value> tail_iter(const Container<Value>& container, size_t n) {…}
 
}  // namespace lsst::gauss2d::fit
 
#endif