Orderbook Simulation
OrderbookSim is a C++ application simulating a financial market order book. It efficiently manages and matches buy and sell orders while calculating the Volume-Weighted Average Price (VWAP).
ordered_map< Key, T, IgnoredLess, Allocator > Member List

This is the complete list of members for ordered_map< Key, T, IgnoredLess, Allocator >, including all inherited members.

at(const key_type &key)ordered_map< Key, T, IgnoredLess, Allocator >inline
at(KeyType &&key)ordered_map< Key, T, IgnoredLess, Allocator >inline
at(const key_type &key) constordered_map< Key, T, IgnoredLess, Allocator >inline
at(KeyType &&key) constordered_map< Key, T, IgnoredLess, Allocator >inline
const_iterator typedefordered_map< Key, T, IgnoredLess, Allocator >
Container typedefordered_map< Key, T, IgnoredLess, Allocator >
count(const key_type &key) constordered_map< Key, T, IgnoredLess, Allocator >inline
count(KeyType &&key) constordered_map< Key, T, IgnoredLess, Allocator >inline
emplace(const key_type &key, T &&t)ordered_map< Key, T, IgnoredLess, Allocator >inline
emplace(KeyType &&key, T &&t)ordered_map< Key, T, IgnoredLess, Allocator >inline
erase(const key_type &key)ordered_map< Key, T, IgnoredLess, Allocator >inline
erase(KeyType &&key)ordered_map< Key, T, IgnoredLess, Allocator >inline
erase(iterator pos)ordered_map< Key, T, IgnoredLess, Allocator >inline
erase(iterator first, iterator last)ordered_map< Key, T, IgnoredLess, Allocator >inline
find(const key_type &key)ordered_map< Key, T, IgnoredLess, Allocator >inline
find(KeyType &&key)ordered_map< Key, T, IgnoredLess, Allocator >inline
find(const key_type &key) constordered_map< Key, T, IgnoredLess, Allocator >inline
insert(value_type &&value)ordered_map< Key, T, IgnoredLess, Allocator >inline
insert(const value_type &value)ordered_map< Key, T, IgnoredLess, Allocator >inline
insert(InputIt first, InputIt last)ordered_map< Key, T, IgnoredLess, Allocator >inline
iterator typedefordered_map< Key, T, IgnoredLess, Allocator >
key_compare typedefordered_map< Key, T, IgnoredLess, Allocator >
key_type typedefordered_map< Key, T, IgnoredLess, Allocator >
mapped_type typedefordered_map< Key, T, IgnoredLess, Allocator >
operator[](const key_type &key)ordered_map< Key, T, IgnoredLess, Allocator >inline
operator[](KeyType &&key)ordered_map< Key, T, IgnoredLess, Allocator >inline
operator[](const key_type &key) constordered_map< Key, T, IgnoredLess, Allocator >inline
operator[](KeyType &&key) constordered_map< Key, T, IgnoredLess, Allocator >inline
ordered_map() noexcept(noexcept(Container()))ordered_map< Key, T, IgnoredLess, Allocator >inline
ordered_map(const Allocator &alloc) noexcept(noexcept(Container(alloc)))ordered_map< Key, T, IgnoredLess, Allocator >inlineexplicit
ordered_map(It first, It last, const Allocator &alloc=Allocator())ordered_map< Key, T, IgnoredLess, Allocator >inline
ordered_map(std::initializer_list< value_type > init, const Allocator &alloc=Allocator())ordered_map< Key, T, IgnoredLess, Allocator >inline
require_input_iter typedefordered_map< Key, T, IgnoredLess, Allocator >
size_type typedefordered_map< Key, T, IgnoredLess, Allocator >
value_type typedefordered_map< Key, T, IgnoredLess, Allocator >