tracy/server/TracyCharUtil.hpp

88 lines
1.5 KiB
C++
Raw Normal View History

2017-09-27 00:35:59 +00:00
#ifndef __TRACY__CHARUTIL_HPP__
#define __TRACY__CHARUTIL_HPP__
#include <stddef.h>
#include <stdint.h>
#include <string.h>
2019-11-07 22:52:52 +00:00
#define XXH_STATIC_LINKING_ONLY
#include "tracy_xxh3.h"
2018-03-23 20:12:29 +00:00
#include "tracy_flat_hash_map.hpp"
2017-09-27 00:35:59 +00:00
namespace tracy
{
namespace charutil
{
2019-11-07 22:52:52 +00:00
static inline size_t hash( const char* str )
2017-09-27 00:35:59 +00:00
{
2019-11-07 22:52:52 +00:00
const auto sz = strlen( str );
return XXH3_64bits( str, sz );
2017-09-27 00:35:59 +00:00
}
2019-11-07 22:52:52 +00:00
static inline size_t hash( const char* str, size_t sz )
{
2019-11-07 22:52:52 +00:00
return XXH3_64bits( str, sz );
}
2017-09-27 00:35:59 +00:00
struct Hasher
{
size_t operator()( const char* key ) const
{
return hash( key );
}
};
2018-03-23 20:12:29 +00:00
struct HasherPOT : public Hasher
{
typedef tracy::power_of_two_hash_policy hash_policy;
};
2017-09-27 00:35:59 +00:00
struct Comparator
{
bool operator()( const char* lhs, const char* rhs ) const
{
return strcmp( lhs, rhs ) == 0;
}
};
struct LessComparator
{
bool operator()( const char* lhs, const char* rhs ) const
{
return strcmp( lhs, rhs ) < 0;
}
};
struct StringKey
{
const char* ptr;
size_t sz;
struct Hasher
{
size_t operator()( const StringKey& key ) const
{
return hash( key.ptr, key.sz );
}
};
struct HasherPOT : public Hasher
{
typedef tracy::power_of_two_hash_policy hash_policy;
};
struct Comparator
{
bool operator()( const StringKey& lhs, const StringKey& rhs ) const
{
return lhs.sz == rhs.sz && memcmp( lhs.ptr, rhs.ptr, lhs.sz ) == 0;
}
};
};
2017-09-27 00:35:59 +00:00
}
}
#endif