TEST( API, iterators ) {
const char *text = "keyA valueA\nkeyB valueB";
Node root = parse( text );
{
Node::iterator it = root.begin();
ASSERT_EQ( "keyA", it->key() );
it->key() = "keyAA";
++it;
ASSERT_EQ( "keyB", it->key() );
it->key() = "keyBB";
++it;
ASSERT_EQ( root.end(), it );
}
{
Node::const_iterator it = root.cbegin();
ASSERT_EQ( "keyAA", it->key() );
++it;
ASSERT_EQ( "keyBB", it->key() );
++it;
ASSERT_EQ( root.end(), it );
}
}
int main(int argc, char **argv)
{
/// trie that associates a integer to strings
/// 0 is the default value I want to receive when there is no match
/// in trie
edm::Trie<int> trie(0);
typedef edm::TrieNode<int> Node;
typedef Node const * pointer; // sigh....
typedef edm::TrieNodeIter<int> node_iterator;
char tre[] = {'a','a','a'};
char quattro[] = {'c','a','a','a'};
for (int j=0;j<3;j++) {
tre[2]='a';
quattro[3]='a';
for (int i=0;i<10;i++) {
trie.insert(tre,3,i);
trie.insert(quattro,4,i);
tre[2]++;
quattro[3]++;
}
tre[1]++;
quattro[2]++;
}
std::cout << "get [aac] " << trie.find("aac", 3) << std::endl;
std::cout << "get [caae] = " << trie.find("caae", 4) << std::endl;
trie.setEntry("caag", 4, -2);
std::cout << "get [caag] = " << trie.find("caag", 4) << std::endl;
// no match
std::cout << "get [abcd] = " << trie.find("abcd", 4) << std::endl;
// no match
std::cout << "get [ca] = " << trie.find("ca", 2) << std::endl;
trie.display(std::cout);
std::cout << std::endl;
pointer pn = trie.node("ab",2);
// if (pn) pn->display(std::cout,0,' ');
std::cout << std::endl;
{
node_iterator e(pn,false);
std::cout << "\n ab iteration" << std::endl;
for (node_iterator p(pn,true); p!=e; p++)
std::cout << "ab" << p.label() << " = " << p->value() << std::endl;
}
{
std::cout << "\n ab iteration: string" << std::endl;
pn = trie.node("ab");
Node::const_iterator p = (*pn).begin();
Node::const_iterator e = (*pn).end();
for (; p!=e; p++)
std::cout << "ab" << p.label() << " = " << p->value() << std::endl;
}
{
pn = trie.initialNode();
node_iterator e(pn,false);
std::cout << "\ntop iteration"<< std::endl;
for (node_iterator p(pn,true); p!=e; p++)
std::cout << p.label() << " = " << p->value() << std::endl;
std::cout << std::endl;
}
std::cout << "\nfull walk"<< std::endl;
Print pr;
edm::walkTrie(pr,*trie.initialNode());
std::cout << std::endl;
std::cout << "\nleaves iteration"<< std::endl;
edm::iterateTrieLeaves(pr,*trie.initialNode());
std::cout << std::endl;
}
int main(int, char**) try {
/// trie that associates a integer to strings
/// 0 is the default value I want to receive when there is no match
/// in trie
edm::Trie<int> trie(0);
typedef edm::TrieNode<int> Node;
typedef Node const* pointer; // sigh....
typedef edm::TrieNodeIter<int> node_iterator;
char tre[] = {'a', 'a', 'a'};
char quattro[] = {'c', 'a', 'a', 'a'};
for (int j = 0; j < 3; j++) {
tre[2] = 'a';
quattro[3] = 'a';
for (int i = 0; i < 10; i++) {
trie.insert(tre, 3, i);
trie.insert(quattro, 4, i);
tre[2]++;
quattro[3]++;
}
tre[1]++;
quattro[2]++;
}
std::cout << "get [aac] " << trie.find("aac", 3) << std::endl;
std::cout << "get [caae] = " << trie.find("caae", 4) << std::endl;
trie.setEntry("caag", 4, -2);
std::cout << "get [caag] = " << trie.find("caag", 4) << std::endl;
// no match
std::cout << "get [abcd] = " << trie.find("abcd", 4) << std::endl;
// no match
std::cout << "get [ca] = " << trie.find("ca", 2) << std::endl;
trie.display(std::cout);
std::cout << std::endl;
pointer pn = trie.node("ab", 2);
if (pn)
pn->display(std::cout, 0, ' ');
std::cout << std::endl;
node_iterator e;
std::cout << "\n ab iteration" << std::endl;
for (node_iterator p(trie.node("ab", 2)); p != e; p++) {
std::cout << "ab" << p.label() << " = " << p->value() << std::endl;
}
std::cout << "\n ab iteration: string" << std::endl;
pn = trie.node("ab");
e = pn->end();
for (Node::const_iterator p = pn->begin(); p != e; p++) {
std::cout << "ab" << p.label() << " = " << p->value() << std::endl;
}
std::cout << "\ntop iteration" << std::endl;
for (node_iterator p(trie.initialNode()); p != e; p++) {
std::cout << p.label() << " = " << p->value() << std::endl;
}
std::cout << std::endl;
std::cout << "\nfull walk" << std::endl;
Print pr;
edm::walkTrie(pr, *trie.initialNode());
std::cout << std::endl;
std::cout << "\nleaves iteration" << std::endl;
edm::iterateTrieLeaves(pr, *trie.initialNode());
std::cout << std::endl;
return 0;
} catch (cms::Exception const& e) {
std::cerr << e.explainSelf() << std::endl;
return 1;
} catch (std::exception const& e) {
std::cerr << e.what() << std::endl;
return 1;
}