⚝
One Hat Cyber Team
⚝
Your IP:
216.73.216.72
Server IP:
41.128.143.86
Server:
Linux host.raqmix.cloud 6.8.0-1025-azure #30~22.04.1-Ubuntu SMP Wed Mar 12 15:28:20 UTC 2025 x86_64
Server Software:
Apache
PHP Version:
8.3.23
Buat File
|
Buat Folder
Eksekusi
Dir :
~
/
usr
/
include
/
x86_64-linux-gnu
/
qt5
/
QtCore
/
Edit File: qcache.h
/**************************************************************************** ** ** Copyright (C) 2016 The Qt Company Ltd. ** Contact: https://www.qt.io/licensing/ ** ** This file is part of the QtCore module of the Qt Toolkit. ** ** $QT_BEGIN_LICENSE:LGPL$ ** 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 Lesser General Public License Usage ** Alternatively, this file may be used under the terms of the GNU Lesser ** General Public License version 3 as published by the Free Software ** Foundation and appearing in the file LICENSE.LGPL3 included in the ** packaging of this file. Please review the following information to ** ensure the GNU Lesser General Public License version 3 requirements ** will be met: https://www.gnu.org/licenses/lgpl-3.0.html. ** ** GNU General Public License Usage ** Alternatively, this file may be used under the terms of the GNU ** General Public License version 2.0 or (at your option) the GNU General ** Public license version 3 or 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.GPL2 and 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-2.0.html and ** https://www.gnu.org/licenses/gpl-3.0.html. ** ** $QT_END_LICENSE$ ** ****************************************************************************/ #ifndef QCACHE_H #define QCACHE_H #include <QtCore/qhash.h> QT_BEGIN_NAMESPACE template <class Key, class T> class QCache { struct Node { inline Node() : keyPtr(0) {} inline Node(T *data, int cost) : keyPtr(nullptr), t(data), c(cost), p(nullptr), n(nullptr) {} const Key *keyPtr; T *t; int c; Node *p,*n; }; Node *f, *l; QHash<Key, Node> hash; int mx, total; inline void unlink(Node &n) { if (n.p) n.p->n = n.n; if (n.n) n.n->p = n.p; if (l == &n) l = n.p; if (f == &n) f = n.n; total -= n.c; T *obj = n.t; hash.remove(*n.keyPtr); delete obj; } inline T *relink(const Key &key) { typename QHash<Key, Node>::iterator i = hash.find(key); if (typename QHash<Key, Node>::const_iterator(i) == hash.constEnd()) return nullptr; Node &n = *i; if (f != &n) { if (n.p) n.p->n = n.n; if (n.n) n.n->p = n.p; if (l == &n) l = n.p; n.p = nullptr; n.n = f; f->p = &n; f = &n; } return n.t; } Q_DISABLE_COPY(QCache) public: inline explicit QCache(int maxCost = 100) noexcept; inline ~QCache() { clear(); } inline int maxCost() const { return mx; } void setMaxCost(int m); inline int totalCost() const { return total; } inline int size() const { return hash.size(); } inline int count() const { return hash.size(); } inline bool isEmpty() const { return hash.isEmpty(); } inline QList<Key> keys() const { return hash.keys(); } void clear(); bool insert(const Key &key, T *object, int cost = 1); T *object(const Key &key) const; inline bool contains(const Key &key) const { return hash.contains(key); } T *operator[](const Key &key) const; bool remove(const Key &key); T *take(const Key &key); private: void trim(int m); }; template <class Key, class T> inline QCache<Key, T>::QCache(int amaxCost) noexcept : f(nullptr), l(nullptr), mx(amaxCost), total(0) {} template <class Key, class T> inline void QCache<Key,T>::clear() { while (f) { delete f->t; f = f->n; } hash.clear(); l = nullptr; total = 0; } template <class Key, class T> inline void QCache<Key,T>::setMaxCost(int m) { mx = m; trim(mx); } template <class Key, class T> inline T *QCache<Key,T>::object(const Key &key) const { return const_cast<QCache<Key,T>*>(this)->relink(key); } template <class Key, class T> inline T *QCache<Key,T>::operator[](const Key &key) const { return object(key); } template <class Key, class T> inline bool QCache<Key,T>::remove(const Key &key) { typename QHash<Key, Node>::iterator i = hash.find(key); if (typename QHash<Key, Node>::const_iterator(i) == hash.constEnd()) { return false; } else { unlink(*i); return true; } } template <class Key, class T> inline T *QCache<Key,T>::take(const Key &key) { typename QHash<Key, Node>::iterator i = hash.find(key); if (i == hash.end()) return nullptr; Node &n = *i; T *t = n.t; n.t = nullptr; unlink(n); return t; } template <class Key, class T> bool QCache<Key,T>::insert(const Key &akey, T *aobject, int acost) { remove(akey); if (acost > mx) { delete aobject; return false; } trim(mx - acost); Node sn(aobject, acost); typename QHash<Key, Node>::iterator i = hash.insert(akey, sn); total += acost; Node *n = &i.value(); n->keyPtr = &i.key(); if (f) f->p = n; n->n = f; f = n; if (!l) l = f; return true; } template <class Key, class T> void QCache<Key,T>::trim(int m) { Node *n = l; while (n && total > m) { Node *u = n; n = n->p; unlink(*u); } } QT_END_NAMESPACE #endif // QCACHE_H
Simpan