ITreeModel.h

/*
 * AUI Framework - Declarative UI toolkit for modern C++20
 * Copyright (C) 2020-2024 Alex2772 and Contributors
 *
 * SPDX-License-Identifier: MPL-2.0
 *
 * This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, You can obtain one at http://mozilla.org/MPL/2.0/.
 */
 
//
// Created by alex2 on 7/1/2021.
//
 
 
#pragma once
 
#include <AUI/Common/ASignal.h>
#include "AUI/Common/AObject.h"
#include "AUI/Common/AOptional.h"
#include <AUI/Model/ATreeModelIndex.h>
#include <variant>

template<typename T>
class ITreeModel: public AObject
{
public:
    virtual ~ITreeModel() = default;

    virtual size_t childrenCount(const ATreeModelIndexOrRoot& vertex) = 0;

    virtual T itemAt(const ATreeModelIndex& index) = 0;

    virtual ATreeModelIndex indexOfChild(size_t row, size_t column,
                                         const ATreeModelIndexOrRoot& vertex) = 0;

    virtual ATreeModelIndexOrRoot parent(const ATreeModelIndex& vertex) = 0;
 
    using stored_t = T;
 
    template<aui::predicate<ATreeModelIndex> Predicate>
    AOptional<ATreeModelIndex> find(const Predicate& predicate) {
        return visit(predicate, ATreeModelIndex::ROOT);
    }
 
    template<aui::invocable<ATreeModelIndex> Callback>
    void forEachDirectChildOf(const ATreeModelIndexOrRoot& vertex, Callback callback) {
        auto s = childrenCount(vertex);
        for (decltype(s) i = 0; i < s; ++i) {
            callback(indexOfChild(i, 0, vertex));
        }
    }
 
signals:
    emits<ATreeModelIndex> dataChanged;

    emits<ATreeModelIndex> dataInserted;

    emits<ATreeModelIndex> dataRemoved;
 
private:
    template<aui::predicate<ATreeModelIndex> Predicate>
    AOptional<ATreeModelIndex> visit(const Predicate& p, const ATreeModelIndexOrRoot& vertex) {
        if (auto index = std::get_if<ATreeModelIndex>(&vertex)) {
            if (p(*index)) {
                return *index;
            }
        }
        std::size_t count = childrenCount(vertex);
        for (std::size_t i = 0; i < count; ++i) {
            auto child = indexOfChild(i, 0, vertex);
            if (auto v = visit(p, child)) {
                return v;
            }
        }
        return {};
    };
};

© 2025 AUI Framework Contributors. Documentation contributions included herein are the copyrights of their respective owners. The documentation provided herein is licensed under the terms of the GNU Free Documentation License version 1.3 as published by the Free Software Foundation. All trademarks are property of their respective owners.