[ create a new paste ] login | about

Link: http://codepad.org/7cuiQ6KA    [ raw code | fork ]

C++, pasted on Jan 3:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
template<class T>
class BST {
public:
    inorderTraverse(void visit(T&)) const;
};

template<class KeyT, class ItemT>
class Entry {
    ItemT item;
    KeyT key;
};

template<class KeyT, class ItemT>
class Dictionary {
    BST< Entry<KeyT, ItemT> > itemTree;
public:
    traverse(void visit(ItemT&)) const;
};


Create a new paste based on this one


Comments: