mirror of
https://github.com/XRPLF/rippled.git
synced 2026-04-29 15:37:57 +00:00
8ed8b52dfe
* XRPLF/develop: fix: Remove fatal assertion on Linux thread name truncation (6690) chore: Enable clang-tidy `coreguidelines` checks (6698) ci: Allow uploading artifacts for XRPLF org (6702) fix: Enforce aggregate MaximumAmount in multi-send MPT (6644) chore: Use nudb recipe from the upstream (6701) fix: Fix previous ledger size typo in RCLConsensus (6696) chore: Enable clang-tidy misc checks (6655) ci: Use pull_request_target to check for signed commits (6697) chore: Remove unnecessary clang-format off/on directives (6682) fix: Fix Workers::stop() race between m_allPaused and m_runningTaskCount (6574)
Basics
Utility functions and classes.
ripple/basic should contain no dependencies on other modules.
Choosing a rippled container.
-
std::vector- For ordered containers with most insertions or erases at the end.
-
std::deque- For ordered containers with most insertions or erases at the start or end.
-
std::list- For ordered containers with inserts and erases to the middle.
- For containers with iterators stable over insert and erase.
- Generally slower and bigger than
std::vectororstd::dequeexcept for those cases.
-
std::set- For sorted containers.
-
xrpl::hash_set- Where inserts and contains need to be O(1).
- For "small" sets,
std::setmight be faster and smaller.
-
xrpl::hardened_hash_set- For data sets where the key could be manipulated by an attacker in an attempt to mount an algorithmic complexity attack: see http://en.wikipedia.org/wiki/Algorithmic_complexity_attack
The following container is deprecated
std::unordered_set- Use
xrpl::hash_setinstead, which uses a better hashing algorithm. - Or use
xrpl::hardened_hash_setto prevent algorithmic complexity attacks.