mirror of
https://github.com/bminor/binutils-gdb.git
synced 2025-11-16 04:24:43 +00:00
ddaee713f5
We don't need anything in this release, but I think it doesn't hurt to just stay up to date. The new version has a new include file, stl.h. To keep things clean and separated, move the imported files to a new sub-directory. This requires a small change in gdb/check-include-guards.py, to be able to ignore the whole new directory. Change-Id: Ic8c5d0dd5ea8b6691c99975d6ca78f637175ef42 Approved-By: Tom Tromey <tom@tromey.com>
38 lines
1.2 KiB
C++
38 lines
1.2 KiB
C++
/* Copyright (C) 2024-2025 Free Software Foundation, Inc.
|
|
|
|
This file is part of GDB.
|
|
|
|
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 3 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, see <http://www.gnu.org/licenses/>. */
|
|
|
|
#ifndef GDBSUPPORT_UNORDERED_MAP_H
|
|
#define GDBSUPPORT_UNORDERED_MAP_H
|
|
|
|
#include "unordered_dense/unordered_dense.h"
|
|
|
|
namespace gdb
|
|
{
|
|
|
|
template<typename Key,
|
|
typename T,
|
|
typename Hash = ankerl::unordered_dense::hash<Key>,
|
|
typename KeyEqual = std::equal_to<Key>>
|
|
using unordered_map
|
|
= ankerl::unordered_dense::map
|
|
<Key, T, Hash, KeyEqual, std::allocator<std::pair<Key, T>>,
|
|
ankerl::unordered_dense::bucket_type::standard>;
|
|
|
|
} /* namespace gdb */
|
|
|
|
#endif /* GDBSUPPORT_UNORDERED_MAP_H */
|