HP Integrity NonStop J-Series - Manual (Page 298)

Do I wish to access objects within the collection based on a numerical index? Use a
sequential or sorted collection. 7.
Do I need to find values based on non-numeric keys? Use a map or dictionary. 8.
Would I prefer to access objects within the collection by supplying an object for
comparison? Use a set, map or hash-based collection. 9.
Am I willing to forego meaningful ordering, and use some extra memory in return for
constant-time look-up by key? Use a hash-based collection. 10.
Do I need fast lookup and insertion in a collection that grows or shrinks to meet the current
need? Use a b-tree, or an associative container based on the new Standard C++ Library. 11.
Do I need access the data without bringing it all into memory? Use RWBTreeOnDisk or
RWTValVirtualArray .
12.