stl_util.h

Go to the documentation of this file.

/* 
* Copyright (C) 2020-2026 MEmilio
*
* Authors: Daniel Abele
*
* Contact: Martin J. Kuehn <Martin.Kuehn@DLR.de>
*
* 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.
*/
#ifndef MIO_UTIL_STL_UTIL_H
#define MIO_UTIL_STL_UTIL_H
 
#include <array>
#include <concepts>
#include <numeric>
#include <vector>
#include <algorithm>
#include <utility>
#include <iterator>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <cstring>
#include <cassert>
#include <memory>
 
namespace mio
{
 
inline std::ostream& set_ostream_format(std::ostream& out, size_t width, size_t precision, char fill = ' ')
{
    // Note: ostream& operator<< returns a reference to itself
    return out << std::setw(width) << std::fixed << std::setprecision(precision) << std::setfill(fill);
}
 
template <typename T, typename Pred>
void insert_sorted_replace(std::vector<T>& vec, T const& item, Pred pred)
{
    auto bounds = std::equal_range(begin(vec), end(vec), item, pred);
    auto lb     = bounds.first;
    auto ub     = bounds.second;
    assert(ub - lb <= 1); //input vector contains at most one item that is equal to the new item
    if (ub - lb == 1) {
        *lb = item;
        return;
    }
    else {
        vec.insert(lb, item);
        return;
    }
}
 
template <typename T>
void insert_sorted_replace(std::vector<T>& vec, T const& item)
{
    return insert_sorted_replace(vec, item, std::less<T>());
}
 
template <class Iterator, class Sentinel = Iterator>
    requires std::input_or_output_iterator<Iterator> && std::input_or_output_iterator<Sentinel> &&
             std::equality_comparable_with<Iterator, Sentinel>
class Range
{
    // TODO: Make this a thin wrapper for std::ranges::subrange, once we have the ranges library (min libc++ version 16)
public:
    // Type definitions for STL compatible containers.
    using iterator               = Iterator;
    using const_iterator         = iterator;
    using reverse_iterator       = std::reverse_iterator<iterator>;
    using const_reverse_iterator = std::reverse_iterator<const_iterator>;
    using value_type             = typename std::iterator_traits<iterator>::value_type;
    using reference              = typename std::iterator_traits<iterator>::reference;
 
    Range(Iterator begin, Sentinel end)
        : m_iterator(std::move(begin))
        , m_sentinel(std::move(end))
    {
    }
    template <class T>
    Range(T&& range)
        : m_iterator(std::forward<T>(range).begin())
        , m_sentinel(std::forward<T>(range).end())
    {
    }
    template <class I, class S>
    Range(std::pair<I, S> iterator_pair)
        : m_iterator(std::move(iterator_pair).first)
        , m_sentinel(std::move(iterator_pair).second)
    {
    }
 
    Iterator begin() const
    {
        return m_iterator;
    }
    Sentinel end() const
    {
        return m_sentinel;
    }
 
    reference front() const
        requires std::forward_iterator<iterator>
    {
        return *(begin());
    }
    reference back() const
        requires std::bidirectional_iterator<iterator>
    {
        return *(--end());
    }
 
    size_t size() const
    {
        return static_cast<size_t>(std::distance(begin(), end()));
    }
    bool empty() const
    {
        return size() == 0;
    }
 
    reference operator[](size_t index) const
    {
        assert(index < size());
        auto it = begin();
        std::advance(it, index);
        return *it;
    }
 
    decltype(auto) rbegin() const
        requires std::bidirectional_iterator<iterator>
    {
        return std::make_reverse_iterator(end());
    }
    decltype(auto) rend() const
        requires std::bidirectional_iterator<iterator>
    {
        return std::make_reverse_iterator(begin());
    }
 
private:
    Iterator m_iterator;
    Sentinel m_sentinel;
};
 
template <class I, class S>
Range(std::pair<I, S> iterator_pair) -> Range<I, S>;
 
template <class T>
Range(T&& range) -> Range<decltype(range.begin()), decltype(range.end())>;
 
template <class T>
concept HasOstreamOperator = requires(std::ostream os, T t) { os << t; };
 
namespace details
{
inline size_t string_length(const char* str)
{
    return std::strlen(str);
}
 
template <class String>
size_t string_length(String&& str)
{
    return str.length();
}
 
inline void path_join_rec(std::stringstream&, bool)
{
}
 
template <class Head, class... Tail>
void path_join_rec(std::stringstream& ss, bool writeSeparator, Head&& head, Tail&&... tail)
{
    if (writeSeparator) {
        ss << '/';
    }
    ss << head;
    path_join_rec(ss, string_length(head) > 0 && head[string_length(head) - 1] != '/', tail...);
}
 
} // namespace details
 
template <class String, class... Strings>
std::string path_join(String&& base, Strings&&... app)
{
    std::stringstream ss;
    details::path_join_rec(ss, false, base, app...);
    auto path = ss.str();
    return path;
}
 
template <class U, class T>
std::unique_ptr<U> dynamic_unique_ptr_cast(std::unique_ptr<T>&& base_ptr)
{
    auto tmp_base_ptr = std::move(base_ptr);
    U* tmp            = dynamic_cast<U*>(tmp_base_ptr.get());
    std::unique_ptr<U> derived_ptr;
    if (tmp != nullptr) {
        tmp_base_ptr.release();
        derived_ptr.reset(tmp);
    }
    return derived_ptr;
}
 
template <class Iter, class Pred>
bool contains(Iter b, Iter e, Pred p)
{
    return find_if(b, e, p) != e;
}
 
template <class T>
constexpr std::array<T, size_t(T::Count)> enum_members()
{
    auto enum_members = std::array<T, size_t(T::Count)>{};
    auto indices      = std::array<std::underlying_type_t<T>, size_t(T::Count)>{};
    std::iota(indices.begin(), indices.end(), std::underlying_type_t<T>(0));
    std::transform(indices.begin(), indices.end(), enum_members.begin(), [](auto i) {
        return T(i);
    });
    return enum_members;
}
 
template <class T>
using VectorRange =
    std::conditional_t<std::is_const_v<T>,
                       typename mio::Range<typename std::vector<std::remove_const_t<T>>::const_iterator>,
                       typename mio::Range<typename std::vector<std::remove_const_t<T>>::iterator>>;
 
} // namespace mio
 
#endif // MIO_UTIL_STL_UTIL_H