How bdkoepke/alib works
Main Components Organization
a) Core Language Components (src/lang/):
• Sub-components for:
• Basic Types (type.nw)
• Array Operations (array.nw)
• String Manipulation (string.nw)
• Mathematical Operations (math_extended.nw)
• Comparison & Equality (compare.nw, equals.nw)
• Sorting Algorithms (sort.nw)
• Hashing Functions (hash.nw)
b) Utility Data Structures (src/util/):
• Linear Data Structures
• Vector (vector.nw)
• Stack (stack.nw)
• Queue (queue.nw)
• Linked implementations (linked_stack.nw, linked_queue.nw)
• Tree Structures
• Binary Tree (binary_tree.nw)
• Red-Black Tree (red_black_tree.nw)
• Tree Node implementations (binary_node.nw, node.nw)
• Graph Structures
• Base Graph (graph.nw)
• Matrix Graph (matrix_graph.nw)
• Linked Graph (linked_graph.nw)
• Graph Visitor (graph_visitor.nw)
• Container Abstractions
• Iterator (iterator.nw)
• Container (container.nw)
• Range Container (range_container.nw)
• Array Container (array_container.nw)
Specific Elements
a) Interface Hierarchies:
• Inheritance relationships between interfaces (e.g., Container → Iterable)
• Demonstrate implementation relationships
b) Algorithm Categories:
• Related algorithms together
• Dependencies on data structures
Notes for Implementation
• Use UML-like notation for class/interface relationships
• Cardinality where relevant
• Template/generic type relationships
• Public interfaces vs. implementation details
Remember to include bidirectional relationships where appropriate, such as between containers and iterators, and show how the testing framework validates each component.