summaryrefslogtreecommitdiffstats
path: root/src/Runtime/ogl-runtime/src/foundation/Qt3DSInvasiveLinkedList.h
diff options
context:
space:
mode:
Diffstat (limited to 'src/Runtime/ogl-runtime/src/foundation/Qt3DSInvasiveLinkedList.h')
m---------src/Runtime/ogl-runtime0
-rw-r--r--src/Runtime/ogl-runtime/src/foundation/Qt3DSInvasiveLinkedList.h361
2 files changed, 0 insertions, 361 deletions
diff --git a/src/Runtime/ogl-runtime b/src/Runtime/ogl-runtime
new file mode 160000
+Subproject 427fddb50d43aa21a90fc7356ee3cdd8a908df5
diff --git a/src/Runtime/ogl-runtime/src/foundation/Qt3DSInvasiveLinkedList.h b/src/Runtime/ogl-runtime/src/foundation/Qt3DSInvasiveLinkedList.h
deleted file mode 100644
index da90e120..00000000
--- a/src/Runtime/ogl-runtime/src/foundation/Qt3DSInvasiveLinkedList.h
+++ /dev/null
@@ -1,361 +0,0 @@
-/****************************************************************************
-**
-** Copyright (C) 2008-2012 NVIDIA Corporation.
-** Copyright (C) 2017 The Qt Company Ltd.
-** Contact: https://www.qt.io/licensing/
-**
-** This file is part of Qt 3D Studio.
-**
-** $QT_BEGIN_LICENSE:GPL$
-** 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.
-**
-** GNU General Public License Usage
-** Alternatively, this file may be used under the terms of the GNU
-** General Public License version 3 or (at your option) any later version
-** approved by the KDE Free Qt Foundation. The licenses are as published by
-** the Free Software Foundation and appearing in the file LICENSE.GPL3
-** included in the packaging of this file. Please review the following
-** information to ensure the GNU General Public License requirements will
-** be met: https://www.gnu.org/licenses/gpl-3.0.html.
-**
-** $QT_END_LICENSE$
-**
-****************************************************************************/
-
-#ifndef QT3DS_FOUNDATION_INVASIVE_LINKED_LIST_H
-#define QT3DS_FOUNDATION_INVASIVE_LINKED_LIST_H
-#include "foundation/Qt3DS.h"
-#include "foundation/Qt3DSAllocator.h"
-#include "foundation/Qt3DSAllocatorCallback.h"
-#include "foundation/Qt3DSContainers.h"
-
-namespace qt3ds {
-namespace foundation {
-
- // Base linked list without an included head or tail member.
- template <typename TObjType, typename TObjHeadOp, typename TObjTailOp>
- struct SInvasiveLinkListBase
- {
- TObjType *tail(TObjType *inObj)
- {
- if (inObj)
- return TObjTailOp().get(inObj);
- return NULL;
- }
-
- TObjType *head(TObjType *inObj)
- {
- if (inObj)
- return TObjHeadOp().get(inObj);
- return NULL;
- }
-
- const TObjType *tail(const TObjType *inObj)
- {
- if (inObj)
- return TObjTailOp().get(inObj);
- return NULL;
- }
-
- const TObjType *head(const TObjType *inObj)
- {
- if (inObj)
- return TObjHeadOp().get(inObj);
- return NULL;
- }
-
- void remove(TObjType &inObj)
- {
- TObjHeadOp theHeadOp;
- TObjTailOp theTailOp;
- TObjType *theHead = theHeadOp.get(inObj);
- TObjType *theTail = theTailOp.get(inObj);
- if (theHead)
- theTailOp.set(*theHead, theTail);
- if (theTail)
- theHeadOp.set(*theTail, theHead);
- theHeadOp.set(inObj, NULL);
- theTailOp.set(inObj, NULL);
- }
-
- void insert_after(TObjType &inPosition, TObjType &inObj)
- {
- TObjTailOp theTailOp;
- TObjType *theHead = &inPosition;
- TObjType *theTail = theTailOp.get(inPosition);
- insert(theHead, theTail, inObj);
- }
-
- void insert_before(TObjType &inPosition, TObjType &inObj)
- {
- TObjHeadOp theHeadOp;
- TObjType *theHead = theHeadOp.get(inPosition);
- TObjType *theTail = &inPosition;
- insert(theHead, theTail, inObj);
- }
-
- void insert(TObjType *inHead, TObjType *inTail, TObjType &inObj)
- {
- TObjHeadOp theHeadOp;
- TObjTailOp theTailOp;
- if (inHead)
- theTailOp.set(*inHead, &inObj);
- if (inTail)
- theHeadOp.set(*inTail, &inObj);
- theHeadOp.set(inObj, inHead);
- theTailOp.set(inObj, inTail);
- }
- };
-
- template <typename TObjType, typename TObjTailOp>
- struct SLinkedListIterator
- {
- typedef SLinkedListIterator<TObjType, TObjTailOp> TMyType;
- TObjType *m_Obj;
- SLinkedListIterator(TObjType *inObj = NULL)
- : m_Obj(inObj)
- {
- }
-
- bool operator!=(const TMyType &inIter) const { return m_Obj != inIter.m_Obj; }
- bool operator==(const TMyType &inIter) const { return m_Obj == inIter.m_Obj; }
-
- TMyType &operator++()
- {
- if (m_Obj)
- m_Obj = TObjTailOp().get(*m_Obj);
- return *this;
- }
-
- TMyType &operator++(int)
- {
- TMyType retval(*this);
- ++(*this);
- return retval;
- }
-
- TObjType &operator*() { return *m_Obj; }
- TObjType *operator->() { return m_Obj; }
- };
-
- // Used for singly linked list where
- // items have either no head or tail ptr.
- template <typename TObjType>
- struct SNullOp
- {
- void set(TObjType &, TObjType *) {}
- TObjType *get(const TObjType &) { return NULL; }
- };
-
- template <typename TObjType, typename TObjTailOp>
- struct InvasiveSingleLinkedList
- : public SInvasiveLinkListBase<TObjType, SNullOp<TObjType>, TObjTailOp>
- {
- typedef InvasiveSingleLinkedList<TObjType, TObjTailOp> TMyType;
- typedef SInvasiveLinkListBase<TObjType, SNullOp<TObjType>, TObjTailOp> TBaseType;
- typedef SLinkedListIterator<TObjType, TObjTailOp> iterator;
- typedef iterator const_iterator;
- TObjType *m_Head;
- InvasiveSingleLinkedList()
- : m_Head(NULL)
- {
- }
- InvasiveSingleLinkedList(const TMyType &inOther)
- : m_Head(inOther.m_Head)
- {
- }
- TMyType &operator=(const TMyType &inOther)
- {
- m_Head = inOther.m_Head;
- return *this;
- }
-
- TObjType &front() const { return *m_Head; }
-
- void push_front(TObjType &inObj)
- {
- if (m_Head != NULL)
- TBaseType::insert_before(*m_Head, inObj);
- m_Head = &inObj;
- }
-
- void push_back(TObjType &inObj)
- {
- if (m_Head == NULL)
- m_Head = &inObj;
- else {
- TObjType *lastObj = NULL;
- for (iterator iter = begin(), endIter = end(); iter != endIter; ++iter)
- lastObj = &(*iter);
-
- QT3DS_ASSERT(lastObj);
- if (lastObj)
- TObjTailOp().set(*lastObj, &inObj);
- }
- }
-
- void remove(TObjType &inObj)
- {
- if (m_Head == &inObj)
- m_Head = TObjTailOp().get(inObj);
- TBaseType::remove(inObj);
- }
-
- bool empty() const { return m_Head == NULL; }
-
- iterator begin() { return iterator(m_Head); }
- iterator end() { return iterator(NULL); }
-
- const_iterator begin() const { return iterator(m_Head); }
- const_iterator end() const { return iterator(NULL); }
- };
-
- template <typename TObjType, typename TObjHeadOp, typename TObjTailOp>
- struct InvasiveLinkedList : public SInvasiveLinkListBase<TObjType, TObjHeadOp, TObjTailOp>
- {
- typedef InvasiveLinkedList<TObjType, TObjHeadOp, TObjTailOp> TMyType;
- typedef SInvasiveLinkListBase<TObjType, TObjHeadOp, TObjTailOp> TBaseType;
- typedef SLinkedListIterator<TObjType, TObjTailOp> iterator;
- typedef iterator const_iterator;
- typedef SLinkedListIterator<TObjType, TObjHeadOp> reverse_iterator;
- typedef reverse_iterator const_reverse_iterator;
-
- TObjType *m_Head;
- TObjType *m_Tail;
-
- InvasiveLinkedList()
- : m_Head(NULL)
- , m_Tail(NULL)
- {
- }
- InvasiveLinkedList(const TMyType &inOther)
- : m_Head(inOther.m_Head)
- , m_Tail(inOther.m_Tail)
- {
- }
- TMyType &operator=(const TMyType &inOther)
- {
- m_Head = inOther.m_Head;
- m_Tail = inOther.m_Tail;
- return *this;
- }
-
- TObjType &front() const
- {
- QT3DS_ASSERT(m_Head);
- return *m_Head;
- }
- TObjType &back() const
- {
- QT3DS_ASSERT(m_Tail);
- return *m_Tail;
- }
-
- TObjType *front_ptr() const { return m_Head; }
- TObjType *back_ptr() const { return m_Tail; }
-
- void push_front(TObjType &inObj)
- {
- if (m_Head != NULL)
- TBaseType::insert_before(*m_Head, inObj);
- m_Head = &inObj;
-
- if (m_Tail == NULL)
- m_Tail = &inObj;
- }
-
- void push_back(TObjType &inObj)
- {
- if (m_Tail != NULL)
- TBaseType::insert_after(*m_Tail, inObj);
- m_Tail = &inObj;
-
- if (m_Head == NULL)
- m_Head = &inObj;
- }
-
- void remove(TObjType &inObj)
- {
- if (m_Head == &inObj)
- m_Head = TObjTailOp().get(inObj);
- if (m_Tail == &inObj)
- m_Tail = TObjHeadOp().get(inObj);
-
- TBaseType::remove(inObj);
- }
-
- bool empty() const { return m_Head == NULL; }
-
- iterator begin() { return iterator(m_Head); }
- iterator end() { return iterator(NULL); }
-
- const_iterator begin() const { return iterator(m_Head); }
- const_iterator end() const { return iterator(NULL); }
-
- reverse_iterator rbegin() { return reverse_iterator(m_Tail); }
- reverse_iterator rend() { return reverse_iterator(NULL); }
-
- const_reverse_iterator rbegin() const { return reverse_iterator(m_Tail); }
- const_reverse_iterator rend() const { return reverse_iterator(NULL); }
- };
-
-// Macros to speed up the definitely of invasive linked lists.
-#define DEFINE_INVASIVE_SINGLE_LIST(type) \
- struct S##type; \
- struct S##type##NextOp \
- { \
- S##type *get(S##type &s); \
- const S##type *get(const S##type &s) const; \
- void set(S##type &inItem, S##type *inNext); \
- }; \
- typedef InvasiveSingleLinkedList<S##type, S##type##NextOp> T##type##List;
-
-#define DEFINE_INVASIVE_LIST(type) \
- struct S##type; \
- struct S##type##NextOp \
- { \
- S##type *get(S##type &s); \
- const S##type *get(const S##type &s) const; \
- void set(S##type &inItem, S##type *inNext); \
- }; \
- struct S##type##PreviousOp \
- { \
- S##type *get(S##type &s); \
- const S##type *get(const S##type &s) const; \
- void set(S##type &inItem, S##type *inNext); \
- }; \
- typedef InvasiveLinkedList<S##type, S##type##PreviousOp, S##type##NextOp> T##type##List;
-
-#define IMPLEMENT_INVASIVE_LIST(type, prevMember, nextMember) \
- inline S##type *S##type##NextOp::get(S##type &s) { return s.nextMember; } \
- inline const S##type *S##type##NextOp::get(const S##type &s) const { return s.nextMember; } \
- inline void S##type##NextOp::set(S##type &inItem, S##type *inNext) \
- { \
- inItem.nextMember = inNext; \
- } \
- inline S##type *S##type##PreviousOp::get(S##type &s) { return s.prevMember; } \
- inline const S##type *S##type##PreviousOp::get(const S##type &s) const \
- { \
- return s.prevMember; \
- } \
- inline void S##type##PreviousOp::set(S##type &inItem, S##type *inNext) \
- { \
- inItem.prevMember = inNext; \
- }
-
-#define IMPLEMENT_INVASIVE_SINGLE_LIST(type, nextMember) \
- inline S##type *S##type##NextOp::get(S##type &s) { return s.nextMember; } \
- inline const S##type *S##type##NextOp::get(const S##type &s) const { return s.nextMember; } \
- inline void S##type##NextOp::set(S##type &inItem, S##type *inNext) \
- { \
- inItem.nextMember = inNext; \
- }
-}
-}
-#endif \ No newline at end of file
generated by cgit v1.2.3 (git 2.25.1) at 2024-05-04 21:38:13 +0000