stl_helpers.hpp

Go to the documentation of this file.

// SPDX-License-Identifier: AGPL-3.0-or-later
/*
 * Project: RAVENNAKIT (RAVENNA / AES67 / ST2110-30 SDK)
 * Copyright (c) 2024-2025 Sound on Digital
 *
 * This file is part of RAVENNAKIT.
 *
 * RAVENNAKIT is dual-licensed:
 *   1) Under the terms of the GNU Affero General Public License as published by
 *      the Free Software Foundation, either version 3 of the License, or
 *      (at your option) any later version (the "AGPL License"); and
 *   2) Under a commercial license from Sound on Digital, for customers who
 *      cannot (or do not wish to) comply with the AGPL License terms.
 *
 * If you obtained this file under the AGPL License, you may redistribute it
 * and/or modify it under the terms of the AGPL License. See the LICENSE
 * file in the project root for details.
 *
 * For commercial licensing, support, and other inquiries, please visit:
 *
 *     https://ravennakit.com
 *
 */
 
#pragma once
 
#include <algorithm>
#include <array>
#include <utility>
 
namespace rav {

template<typename Container, typename Pred>
size_t stl_remove_if(Container& container, Pred pred) {
    auto old_size = container.size();
    container.erase(std::remove_if(container.begin(), container.end(), pred), container.end());
    return old_size - container.size();
}

template<typename Map, typename Key>
auto stl_get_or_default(const Map& map, const Key& key) -> typename Map::mapped_type {
    if (auto it = map.find(key); it != map.end())
        return it->second;
    return typename Map::mapped_type {};
}
 
// Helper for `generate_array`
template<typename T, std::size_t N, typename F, std::size_t... Is>
std::array<T, N> generate_array_impl(F&& f, std::index_sequence<Is...>) {
    return {{f(Is)...}};
}

template<typename T, std::size_t N, typename F>
std::array<T, N> generate_array(F&& f) {
    return generate_array_impl<T, N>(std::forward<F>(f), std::make_index_sequence<N> {});
}
 
}  // namespace rav