/**************************************************************************** ** ** Copyright (C) 2021 The Qt Company Ltd. ** Contact: https://www.qt.io/licensing/ ** ** This file is part of the QtQml module of the Qt Toolkit. ** ** $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 QINTRUSIVELIST_P_H #define QINTRUSIVELIST_P_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 QT_BEGIN_NAMESPACE class QIntrusiveListNode; template class QIntrusiveList { public: inline QIntrusiveList(); inline ~QIntrusiveList(); inline bool isEmpty() const; inline void insert(N *n); inline void remove(N *n); inline bool contains(N *) const; class iterator { public: inline iterator(); inline iterator(N *value); inline N *operator*() const; inline N *operator->() const; inline bool operator==(const iterator &other) const; inline bool operator!=(const iterator &other) const; inline iterator &operator++(); inline iterator &erase(); private: N *_value; }; typedef iterator Iterator; inline N *first() const; static inline N *next(N *current); inline iterator begin(); inline iterator end(); private: static inline N *nodeToN(QIntrusiveListNode *node); QIntrusiveListNode *__first = nullptr; }; class QIntrusiveListNode { public: inline QIntrusiveListNode(); inline ~QIntrusiveListNode(); inline void remove(); inline bool isInList() const; QIntrusiveListNode *_next = nullptr; QIntrusiveListNode**_prev = nullptr; }; template QIntrusiveList::iterator::iterator() : _value(nullptr) { } template QIntrusiveList::iterator::iterator(N *value) : _value(value) { } template N *QIntrusiveList::iterator::operator*() const { return _value; } template N *QIntrusiveList::iterator::operator->() const { return _value; } template bool QIntrusiveList::iterator::operator==(const iterator &other) const { return other._value == _value; } template bool QIntrusiveList::iterator::operator!=(const iterator &other) const { return other._value != _value; } template typename QIntrusiveList::iterator &QIntrusiveList::iterator::operator++() { _value = QIntrusiveList::next(_value); return *this; } template typename QIntrusiveList::iterator &QIntrusiveList::iterator::erase() { N *old = _value; _value = QIntrusiveList::next(_value); (old->*member).remove(); return *this; } template QIntrusiveList::QIntrusiveList() { } template QIntrusiveList::~QIntrusiveList() { while (__first) __first->remove(); } template bool QIntrusiveList::isEmpty() const { return __first == nullptr; } template void QIntrusiveList::insert(N *n) { QIntrusiveListNode *nnode = &(n->*member); nnode->remove(); nnode->_next = __first; if (nnode->_next) nnode->_next->_prev = &nnode->_next; __first = nnode; nnode->_prev = &__first; } template void QIntrusiveList::remove(N *n) { QIntrusiveListNode *nnode = &(n->*member); nnode->remove(); } template bool QIntrusiveList::contains(N *n) const { QIntrusiveListNode *nnode = __first; while (nnode) { if (nodeToN(nnode) == n) return true; nnode = nnode->_next; } return false; } template N *QIntrusiveList::first() const { return __first?nodeToN(__first):nullptr; } template N *QIntrusiveList::next(N *current) { QIntrusiveListNode *nextnode = (current->*member)._next; N *nextstruct = nextnode?nodeToN(nextnode):nullptr; return nextstruct; } template typename QIntrusiveList::iterator QIntrusiveList::begin() { return __first?iterator(nodeToN(__first)):iterator(); } template typename QIntrusiveList::iterator QIntrusiveList::end() { return iterator(); } template N *QIntrusiveList::nodeToN(QIntrusiveListNode *node) { return (N *)((char *)node - ((char *)&(((N *)nullptr)->*member) - (char *)nullptr)); } QIntrusiveListNode::QIntrusiveListNode() { } QIntrusiveListNode::~QIntrusiveListNode() { remove(); } void QIntrusiveListNode::remove() { if (_prev) *_prev = _next; if (_next) _next->_prev = _prev; _prev = nullptr; _next = nullptr; } bool QIntrusiveListNode::isInList() const { return _prev != nullptr; } QT_END_NAMESPACE #endif // QINTRUSIVELIST_P_H