/******************************************************************** ** Image Component Library (ICL) ** ** ** ** Copyright (C) 2006-2013 CITEC, University of Bielefeld ** ** Neuroinformatics Group ** ** Website: www.iclcv.org and ** ** http://opensource.cit-ec.de/projects/icl ** ** ** ** File : ICLUtils/src/ICLUtils/SmartArray.h ** ** Module : ICLUtils ** ** Authors: Christof Elbrechter ** ** ** ** ** ** GNU LESSER GENERAL PUBLIC LICENSE ** ** This file may be used under the terms of the GNU Lesser General ** ** Public License version 3.0 as published by the ** ** ** ** Free Software Foundation and appearing in the file LICENSE.LGPL ** ** included in the packaging of this file. Please review the ** ** following information to ensure the license requirements will ** ** be met: http://www.gnu.org/licenses/lgpl-3.0.txt ** ** ** ** The development of this software was supported by the ** ** Excellence Cluster EXC 277 Cognitive Interaction Technology. ** ** The Excellence Cluster EXC 277 is a grant of the Deutsche ** ** Forschungsgemeinschaft (DFG) in the context of the German ** ** Excellence Initiative. ** ** ** ********************************************************************/ #pragma once #include #include namespace icl{ namespace utils{ #ifdef ICL_USE_STD_SHARED_PTR template using SmartArray = SmartPtrBase; #else /// Specialization of the SmartPtrBase class for Arrays /** If the internal reference counter becomes 0, the contained data pointer is release using delete []*/ template struct SmartArray : public SmartPtrBase{ // type definition for the parent class typedef SmartPtrBase super; /// creates a null pointer SmartArray():super(){} /// gets pointer, ownership is passed optionally template SmartArray(DerivedT *ptData, bool bOwn=true):super(ptData,bOwn){} /// gets pointer, ownership is passed optionally SmartArray(T *ptData, bool bOwn=true):super(ptData,bOwn){} /// reference counting copy constructor template SmartArray(const SmartPtrBase& r):super(r){} /// reference counting copy constructor SmartArray(const SmartPtrBase& r):super(r){} /// index access operator (no index checks) T &operator[](int idx){ ICLASSERT(super::e); return super::e[idx]; } /// index access operator (const, no index checks) const T&operator[](int idx) const{ ICLASSERT(super::e); return super::e[idx]; } }; #endif } // namespace utils }