Files
Work/as68hc11/Labelgen.hpp
2024-08-07 09:12:07 -04:00

72 lines
1.6 KiB
C++

#ifndef _AS68HC11_LABELGENERATOR_HPP_
#define _AS68HC11_LABELGENERATOR_HPP_
#ifndef _COMMON_WINDOWS_HPP_
#include <common/windows.hpp>
#endif
#ifndef _BSPTREE_BINARYTREE_HPP_
#include <bsptree/bintree.hpp>
#endif
#ifndef _AS68HC11_LABEL_HPP_
#include <as68hc11/label.hpp>
#endif
class LabelGenerator : private BinaryTree<Label>
{
public:
LabelGenerator(void);
virtual ~LabelGenerator();
BOOL insert(const Label &someLabel);
BOOL searchItem(const Label &someItem,SmartPointer<Label> &nodeItem);
BOOL find(Label &someLabel);
private:
LabelGenerator(const LabelGenerator &someLabelGenerator);
LabelGenerator &operator=(const LabelGenerator &someLabelGenerator);
BOOL operator==(const LabelGenerator &someLabelGenerator)const;
};
inline
LabelGenerator::LabelGenerator(void)
{
}
inline
LabelGenerator::LabelGenerator(const LabelGenerator &someLabelGenerator)
{ // private implementation
*this=someLabelGenerator;
}
inline
LabelGenerator::~LabelGenerator()
{
}
inline
LabelGenerator &LabelGenerator::operator=(const LabelGenerator &/*someLabelGenerator*/)
{ // private implementation
return *this;
}
inline
BOOL LabelGenerator::operator==(const LabelGenerator &someLabelGenerator)const
{ // private implementation
return FALSE;
}
inline
BOOL LabelGenerator::insert(const Label &someLabel)
{
return BinaryTree<Label>::insert(someLabel);
}
inline
BOOL LabelGenerator::find(Label &someLabel)
{
return BinaryTree<Label>::searchItem(someLabel);
}
inline
BOOL LabelGenerator::searchItem(const Label &someItem,SmartPointer<Label> &nodeItem)
{
return BinaryTree<Label>::searchItem(someItem,nodeItem);
}
#endif