

N::integer() >= 0 or {size, N::integer() >= 0}: Specifies the initial size of the array; this also implies {fixed, true}. If N is not a nonnegative integer, the call fails with reason badarg.  
fixed or {fixed, true}: Creates a fixedsize array; see also fix/1.  
{fixed, false}: Creates an extendible (non fixedsize) array.  
{default, Value}: Sets the default value for the array to Value.  
Options are processed in the order they occur in the list, i.e., later options have higher precedence.
The default value is used as the value of uninitialized entries, and cannot be changed once the array has been created.
Examples:
array:new(100)
creates a fixedsize array of size 100.
array:new({default,0})
creates an empty, extendible array whose default value is 0.
array:new([{size,10},{fixed,false},{default,1}])
creates an extendible array with initial size 10 whose default value is 1.
See also: fix/1, from_list/2, get/2, new/0, new/2, set/3.
new(Size :: integer() >= 0, Options :: array_opts()) > array()
Create a new array according to the given size and options. If Size is not a nonnegative integer, the call fails with reason badarg. By default, the array has fixed size. Note that any size specifications in Options will override the Size parameter.
If Options is a list, this is simply equivalent to new([{size, Size}  Options], otherwise it is equivalent to new([{size, Size}  [Options]]. However, using this function directly is more efficient.
Example:
array:new(100, {default,0})creates a fixedsize array of size 100, whose default value is 0.
See also: new/1.
relax(Array :: array(Type)) > array(Type)
Make the array resizable. (Reverses the effects of fix/1.)
See also: fix/1.
reset(I :: array_indx(), Array :: array(Type)) > array(Type)
Reset entry I to the default value for the array. If the value of entry I is the default value the array will be returned unchanged. Reset will never change size of the array. Shrinking can be done explicitly by calling resize/2.
If I is not a nonnegative integer, or if the array has fixed size and I is larger than the maximum index, the call fails with reason badarg; cf. set/3
See also: new/2, set/3.
resize(Array :: array(Type)) > array(Type)
Change the size of the array to that reported by sparse_size/1. If the given array has fixed size, the resulting array will also have fixed size.
See also: resize/2, sparse_size/1.
resize(Size :: integer() >= 0, Array :: array(Type)) > array(Type)
Change the size of the array. If Size is not a nonnegative integer, the call fails with reason badarg. If the given array has fixed size, the resulting array will also have fixed size.
set(I :: array_indx(), Value :: Type, Array :: array(Type)) > array(Type)
Set entry I of the array to Value. If I is not a nonnegative integer, or if the array has fixed size and I is larger than the maximum index, the call fails with reason badarg.
If the array does not have fixed size, and I is greater than size(Array)1, the array will grow to size I+1.
See also: get/2, reset/2.
size(Array :: array()) > integer() >= 0
Get the number of entries in the array. Entries are numbered from 0 to size(Array)1; hence, this is also the index of the first entry that is guaranteed to not have been previously set.
See also: set/3, sparse_size/1.
sparse_foldl(Function, InitialAcc :: A, Array :: array(Type)) > B
Types:
Function =
fun((Index :: array_indx(), Value :: Type, Acc :: A) > B)
Fold the elements of the array using the given function and initial accumulator value, skipping defaultvalued entries. The elements are visited in order from the lowest index to the highest. If Function is not a function, the call fails with reason badarg.
See also: foldl/3, sparse_foldr/3.
sparse_foldr(Function, InitialAcc :: A, Array :: array(Type)) > B
Types:
Function =
fun((Index :: array_indx(), Value :: Type, Acc :: A) > B)
Fold the elements of the array righttoleft using the given function and initial accumulator value, skipping defaultvalued entries. The elements are visited in order from the highest index to the lowest. If Function is not a function, the call fails with reason badarg.
See also: foldr/3, sparse_foldl/3.
sparse_map(Function, Array :: array(Type1)) > array(Type2)
Types:
Function = fun((Index :: array_indx(), Type1) > Type2)
Map the given function onto each element of the array, skipping defaultvalued entries. The elements are visited in order from the lowest index to the highest. If Function is not a function, the call fails with reason badarg.
See also: map/2.
sparse_size(Array :: array()) > integer() >= 0
Get the number of entries in the array up until the last nondefault valued entry. In other words, returns I+1 if I is the last nondefault valued entry in the array, or zero if no such entry exists.
See also: resize/1, size/1.
sparse_to_list(Array :: array(Type)) > [Value :: Type]
Converts the array to a list, skipping defaultvalued entries.
See also: to_list/1.
sparse_to_orddict(Array :: array(Type)) > indx_pairs(Value :: Type)
Convert the array to an ordered list of pairs {Index, Value}, skipping defaultvalued entries.
See also: to_orddict/1.
to_list(Array :: array(Type)) > [Value :: Type]
Converts the array to a list.
See also: from_list/2, sparse_to_list/1.
to_orddict(Array :: array(Type)) > indx_pairs(Value :: Type)
Convert the array to an ordered list of pairs {Index, Value}.
See also: from_orddict/2, sparse_to_orddict/1.
Ericsson AB  ARRAY (3)  stdlib 2.8 
Visit the GSP FreeBSD Man Page Interface.
Output converted with manServer 1.07.