2017-10-09 09:44:02 +00:00
|
|
|
/*
|
|
|
|
* This program source code file is part of KiCad, a free EDA CAD application.
|
|
|
|
*
|
|
|
|
* Copyright (C) 2017 CERN
|
2021-01-25 12:42:36 +00:00
|
|
|
* Copyright (C) 2020-2021 KiCad Developers, see AUTHORS.txt for contributors.
|
|
|
|
*
|
2017-10-09 09:44:02 +00:00
|
|
|
* @author Maciej Suminski <maciej.suminski@cern.ch>
|
|
|
|
*
|
|
|
|
* This program 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; either version 2
|
|
|
|
* of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This program 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 this program; if not, you may find one here:
|
|
|
|
* http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
|
|
|
|
* or you may search the http://www.gnu.org website for the version 2 license,
|
|
|
|
* or you may write to the Free Software Foundation, Inc.,
|
|
|
|
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
|
|
|
|
*/
|
|
|
|
|
2020-07-10 00:39:00 +00:00
|
|
|
#ifndef HASH_EDA_H_
|
|
|
|
#define HASH_EDA_H_
|
2021-01-25 12:42:36 +00:00
|
|
|
|
2017-10-09 09:44:02 +00:00
|
|
|
/**
|
|
|
|
* @brief Hashing functions for EDA_ITEMs.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <cstdlib>
|
2020-07-10 00:39:00 +00:00
|
|
|
#include <functional>
|
2017-10-09 09:44:02 +00:00
|
|
|
|
|
|
|
class EDA_ITEM;
|
|
|
|
|
2021-01-25 12:42:36 +00:00
|
|
|
///< Enables/disables properties that will be used for calculating the hash.
|
|
|
|
///< The properties might be combined using the bitwise 'or' operator.
|
2017-10-09 09:44:02 +00:00
|
|
|
enum HASH_FLAGS
|
|
|
|
{
|
2020-07-10 00:39:00 +00:00
|
|
|
HASH_POS = 0x01,
|
2017-10-09 09:44:02 +00:00
|
|
|
|
2021-01-25 12:42:36 +00:00
|
|
|
///< use coordinates relative to the parent object
|
2017-10-09 09:44:02 +00:00
|
|
|
REL_COORD = 0x02,
|
2020-07-10 00:39:00 +00:00
|
|
|
HASH_ROT = 0x04,
|
|
|
|
HASH_LAYER = 0x08,
|
|
|
|
HASH_NET = 0x10,
|
|
|
|
HASH_REF = 0x20,
|
|
|
|
HASH_VALUE = 0x40,
|
|
|
|
HASH_ALL = 0xff
|
2017-10-09 09:44:02 +00:00
|
|
|
};
|
|
|
|
|
2019-10-10 16:44:33 +00:00
|
|
|
/**
|
2021-01-25 12:42:36 +00:00
|
|
|
* Calculate hash of an EDA_ITEM.
|
|
|
|
*
|
2017-10-09 09:44:02 +00:00
|
|
|
* @param aItem is the item for which the hash will be computed.
|
|
|
|
* @return Hash value.
|
|
|
|
*/
|
2020-11-14 01:16:02 +00:00
|
|
|
std::size_t hash_fp_item( const EDA_ITEM* aItem, int aFlags = HASH_FLAGS::HASH_ALL );
|
2020-07-10 00:39:00 +00:00
|
|
|
|
2020-07-10 16:56:50 +00:00
|
|
|
/**
|
|
|
|
* This is a dummy function to take the final case of hash_combine below
|
|
|
|
* @param seed
|
|
|
|
*/
|
|
|
|
static inline void hash_combine( std::size_t &seed ) {}
|
2020-07-10 00:39:00 +00:00
|
|
|
|
|
|
|
/**
|
2021-01-25 12:42:36 +00:00
|
|
|
* Combine multiple hashes utilizing previous hash result.
|
|
|
|
*
|
2020-07-10 16:56:50 +00:00
|
|
|
* @tparam T A hashable type
|
|
|
|
* @param seed A seed value input and output for the result.
|
|
|
|
* @param val A hashable object of type T
|
2020-07-10 00:39:00 +00:00
|
|
|
*/
|
|
|
|
template< typename T, typename ... Types >
|
|
|
|
static inline void hash_combine( std::size_t &seed, const T &val, const Types &... args )
|
|
|
|
{
|
2020-07-10 16:56:50 +00:00
|
|
|
seed ^= std::hash<T>()( val ) + 0x9e3779b9 + ( seed << 6 ) + ( seed >> 2 );
|
2020-07-10 00:39:00 +00:00
|
|
|
hash_combine( seed, args... );
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename... Types>
|
|
|
|
static inline std::size_t hash_val( const Types &... args )
|
|
|
|
{
|
2020-07-10 16:56:50 +00:00
|
|
|
std::size_t seed = 0xa82de1c0;
|
2020-07-10 00:39:00 +00:00
|
|
|
hash_combine( seed, args... );
|
|
|
|
return seed;
|
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|