the_Foundation 1.0
Loading...
Searching...
No Matches
Data Structures | Macros | Functions
array.h File Reference
#include "defs.h"
#include "range.h"

Data Structures

struct  iArray
 
struct  iArrayReverseIterator
 
struct  iArrayReverseConstIterator
 

Macros

#define value_Array(d, index, type)   (*(type *) at_Array((d), (index)))
 
#define constValue_Array(d, index, type)   (*(const type *) constAt_Array((d), (index)))
 

Functions

iArray * new_Array (size_t elementSize)
 
void delete_Array (iArray *)
 
void init_Array (iArray *, size_t elementSize)
 
void deinit_Array (iArray *)
 
iArray * newN_Array (size_t elementSize, const void *value, size_t count)
 
iArray * newElements_Array (size_t elementSize, const void *value,...)
 
iArray * copy_Array (const iArray *)
 
iArray * collectNew_Array (size_t elementSize)
 
void initCopy_Array (iArray *, const iArray *other)
 
void * data_Array (iArray *)
 
const void * constData_Array (const iArray *)
 
void * at_Array (iArray *, size_t pos)
 
const void * constAt_Array (const iArray *, size_t pos)
 
void * end_Array (iArray *)
 
const void * constEnd_Array (const iArray *)
 
size_t indexOf_Array (const iArray *, const void *element)
 
size_t size_Array (const iArray *)
 
iBool equal_Array (const iArray *, const iArray *other)
 
void reserve_Array (iArray *, size_t reservedSize)
 
void clear_Array (iArray *)
 
void resize_Array (iArray *, size_t size)
 
void fill_Array (iArray *, char value)
 
void sort_Array (iArray *, int(*cmp)(const void *, const void *))
 
void setN_Array (iArray *, size_t pos, const void *value, size_t count)
 
void pushBackN_Array (iArray *, const void *value, size_t count)
 
void pushFrontN_Array (iArray *, const void *value, size_t count)
 
size_t popBackN_Array (iArray *, size_t count)
 
size_t popFrontN_Array (iArray *, size_t count)
 
size_t takeN_Array (iArray *, size_t pos, void *value_out, size_t count)
 
void insertN_Array (iArray *, size_t pos, const void *value, size_t count)
 
void removeN_Array (iArray *, size_t pos, size_t count)
 
void move_Array (iArray *, iRanges range, iArray *dest, size_t destPos)
 
Iterators
void init_ArrayIterator (iArrayIterator *, iArray *)
 
void next_ArrayIterator (iArrayIterator *)
 
void init_ArrayReverseIterator (iArrayReverseIterator *, iArray *)
 
void next_ArrayReverseIterator (iArrayReverseIterator *)
 
void init_ArrayConstIterator (iArrayConstIterator *, const iArray *)
 
void next_ArrayConstIterator (iArrayConstIterator *)
 
void init_ArrayReverseConstIterator (iArrayReverseConstIterator *, const iArray *)
 
void next_ArrayReverseConstIterator (iArrayReverseConstIterator *)
 
size_t index_ArrayIterator (const iArrayIterator *)
 
size_t index_ArrayConstIterator (const iArrayConstIterator *)
 
size_t index_ArrayReverseIterator (const iArrayReverseIterator *)
 
size_t index_ArrayReverseConstIterator (const iArrayReverseConstIterator *)
 
void remove_ArrayIterator (iArrayIterator *)
 

Detailed Description

Array of sequential fixed-size elements.

Array elements are packed sequentially inside a single block of memory. New elements can be efficiently added to or removed from the start/end of the array.

             start                          end
               v                             v
| ....... | Element | Element | Element | ....... |
Complexity
Authors
Copyright (c) 2017 Jaakko Keränen jaakk.nosp@m.o.ke.nosp@m.ranen.nosp@m.@iki.nosp@m..fi
License

Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:

  1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
  2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.