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 	public:
39 
40 		ArrayView()
41 		{
42 			data = nullptr;
43 			count = 0;
44 		}
45 
46 		ArrayView(void* memoryChunk, size_t instanceCount)
47 			: data((T*)memoryChunk)
48 			, count(instanceCount)
49 		{
50 			MT_ASSERT(count == 0 || data, "Invalid data array");
51 		}
52 
53 		~ArrayView()
54 		{
55 			data = nullptr;
56 			count = 0;
57 		}
58 
59 		const T &operator[]( size_t i ) const
60 		{
61 			MT_ASSERT( i < Size(), "bad index" );
62 			return data[i];
63 		}
64 
65 		T &operator[]( size_t i )
66 		{
67 			MT_ASSERT( i < Size(), "bad index" );
68 			return data[i];
69 		}
70 
71 		size_t Size() const
72 		{
73 			return count;
74 		}
75 
76 		bool IsEmpty() const
77 		{
78 			return count == 0;
79 		}
80 
81 		T* GetRawData()
82 		{
83 			return data;
84 		}
85 
86 		const T* GetRawData() const
87 		{
88 			return data;
89 		}
90 
91 	};
92 
93 
94 }
95