PythonQtMisc.h
134 lines
| 3.7 KiB
| text/x-c
|
CLexer
/ src / PythonQtMisc.h
ezust
|
r0 | #ifndef _PYTHONQTMISC_H | ||
| #define _PYTHONQTMISC_H | ||||
| /* | ||||
| * | ||||
| * Copyright (C) 2006 MeVis Research GmbH All Rights Reserved. | ||||
| * | ||||
| * This library is free software; you can redistribute it and/or | ||||
| * modify it under the terms of the GNU Lesser General Public | ||||
| * License as published by the Free Software Foundation; either | ||||
| * version 2.1 of the License, or (at your option) any later version. | ||||
| * | ||||
| * This library is distributed in the hope that it will be useful, | ||||
| * but WITHOUT ANY WARRANTY; without even the implied warranty of | ||||
| * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | ||||
| * Lesser General Public License for more details. | ||||
| * | ||||
| * Further, this software is distributed without any warranty that it is | ||||
| * free of the rightful claim of any third person regarding infringement | ||||
| * or the like. Any license provided herein, whether implied or | ||||
| * otherwise, applies only to this software file. Patent licenses, if | ||||
| * any, provided herein do not apply to combinations of this program with | ||||
| * other software, or any other product whatsoever. | ||||
| * | ||||
| * You should have received a copy of the GNU Lesser General Public | ||||
| * License along with this library; if not, write to the Free Software | ||||
| * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA | ||||
| * | ||||
| * Contact information: MeVis Research GmbH, Universitaetsallee 29, | ||||
| * 28359 Bremen, Germany or: | ||||
| * | ||||
| * http://www.mevis.de | ||||
| * | ||||
| */ | ||||
| //---------------------------------------------------------------------------------- | ||||
| /*! | ||||
| // \file PythonQtMisc.h | ||||
| // \author Florian Link | ||||
| // \author Last changed by $Author: florian $ | ||||
| // \date 2006-05 | ||||
| */ | ||||
| //---------------------------------------------------------------------------------- | ||||
| #include <QList> | ||||
| #define PythonQtValueStorage_ADD_VALUE(store, type, value, ptr) \ | ||||
| { type* item = (type*)store.nextValuePtr(); \ | ||||
| *item = value; \ | ||||
| ptr = (void*)item; \ | ||||
| } | ||||
| //! stores a position in the PythonQtValueStorage | ||||
| class PythonQtValueStoragePosition { | ||||
| public: | ||||
| PythonQtValueStoragePosition() { chunkIdx = 0; chunkOffset = 0; } | ||||
| int chunkIdx; | ||||
| int chunkOffset; | ||||
| }; | ||||
| //! a helper class that stores basic C++ value types in chunks | ||||
| template <typename T, int chunkEntries> class PythonQtValueStorage | ||||
| { | ||||
| public: | ||||
| PythonQtValueStorage() { | ||||
| _chunkIdx = 0; | ||||
| _chunkOffset = 0; | ||||
| _currentChunk = new T[chunkEntries]; | ||||
| _chunks.append(_currentChunk); | ||||
| }; | ||||
| //! clear all memory | ||||
| void clear() { | ||||
| T* chunk; | ||||
| foreach(chunk, _chunks) { | ||||
| delete[]chunk; | ||||
| } | ||||
| } | ||||
| //! reset the storage to 0 (without freeing memory, thus caching old entries for reuse) | ||||
| void reset() { | ||||
| _chunkIdx = 0; | ||||
| _chunkOffset = 0; | ||||
| _currentChunk = _chunks.at(0); | ||||
| } | ||||
| //! get the current position to be restored with setPos | ||||
| void getPos(PythonQtValueStoragePosition & pos) { | ||||
| pos.chunkIdx = _chunkIdx; | ||||
| pos.chunkOffset = _chunkOffset; | ||||
| } | ||||
| //! set the current position (without freeing memory, thus caching old entries for reuse) | ||||
| void setPos(const PythonQtValueStoragePosition& pos) { | ||||
| _chunkOffset = pos.chunkOffset; | ||||
| if (_chunkIdx != pos.chunkIdx) { | ||||
| _chunkIdx = pos.chunkIdx; | ||||
| _currentChunk = _chunks.at(_chunkIdx); | ||||
| } | ||||
| } | ||||
| //! add one default constructed value and return the pointer to it | ||||
| T* nextValuePtr() { | ||||
| if (_chunkOffset>=chunkEntries) { | ||||
| _chunkIdx++; | ||||
| if (_chunkIdx >= _chunks.size()) { | ||||
| T* newChunk = new T[chunkEntries]; | ||||
| _chunks.append(newChunk); | ||||
| _currentChunk = newChunk; | ||||
| } else { | ||||
| _currentChunk = _chunks.at(_chunkIdx); | ||||
| } | ||||
| _chunkOffset = 0; | ||||
| } | ||||
| T* newEntry = _currentChunk + _chunkOffset; | ||||
| _chunkOffset++; | ||||
| return newEntry; | ||||
| }; | ||||
| private: | ||||
| QList<T*> _chunks; | ||||
| int _chunkIdx; | ||||
| int _chunkOffset; | ||||
| T* _currentChunk; | ||||
| }; | ||||
| #endif | ||||