This required various changes to various parts of the infrastructure (mostly using paths to finding the "root project" of any given object throughout). Now theoretically infinite projects can be opened and accounted for at any given time.
207 lines
3.5 KiB
C++
207 lines
3.5 KiB
C++
/***
|
|
|
|
Olive - Non-Linear Video Editor
|
|
Copyright (C) 2019 Olive Team
|
|
|
|
This program is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
***/
|
|
|
|
#include "item.h"
|
|
|
|
OLIVE_NAMESPACE_ENTER
|
|
|
|
Item::Item() :
|
|
parent_(nullptr),
|
|
project_(nullptr)
|
|
{
|
|
}
|
|
|
|
Item::~Item()
|
|
{
|
|
}
|
|
|
|
void Item::add_child(ItemPtr c)
|
|
{
|
|
if (c->parent_ == this) {
|
|
return;
|
|
}
|
|
|
|
if (c->parent_ != nullptr) {
|
|
c->parent_->remove_child(c.get());
|
|
}
|
|
|
|
children_.append(c);
|
|
c->parent_ = this;
|
|
}
|
|
|
|
void Item::remove_child(Item *c)
|
|
{
|
|
if (c->parent_ != this) {
|
|
return;
|
|
}
|
|
|
|
// Remove all instances of this child in the list
|
|
for (int i=0;i<children_.size();i++) {
|
|
if (children_.at(i).get() == c) {
|
|
children_.removeAt(i);
|
|
i--;
|
|
}
|
|
}
|
|
|
|
c->parent_ = nullptr;
|
|
}
|
|
|
|
int Item::child_count() const
|
|
{
|
|
return children_.size();
|
|
}
|
|
|
|
Item *Item::child(int i) const
|
|
{
|
|
return children_.at(i).get();
|
|
}
|
|
|
|
const QList<ItemPtr> &Item::children() const
|
|
{
|
|
return children_;
|
|
}
|
|
|
|
ItemPtr Item::get_shared_ptr() const
|
|
{
|
|
QList<ItemPtr> siblings = parent()->children();
|
|
|
|
foreach (ItemPtr s, siblings) {
|
|
if (s.get() == this) {
|
|
return s;
|
|
}
|
|
}
|
|
|
|
return nullptr;
|
|
}
|
|
|
|
const QString &Item::name() const
|
|
{
|
|
return name_;
|
|
}
|
|
|
|
void Item::set_name(const QString &n)
|
|
{
|
|
name_ = n;
|
|
|
|
NameChangedEvent(n);
|
|
}
|
|
|
|
const QString &Item::tooltip() const
|
|
{
|
|
return tooltip_;
|
|
}
|
|
|
|
void Item::set_tooltip(const QString &t)
|
|
{
|
|
tooltip_ = t;
|
|
}
|
|
|
|
QString Item::duration()
|
|
{
|
|
return QString();
|
|
}
|
|
|
|
QString Item::rate()
|
|
{
|
|
return QString();
|
|
}
|
|
|
|
Item *Item::parent() const
|
|
{
|
|
return parent_;
|
|
}
|
|
|
|
const Item *Item::root() const
|
|
{
|
|
const Item* item = this;
|
|
|
|
while (item->parent()) {
|
|
item = item->parent();
|
|
}
|
|
|
|
return item;
|
|
}
|
|
|
|
Project *Item::project() const
|
|
{
|
|
const Item* root_item = root();
|
|
|
|
return root_item->project_;
|
|
}
|
|
|
|
void Item::set_project(Project *project)
|
|
{
|
|
project_ = project;
|
|
}
|
|
|
|
QList<ItemPtr> Item::get_children_of_type(Type type, bool recursive) const
|
|
{
|
|
QList<ItemPtr> list;
|
|
|
|
foreach (ItemPtr item, children_) {
|
|
if (item->type() == type) {
|
|
list.append(item);
|
|
}
|
|
|
|
if (recursive && item->CanHaveChildren()) {
|
|
list.append(item->get_children_of_type(type, recursive));
|
|
}
|
|
}
|
|
|
|
return list;
|
|
}
|
|
|
|
bool Item::CanHaveChildren() const
|
|
{
|
|
return false;
|
|
}
|
|
|
|
bool Item::ChildExistsWithName(const QString &name)
|
|
{
|
|
return ChildExistsWithNameInternal(name, this);
|
|
}
|
|
|
|
void Item::NameChangedEvent(const QString &)
|
|
{
|
|
}
|
|
|
|
bool Item::ChildExistsWithNameInternal(const QString &name, Item *folder)
|
|
{
|
|
// Loop through all children
|
|
for (int i=0;i<folder->child_count();i++) {
|
|
Item* child = folder->child(i);
|
|
|
|
// If this child has the same name, return true
|
|
if (child->name() == name) {
|
|
return true;
|
|
} else if (child->CanHaveChildren()) {
|
|
// If the child has children, run function recursively on this item
|
|
if (ChildExistsWithNameInternal(name, child)) {
|
|
// If it returns true, we've found a child so we can return now
|
|
return true;
|
|
}
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
OLIVE_NAMESPACE_EXIT
|