ead18b2af2
# Conflicts: # CMakeLists.txt # src/3rdparty/md5/md5.h # src/3rdparty/squirrel/squirrel/squtils.h # src/animated_tile.cpp # src/console_func.h # src/core/CMakeLists.txt # src/core/container_func.hpp # src/core/smallstack_type.hpp # src/crashlog.cpp # src/crashlog.h # src/debug.h # src/economy.cpp # src/gamelog.cpp # src/industry_gui.cpp # src/lang/catalan.txt # src/misc_gui.cpp # src/network/network_content.h # src/newgrf.cpp # src/newgrf.h # src/newgrf_config.cpp # src/newgrf_config.h # src/newgrf_gui.cpp # src/os/unix/font_unix.cpp # src/os/windows/crashlog_win.cpp # src/rail_cmd.cpp # src/saveload/animated_tile_sl.cpp # src/script/api/script_tilelist.cpp # src/settings.cpp # src/settingsgen/settingsgen.cpp # src/sl/oldloader_sl.cpp # src/station.cpp # src/station_cmd.cpp # src/stdafx.h # src/strgen/strgen.cpp # src/strgen/strgen_base.cpp # src/table/settings/gui_settings.ini # src/train_gui.cpp # src/vehicle.cpp # src/vehicle_base.h # src/vehicle_cmd.cpp # src/vehicle_gui_base.h # src/viewport_sprite_sorter.h
108 lines
3.3 KiB
C++
108 lines
3.3 KiB
C++
/*
|
|
* This file is part of OpenTTD.
|
|
* OpenTTD is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, version 2.
|
|
* OpenTTD is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
|
* See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with OpenTTD. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
/** @file container_func.hpp Some simple functions to help with accessing containers. */
|
|
|
|
#ifndef CONTAINER_FUNC_HPP
|
|
#define CONTAINER_FUNC_HPP
|
|
|
|
#include <iterator>
|
|
#include <algorithm>
|
|
|
|
/**
|
|
* Helper function to append an item to a container if it is not already contained.
|
|
* The container must have a \c emplace_back function.
|
|
* Consider using std::set, std::unordered_set or std::flat_set in new code.
|
|
*
|
|
* @param container A reference to the container to be extended
|
|
* @param item Reference to the item to be copy-constructed if not found
|
|
*
|
|
* @return Whether the item was already present
|
|
*/
|
|
template <typename Container>
|
|
inline bool include(Container &container, typename Container::const_reference &item)
|
|
{
|
|
const bool is_member = std::find(container.begin(), container.end(), item) != container.end();
|
|
if (!is_member) container.emplace_back(item);
|
|
return is_member;
|
|
}
|
|
|
|
/**
|
|
* Helper function to get the index of an item
|
|
* Consider using std::set, std::unordered_set or std::flat_set in new code.
|
|
*
|
|
* @param container A reference to the container to be searched.
|
|
* @param item Reference to the item to be search for
|
|
*
|
|
* @return Index of element if found, otherwise -1
|
|
*/
|
|
template <typename Container>
|
|
int find_index(Container const &container, typename Container::const_reference item)
|
|
{
|
|
auto const it = std::find(container.begin(), container.end(), item);
|
|
if (it != container.end()) return std::distance(container.begin(), it);
|
|
|
|
return -1;
|
|
}
|
|
|
|
template <typename C, typename UP> unsigned int container_unordered_remove_if (C &container, UP predicate) {
|
|
unsigned int removecount = 0;
|
|
for (auto it = container.begin(); it != container.end();) {
|
|
if (predicate(*it)) {
|
|
removecount++;
|
|
if (std::next(it) != container.end()) {
|
|
*it = std::move(container.back());
|
|
container.pop_back();
|
|
} else {
|
|
container.pop_back();
|
|
break;
|
|
}
|
|
} else {
|
|
++it;
|
|
}
|
|
}
|
|
return removecount;
|
|
}
|
|
|
|
template <typename C, typename V> unsigned int container_unordered_remove(C &container, const V &value) {
|
|
return container_unordered_remove_if (container, [&](const typename C::value_type &v) {
|
|
return v == value;
|
|
});
|
|
}
|
|
|
|
template <typename T>
|
|
bool multimaps_equalivalent(const T &a, const T&b)
|
|
{
|
|
if (a.size() != b.size()) return false;
|
|
|
|
for (auto it_a = a.begin(); it_a != a.end();) {
|
|
const auto start_a = it_a;
|
|
const auto key = start_a->first;
|
|
size_t distance_a = 0;
|
|
do {
|
|
++it_a;
|
|
++distance_a;
|
|
} while (it_a != a.end() && it_a->first == key);
|
|
|
|
const auto start_b = b.lower_bound(key);
|
|
size_t distance_b = 0;
|
|
for (auto it_b = start_b; it_b != b.end() && it_b->first == key; ++it_b) {
|
|
++distance_b;
|
|
}
|
|
|
|
if (distance_a != distance_b) return false;
|
|
|
|
if (!std::is_permutation(start_a, it_a, start_b)) {
|
|
return false;
|
|
}
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
#endif /* CONTAINER_FUNC_HPP */
|