7#include <absl/container/flat_hash_map.h>
8#include <absl/container/flat_hash_set.h>
9#include <absl/container/node_hash_map.h>
10#include <absl/container/node_hash_set.h>
22template<
class D,
class S>
25 auto s =
reinterpret_cast<const void*
>(&src);
26 auto d =
reinterpret_cast<void*
>(&dst);
28 if constexpr (
sizeof(D) ==
sizeof(S)) std::memcpy(d, s,
sizeof(D));
29 if constexpr (
sizeof(D) <
sizeof(S)) std::memcpy(d, s,
sizeof(D));
30 if constexpr (
sizeof(D) >
sizeof(S)) {
31 std::memset(d, 0,
sizeof(D));
32 std::memcpy(d, s,
sizeof(S));
39 static_assert(std::is_integral<T>(),
"get_sign only supported for signed and unsigned integer types");
40 if constexpr (std::is_signed<T>())
43 return val >> (T(
sizeof(val)) * T(8) - T(1));
48 auto mod = offset % align;
49 if (mod != 0) offset += align - mod;
56template<
class I,
class T,
class L>
58 static_assert(std::random_access_iterator<I>);
60 if (std::distance(begin, end) < 16)
61 for (i = begin; i != end && lt(*i, val); ++i) {}
63 i = std::lower_bound(begin, end, val, lt);
64 return (i != end && !lt(val, *i)) ? i : end;
68inline std::string_view
subview(std::string_view s,
size_t i,
size_t n = std::string_view::npos) {
69 n = std::min(n, s.size());
70 return {s.data() + i, n - i};
74inline void find_and_replace(std::string& str, std::string_view what, std::string_view repl) {
75 for (
size_t pos = str.find(what); pos != std::string::npos; pos = str.find(what, pos + repl.size()))
76 str.replace(pos, what.size(), repl);
83auto pop(S& s) ->
decltype(s.top(),
typename S::value_type()) {
90auto pop(Q& q) ->
decltype(q.front(),
typename Q::value_type()) {
99template<
class C,
class K>
100auto lookup(
const C& container,
const K& key) {
101 auto i = container.find(key);
102 if constexpr (std::is_pointer_v<typename C::mapped_type>)
103 return i != container.end() ? i->second :
nullptr;
105 return i != container.end() ? &i->second :
nullptr;
109template<
class C,
class... Args>
111 auto [i, ins] = container.emplace(std::forward<Args>(args)...);
120 using T =
typename std::remove_reference_t<Set>::value_type;
123 if (done_.emplace(val).second) {
130 bool empty()
const {
return stack_.empty(); }
131 const T&
top() {
return stack_.top(); }
140 std::stack<T> stack_;
146 using T =
typename std::remove_reference_t<Set>::value_type;
153 if (done_.emplace(val).second) {
160 bool empty()
const {
return queue_.empty(); }
171 std::queue<T> queue_;
181 constexpr bool operator()(T a, T b)
const noexcept {
return a->gid() < b->gid(); }
187template<
class K,
class V>
using GIDMap = absl::flat_hash_map<K, V, GIDHash<K>>;
188template<
class K>
using GIDSet = absl::flat_hash_set<K, GIDHash<K>>;
189template<
class K,
class V>
using GIDNodeMap = absl::node_hash_map<K, V, GIDHash<K>>;
190template<
class K>
using GIDNodeSet = absl::node_hash_set<K, GIDHash<K>>;
typename std::remove_reference_t< Set >::value_type T
typename std::remove_reference_t< Set >::value_type T
auto pop(S &s) -> decltype(s.top(), typename S::value_type())
D bitcast(const S &src)
A bitcast from src of type S to D.
auto assert_emplace(C &container, Args &&... args)
Invokes emplace on container, asserts that insertion actually happened, and returns the iterator.
auto lookup(const C &container, const K &key)
Yields pointer to element (or the element itself if it is already a pointer), if found and nullptr ot...
I binary_find(I begin, I end, T val, L lt)
absl::flat_hash_map< K, V, GIDHash< K > > GIDMap
u64 pad(u64 offset, u64 align)
void find_and_replace(std::string &str, std::string_view what, std::string_view repl)
Replaces all occurrences of what with repl.
constexpr size_t hash(size_t h) noexcept
absl::node_hash_set< K, GIDHash< K > > GIDNodeSet
absl::node_hash_map< K, V, GIDHash< K > > GIDNodeMap
absl::flat_hash_set< K, GIDHash< K > > GIDSet
std::string_view subview(std::string_view s, size_t i, size_t n=std::string_view::npos)
Like std::string::substr, but works on std::string_view instead.
constexpr size_t operator()(T p) const noexcept
constexpr bool operator()(T a, T b) const noexcept