hashtables.h

Go to the documentation of this file.

/*
 * This program source code file is part of KiCad, a free EDA CAD application.
 *
 * Copyright (C) 2012 SoftPLC Corporation, Dick Hollenbeck <[email protected]>
 * Copyright (C) 2012-2020 KiCad Developers, see AUTHORS.TXT for contributors.
 *
 * 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
 */

#ifndef HASHTABLES_H_
#define HASHTABLES_H_

#include <unordered_map>

#include <eda_rect.h>
#include <wx/string.h>

// First some utility classes and functions

struct iequal_to : std::binary_function< const char*, const char*, bool >
{
 bool operator()( const char* x, const char* y ) const
 {
 return !strcmp( x, y );
 }
};


struct fnv_1a
{
 /* not used, std::string is too slow:
 std::size_t operator()( std::string const& text ) const
 {
 std::size_t hash = 2166136261u;

 for( std::string::const_iterator it = text.begin(), end = text.end();
 it != end; ++it )
 {
 hash ^= *it;
 hash *= 16777619;
 }
 return hash;
 }
 */

 std::size_t operator()( const char* it ) const
 {
 std::size_t hash = 2166136261u;

 for( ; *it; ++it )
 {
 hash ^= (unsigned char) *it;
 hash *= 16777619;
 }
 return hash;
 }
};


struct WXSTRING_HASH : std::unary_function<wxString, std::size_t>
{
 std::size_t operator()( const wxString& aString ) const
 {
 std::size_t hash = 2166136261u;

 for( const wxUniChar c : aString )
 {
 unsigned ch = static_cast<unsigned>( c );
 hash ^= ch;
 hash *= 16777619;
 }
 return hash;
 }
};


#ifdef SWIG
#define DECL_HASH_FOR_SWIG( TypeName, KeyType, ValueType ) \
 namespace std \
 { \
 % template( TypeName ) unordered_map<KeyType, ValueType>; \
 } \
 typedef std::unordered_map<KeyType, ValueType> TypeName;
#else
#define DECL_HASH_FOR_SWIG( TypeName, KeyType, ValueType ) \
 typedef std::unordered_map<KeyType, ValueType> TypeName;
#endif


typedef std::unordered_map< const char*, int, fnv_1a, iequal_to > KEYWORD_MAP;

typedef std::unordered_map< std::string, EDA_RECT > RECT_MAP;


#endif // HASHTABLES_H_