2009-08-21 22:21:05 +02:00
|
|
|
/*
|
|
|
|
* 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/>.
|
|
|
|
*/
|
|
|
|
|
2008-06-19 12:19:02 +02:00
|
|
|
/** @file smallvec_type.hpp Simple vector class that allows allocating an item without the need to copy this->data needlessly. */
|
2008-04-16 21:01:09 +02:00
|
|
|
|
2008-06-19 12:19:02 +02:00
|
|
|
#ifndef SMALLVEC_TYPE_HPP
|
|
|
|
#define SMALLVEC_TYPE_HPP
|
2008-04-16 21:01:09 +02:00
|
|
|
|
2008-06-19 12:19:02 +02:00
|
|
|
#include "alloc_func.hpp"
|
2010-09-03 23:50:51 +02:00
|
|
|
#include "mem_func.hpp"
|
2018-09-20 23:41:43 +02:00
|
|
|
#include <vector>
|
2008-05-30 11:32:24 +02:00
|
|
|
|
2019-02-20 22:35:41 +01:00
|
|
|
/**
|
|
|
|
* Helper function to append an item to a vector if it is not already contained
|
|
|
|
* Consider using std::set, std::unordered_set or std::flat_set in new code
|
|
|
|
*
|
|
|
|
* @param vec A reference to the vector 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 T>
|
|
|
|
inline bool include(std::vector<T>& vec, const T &item)
|
|
|
|
{
|
|
|
|
const bool is_member = std::find(vec.begin(), vec.end(), item) != vec.end();
|
|
|
|
if (!is_member) vec.emplace_back(item);
|
|
|
|
return is_member;
|
|
|
|
}
|
|
|
|
|
2019-02-18 23:39:06 +01:00
|
|
|
/**
|
2019-02-20 20:27:10 +01:00
|
|
|
* Helper function to get the index of an item
|
|
|
|
* Consider using std::set, std::unordered_set or std::flat_set in new code
|
|
|
|
*
|
|
|
|
* @param vec A reference to the vector to be extended
|
|
|
|
* @param item Reference to the item to be search for
|
|
|
|
*
|
|
|
|
* @return Index of element if found, otherwise -1
|
|
|
|
*/
|
|
|
|
template <typename T>
|
|
|
|
int find_index(std::vector<T> const& vec, T const& item)
|
|
|
|
{
|
|
|
|
auto const it = std::find(vec.begin(), vec.end(), item);
|
|
|
|
if (it != vec.end()) return it - vec.begin();
|
|
|
|
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2008-06-19 12:19:02 +02:00
|
|
|
#endif /* SMALLVEC_TYPE_HPP */
|