Merge pull request #1 from ronzano/master

Bugfix for inclusion in multiple files

Author: luisllamasbinaburo

src/ListLib.h

@@ -1,10 +1,10 @@
-/***************************************************
-Copyright (c) 2017 Luis Llamas
-(www.luisllamas.es)
-
-Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0
-
-Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License
+/***************************************************
+Copyright (c) 2017 Luis Llamas
+(www.luisllamas.es)
+
+Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License
  ****************************************************/
 
 #ifndef _ListLib_h
@@ -21,7 +21,7 @@ class List
 {
 public:
 	List();
-	List(size_t capacity);
+	List(size_t capacity);
 	~List();
 
 	size_t Capacity() const;
@@ -38,9 +38,9 @@ class List
 	void Add(T item);
 	void AddRange(T* items, size_t numItems);
 
-	void Insert(T item);
-	void Insert(size_t index, T item);
-	void InsertRange(T* items, size_t numItems);
+	void Insert(T item);
+	void Insert(size_t index, T item);
+	void InsertRange(T* items, size_t numItems);
 	void InsertRange(size_t index, T* items, size_t numItems);
 
 	void RemoveFirst();
@@ -76,7 +76,6 @@ class List
 	void reserve(size_t size);
 	void resize(size_t size);
 };
-#endif
 
 
 template <typename T>
@@ -90,12 +89,12 @@ List<T>::List(size_t capacity)
 {
 	_capacity = capacity;
 	_items = new T[_capacity];
-}
-
-template <typename T>
-List<T>::~List()
-{
-	delete[] _items;
+}
+
+template <typename T>
+List<T>::~List()
+{
+	delete[] _items;
 }
 
 template <typename T>
@@ -152,15 +151,15 @@ void List<T>::Insert(T item)
 	shift(0, 1);
 	_items[0] = item;
 }
-
-template <typename T>
-void List<T>::InsertRange(T* items, size_t numItems)
-{
-	_count += numItems;
-	reserve(_count);
-	shift(0, numItems);
-	memmove(_items, items, numItems * sizeof(T));
-}
+
+template <typename T>
+void List<T>::InsertRange(T* items, size_t numItems)
+{
+	_count += numItems;
+	reserve(_count);
+	shift(0, numItems);
+	memmove(_items, items, numItems * sizeof(T));
+}
 
 template <typename T>
 void List<T>::Insert(size_t index, T item)
@@ -360,4 +359,6 @@ void List<T>::resize(size_t size)
 	delete[] _items;
 	_capacity = size;
 	_items = newItems;
-}
+}
+
+#endif