Here is a list of all struct and union fields with links to the structures/unions they belong to:

- a -

• add : HashSet

- b -

• back : Queue
• bulk_insert : Trie

- c -

• capacity : Vector

- d -

• delete : LinkedList , Trie , Vector

- f -

• find : HashMap , HashSet , TreeMap
• front : Queue

- g -

• get : HashMap , TreeMap , Vector
• get_at : LinkedList
• get_back : LinkedList
• get_front : LinkedList
• get_prefix_as : Trie

- h -

• has_exact : Trie
• has_prefix_as : Trie

- i -

• insert : LinkedList , Trie , Vector
• iterate : HashMap , HashSet , LinkedList , TreeMap , Vector

- m -

• maximum : TreeMap
• minimum : TreeMap

- p -

• pData : HashMap , HashSet , LinkedList , PriorityQueue , Queue , Stack , TreeMap , Trie , Vector
• pop : PriorityQueue , Queue , Stack
• pop_back : LinkedList , Vector
• pop_front : LinkedList
• predecessor : TreeMap
• push : PriorityQueue , Queue , Stack
• push_back : LinkedList , Vector
• push_front : LinkedList
• put : HashMap , TreeMap

- r -

• remove : HashMap , HashSet , TreeMap
• replace : LinkedList
• resize : Vector
• reverse : LinkedList
• reverse_iterate : LinkedList , TreeMap , Vector

- s -

• set : Vector
• set_at : LinkedList
• set_back : LinkedList
• set_compare : PriorityQueue , TreeMap
• set_destroy : HashMap , HashSet , LinkedList , PriorityQueue , Queue , Stack , TreeMap , Vector
• set_front : LinkedList
• set_hash : HashMap , HashSet
• size : HashMap , HashSet , LinkedList , PriorityQueue , Queue , Stack , TreeMap , Trie , Vector
• sort : Vector
• successor : TreeMap

- t -

• top : PriorityQueue , Stack