-
Notifications
You must be signed in to change notification settings - Fork 0
array
template <class value_type> struct array
This structure implements dynamic array.
-
typedef value_type type
so that generic wrappers can access this containersvalue_type
- array::iterator
- array::const_iterator
-
value_type *data
is a pointer to the data in memory. -
int count
keeps track of the number of elements stored in this array. -
int capacity
keeps track of the number of elements we can store at this location in memory.
The default constructor, initializes data
to NULL
, count
to 0
and capacity
to 0
.
array(const value_type &value)
array(const container_type &store)
array(const array<value_type> &store)
array(iterator left, iterator right)
array(const_iterator left, const_iterator right)
array(typename container_type::iterator left, typename container_type::iterator right)
array(typename container_type::const_iterator left, typename container_type::const_iterator right)
Basic functions necessary for algorithm execution.
returns the number of values in this range: finish-start
.
returns an iterator to the first element.
returns an iterator to one after the last element.
returns an iterator to the last element.
returns an iterator to one before the first element.
returns an iterator to the i
th element.
Returns the value of the first element: start
.
Returns the value of the last element: finish-1
.
Returns the value of the i
th element: start+i
.
Returns the value of the i
th element: start+i
.
wraps this range with a slice. This is particularly useful if an algorithm gives you a container filled with iterators. You can convert it into a slice with a single call to this function.
This is orthogonal to deref()
. If this container is filled with iterators, it returns the index of each iterator.
returns a slice of this container of the elements within the range [start
,end
).
returns a slice of this container of the elements after start
.
returns a slice of all the elements in this container.
returns a slice of all the elements within the range [start
,end
) of a range container.
see above. This returns a copy instead of a slice.
see above. This returns a copy instead of a slice.
see above. This returns a copy instead of a slice.
uses the values of the range container as indices into c
. Returns another range container with the indexed value from c
.
swaps the contents of this range container with another.
sets the contents of this range container equal the contents of another.
bool operator==(range<value_type1> s1, range<value_type2> s2)
bool operator!=(range<value_type1> s1, range<value_type2> s2)
bool operator<(range<value_type1> s1, range<value_type2> s2)
bool operator>(range<value_type1> s1, range<value_type2> s2)
bool operator<=(range<value_type1> s1, range<value_type2> s2)
bool operator>=(range<value_type1> s1, range<value_type2> s2)
Compares two range containers by comparing start
followed by finish
.
bool operator==(range<value_type1> s1, core::slice<container2> s2)
bool operator!=(range<value_type1> s1, core::slice<container2> s2)
bool operator<(range<value_type1> s1, core::slice<container2> s2)
bool operator>(range<value_type1> s1, core::slice<container2> s2)
bool operator<=(range<value_type1> s1, core::slice<container2> s2)
bool operator>=(range<value_type1> s1, core::slice<container2> s2)
bool operator==(core::slice<container1> s1, range<value_type2> s2)
bool operator!=(core::slice<container1> s1, range<value_type2> s2)
bool operator<(core::slice<container1> s1, range<value_type2> s2)
bool operator>(core::slice<container1> s1, range<value_type2> s2)
bool operator<=(core::slice<container1> s1, range<value_type2> s2)
bool operator>=(core::slice<container1> s1, range<value_type2> s2)
Compares a range container to a generic slice by calling compare()
.
#include <std/ascii_stream.h>
#include <std/array.h>
using namespace core;
int main()
{
array<int> arr = range<int>(0, 10);
cout << arr << endl;
return 0;
}