Arrays: Difference between revisions

This task is about arrays.

{{trans|Python}}

array.append(1)

array.append(3)

=={{header|360 Assembly}}==

ARRAYS PROLOG

* we use TA array with 1 as origin. So TA(1) to TA(20)

An array is little more than just a contiguous section of memory. Whether or not an array is mutable depends solely on whether it is defined in ROM or RAM. The syntax will be discussed in further detail in the Two-Dimensional Arrays section.

db 5,10,15,20,25,30,35,40,45,50</syntaxhighlight>

Looking up a value in an array is fairly straightforward. The best addressing modes for doing so are <code>LDA $????,x</code>,<code>LDA $????,y</code>, and <code>LDA ($??),y</code>. In this case, x or y represents the index into the array. To put it in terms of C:

{

char array[5] = {3,6,9,12,15};

would (theoretically) compile to the following in 6502 Assembly:

foo:

LDX #2 ;load the desired index

One important thing to note is a hardware bug involving <code>LDA $??,x</code>. If the sum of $?? and x would exceed 255, instead of continuing past $100, the CPU will actually wrap around back to $00. This does not happen with absolute addressing modes or indexed indirect with Y. Here's an example:

LDA $80,x ;evaluates to LDA $00

LDA $0480,x ;evaluates to LDA $0500</syntaxhighlight>

===Arrays of 16-Bit Data===

You can have arrays of 16-bit data as well as 8-bit ones. There are a few ways to do this, and we'll go over the "naive" way first:

dw $ABCD,$BEEF,$CAFE,$DADA</syntaxhighlight>

The 6502 is little-endian, so the above would be exactly the same as the following:

db $CD,$AB,$EF,$BE,$FE,$CA,$DA,$DA</syntaxhighlight>

To properly index a 16-bit array that's formatted as in the above example, you'll need to double your index. In this example, we'll be loading the offset of <code>$BEEF</code>:

LDA wordArray,X ;evaluates to LDA #$EF

STA $00 ;store in a zero page temporary variable

However, if you split the word table into two byte tables, you can actually get more bang for your buck, and it takes the same amount of memory no matter which way you store the data.

db $CD,$EF,$FE,$DA

If both wordArray_Lo and wordArray_Hi were 256 bytes each, you'd be able to index both of them no problem, where you wouldn't be able to do that if it were one array. Let's try loading <code>$BEEF</code> again:

LDA wordArray_Lo,x ;evaluates to LDA #$EF

STA $00

I'll let you in on a little secret: two-dimensional arrays don't exist. This is just as true for modern computers as it is the 6502.

In the first section I had this example of an array:

db 5,10,15,20,25,30,35,40,45,50</syntaxhighlight>

In the eyes of the CPU, this is the same as ANY of the following:

db 5

db 10

db 50</syntaxhighlight>

db 5,10

db 15,20

or any other way to write it you can imagine. All that matters is the order of the bytes in the array - as long as that is the same you can write it however you want. It's best to write it in the way it's meant to be interpreted, however. But in order to explain that to the computer you'll need a little bit of finesse. Let's pretend that the "correct" interpretation is this 5 by 2 array:

db 5,10

db 15,20

For this example, we want row 3 and column 1 (zero-indexed for both) which means we want to load 40.

LDA #3 ;desired row

ASL A ;Times 2 bytes per row (if the array's row size wasn't a multiple of 2 we'd need to actually do multiplication)

Creating an array is as simple as declaring its base address. Note that all bounds checking must be done by the programmer and is not built in by default. You also will need to have some sort of knowledge about what is stored nearby, so that you don't clobber it.

Defining an array in ROM (or RAM if you're making a program that is loaded from disk) is very simple:

MyArray:

DC.B 1,2,3,4,5

Strings are also arrays and most assemblers accept single or double quotes. The following are equivalent:

DC.B "Hello World",0

even

The base address can be offset by the value in a data register, to allow for assigning values to an array. The offset is always measured in bytes, so if your array is intended to contain a larger data size you will need to adjust it accordingly.

LEA myArray,A0 ;load the base address of the array into A0

This is the equivalent of the [[C]] code:

myArray[3] = 23;</syntaxhighlight>

Loading an element is very similar to storing it.

;load element 4

Inserting an element at a desired position is a bit more tricky. First of all, an array has no "end" in hardware. So how do you know where to stop? For this example, assume this array is currently contains 6 total elements (0,1,2,3,4,5) and we want to extend it.

;insert a new element into the 2nd slot and push everything behind it back.

<li>In external RAM - element retrieval/altering is most efficiently done sequentially, necessary for large arrays or peripherals</ul>

Dynamic (resizable) arrays are possible to implement, but are error-prone since bounds checking must be done by the programmer.

myarray db 'Array' ; db = define bytes - initializes 5 bytes with values 41, 72, 72, etc. (the ascii characters A,r,r,a,y)

myarray2 dw 'A','r','r','a','y' ; dw = define words - initializes 5 words (1 word = 2 bytes) with values 41 00 , 72 00, 72 00, etc.

Arrays are declared using JSON syntax, and are dynamic (but not sparse)

[ 1 , 2 ,3 ] \ an array holding three numbers

1 a:@ \ this will be '2', the element at index 1

=={{header|AArch64 Assembly}}==

{{works with|as|Raspberry Pi 3B version Buster 64 bits}}

/* ARM assembly AARCH64 Raspberry PI 3B */

/* program areaString64.s */

=={{header|ABAP}}==

There are no real arrays in ABAP but a construct called internal tables.

TYPES: tty_int TYPE STANDARD TABLE OF i

WITH NON-UNIQUE DEFAULT KEY.

=={{header|ACL2}}==

(assign array-example

(compress1 'array-example

=={{header|Action!}}==

BYTE i

=={{header|ActionScript}}==

var array1:Array = new Array(10);

//creates an array with the values 1, 2

=={{header|Ada}}==

A, B : array (1..20) of Integer;

=={{header|Aikido}}==

Aikido arrays (or vectors) are dynamic and not fixed in size. They can hold a set of any defined value.

var arr1 = [1,2,3,4] // initialize with array literal

var arr2 = new [10] // empty array of 10 elements (each element has value none)

=={{header|Aime}}==

The aime ''list'' is a heterogeneous, dynamic sequence. No special creation procedure, only declaration is needed:

Values (numbers, strings, collections, functions, etc) can be added in a type generic fashion:

l_append(l, "arrays");

l_append(l, pow);</syntaxhighlight>

The insertion position can be specified:

l_push(l, 4, __type(l));</syntaxhighlight>

More aptly, values (of selected types) can be inserted in a type specific fashion:

l_p_real(l, 6, 88);</syntaxhighlight>

Similarly, values can be retrieved in a type generic fashion:

or is type specific fashion:

l_q_text(l, 1);</syntaxhighlight>

=={{header|ALGOL 60}}==

{{trans|Simula}}

comment arrays - Algol 60;

=={{header|ALGOL 68}}==

(

[1:20]INT a;

=={{header|ALGOL W}}==

% declare an array %

integer array a ( 1 :: 10 );

=={{header|AmigaE}}==

da: PTR TO CHAR,

la: PTR TO CHAR

=={{header|AntLang}}==

arr: <1;2;3>

=={{header|Apex}}==

array[0] = 42;

System.debug(array[0]); // Prints 42</syntaxhighlight>

Dynamic arrays can be made using <code>List</code>s. <code>List</code>s and array can be used interchangeably in Apex, e.g. any method that accepts a <code>List<String></code> will also accept a <code>String[]</code>

aList.add(5);// appends to the end of the list

aList.add(1, 6);// assigns the element at index 1

=={{header|APL}}==

Arrays in APL are one dimensional matrices, defined by seperating variables with spaces. For example:

=={{header|App Inventor}}==

=={{header|AppleScript}}==

AppleScript arrays are called lists:

set ints to {1, 2, 3}</syntaxhighlight>

Lists can contain any objects including other lists:

Items can be appended to the beginning or end of a list:

set beginning of any to false

set end of any to Wednesday

Or a new list containing the items can be created through concatenation:

set any to false & any & Wednesday

--> {false, 1, "foo", 2.57, missing value, {1, 2, 3}, Wednesday}</syntaxhighlight>

List indices are 1-based and negative numbers can be used to index items from the end of the list instead of from the beginning. Items can be indexed individually or by range:

item -1 of any --> {1, 2, 3}

items 1 thru 3 of any --> {1, "foo", 2.57}</syntaxhighlight>

If required, items can be specified by class instead of the generic 'item' …

number 2 of any -- 2.57 (ie. the second number in the list)</syntaxhighlight>

… and some fairly complex range specifiers are possible:

integers from text 1 to list 1 of any --> {5, 4, 38}</syntaxhighlight>

The length of a list can be determined in any of three ways, although only the first two below are now recommended:

length of any -- Property.

number of any -- Property.</syntaxhighlight>

The number of items of a specific class can also be obtained:

length of any's integers</syntaxhighlight>

Through AppleScriptObjC, AppleScript is also able to make use of Objective-C arrays and many of their methods, with bridging possible between lists and NSArrays:

use framework "Foundation" -- Allows access to NSArrays and other Foundation classes.

=={{header|Argile}}==

{{works with|Argile|1.0.0}}

(:::::::::::::::::

{{works with|Argile|1.1.0}}

let x = @["foo" "bar" "123"]

print x[2]

=={{header|ARM Assembly}}==

{{works with|as|Raspberry Pi}}

/* ARM assembly Raspberry PI */

/* program areaString.s */

=={{header|Arturo}}==

arrA: []

{{works with|AutoHotkey_L}}

The current, official build of AutoHotkey is called AutoHotkey_L. In it, arrays are called Objects, and associative/index based work hand-in-hand.

myArray[1] := "foo"

myArray[2] := "bar"

However, variable names could be concatenated, simulating associative arrays.

By convention, based on built-in function stringsplit, indexes are 1-based and "0" index is the length.

arrayX1 = first

arrayX2 = second

=={{header|AutoIt}}==

Create an userdefined array.

#include <Array.au3> ;Include extended Array functions (_ArrayDisplay)

=={{header|Avail}}==

Avail supports tuples as its primary ordered collection.

Tuple indices (officially referred to as "subscripts") are 1-based. One can provide an alternative if there is no element at a subscript using an else clause.

<3, 2, 1>[100] else [0]</syntaxhighlight>

Tuples are immutable, however one can quickly create a new tuple with a specified element replaced.

=={{header|AWK}}==

An ordered array just uses subscripts as integers. Array subscripts can start at 1, or any other integer. The built-in split() function makes arrays that start at 1.

# to make an array, assign elements to it

array[1] = "first"

=={{header|Axe}}==

2→{L₁+1}

3→{L₁+2}

There are two kinds of array in Babel: value-arrays and pointer-arrays. A value-array is a flat array of data words. A pointer-array is an array of pointers to other things (including value-arrays). You can create a data-array with plain square-brackets. You can create a value-array with the [ptr ] list form:

===Get a single array element===

{{Out}}

Changing a value-array element:

</syntaxhighlight>

Changing a pointer-array element:

{{Out}}

===Select a range of an array===

{{Out}}

You can concatenate arrays of same type:

Concatenation creates a new array - it does not add to an array in-place. Instead, Babel provides operators and standard utilities for converting an array to a list in order to manipulate it, and then convert back.

Convert a value-array to a list of values:

{{Out}}

Convert a list of values to a value-array:

{{Out}}

Convert a pointer-array to a list of pointers:

{{Out}}

Convert a list of pointers to a pointer-array:

{{Out}}

Note: We need to use quotes in DATA

DATA "January", "February", "March", "April", "May", "June", "July"

DATA "August", "September", "October", "November", "December"

2.) A modern BaCon approach to do arrays using strings

DECLARE A$[11] = {"January", "February", "March", "April", "May", \

"June", "July", "August", "September", "October", "November", "December"} TYPE STRING

name this '''split.bac'''

SPLIT ARGUMENT$ BY " " TO TOK$ SIZE len_array

in the terminal

./split January February March April May June July August September October November December

</syntaxhighlight>

The default array base (lower bound) can be set with OPTION BASE. If OPTION BASE is not set, the base may be either 0 or 1, depending on implementation. The value given in DIM statement is the upper bound. If the base is 0, then DIM a(100) will create an array containing 101 elements.

DIM myArray(100) AS INTEGER </syntaxhighlight>

Alternatively, the lower and upper bounds can be given while defining the array:

Dynamic arrays:

'$DYNAMIC

DIM SHARED myArray(-10 TO 10, 10 TO 30) AS STRING

BASIC does not generally have option for initializing arrays to other values, so the initializing is usually done at run time.

DATA and READ statements are often used for this purpose:

DATA January, February, March, April, May, June, July

DATA August, September, October, November, December

FreeBASIC has an option to initialize array while declaring it.

20 REM ELEMENT NUMBERS TRADITIONALLY START AT ONE

30 DIM A%(11): REM ARRAY OF ELEVEN INTEGER ELEMENTS

===Static===

staticArray(0) = -1

Note that BASIC dynamic arrays are not stack-based; instead, their size must be changed in the same manner as their initial declaration -- the only difference between static and dynamic arrays is the keyword used to declare them (<code>DIM</code> vs. <code>REDIM</code>). [[QBasic]] lacks the <code>PRESERVE</code> keyword found in some modern BASICs; resizing an array without <code>PRESERVE</code> zeros the values.

dynamicArray(0) = -1

==={{header|Applesoft BASIC}}===

20 LET A%(0) = -1

30 LET A%(11) = 1

=={{header|BASIC256}}==

dim numbers(10)

for t = 0 to 9

Arrays can be approximated, in a style similar to REXX

@echo off

setlocal ENABLEDELAYEDEXPANSION

=={{header|BBC BASIC}}==

DIM array(6), array%(6), array$(6)

The following is a transcript of an interactive session:

g[3] = 42

/* Look at some other elements in g */

'''Note:''' Variables in BML can either be placed in a prefix group($, @, and &) or in the world. Placing variables in the world is not recommended since it can take large sums of memory when using said variable.

% Define an array(containing the numbers 1-3) named arr in the group $

in $ let arr hold 1 2 3

=={{header|Boo}}==

myArray as (int) = (1, 2, 3) // Size based on initialization

fixedArray as (int) = array(int, 1) // Given size(1 in this case)

All arrays are variable length, and can contain any types of values.

arr ← 1‿2‿'a'‿+‿5

# General List Syntax:

# Modifying the array(↩):

arr ↩ "hello"⌾(4⊸⊑) arr</syntaxhighlight>

⟨ 1 2 'a' + 5 ⟩

⟨ 1 2 'a' + 5 ⟩

To delete and array (and therefore the variable with the array's name), call <code>tbl</code> with a size <code>0</code>.

& 5:?(30$mytable)

& 9:?(31$mytable)

Note that Brainf*** does not natively support arrays, this example creates something that's pretty close, with access of elements at each index, altering elements, and changing size of list at runtime.

===========[

ARRAY DATA STRUCTURE

=={{header|C}}==

Fixed size static array of integers with initialization:

float myFloats[] ={1.2, 2.5, 3.333, 4.92, 11.2, 22.0 }; /* automatically sizes */</syntaxhighlight>

When no size is given, the array is automatically sized. Typically this is how initialized arrays are defined. When this is done, you'll often see a definition that produces the number of elements in the array, as follows.

When defining autosized multidimensional arrays, all the dimensions except the first (leftmost) need to be defined. This is required in order for the compiler to generate the proper indexing for the array.

float my2Dfloats[][3] = {

1.0, 2.0, 0.0,

When the size of the array is not known at compile time, arrays may be dynamically

allocated to the proper size. The <code>malloc()</code>, <code>calloc()</code> and <code>free()</code> functions require the header <code>stdlib.h</code>.

int *myArray = malloc(sizeof(int) * numElements); /* array of 10 integers */

if ( myArray != NULL ) /* check to ensure allocation succeeded. */

The first element of a C array is indexed with 0. To set a value:

myArray[1] = 3;</syntaxhighlight>

And to retrieve it (e.g. for printing, provided that the <tt>stdio.h</tt> header was included for the printf function)

The <tt>array[index]</tt> syntax can be considered as a shortcut for <tt>*(index + array)</tt> and

thus the square brackets are a commutative binary operator:

printf("%d\n", *(array + index));

3[array] = 5;</syntaxhighlight>

There's no bounds check on the indexes. Negative indexing can be implemented as in the following.

double *kernel = malloc(sizeof(double)*2*XSIZE+1);

if (kernel) {

Typically dynamic allocation is used and the allocated array is sized to the maximum that might be needed. A additional variable is

declared and used to maintain the current number of elements used. In C, arrays may be dynamically resized if they were allocated:

int *array = malloc (sizeof(int) * 20);

....

</syntaxhighlight>

A Linked List for chars may be implemented like this:

#include <stdlib.h>

#include <stdio.h>

Example of array of 10 int types:

Example of array of 3 string types:

You can also declare the size of the array and initialize the values at the same time:

The following creates a 3x2 int matrix

As with the previous examples you can also initialize the values of the array, the only difference being each row in the matrix must be enclosed in its own braces.

or

array[0] = 1;

Dynamic

using System.Collections.Generic;

<code>std::vector<T></code> is a resizable array of <code>T</code> objects.

The memory for the array will be allocated from the heap (unless a custom allocator is used).

#include <vector>

=={{header|Ceylon}}==

{{works with|Ceylon|1.3.0}}

ArrayList

=={{header|ChucK}}==

int array[0]; // instantiate int array

array << 1; // append item

===Lazy array===

Create a lazy array of strings using an array denotation.

array = {"Hello", "World"}</syntaxhighlight>

Create a lazy array of floating point values by sharing a single element.

array = createArray 10 3.1415</syntaxhighlight>

Create a lazy array of integers using an array (and also a list) comprehension.

array = {x \\ x <- [1 .. 10]}</syntaxhighlight>

===Strict array===

Create a strict array of integers.

array = {x \\ x <- [1 .. 10]}</syntaxhighlight>

===Unboxed array===

Create an unboxed array of characters, also known as <tt>String</tt>.

array = {x \\ x <- ['a' .. 'z']}</syntaxhighlight>

=={{header|Clipper}}==

Clipper arrays aren't divided to fixed-length and dynamic. Even if we declare it with a certain dimensions, it can be resized in the same way as it was created dynamically. The first position in an array is 1, not 0, as in some other languages.

Local arr1 := { { "NITEM","N",10,0 }, { "CONTENT","C",60,0} }

// Create an empty array

arr4 := ASize( arr4, 80 )</syntaxhighlight>

Items, including nested arrays, can be added to existing array, deleted from it, assigned to it

Aadd( arr1, { "LBASE","L",1,0 } )

// Delete the first item of arr3, The size of arr3 remains the same, all items are shifted to one position, the last item is replaced by Nil:

arr3[1,1,1] := 11.4</syntaxhighlight>

Retrieve items of an array:

// The retrieved item can be nested array, in this case it isn't copied, the pointer to it is assigned

</syntaxhighlight>

There is a set of functions to manage arrays in Clipper, including the following:

AFill( arr4, 0, 5, 20 )

//Copy 10 items from arr4 to arr3[2], starting from the first position:

=={{header|Clojure}}==

;is, instead clojure creates a new array with an added value using (conj...)

;in the example below the my-list does not change.

=={{header|COBOL}}==

In COBOL, arrays are called ''tables''. Also, indexes begin from 1.

PROGRAM-ID. arrays.

=={{header|CoffeeScript}}==

array1[0] = "Dillenidae"

array1[1] = "animus"

=={{header|ColdFusion}}==

Creating a one-dimensional Array:

Creating a two-dimensional Array in CFScript:

arr2 = ArrayNew(2);

</cfscript></syntaxhighlight>

=={{header|Common Lisp}}==

(setf (aref array 0) 1

(aref array 1) 3)

Dynamic

(vector-push-extend 1 array)

(vector-push-extend 3 array)

Creates a one-dimensional array of length 10. The initial contents are undefined.

Creates a two-dimensional array with dimensions 10x20.

<tt>make-array</tt> may be called with a number of optional arguments.

(make-array 20 :initial-element nil)

; Makes an integer array of 4 elements containing 1 2 3 and 4 initially which can be resized

MODULE TestArray;

(* Implemented in BlackBox Component Builder *)

===Fixed-length array===

We have finished iterating through the array when the next load instruction would be <tt>LDA ary+length(ary)</tt>.

ADD sum

STA sum

10</syntaxhighlight>

===Zero-terminated array===

BRZ done

=={{header|Crystal}}==

# create an array with one object in it

a = ["foo"]

=={{header|D}}==

import std.stdio, core.stdc.stdlib;

D) Element 1: 3</pre>

One more kind of built-in array:

void main() {

=={{header|Dao}}==

a = [ 1, 2, 3 ] # a vector

b = [ 1, 2; 3, 4 ] # a 2X2 matrix

=={{header|Dart}}==

main(){

// Dart uses Lists which dynamically resize by default

=={{header|DBL}}==

; Arrays for DBL version 4 by Dario B.

;

=={{header|Delphi}}==

This example creates a static and dynamic array, asks for a series of numbers storing them in the static one, puts in the dynamic one the numbers in reverse order, concatenates the number in two single string variables and display those strings in a popup window.

procedure TForm1.Button1Click(Sender: TObject);

var

=={{header|Diego}}==

set_base(0);

=={{header|Dragon}}==

array[0] = 42

showln array[2] </syntaxhighlight>

=={{header|DWScript}}==

// dynamic array, extensible, this a reference type

var d : array of Integer;

=={{header|Dyalect}}==

var empty = []

var xs = [1, 2, 3]

=={{header|Déjà Vu}}==

In Déjà Vu, the relevant datatype is called list, which is basically a stack with random element access for getting and setting values.

local :l []

Literal lists are <code>ConstList</code>s.

# value: []

Note that each of these operations returns a different list object rather than modifying the original. You can, for example, collect values:

# value: []

FlexLists can be created explicitly, but are typically created by ''diverging'' another list. A ConstList can be gotten from a FlexList by ''snapshot''.

# value: [1, 2].diverge()

Creating a FlexList with a specific size, generic initial data, and a type restriction:

Note that this puts the same value in every element; if you want a collection of some distinct mutable objects, see [[N distinct objects#E]].

=={{header|EasyLang}}==

for i range len f[]

f[i] = i

'''Fixed-length array'''

array int[10]; //optionally, add a braced list of values. E.g. array int[10]{1, 2, 3};

array[1] = 42;

=={{header|Eiffel}}==

class

APPLICATION

Static array

Generic array

array[0] := 1;

array[1] := 2;

array[2] := 3;</syntaxhighlight>

Stack allocated array

stackAllocatedArray[0] := 1;

stackAllocatedArray[1] := 2;

stackAllocatedArray[2] := 3;</syntaxhighlight>

Dynamic array

dynamicArray.append:1;

dynamicArray.append:2;

dynamicArray[2] := 3;</syntaxhighlight>

Printing an element

system'console.writeLine(stackAllocatedArray[1]);

system'console.writeLine(dynamicArray[2]);</syntaxhighlight>

The elixir language has array-like structures called ''tuples''. The values of tuples occur sequentially in memory, and can be of any type. Tuples are represented with curly braces:

Elements of tuples are indexed numerically, starting with zero.

elem(ret, 0) == :ok

put_elem(ret, 2, "pi") # => {:ok, "fun", "pi"}

Elements can be appended to tuples with <tt>Tuple.append/2</tt>, which returns a new tuple, without having modified the tuple given as an argument.

New tuple elements can be inserted with <tt>Tuple.insert/3</tt>, which returns a new tuple with the given value inserted at the indicated position in the tuple argument.

Elixir also has structures called ''lists'', which can contain values of any type, and are implemented as linked lists. Lists are represented with square brackets:

Lists can be indexed, appended, added, subtracted, and list elements can be replaced, updated, and deleted. In all cases, new lists are returned without affecting the list being operated on.

my_list ++ [4, :five] # => [1, :two, "three", 4, :five]

Lists have a ''head'', being the first element, and a ''tail'', which are all the elements of the list following the head.

[:apple, :banana, :cherry]

iex(2)> hd(fruit)

=={{header|Erlang}}==

%% Create a fixed-size array with entries 0-9 set to 'undefined'

A0 = array:new(10).

=={{header|Euphoria}}==

--Arrays task for Rosetta Code wiki

--User:Lnettnay

=={{header|F Sharp|F#}}==

'''Fixed-length arrays:'''

val it : char [] = [|'A'; 'A'; 'A'; 'A'; 'A'; 'A'|]

> Array.init 8 (fun i -> i * 10) ;;

If dynamic arrays are needed, it is possible to use the .NET class <code>System.Collections.Generic.List<'T></code> which is aliased as <code>Microsoft.FSharp.Collections.ResizeArray<'T></code>:

val arr : ResizeArray<int>

> arr.Add(42);;

Directly in the listener :

{

[ "The initial array: " write . ]

{ 1 "coucou" f [ ] }

Arrays of growable length are called Vectors.

{

[ "The initial vector: " write . ]

For example, a static array of 10 cells in the dictionary, 5 initialized and 5 uninitialized:

here constant MyArrayEnd

: .array MyArrayEnd MyArray do I @ . cell +loop ;</syntaxhighlight>

: array ( n -- )

create

.MyArray \ 1 2 3 4 5 0 30 0 0 0

</syntaxhighlight>

: array create dup , dup cells here swap 0 fill cells allot ;

: [size] @ ;

Basic array declaration:

Arrays are one-based. These declarations are equivalent:

Other bases can be used:

Arrays can have any type (intrinsic or user-defined), e.g.:

Multidimensional array declaration:

Allocatable array declaration:

Array allocation:

Array deallocation:

Array initialisation:

integer, dimension (10) :: a = (/(i * i, i = 1, 10)/)</syntaxhighlight>

integer, dimension (10, 10) :: a = reshape ((/(i * i, i = 1, 100)/), (/10, 10/))</syntaxhighlight>

Constant array declaration:

integer, dimension (10), parameter :: a = (/(i * i, i = 1, 10)/)</syntaxhighlight>

Element assignment:

Array assignment (note that since Fortran 2003 array assignment also allocates or reallocates if necessary):

Array section assignment:

Element retrieval:

Array section retrieval:

Size retrieval:

Size along a single dimension retrieval:

Bounds retrieval:

Bounds of a multidimensional array retrieval:

=={{header|FreeBASIC}}==

'''The default lower bound is always 0'''

' compile with: FBC -s console -exx to have boundary checks.

=={{header|Frink}}==

In Frink, all arrays are dynamically resizable. Arrays can be created as literals or using <CODE>new array</CODE>

a = new array

a@0 = 10

Multidimensional regular arrays are a built-in datatype in Futhark. They can be written as array literals:

[1, 2, 3]

</syntaxhighlight>

Or created by an assortment of built-in functions:

replicate 5 3 == [3,3,3,3,3]

iota 5 = [0,1,2,3,4]

Uniqueness types are used to permit in-place updates without violating referential transparency. For example, we can write a function that writes an element to a specific index of an array as such:

fun update(as: *[]int, i: int, x: int): []int =

let as[i] = x

In Gambas, there is no need to dimension arrays. The first element of an array is numbered zero, and the DIM statement is optional and can be omitted:

DIM mynumbers AS INTEGER[]

myfruits AS STRING[]

'''[https://gambas-playground.proko.eu/?gist=5061d7f882a4768d212080e416c25e27 Click this link to run this code]'''

Dim sFixedArray As String[] = ["Rosetta", "code", "is", "a", "programming", "chrestomathy", "site"]

Dim sFixedArray1 As New String[10]

=={{header|GAP}}==

v := [ 10, 7, "bob", true, [ "inner", 5 ] ];

# [ 10, 7, "bob", true, [ "inner", 5 ] ]

=={{header|Genie}}==

/*

Arrays, in Genie

====Example of Fixed Length Array====

Array containing a space (" "), "A", "B", and "C":

array[1] = 'A'

array[2] = 'B'

====Example of Arbitrary Length Array====

Array containing the set of all natural numbers from 1 through k:

array[i] = i + 1</syntaxhighlight>

====Example of Fixed Length Array====

Array containing the multiplication table of 1 through 4 by 1 through 3:

array[1,2] = 2

array[1,3] = 3

====Example of Arbitrary Length Array====

Array containing the multiplication table of 1 through k by 1 through h:

for(j = 1; j <= h; j += 1)