1
/***************************************************************************
2
* Copyright (C) 2008 by Volker Lanz <vl@fidra.de> *
4
* This program is free software; you can redistribute it and/or modify *
5
* it under the terms of the GNU General Public License as published by *
6
* the Free Software Foundation; either version 2 of the License, or *
7
* (at your option) any later version. *
9
* This program is distributed in the hope that it will be useful, *
10
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
11
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
12
* GNU General Public License for more details. *
14
* You should have received a copy of the GNU General Public License *
15
* along with this program; if not, write to the *
16
* Free Software Foundation, Inc., *
17
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA *
18
***************************************************************************/
20
#if !defined(PARTITIONNODE__H)
22
#define PARTITIONNODE__H
31
/** @brief A node in the tree of partitions.
33
The root in this tree is the PartitionTable. The primaries are the child nodes; extended partitions again
36
@see Device, PartitionTable, Partition
39
class PartitionNode : public QObject
44
typedef QList<Partition*> Partitions;
48
virtual ~PartitionNode() {}
51
virtual bool insert(Partition* partNew);
53
virtual Partition* predecessor(Partition& p);
54
virtual const Partition* predecessor(const Partition& p) const;
56
virtual Partition* successor(Partition& p);
57
virtual const Partition* successor(const Partition& p) const;
59
virtual bool remove(Partition* p);
60
virtual Partition* findPartitionBySector(qint64 s, const PartitionRole& role);
61
virtual const Partition* findPartitionBySector(qint64 s, const PartitionRole& role) const;
62
virtual void reparent(Partition& p);
64
virtual Partitions& children() = 0;
65
virtual PartitionNode* parent() = 0;
66
virtual bool isRoot() const = 0;
67
virtual const PartitionNode* parent() const = 0;
68
virtual const Partitions& children() const = 0;
69
virtual void append(Partition* p) = 0;
70
virtual qint32 highestMountedChild() const;
71
virtual bool isChildMounted() const;
74
virtual void clearChildren();