114 lines
2.8 KiB
C++
114 lines
2.8 KiB
C++
// This file Copyright © Mnemosyne LLC.
|
|
// It may be used under GPLv2 (SPDX: GPL-2.0-only), GPLv3 (SPDX: GPL-3.0-only),
|
|
// or any future license endorsed by Mnemosyne LLC.
|
|
// License text can be found in the licenses/ folder.
|
|
|
|
#pragma once
|
|
|
|
#include <cstdint>
|
|
#include <unordered_map>
|
|
#include <utility>
|
|
#include <vector>
|
|
|
|
#include <QCoreApplication>
|
|
#include <QString>
|
|
#include <QVariant>
|
|
|
|
#include <libtransmission/tr-macros.h>
|
|
|
|
#include "Utils.h" // for std::hash<QString>
|
|
#include "Typedefs.h"
|
|
|
|
class FileTreeItem
|
|
{
|
|
Q_DECLARE_TR_FUNCTIONS(FileTreeItem)
|
|
TR_DISABLE_COPY_MOVE(FileTreeItem)
|
|
|
|
public:
|
|
static auto constexpr Low = int{ 1 << 0 };
|
|
static auto constexpr Normal = int{ 1 << 1 };
|
|
static auto constexpr High = int{ 1 << 2 };
|
|
|
|
FileTreeItem(QString const& name = QString{}, int file_index = -1, uint64_t size = 0)
|
|
: name_{ name }
|
|
, total_size_{ size }
|
|
, file_index_{ file_index }
|
|
{
|
|
}
|
|
|
|
~FileTreeItem();
|
|
|
|
void appendChild(FileTreeItem* child);
|
|
FileTreeItem* child(QString const& filename);
|
|
|
|
FileTreeItem* child(int row)
|
|
{
|
|
return children_.at(row);
|
|
}
|
|
|
|
[[nodiscard]] TR_CONSTEXPR20 int childCount() const noexcept
|
|
{
|
|
return std::size(children_);
|
|
}
|
|
|
|
[[nodiscard]] constexpr auto* parent() noexcept
|
|
{
|
|
return parent_;
|
|
}
|
|
|
|
[[nodiscard]] constexpr auto const* parent() const noexcept
|
|
{
|
|
return parent_;
|
|
}
|
|
|
|
int row() const;
|
|
|
|
[[nodiscard]] constexpr auto const& name() const noexcept
|
|
{
|
|
return name_;
|
|
}
|
|
|
|
QVariant data(int column, int role) const;
|
|
std::pair<int, int> update(QString const& name, bool want, int priority, uint64_t have, bool update_fields);
|
|
void setSubtreeWanted(bool wanted, file_indices_t& setme_changed_ids);
|
|
void setSubtreePriority(int priority, file_indices_t& setme_changed_ids);
|
|
|
|
[[nodiscard]] constexpr auto fileIndex() const noexcept
|
|
{
|
|
return file_index_;
|
|
}
|
|
|
|
[[nodiscard]] constexpr auto totalSize() const noexcept
|
|
{
|
|
return total_size_;
|
|
}
|
|
|
|
[[nodiscard]] constexpr auto isComplete() const noexcept
|
|
{
|
|
return have_size_ == totalSize();
|
|
}
|
|
|
|
QString path() const;
|
|
int priority() const;
|
|
int isSubtreeWanted() const;
|
|
|
|
private:
|
|
QString priorityString() const;
|
|
QString sizeString() const;
|
|
std::pair<uint64_t, uint64_t> get_subtree_wanted_size() const;
|
|
double progress() const;
|
|
uint64_t size() const;
|
|
std::unordered_map<QString, int> const& getMyChildRows() const;
|
|
|
|
FileTreeItem* parent_ = {};
|
|
mutable std::unordered_map<QString, int> child_rows_;
|
|
std::vector<FileTreeItem*> children_;
|
|
QString name_;
|
|
uint64_t const total_size_ = {};
|
|
uint64_t have_size_ = {};
|
|
mutable int first_unhashed_row_ = {};
|
|
int const file_index_ = {};
|
|
int priority_ = {};
|
|
bool is_wanted_ = {};
|
|
};
|