lasd/librerie/exercise3/binarytree/vec/binarytreevec.hpp

77 lines
2.4 KiB
C++
Raw Normal View History

2021-04-24 16:58:05 +02:00
#ifndef BINARYTREEVEC_HPP
#define BINARYTREEVEC_HPP
#include "../binarytree.hpp"
#include "../../vector/vector.hpp"
namespace lasd {
template <typename Data>
2021-05-01 23:58:12 +02:00
class BinaryTreeVec : virtual public BinaryTree<Data>{ // Must extend BinaryTree<Data>
2021-04-24 16:58:05 +02:00
protected:
2021-05-06 19:46:16 +02:00
struct NodeVec : virtual public BinaryTree<Data>::Node { // Must extend Node
2021-04-24 16:58:05 +02:00
protected:
2021-05-01 23:58:12 +02:00
using BinaryTree<Data>::Node::data;
ulong index;
BinaryTreeVec<Data>* ReferenceToTree = nullptr;
2021-04-24 16:58:05 +02:00
public:
2021-05-04 16:05:48 +02:00
NodeVec(Data&, ulong, BinaryTreeVec<Data>*);
struct NodeVec& operator=(const NodeVec&); // Copy assignment of abstract types should not be possible.
struct NodeVec& operator=(NodeVec&&) noexcept; // Move assignment of abstract types should not be possible.
2021-05-01 23:58:12 +02:00
bool IsLeaf() const noexcept override; // (concrete function should not throw exceptions)
bool HasLeftChild() const noexcept override; // (concrete function should not throw exceptions)
bool HasRightChild() const noexcept override; // (concrete function should not throw exceptions)
struct NodeVec& LeftChild() const override; // (concrete function must throw std::out_of_range when not existent)
struct NodeVec& RightChild() const override; // (concrete function must throw std::out_of_range when not existent)
2021-05-04 16:05:48 +02:00
friend class BinaryTreeVec<Data>;
2021-04-24 16:58:05 +02:00
};
2021-05-04 16:05:48 +02:00
protected:
2021-05-06 19:46:16 +02:00
2021-05-05 22:37:45 +02:00
using BinaryTree<Data>::size;
Vector<struct BinaryTreeVec<Data>::NodeVec*> tree;
2021-05-04 16:05:48 +02:00
2021-04-24 16:58:05 +02:00
public:
2021-05-01 23:58:12 +02:00
BinaryTreeVec() = default;
BinaryTreeVec(const LinearContainer<Data>&); // A binary tree obtained from a LinearContainer
BinaryTreeVec(const BinaryTreeVec<Data>&);
BinaryTreeVec(BinaryTreeVec<Data>&&) noexcept;
2021-04-24 16:58:05 +02:00
2021-05-01 23:58:12 +02:00
virtual ~BinaryTreeVec();
2021-04-24 16:58:05 +02:00
2021-05-01 23:58:12 +02:00
BinaryTreeVec& operator=(const BinaryTreeVec<Data>&);
BinaryTreeVec& operator=(BinaryTreeVec<Data>&&) noexcept;
2021-04-24 16:58:05 +02:00
2021-05-01 23:58:12 +02:00
bool operator==(const BinaryTreeVec&) const noexcept;
bool operator!=(const BinaryTreeVec&) const noexcept;
2021-04-24 16:58:05 +02:00
// Specific member functions (inherited from BinaryTree)
2021-05-06 19:46:16 +02:00
NodeVec& Root() const override; // Override BinaryTree member (throw std::length_error when empty)
2021-04-24 16:58:05 +02:00
// Specific member functions (inherited from Container)
2021-05-01 23:58:12 +02:00
void Clear() override; // Override Container member
/* ----- override of map and fold in breadth ----- */
2021-05-05 22:37:45 +02:00
2021-05-01 23:58:12 +02:00
using typename BinaryTree<Data>::MapFunctor;
using typename BinaryTree<Data>::FoldFunctor;
void MapBreadth(const MapFunctor, void*) override;
void FoldBreadth(const FoldFunctor, const void*, void*) const override;
2021-04-24 16:58:05 +02:00
};
}
#include "binarytreevec.cpp"
#endif