Demo and test code

Demo and test code

--

Test programs

avl_test
test AVL trees (not for Aonix)
bag_test
test bounded, dynamic and unbounded bags (not for Aonix)
bag_test_aonix
test bounded and unbounded bags
collection_test
test unbounded collections
graph_test
test directed and undirected graphs
list_test
test single and double lists
map_test
test bounded, dynamic and unbounded maps (not for Aonix)
map_test_aonix
test bounded and unbounded maps
ordered_collection_test
test unbounded ordered collections
ordered_queue_test
test unbounded ordered queues
queue_test
test bounded, dynamic and unbounded queues (not for Aonix)
queue_test_aonix
test bounded and unbounded queues
ring_test
test unbounded rings
set_test
test bounded, dynamic and unbounded sets (not for Aonix)
set_test_aonix
test bounded and unbounded sets
smart_test
test smart pointers
stack_test
test bounded, dynamic and unbounded stacks (not for Aonix)
stack_test_aonix
test bounded and unbounded stacks
tree_test
test AVL, binary and multiway trees (not for Aonix)

Demo programs

ada_units
demonstrate graphs
lists_traversal
demonstrate an unexpected behaviour of double lists
ordering_test
demonstrate ordered containers, especially where different elements have equal keys
storage
demonstrate managed and unmanaged store allocation (not for Aonix)
test_synchronization
demonstrate the functionality in BC.Support.Synchronization
time_lists
demonstrate timings for lists of varying lengths
time_queues
demonstrate timings for queues of varying lengths (not for Aonix)
unmanaged_storage
demonstrate use of Unmanaged_Storage (not for Aonix)
user_set
demonstrate user-defined equality for sets (not for Aonix)
word_count
a word-counter demo, as suggested by John English in the Ada Standard Component Library Working Group

NB, as supplied this fails if the last line of the input is blank!

--

[index]