1 // The MIT License (MIT) 2 // 3 // Copyright (c) 2015 Sergey Makeev, Vadim Slyusarev 4 // 5 // Permission is hereby granted, free of charge, to any person obtaining a copy 6 // of this software and associated documentation files (the "Software"), to deal 7 // in the Software without restriction, including without limitation the rights 8 // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 9 // copies of the Software, and to permit persons to whom the Software is 10 // furnished to do so, subject to the following conditions: 11 // 12 // The above copyright notice and this permission notice shall be included in 13 // all copies or substantial portions of the Software. 14 // 15 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 16 // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 17 // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 18 // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 19 // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 20 // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN 21 // THE SOFTWARE. 22 23 #pragma once 24 25 26 namespace MT 27 { 28 29 30 /// \class ArrayView 31 /// \brief Simple wrapper to work with raw memory as an array. Includes array bounds checking. 32 template<class T> 33 class ArrayView 34 { 35 T* data; 36 size_t count; 37 38 private: 39 40 ArrayView(ArrayView& ) {} 41 void operator=(const ArrayView&) {} 42 43 public: 44 45 ArrayView(void* memoryChunk, size_t instanceCount) 46 : data((T*)memoryChunk) 47 , count(instanceCount) 48 { 49 MT_ASSERT(count == 0 || data, "Invalid data array"); 50 } 51 52 const T &operator[]( size_t i ) const 53 { 54 MT_ASSERT( i < Size(), "bad index" ); 55 return data[i]; 56 } 57 58 T &operator[]( size_t i ) 59 { 60 MT_ASSERT( i < Size(), "bad index" ); 61 return data[i]; 62 } 63 64 size_t Size() const 65 { 66 return count; 67 } 68 69 bool IsEmpty() const 70 { 71 return count == 0; 72 } 73 }; 74 75 76 } 77