├── LICENSE ├── README.md ├── examples └── List │ └── List.ino ├── keywords.txt ├── library.properties └── src └── ListLib.h /LICENSE: -------------------------------------------------------------------------------- 1 | Apache License 2 | Version 2.0, January 2004 3 | http://www.apache.org/licenses/ 4 | 5 | TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 6 | 7 | 1. Definitions. 8 | 9 | "License" shall mean the terms and conditions for use, reproduction, 10 | and distribution as defined by Sections 1 through 9 of this document. 11 | 12 | "Licensor" shall mean the copyright owner or entity authorized by 13 | the copyright owner that is granting the License. 14 | 15 | "Legal Entity" shall mean the union of the acting entity and all 16 | other entities that control, are controlled by, or are under common 17 | control with that entity. For the purposes of this definition, 18 | "control" means (i) the power, direct or indirect, to cause the 19 | direction or management of such entity, whether by contract or 20 | otherwise, or (ii) ownership of fifty percent (50%) or more of the 21 | outstanding shares, or (iii) beneficial ownership of such entity. 22 | 23 | "You" (or "Your") shall mean an individual or Legal Entity 24 | exercising permissions granted by this License. 25 | 26 | "Source" form shall mean the preferred form for making modifications, 27 | including but not limited to software source code, documentation 28 | source, and configuration files. 29 | 30 | "Object" form shall mean any form resulting from mechanical 31 | transformation or translation of a Source form, including but 32 | not limited to compiled object code, generated documentation, 33 | and conversions to other media types. 34 | 35 | "Work" shall mean the work of authorship, whether in Source or 36 | Object form, made available under the License, as indicated by a 37 | copyright notice that is included in or attached to the work 38 | (an example is provided in the Appendix below). 39 | 40 | "Derivative Works" shall mean any work, whether in Source or Object 41 | form, that is based on (or derived from) the Work and for which the 42 | editorial revisions, annotations, elaborations, or other modifications 43 | represent, as a whole, an original work of authorship. For the purposes 44 | of this License, Derivative Works shall not include works that remain 45 | separable from, or merely link (or bind by name) to the interfaces of, 46 | the Work and Derivative Works thereof. 47 | 48 | "Contribution" shall mean any work of authorship, including 49 | the original version of the Work and any modifications or additions 50 | to that Work or Derivative Works thereof, that is intentionally 51 | submitted to Licensor for inclusion in the Work by the copyright owner 52 | or by an individual or Legal Entity authorized to submit on behalf of 53 | the copyright owner. For the purposes of this definition, "submitted" 54 | means any form of electronic, verbal, or written communication sent 55 | to the Licensor or its representatives, including but not limited to 56 | communication on electronic mailing lists, source code control systems, 57 | and issue tracking systems that are managed by, or on behalf of, the 58 | Licensor for the purpose of discussing and improving the Work, but 59 | excluding communication that is conspicuously marked or otherwise 60 | designated in writing by the copyright owner as "Not a Contribution." 61 | 62 | "Contributor" shall mean Licensor and any individual or Legal Entity 63 | on behalf of whom a Contribution has been received by Licensor and 64 | subsequently incorporated within the Work. 65 | 66 | 2. Grant of Copyright License. Subject to the terms and conditions of 67 | this License, each Contributor hereby grants to You a perpetual, 68 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 69 | copyright license to reproduce, prepare Derivative Works of, 70 | publicly display, publicly perform, sublicense, and distribute the 71 | Work and such Derivative Works in Source or Object form. 72 | 73 | 3. Grant of Patent License. Subject to the terms and conditions of 74 | this License, each Contributor hereby grants to You a perpetual, 75 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 76 | (except as stated in this section) patent license to make, have made, 77 | use, offer to sell, sell, import, and otherwise transfer the Work, 78 | where such license applies only to those patent claims licensable 79 | by such Contributor that are necessarily infringed by their 80 | Contribution(s) alone or by combination of their Contribution(s) 81 | with the Work to which such Contribution(s) was submitted. If You 82 | institute patent litigation against any entity (including a 83 | cross-claim or counterclaim in a lawsuit) alleging that the Work 84 | or a Contribution incorporated within the Work constitutes direct 85 | or contributory patent infringement, then any patent licenses 86 | granted to You under this License for that Work shall terminate 87 | as of the date such litigation is filed. 88 | 89 | 4. Redistribution. You may reproduce and distribute copies of the 90 | Work or Derivative Works thereof in any medium, with or without 91 | modifications, and in Source or Object form, provided that You 92 | meet the following conditions: 93 | 94 | (a) You must give any other recipients of the Work or 95 | Derivative Works a copy of this License; and 96 | 97 | (b) You must cause any modified files to carry prominent notices 98 | stating that You changed the files; and 99 | 100 | (c) You must retain, in the Source form of any Derivative Works 101 | that You distribute, all copyright, patent, trademark, and 102 | attribution notices from the Source form of the Work, 103 | excluding those notices that do not pertain to any part of 104 | the Derivative Works; and 105 | 106 | (d) If the Work includes a "NOTICE" text file as part of its 107 | distribution, then any Derivative Works that You distribute must 108 | include a readable copy of the attribution notices contained 109 | within such NOTICE file, excluding those notices that do not 110 | pertain to any part of the Derivative Works, in at least one 111 | of the following places: within a NOTICE text file distributed 112 | as part of the Derivative Works; within the Source form or 113 | documentation, if provided along with the Derivative Works; or, 114 | within a display generated by the Derivative Works, if and 115 | wherever such third-party notices normally appear. The contents 116 | of the NOTICE file are for informational purposes only and 117 | do not modify the License. You may add Your own attribution 118 | notices within Derivative Works that You distribute, alongside 119 | or as an addendum to the NOTICE text from the Work, provided 120 | that such additional attribution notices cannot be construed 121 | as modifying the License. 122 | 123 | You may add Your own copyright statement to Your modifications and 124 | may provide additional or different license terms and conditions 125 | for use, reproduction, or distribution of Your modifications, or 126 | for any such Derivative Works as a whole, provided Your use, 127 | reproduction, and distribution of the Work otherwise complies with 128 | the conditions stated in this License. 129 | 130 | 5. Submission of Contributions. Unless You explicitly state otherwise, 131 | any Contribution intentionally submitted for inclusion in the Work 132 | by You to the Licensor shall be under the terms and conditions of 133 | this License, without any additional terms or conditions. 134 | Notwithstanding the above, nothing herein shall supersede or modify 135 | the terms of any separate license agreement you may have executed 136 | with Licensor regarding such Contributions. 137 | 138 | 6. Trademarks. This License does not grant permission to use the trade 139 | names, trademarks, service marks, or product names of the Licensor, 140 | except as required for reasonable and customary use in describing the 141 | origin of the Work and reproducing the content of the NOTICE file. 142 | 143 | 7. Disclaimer of Warranty. Unless required by applicable law or 144 | agreed to in writing, Licensor provides the Work (and each 145 | Contributor provides its Contributions) on an "AS IS" BASIS, 146 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 147 | implied, including, without limitation, any warranties or conditions 148 | of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A 149 | PARTICULAR PURPOSE. You are solely responsible for determining the 150 | appropriateness of using or redistributing the Work and assume any 151 | risks associated with Your exercise of permissions under this License. 152 | 153 | 8. Limitation of Liability. In no event and under no legal theory, 154 | whether in tort (including negligence), contract, or otherwise, 155 | unless required by applicable law (such as deliberate and grossly 156 | negligent acts) or agreed to in writing, shall any Contributor be 157 | liable to You for damages, including any direct, indirect, special, 158 | incidental, or consequential damages of any character arising as a 159 | result of this License or out of the use or inability to use the 160 | Work (including but not limited to damages for loss of goodwill, 161 | work stoppage, computer failure or malfunction, or any and all 162 | other commercial damages or losses), even if such Contributor 163 | has been advised of the possibility of such damages. 164 | 165 | 9. Accepting Warranty or Additional Liability. While redistributing 166 | the Work or Derivative Works thereof, You may choose to offer, 167 | and charge a fee for, acceptance of support, warranty, indemnity, 168 | or other liability obligations and/or rights consistent with this 169 | License. However, in accepting such obligations, You may act only 170 | on Your own behalf and on Your sole responsibility, not on behalf 171 | of any other Contributor, and only if You agree to indemnify, 172 | defend, and hold each Contributor harmless for any liability 173 | incurred by, or claims asserted against, such Contributor by reason 174 | of your accepting any such warranty or additional liability. 175 | 176 | END OF TERMS AND CONDITIONS 177 | 178 | APPENDIX: How to apply the Apache License to your work. 179 | 180 | To apply the Apache License to your work, attach the following 181 | boilerplate notice, with the fields enclosed by brackets "{}" 182 | replaced with your own identifying information. (Don't include 183 | the brackets!) The text should be enclosed in the appropriate 184 | comment syntax for the file format. We also recommend that a 185 | file or class name and description of purpose be included on the 186 | same "printed page" as the copyright notice for easier 187 | identification within third-party archives. 188 | 189 | Copyright {yyyy} {name of copyright owner} 190 | 191 | Licensed under the Apache License, Version 2.0 (the "License"); 192 | you may not use this file except in compliance with the License. 193 | You may obtain a copy of the License at 194 | 195 | http://www.apache.org/licenses/LICENSE-2.0 196 | 197 | Unless required by applicable law or agreed to in writing, software 198 | distributed under the License is distributed on an "AS IS" BASIS, 199 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 200 | See the License for the specific language governing permissions and 201 | limitations under the License. 202 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Librería Arduino List 2 | Librería para Arduino que implementa un array de tamaño dinámico, es decir, una colección en la que es posible añadir o eliminar elementos, y la colección aumenta o disminuye su capacidad en función del número de elementos almacenados. 3 | 4 | Más información https://www.luisllamas.es/libreria-arduino-list/ 5 | 6 | ## Instrucciones de uso 7 | El funcionamiento de la clase List es similar a la clase Vector de C++, pero en una implementación sencilla que puede ser empleada en un procesador como Arduino. Sin embargo, los nombres de los métodos y variables se asemejan a la clase genérica List disponible en C#, más modernos y actualizados. 8 | 9 | La clase List se inicializa a una determinada capacidad, que por defecto es 4 elementos. Internamente la clase implementa un array del tamaño de la capacidad de la lista. La variable Count contabiliza el número de elementos ocupados en la lista. La lista está llena cuando el número de elementos es igual a la capacidad de la lista. 10 | 11 | En caso de añadir un elemento cuando la lista está llena, el array interno se copia a un nuevo array del doble de capacidad del array inicial. El proceso de expansión requiere la creación de un nuevo array y la copia de los elementos, lo que supone un tiempo adicional a una inserción simple. 12 | 13 | El acceso a los elementos de la lista se realiza mediante el indexador [], como en el caso de un array normal. Adicionalmente se disponen de métodos para añadir, insertar, reemplazar o eliminar elementos o series de elementos. 14 | 15 | Los métodos Trim permiten ajustar la capacidad de la lista al número de elementos realmente ocupados, con objeto de reducir la memoria ocupada por la lista. Al igual que el proceso de expansión, la contracción requiere un tiempo adicional. 16 | 17 | También se disponen de métodos para buscar elementos dentro de la lista, invertir los elementos, y para copiar los elementos desde y hacia un array externo. 18 | 19 | Finalmente, se dispone de métodos especiales para insertar o eliminar elementos en la primera y última posición, que permiten implementar de forma sencilla estructuras de tipo LIFO (Pila) y FIFO (Cola). 20 | 21 | 22 | ### Constructor 23 | La clase List se instancia a través de su constructor. 24 | ```c++ 25 | // Crea una nueva lista con capacidad 4 26 | List(); 27 | 28 | // Crea una nueva lista con capacidad capacity 29 | List(size_t capacity); 30 | ``` 31 | 32 | ### Métodos generales 33 | ```c++ 34 | // Devuelve la capacidad de la lista 35 | size_t Capacity() const; 36 | 37 | // Devuelve el numero de elementos guardados en la lista 38 | size_t Count() const; 39 | 40 | // Devuelve true si la lista esta vacia 41 | // false en caso contrario 42 | bool IsEmpty(); 43 | 44 | // Devuelve true si la lista esta llena 45 | // false en caso contrario 46 | bool IsFull(); 47 | 48 | // Invierte los elementos de la lista 49 | void Reverse(); 50 | ``` 51 | 52 | 53 | ### Acceder elementos 54 | ```c++ 55 | // Indexador de la lista permite acceder a un elemento usando list[index] 56 | T& operator[](const size_t index); 57 | 58 | // Devuelve el primer elemento de la lista 59 | void First(); 60 | 61 | // Devuelve el ultimo elemento de la lista 62 | void Last(); 63 | ``` 64 | 65 | 66 | ### Añadir elementos 67 | ```c++ 68 | // Añade un elemento al final de la lista 69 | void Add(T item); 70 | 71 | // Añade una serie de elementos al final de la lista 72 | void AddRange(T* items, size_t numItems); 73 | ``` 74 | 75 | ### Insertar elementos 76 | ```c++ 77 | // Inserta un elemento al principio de la lista 78 | void Insert(T item); 79 | 80 | // Inserta un elemento en la posicion indicada 81 | void Insert(size_t index, T item); 82 | 83 | // Inserta una serie de elementos al principio de la lista 84 | void InsertRange(T* items, size_t numItems); 85 | 86 | // Inserta una serie de elementos en la posicion indicada 87 | void InsertRange(size_t index, T* items, size_t numItems); 88 | ``` 89 | 90 | ### Reemplazar elementos 91 | ```c++ 92 | // Remplaza el elemento de la posicion indicada 93 | void Replace(size_t index, T item); 94 | 95 | // Reemplaza una serie de elementos en la posicion indicada 96 | void ReplaceRange(size_t index, T* items, size_t numItems); 97 | ``` 98 | 99 | ### Eliminar elementos 100 | ```c++ 101 | // Elimina todos los elementos de la lista 102 | void Clear(); 103 | 104 | // Elimina el primer elemento de la lista 105 | void RemoveFirst(); 106 | 107 | // Elimina el ultimo elemento de la lista 108 | void RemoveLast(); 109 | 110 | // Elementa el elemento de la posicion indicada 111 | void Remove(size_t index); 112 | 113 | // Elimina una serie de elementos de la posicion indicada 114 | void RemoveRange(size_t index, size_t numItems); 115 | ``` 116 | 117 | ### Reducir capacidad 118 | ```c++ 119 | // Reduce la capacidad de la lista al numero de elementos para reducir la memoria empleada 120 | void Trim(); 121 | 122 | // Reduce la capacidad de la lista al numero de elementos 123 | // mas una cierta capacidad de reserva 124 | void Trim(size_t reserve); 125 | ``` 126 | 127 | ### Buscar elementos 128 | ```c++ 129 | // Devuelve true si la lista contiene un elemento, false en caso contrario 130 | bool Contains(T item); 131 | 132 | // Devuelve el indice de la primera ocurencia de un elemento en la lista 133 | size_t IndexOf(T item); 134 | ``` 135 | 136 | ### Conversión desde/hacia arrays 137 | ```c++ 138 | // Devuelve todos los elementos de la lista en un nuevo array 139 | T* ToArray(); 140 | 141 | // Devuelve una serie de elementos de la lista en un nuevo array 142 | T* ToArray(size_t index, size_t numItems); 143 | 144 | // Inicia una lista copiando los elementos desde un array existente 145 | void FromArray(T* items, size_t numItems); 146 | 147 | // Copia todos los elementos a un array existente 148 | void CopyTo(T* items); 149 | 150 | // Copia una serie de elementos a un array existente 151 | void CopyTo(T* items, size_t index, size_t numItems); 152 | ``` 153 | 154 | 155 | ## Ejemplos 156 | La librería List incluye los siguientes ejemplos para ilustrar su uso. 157 | * List: Ejemplo general de uso de la clase List. 158 | ```c++ 159 | #include "ListLib.h" 160 | 161 | void setup() { 162 | Serial.begin(9600); 163 | 164 | // Crear una nueva lista 165 | List list; 166 | 167 | // Añadir elementos de 0 a 10 168 | for (int i = 0; i <= 10; i++) 169 | { 170 | list.Add(i); 171 | } 172 | 173 | // Array para ejemplos con rangos 174 | int test[] = {100, 200, 300, 400, 500 }; 175 | 176 | // Ejemplo añadir 177 | list.Add(1000); 178 | list.AddRange(test, 5); 179 | 180 | // Ejemplo insertar 181 | list.Insert(2, 2000); 182 | list.InsertRange(5, test, 5); 183 | 184 | // Ejemplo reemplazar 185 | list.Replace(2, 5000); 186 | list.ReplaceRange(3, test, 5); 187 | 188 | // Ejemplo de eliminar 189 | list.Remove(17); 190 | list.RemoveRange(2, 8); 191 | 192 | // Mostrar resultado por pantalla 193 | // y ejemplo acceso con indexador[] 194 | for (int i = 0; i < list.Count(); i++) 195 | { 196 | Serial.println(list[i]); 197 | } 198 | 199 | // Ejemplo IndexOf 200 | Serial.print("IndexOf: "); 201 | Serial.println(list.IndexOf(23)); 202 | 203 | // Ejemplo Trim 204 | list.Trim(); 205 | Serial.print("Capacity: "); 206 | Serial.println(list.Capacity()); 207 | } 208 | 209 | void loop() { 210 | 211 | } 212 | ``` 213 | -------------------------------------------------------------------------------- /examples/List/List.ino: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/luisllamasbinaburo/Arduino-List/a250c6ee7e3d014b6dda415d420b09ca93b117cc/examples/List/List.ino -------------------------------------------------------------------------------- /keywords.txt: -------------------------------------------------------------------------------- 1 | ####################################### 2 | # Syntax Coloring Map List 3 | ####################################### 4 | 5 | ####################################### 6 | # Datatypes (KEYWORD1) 7 | ####################################### 8 | List KEYWORD1 9 | 10 | ####################################### 11 | # Methods and Functions (KEYWORD2) 12 | ####################################### 13 | Capacity KEYWORD2 14 | Count KEYWORD2 15 | Contains KEYWORD2 16 | IndexOf KEYWORD2 17 | First KEYWORD2 18 | Last KEYWORD2 19 | Add KEYWORD2 20 | AddRange KEYWORD2 21 | Insert KEYWORD2 22 | InsertRange KEYWORD2 23 | RemoveFirst KEYWORD2 24 | Remove KEYWORD2 25 | RemoveLast KEYWORD2 26 | RemoveRange KEYWORD2 27 | Replace KEYWORD2 28 | ReplaceRange KEYWORD2 29 | Reverse KEYWORD2 30 | Clear KEYWORD2 31 | IsEmpty KEYWORD2 32 | IsFull KEYWORD2 33 | Trim KEYWORD2 34 | ToArray KEYWORD2 35 | CopyTo KEYWORD2 36 | FromArray KEYWORD2 37 | 38 | ####################################### 39 | # Constants (LITERAL1) 40 | ####################################### 41 | -------------------------------------------------------------------------------- /library.properties: -------------------------------------------------------------------------------- 1 | name=ListLib 2 | version=1.0.0 3 | author=Luis Llamas 4 | maintainer=Luis Llamas 5 | sentence=List Library 6 | paragraph=Arduino Library that implements a dynamic-sized array, that is, a collection in which it is possible to add or remove elements, and the collection increases or decreases its capacity depending on the number of items stored. 7 | category=Other 8 | url=https://github.com/luisllamasbinaburo/Arduino-List 9 | architectures=* 10 | -------------------------------------------------------------------------------- /src/ListLib.h: -------------------------------------------------------------------------------- 1 | /*************************************************** 2 | Copyright (c) 2017 Luis Llamas 3 | (www.luisllamas.es) 4 | 5 | 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 6 | 7 | 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 8 | ****************************************************/ 9 | 10 | #ifndef _ListLib_h 11 | #define _ListLib_h 12 | 13 | #if defined(ARDUINO) && ARDUINO >= 100 14 | #include 15 | #else 16 | #include "WProgram.h" 17 | #endif 18 | 19 | template 20 | class List 21 | { 22 | public: 23 | List(); 24 | List(size_t capacity); 25 | ~List(); 26 | 27 | size_t Capacity() const; 28 | size_t Count() const; 29 | 30 | T& operator[](const size_t index); 31 | 32 | bool Contains(T item); 33 | size_t IndexOf(T item); 34 | 35 | T& First(); 36 | T& Last(); 37 | 38 | void Add(T item); 39 | void AddRange(T* items, size_t numItems); 40 | 41 | void Insert(T item); 42 | void Insert(size_t index, T item); 43 | void InsertRange(T* items, size_t numItems); 44 | void InsertRange(size_t index, T* items, size_t numItems); 45 | 46 | void RemoveFirst(); 47 | void Remove(size_t index); 48 | void RemoveLast(); 49 | void RemoveRange(size_t index, size_t numItems); 50 | 51 | void Replace(size_t index, T item); 52 | void ReplaceRange(size_t index, T* items, size_t numItems); 53 | 54 | void Reverse(); 55 | void Clear(); 56 | bool IsEmpty(); 57 | bool IsFull(); 58 | void Trim(); 59 | void Trim(size_t reserve); 60 | 61 | T* ToArray(); 62 | T* ToArray(size_t index, size_t numItems); 63 | void CopyTo(T* items); 64 | void CopyTo(T* items, size_t index, size_t numItems); 65 | void FromArray(T* items, size_t numItems); 66 | 67 | 68 | private: 69 | T* _items; 70 | 71 | size_t _count = 0; 72 | size_t _capacity = 4; 73 | 74 | void shift(size_t index, size_t numItems); 75 | void unshift(size_t index, size_t numItems); 76 | void reserve(size_t size); 77 | void resize(size_t size); 78 | }; 79 | 80 | 81 | template 82 | List::List() 83 | { 84 | _items = new T[_capacity]; 85 | } 86 | 87 | template 88 | List::List(size_t capacity) 89 | { 90 | _capacity = capacity; 91 | _items = new T[_capacity]; 92 | } 93 | 94 | template 95 | List::~List() 96 | { 97 | delete[] _items; 98 | } 99 | 100 | template 101 | T& List::operator[](const size_t index) 102 | { 103 | return _items[index]; 104 | } 105 | 106 | template 107 | size_t List::Capacity() const 108 | { 109 | return _capacity; 110 | } 111 | 112 | template 113 | size_t List::Count() const 114 | { 115 | return _count; 116 | } 117 | 118 | template 119 | T& List::First() 120 | { 121 | return _items[0]; 122 | } 123 | 124 | template 125 | T& List::Last() 126 | { 127 | return _items[_count - 1]; 128 | } 129 | 130 | template 131 | void List::Add(T item) 132 | { 133 | ++_count; 134 | reserve(_count); 135 | _items[_count - 1] = item; 136 | } 137 | 138 | template 139 | void List::AddRange(T* items, size_t numItems) 140 | { 141 | reserve(_count + numItems); 142 | memmove(_items + _count , items, numItems * sizeof(T)); 143 | _count += numItems; 144 | } 145 | 146 | template 147 | void List::Insert(T item) 148 | { 149 | ++_count; 150 | reserve(_count); 151 | shift(0, 1); 152 | _items[0] = item; 153 | } 154 | 155 | template 156 | void List::InsertRange(T* items, size_t numItems) 157 | { 158 | _count += numItems; 159 | reserve(_count); 160 | shift(0, numItems); 161 | memmove(_items, items, numItems * sizeof(T)); 162 | } 163 | 164 | template 165 | void List::Insert(size_t index, T item) 166 | { 167 | if (index > _count - 1) return; 168 | 169 | ++_count; 170 | reserve(_count); 171 | shift(index, 1); 172 | _items[index] = item; 173 | } 174 | 175 | template 176 | void List::InsertRange(size_t index, T* items, size_t numItems) 177 | { 178 | if (index > _count - 1) return; 179 | 180 | _count += numItems; 181 | reserve(_count); 182 | shift(index, numItems); 183 | memmove(_items + index, items, numItems * sizeof(T)); 184 | } 185 | 186 | template 187 | void List::RemoveFirst() 188 | { 189 | if (_count == 0) return; 190 | 191 | unshift(0, 1); 192 | --_count; 193 | } 194 | 195 | template 196 | void List::Remove(size_t index) 197 | { 198 | if (index > _count - 1) return; 199 | 200 | unshift(index, 1); 201 | --_count; 202 | } 203 | 204 | template 205 | void List::RemoveLast() 206 | { 207 | if (_count == 0) return; 208 | 209 | --_count; 210 | } 211 | 212 | template 213 | void List::RemoveRange(size_t index, size_t numItems) 214 | { 215 | unshift(index, numItems); 216 | _count -= numItems; 217 | } 218 | 219 | template 220 | void List::Replace(size_t index, T item) 221 | { 222 | if (index > _count - 1) return; 223 | 224 | _items[index] = item; 225 | } 226 | 227 | template 228 | void List::ReplaceRange(size_t index, T* items, size_t numItems) 229 | { 230 | memmove(_items + index, items, numItems * sizeof(T)); 231 | } 232 | 233 | template 234 | void List::Reverse() 235 | { 236 | T item; 237 | for (int index = 0; index < _count / 2; index++) 238 | { 239 | item = _items[index]; 240 | _items[index] = _items[_count - 1 - index]; 241 | _items[_count -1 - index] = item; 242 | } 243 | } 244 | 245 | template 246 | void List::Clear() 247 | { 248 | _count = 0; 249 | } 250 | 251 | template 252 | bool List::IsEmpty() 253 | { 254 | return (_count == 0); 255 | } 256 | 257 | template 258 | bool List::IsFull() 259 | { 260 | return (_count >= _capacity); 261 | } 262 | 263 | template 264 | void List::Trim() 265 | { 266 | resize(_count); 267 | } 268 | 269 | template 270 | void List::Trim(size_t reserve) 271 | { 272 | resize(_count + reserve); 273 | } 274 | 275 | template 276 | T* List::ToArray() 277 | { 278 | T* items = new T[_count]; 279 | memmove(items, _items, _count * sizeof(T)); 280 | return items; 281 | } 282 | 283 | template 284 | T* List::ToArray(size_t index, size_t numItems) 285 | { 286 | T* items = new T[numItems]; 287 | memmove(items, _items + index, numItems * sizeof(T)); 288 | return items; 289 | } 290 | 291 | template 292 | void List::CopyTo(T* items) 293 | { 294 | memmove(items, _items, _count * sizeof(T)); 295 | } 296 | 297 | template 298 | void List::CopyTo(T* items, size_t index, size_t numItems) 299 | { 300 | memmove(items, _items + index , numItems * sizeof(T)); 301 | } 302 | 303 | template 304 | void List::FromArray(T* items, size_t numItems) 305 | { 306 | reserve(numItems); 307 | _count = numItems; 308 | memmove(_items, items, numItems * sizeof(T)); 309 | } 310 | 311 | template 312 | bool List::Contains(T item) 313 | { 314 | for (int index = 0; index < _count; index++) 315 | if (_items[index] == item) 316 | return true; 317 | return false; 318 | } 319 | 320 | template 321 | size_t List::IndexOf(T item) 322 | { 323 | for (int index = 0; index < _count; index++) 324 | if (_items[index] == item) 325 | return index; 326 | return -1; 327 | } 328 | 329 | template 330 | void List::shift(size_t index, size_t numItems) 331 | { 332 | memmove(_items + index + numItems, _items + index, (_count - index - 1) * sizeof(T)); 333 | } 334 | 335 | template 336 | void List::unshift(size_t index, size_t numItems) 337 | { 338 | memmove(_items + index , _items + index + numItems, (_count - index - numItems + 1) * sizeof(T)); 339 | } 340 | 341 | template 342 | void List::reserve(size_t size) 343 | { 344 | if (_count > _capacity) 345 | { 346 | size_t newSize = _capacity * 2 > size ? _capacity * 2 : size; 347 | resize(newSize); 348 | } 349 | } 350 | 351 | template 352 | void List::resize(size_t size) 353 | { 354 | if (_count > size) return; 355 | if (_capacity == size) return; 356 | 357 | T* newItems = new T[size]; 358 | memmove(newItems, _items, _count * sizeof(T)); 359 | delete[] _items; 360 | _capacity = size; 361 | _items = newItems; 362 | } 363 | 364 | #endif 365 | --------------------------------------------------------------------------------