Files
xahaud/src/ripple/basics
Nik Bougalis 97c89168f7 Improve exception handling:
* Self-document the code by renaming Throw to Rethrow.
* Write a message to the debug log when we throw or
  rethrow an exception.
2016-05-24 12:37:46 -07:00
..
2016-05-24 12:37:46 -07:00
2016-05-24 12:37:46 -07:00
2016-05-12 19:24:35 -04:00
2015-05-22 11:09:50 -07:00
2015-10-13 17:15:45 -07:00
2016-05-24 12:37:46 -07:00
2015-10-13 17:15:45 -07:00
2015-05-22 11:09:50 -07:00
2016-04-20 12:01:25 -04:00
2016-04-20 12:01:25 -04:00
2016-05-24 12:37:46 -07:00
2015-10-13 17:15:45 -07:00
2016-05-12 19:24:35 -04:00
2015-10-13 17:15:45 -07:00
2016-01-12 18:45:36 -08:00
2015-06-02 16:52:22 -07:00
2015-09-25 06:29:07 -07:00
2016-04-20 12:01:25 -04:00
2016-04-20 12:01:25 -04:00
2015-03-02 16:49:56 -05:00
2016-04-20 12:01:25 -04:00

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::vector or std::deque except for those cases.
  • std::set

    • For sorted containers.
  • ripple::hash_set

    • Where inserts and contains need to be O(1).
    • For "small" sets, std::set might be faster and smaller.
  • ripple::hardened_hash_set

The following container is deprecated

  • std::unordered_set
  • Use ripple::hash_set instead, which uses a better hashing algorithm.
  • Or use ripple::hardened_hash_set to prevent algorithmic complexity attacks.