qse/samples/cmn/rbt02.cpp

65 lines
1.3 KiB
C++
Raw Normal View History

2015-03-11 06:12:48 +00:00
#include <stdio.h>
#include <qse/cmn/RedBlackTree.hpp>
class IntPair
{
public:
IntPair (int x = 0, int y = 0): x (x), y (y) {}
int getX () const { return this->x; }
int getY () const { return this->y; }
bool operator== (const IntPair& ip) const { return this->x == ip.x; }
bool operator< (const IntPair& ip) const { return this->x < ip.x; }
bool operator> (const IntPair& ip) const { return this->x > ip.x; }
protected:
int x, y;
};
typedef QSE::RedBlackTree<IntPair> IntTree;
int main ()
{
IntTree t (10000, QSE_NULL);
2015-03-11 06:12:48 +00:00
//IntTree t (0);
for (int i = 0; i < 20 ; i++)
{
t.insert (IntPair (i , i * 2));
}
t.clear (true);
for (int i = 0; i < 20 ; i++)
{
t.insert (IntPair (i , i * 2));
}
IntTree::ConstIterator it;
for (it = t.getConstIterator(); it.isLegit(); ++it)
{
printf ("%d %d\n", it.getValue().getX(), (*it).getY());
}
printf ("------------------\n");
IntTree x(t);
for (it = t.getConstIterator(); it.isLegit(); ++it)
{
printf ("%d %d\n", it.getValue().getX(), (*it).getY());
}
printf ("------------------\n");
t.insert (IntPair(99, 999));
t.insert (IntPair(88, 888));
//IntTree y (5, QSE_NULL);
2015-03-11 06:12:48 +00:00
x = t;
for (it = x.getConstIterator(); it.isLegit(); ++it)
{
printf ("%d %d\n", it.getValue().getX(), (*it).getY());
}
return 0;
}