/**************************************************************************** ** ** Copyright (C) 2021 The Qt Company Ltd. ** Contact: https://www.qt.io/licensing/ ** ** This file is part of the QML preview debug service. ** ** $QT_BEGIN_LICENSE:COMM$ ** ** Commercial License Usage ** Licensees holding valid commercial Qt licenses may use this file in ** accordance with the commercial license agreement provided with the ** Software or, alternatively, in accordance with the terms contained in ** a written agreement between you and The Qt Company. For licensing terms ** and conditions see https://www.qt.io/terms-conditions. For further ** information use the contact form at https://www.qt.io/contact-us. ** ** $QT_END_LICENSE$ ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ** ****************************************************************************/ #ifndef QQMLPREVIEWBLACKLIST_H #define QQMLPREVIEWBLACKLIST_H // // W A R N I N G // ------------- // // This file is not part of the Qt API. It exists purely as an // implementation detail. This header file may change from version to // version without notice, or even be removed. // // We mean it. // #include #include #include #include QT_BEGIN_NAMESPACE class QQmlPreviewBlacklist { public: void blacklist(const QString &path); void whitelist(const QString &path); bool isBlacklisted(const QString &path) const; void clear(); private: class Node { public: Node(); Node(const Node &other); Node(Node &&other) Q_DECL_NOEXCEPT; ~Node(); Node &operator=(const Node &other); Node &operator=(Node &&other) Q_DECL_NOEXCEPT; void split(QString::iterator it, QString::iterator end); void insert(const QString &path, int offset); void remove(const QString &path, int offset); int containedPrefixLeaf(const QString &path, int offset) const; private: Node(const QString &mine, const QHash &next = QHash(), bool isLeaf = true); QString m_mine; QHash m_next; bool m_isLeaf = false; }; Node m_root; }; QT_END_NAMESPACE #endif // QQMLPREVIEWBLACKLIST_H