MCPcopy Create free account
hub / github.com/SuprDewd/CompetitiveProgramming / node

Class node

code/data-structures/avl_map.cpp:3–7  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

1#include "avl_tree.cpp"
2template <class K, class V> struct avl_map {
3 struct node {
4 K key; V value;
5 node(K k, V v) : key(k), value(v) { }
6 bool operator <(const node &other) const {
7 return key < other.key; } };
8 avl_tree<node> tree;
9 V& operator [](K key) {
10 typename avl_tree<node>::node *n =

Callers 1

avl_mapClass · 0.70

Calls

no outgoing calls

Tested by

no test coverage detected