Arrays: Difference between revisions
m
syntax highlighting fixup automation
m (→{{header|J}}) |
Thundergnat (talk | contribs) m (syntax highlighting fixup automation) |
||
Line 31:
{{trans|Python}}
<
array.append(1)
array.append(3)
Line 44:
V width = 3
V height = 4
V myArray2 = [[0] * width] * height // create array of arrays</
{{out}}
Line 55:
=={{header|360 Assembly}}==
<
ARRAYS PROLOG
* we use TA array with 1 as origin. So TA(1) to TA(20)
Line 84:
J DC F'4'
YREGS
END ARRAYS</
=={{header|6502 Assembly}}==
Line 90:
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</
Line 98:
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};
return array[2];
}</
would (theoretically) compile to the following in 6502 Assembly:
<
foo:
LDX #2 ;load the desired index
Line 112:
array: ;this is the array we're reading from.
db 3,6,9,12,15</
===Arrays in the Zero Page - A Word of Warning===
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</
If you really want to read from an array in the zero page like this (and chances are you won't since that array also starts to overlap with the hardware stack), you can use an absolute addressing mode in the zero page. Beware - some assemblers will forcibly optimize <code>LDA $00??</code> into <code>LDA $??</code> so you may have to inline the bytecode for it directly. If you stick to arrays outsize the zero page you don't need to worry about index wraparound.
Line 124:
===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</
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</
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
Line 138:
LDA wordArray,X ;evaluates to LDA #$BE
STA $01 ;store in a different zero page temporary variable. If your word data is a pointer you want to dereference,
;you'll need to store the low byte in $nn and the high byte in $nn+1 like I did here.</
There are a few downsides in 6502 assembly to storing word data in this format. A minor one is the need to double your index. This isn't a big deal, it doesn't take long to do that. The bigger problem is that the 6502 has a soft array length cap of 256 bytes. If your code is running in ROM and you're not able to use self-modifying code to adjust the base address, or you're not willing to use the slower <code>LDA ($??),y</code>, you're mostly limited to 256 bytes or 128 words.
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
wordArray_Hi:
db $AB,$BE,$CA,$DA ;both this version and the above versions are 8 bytes of memory.</
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
LDA wordArray_Hi,x ;evaluates to LDA #$BE
STA $01</
Both tables share the same index, which means you can do the lookup without destroying your index (not that it was that difficult to retrieve the original index to begin with), but on 8-bit computers you want to be as efficient as possible, using the hardware's strengths to your advantage. Splitting your "wider" arrays into multiple 8-bit tables is often the best approach.
Line 162:
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</
In the eyes of the CPU, this is the same as ANY of the following:
<
db 5
db 10
Line 176:
db 40
db 45
db 50</
<
db 5,10
db 15,20
db 25,30
db 35,40
db 45,50</
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
db 25,30
db 35,40
db 45,50</
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)
Line 203:
TAX ;move A to X so we can use it as the index
LDA Array,x ;evaluates to LDA #40</
You may be wondering, why not just treat the array as though it were one-dimensional? Reason is, you won't always know in advance what you want from your array, it may depend on 2 variables in your program (such as X/Y coordinates, etc.), so you might need to use this method rather than just treating it as linear data.
Line 211:
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
Line 232:
DC.L 6,7,8,9,10
DC.L 11,12,13,14,15
</syntaxhighlight>
Strings are also arrays and most assemblers accept single or double quotes. The following are equivalent:
<
DC.B "Hello World",0
even
Line 241:
MyString2:
DC.B 'H','e','l','l','o',' ','W','o','r','l','d',0
even</
The assembler will automatically substitute each letter with its ASCII equivalent. Notice the lack of quotes around the null terminator 0. If it had quotes, it would be assembled as 0x30 instead of 0. Not good if your printing routine expects a 0 as the terminator byte.
Line 255:
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
Line 261:
LSL.W #2,D0 ;this array is intended for 32-bit values.
MOVE.L #23,D1 ;load decimal 23 into D1
MOVE.L D1,(A0,D0) ;store #23 into the 3rd slot of the array (arrays are zero-indexed in assembly)</
This is the equivalent of the [[C]] code:
<
myArray[3] = 23;</
Loading an element is very similar to storing it.
<
;load element 4
Line 275:
MOVE.W #4,D0 ;load the desired offset into D0
LSL.W #2,D0 ;this array is intended for 32-bit values.
MOVE.L (A0,D0),D1 ;load the 4th element into D1.</
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.
Line 308:
MOVE.L (A0,D0),(4,A0,D0)
ADDA.L #4,A0
DBRA D2,LOOP</
The use of the number 4 in <code>(4,A0,D0)</code> and <code>ADDA.L #4,A0</code> was because we were working with <code>MOVE.L</code> commands to store 32-bit values. If your data size was 16 bit you would replace the 4s with 2s, and if it was 8 bit you would use 1s.
Line 318:
<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.
Line 409:
pop dph
</syntaxhighlight>
=={{header|8th}}==
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
Line 429:
\ arrays don't have to be homogenous:
[1,"one", 2, "two"]
</syntaxhighlight>
=={{header|AArch64 Assembly}}==
{{works with|as|Raspberry Pi 3B version Buster 64 bits}}
<
/* ARM assembly AARCH64 Raspberry PI 3B */
/* program areaString64.s */
Line 579:
/* for this file see task include a file in language AArch64 assembly */
.include "../includeARM64.inc"
</syntaxhighlight>
=={{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.
Line 597:
cl_demo_output=>display( itab ).
cl_demo_output=>display( itab[ 2 ] ).
</syntaxhighlight>
{{out}}
Line 610:
=={{header|ACL2}}==
<
(assign array-example
(compress1 'array-example
Line 624:
;; Get a[5]
(aref1 'array-example (@ array-example) 5)</
=={{header|Action!}}==
<
BYTE i
Line 686:
PrintF("c(%B)=%B ",i,c(i))
OD
RETURN</
{{out}}
[https://gitlab.com/amarok8bit/action-rosetta-code/-/raw/master/images/Arrays.png Screenshot from Atari 8-bit computer]
Line 710:
=={{header|ActionScript}}==
<
var array1:Array = new Array(10);
//creates an array with the values 1, 2
Line 725:
array2.push(4);
//get and remove the last element of an array
trace(array2.pop());</
=={{header|Ada}}==
<
A, B : array (1..20) of Integer;
Line 770:
Fingers_Extended'Last := False; -- Set last element of array
end Array_Test;</
Arrays are first-class objects in [[Ada]]. They can be allocated statically or dynamically as any other object. The number of elements in an array object is always constrained. Variable size arrays are provided by the standard container library. They also can be implemented as user-defined types.
=={{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)
Line 792:
var arr7 = arr1 & arr2 // intersection
</syntaxhighlight>
# retrieve an element
Line 799:
=={{header|Aime}}==
The aime ''list'' is a heterogeneous, dynamic sequence. No special creation procedure, only declaration is needed:
<syntaxhighlight lang
Values (numbers, strings, collections, functions, etc) can be added in a type generic fashion:
<
l_append(l, "arrays");
l_append(l, pow);</
The insertion position can be specified:
<
l_push(l, 4, __type(l));</
More aptly, values (of selected types) can be inserted in a type specific fashion:
<
l_p_real(l, 6, 88);</
Similarly, values can be retrieved in a type generic fashion:
<syntaxhighlight lang
or is type specific fashion:
<
l_q_text(l, 1);</
=={{header|ALGOL 60}}==
{{trans|Simula}}
<
comment arrays - Algol 60;
Line 850:
dynamic(5)
end arrays </
{{out}}
<pre>
Line 858:
=={{header|ALGOL 68}}==
<
(
[1:20]INT a;
Line 877:
FLEX []CHAR string := "Hello, world!"; # create an array with variable bounds #
string := "shorter" # flexible arrays automatically resize themselves on assignment #
)</
Arrays in ALGOL 68 are first class objects. Slices to any portion of the array can be created and then treated equivalently to arrays, even sections of a multidimensional array; the bounds are queried at run time. References may be made to portions of an array. Flexible arrays are supported, which resize themselves on assignment, but they can't be resized without destroying the data.
=={{header|ALGOL W}}==
<
% declare an array %
integer array a ( 1 :: 10 );
Line 899:
% as parameters to procedures %
% multi-dimension arrays are supported %
end.</
=={{header|AmigaE}}==
<
da: PTR TO CHAR,
la: PTR TO CHAR
Line 918:
-> "deallocating" the array
IF la <> NIL THEN END la[100]
ENDPROC</
=={{header|AntLang}}==
<
arr: <1;2;3>
Line 933:
/ Get the nth element (index origin = 0)
nth:arr[n]</
=={{header|Apex}}==
<
array[0] = 42;
System.debug(array[0]); // Prints 42</
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
System.debug(list[0]); // Prints 5, alternatively you can use list.get(0)</
=={{header|APL}}==
Arrays in APL are one dimensional matrices, defined by seperating variables with spaces. For example:
<syntaxhighlight lang
Is equivalent to <
=={{header|App Inventor}}==
Line 958:
=={{header|AppleScript}}==
AppleScript arrays are called lists:
<
set ints to {1, 2, 3}</
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
return any
--> {false, 1, "foo", 2.57, missing value, {1, 2, 3}, 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}</
However, this isn't usually as efficient and it's important to be aware of the coercion rules associated with AppleScript concatenations, which may lead to unexpected results!
Line 984:
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}</
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)</
… and some fairly complex range specifiers are possible:
<
integers from text 1 to list 1 of any --> {5, 4, 38}</
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.</
The number of items of a specific class can also be obtained:
<
length of any's integers</
A list's other properties are its <code>rest</code> (which is another list containing all the items except for the first) and its <code>reverse</code> (another list containing the items in reverse order).
Line 1,013:
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.
Line 1,019:
set myNSArray to current application's NSArray's arrayWithArray:myList -- Bridge the list to an NSArray.
set arrayLength to myNSArray's |count|() -- Get the array's length using its 'count' property.
--> 5</
=={{header|Arendelle}}==
Line 1,056:
=={{header|Argile}}==
{{works with|Argile|1.0.0}}
<
(:::::::::::::::::
Line 1,086:
DynArray[5] = 243
prints DynArray[0] DynArray[5]
del DynArray</
{{works with|Argile|1.1.0}}
<
let x = @["foo" "bar" "123"]
print x[2]
x[2] = "abc"</
=={{header|ARM Assembly}}==
{{works with|as|Raspberry Pi}}
<
/* ARM assembly Raspberry PI */
/* program areaString.s */
Line 1,284:
.Ls_magic_number_10: .word 0x66666667
</syntaxhighlight>
=={{header|Arturo}}==
<
arrA: []
Line 1,302:
; retrieve an element at some index
print arrB\1</
{{out}}
Line 1,313:
{{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"
Line 1,319:
; Push a value onto the array
myArray.Insert("baz")</
AutoHotkey Basic (deprecated) did not have typical arrays.
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
Line 1,333:
StringSplit arrayX, source, %A_Space%
Loop, %arrayX0%
Msgbox % arrayX%A_Index%</
=={{header|AutoIt}}==
Create an userdefined array.
<
#include <Array.au3> ;Include extended Array functions (_ArrayDisplay)
Line 1,352:
_ArrayDisplay($aInputs) ;Display the Array
</syntaxhighlight>
=={{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]</
Tuples are immutable, however one can quickly create a new tuple with a specified element replaced.
<
=={{header|AWK}}==
Line 1,370:
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"
Line 1,399:
print " " i ": " array[i]
}
}</
{{out}}
Line 1,425:
=={{header|Axe}}==
<
2→{L₁+1}
3→{L₁+2}
Line 1,432:
Disp {L₁+1}►Dec,i
Disp {L₁+2}►Dec,i
Disp {L₁+3}►Dec,i</
=={{header|Babel}}==
Line 1,440:
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:
<syntaxhighlight lang
<syntaxhighlight lang
===Get a single array element===
<
{{Out}}
Line 1,456:
Changing a value-array element:
<
</syntaxhighlight>
{{Out}}
Line 1,464:
Changing a pointer-array element:
<
{{Out}}
Line 1,471:
===Select a range of an array===
<
{{Out}}
Line 1,480:
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.
Line 1,490:
Convert a value-array to a list of values:
<
{{Out}}
Line 1,497:
Convert a list of values to a value-array:
<
{{Out}}
Line 1,504:
Convert a pointer-array to a list of pointers:
<
{{Out}}
Line 1,511:
Convert a list of pointers to a pointer-array:
<
{{Out}}
Line 1,522:
Note: We need to use quotes in DATA
<
DATA "January", "February", "March", "April", "May", "June", "July"
DATA "August", "September", "October", "November", "December"
Line 1,531:
PRINT dat$[i]
NEXT
</syntaxhighlight>
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
Line 1,545:
INCR i
WEND
</syntaxhighlight>
Line 1,551:
name this '''split.bac'''
<
SPLIT ARGUMENT$ BY " " TO TOK$ SIZE len_array
Line 1,557:
PRINT TOK$[i]
NEXT i
</syntaxhighlight>
in the terminal
<
./split January February March April May June July August September October November December
</syntaxhighlight>
Notes: if you want to take a string from the command line
Line 1,575:
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 </
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
REDIM SHARED myArray(20, 20) AS STRING
myArray(1,1) = "Item1"
myArray(1,2) = "Item2" </
'''Array Initialization'''
Line 1,594:
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
FOR m=1 TO 12
READ month$(m)
NEXT m </
{{works with|FreeBASIC}}
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
Line 1,612:
50 LET A%(11) = 1
60 PRINT A%(1), A%(11)
70 END</
{{works with|qbasic}}
Line 1,618:
===Static===
<
staticArray(0) = -1
staticArray(10) = 1
PRINT staticArray(0), staticArray(10)</
===Dynamic===
Line 1,629:
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
Line 1,637:
dynamicArray(20) = 1
PRINT dynamicArray(0), dynamicArray(20)</
==={{header|Applesoft BASIC}}===
<
20 LET A%(0) = -1
30 LET A%(11) = 1
40 PRINT A%(0), A%(11)</
==={{header|Commodore BASIC}}===
Line 1,649:
=={{header|BASIC256}}==
<
dim numbers(10)
for t = 0 to 9
Line 1,677:
print numbers[t] + "=" + words$[t]
next t
return</
=={{header|Batch File}}==
Arrays can be approximated, in a style similar to REXX
<
@echo off
setlocal ENABLEDELAYEDEXPANSION
Line 1,706:
echo %1 = %2
goto :eof
</syntaxhighlight>
{{out}}
Line 1,719:
=={{header|BBC BASIC}}==
<
DIM array(6), array%(6), array$(6)
Line 1,735:
PRINT array(2) TAB(16) array(3) TAB(32) array(4)
PRINT array%(2) TAB(16) array%(3) TAB(32) array%(4)
PRINT array$(2) TAB(16) array$(3) TAB(32) array$(4)</
=={{header|bc}}==
Line 1,742:
The following is a transcript of an interactive session:
<
g[3] = 42
/* Look at some other elements in g */
Line 1,759:
123
g[3]
42</
=={{header|BML}}==
'''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
Line 1,776:
% There is no automatic garbage collection
delete $arr
</syntaxhighlight>
=={{header|Boo}}==
<
myArray as (int) = (1, 2, 3) // Size based on initialization
fixedArray as (int) = array(int, 1) // Given size(1 in this case)
Line 1,788:
print myArray[0]
</syntaxhighlight>
=={{header|BQN}}==
Line 1,794:
All arrays are variable length, and can contain any types of values.
<
arr ← 1‿2‿'a'‿+‿5
# General List Syntax:
Line 1,806:
# Modifying the array(↩):
arr ↩ "hello"⌾(4⊸⊑) arr</
<
⟨ 1 2 'a' + 5 ⟩
⟨ 1 2 'a' + 5 ⟩
+
⟨ 1 2 'a' + "hello" ⟩</
[https://mlochbaum.github.io/BQN/try.html#code=IyBTdHJhbmRpbmc6CmFyciDihpAgMeKAvzLigL8nYSfigL8r4oC/NQojIEdlbmVyYWwgTGlzdCBTeW50YXg6CmFycjEg4oaQIOKfqDEsMiwnYScsKyw14p+pCuKAolNob3cgYXJyIOKJoSBhcnIxICMgYm90aCBhcnJheXMgYXJlIHRoZSBzYW1lLgrigKJTaG93IGFycgrigKJTaG93IGFycjEKCiMgVGFraW5nIG50aCBlbGVtZW50KOKKkSk6CuKAolNob3cgM+KKkWFycgoKIyBNb2RpZnlpbmcgdGhlIGFycmF5KOKGqSk6CmFyciDihqkgImhlbGxvIuKMvig04oq44oqRKSBhcnIK Try It Here!]
Line 1,826:
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)
Line 1,836:
| out$"mytable is gone"
)
);</
{{out}}
<pre>5
Line 1,846:
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.
<syntaxhighlight lang=bf>
===========[
ARRAY DATA STRUCTURE
Line 1,932:
return back by finding leftmost null then decrementing pointer
twice then decrement our NEWVALUE cell
</syntaxhighlight>
=={{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 */</
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,
5.0, 1.0, 3.0 };
#define FLOAT_ROWS (sizeof(my2Dfloats)/sizeof(my2dFloats[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. */
Line 1,961:
/* calloc() additionally pre-initializes to all zeros */
short *myShorts = calloc( numElements, sizeof(short)); /* array of 10 */
if (myShorts != NULL)....</
Once allocated, myArray can be used as a normal array.
The first element of a C array is indexed with 0. To set a value:
<
myArray[1] = 3;</
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;</
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) {
Line 1,988:
free(kernel-XSIZE);
}
}</
In C99, it is possible to declare arrays with a size that is only known at runtime (e.g. a number input by the user).
Line 1,994:
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:
<syntaxhighlight lang=c>
int *array = malloc (sizeof(int) * 20);
....
array = realloc(array, sizeof(int) * 40);
</syntaxhighlight>
A Linked List for chars may be implemented like this:
<syntaxhighlight lang=C>
#include <stdlib.h>
#include <stdio.h>
Line 2,060:
list->size = 0;
}
</syntaxhighlight>
=={{header|C sharp|C#}}==
Line 2,066:
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:
<
Line 2,080:
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;
array[1] = 3;
Console.WriteLine(array[0]);</
Dynamic
<
using System.Collections.Generic;
Line 2,109:
list[0] = 2;
Console.WriteLine(list[0]);</
=={{header|C++}}==
Line 2,123:
<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>
Line 2,166:
demonstrate(fixed_size_array);
demonstrate(dynamic_array);
}</
=={{header|Ceylon}}==
{{works with|Ceylon|1.3.0}}
<
ArrayList
Line 2,189:
list.push("hello again");
print(list);
}</
=={{header|ChucK}}==
<syntaxhighlight lang=c>
int array[0]; // instantiate int array
array << 1; // append item
Line 2,202:
[1,2,3,4,5,6,7] @=> array;
array.popBack(); // Pop last element
</syntaxhighlight>
=={{header|Clean}}==
Line 2,208:
===Lazy array===
Create a lazy array of strings using an array denotation.
<
array = {"Hello", "World"}</
Create a lazy array of floating point values by sharing a single element.
<
array = createArray 10 3.1415</
Create a lazy array of integers using an array (and also a list) comprehension.
<
array = {x \\ x <- [1 .. 10]}</
===Strict array===
Create a strict array of integers.
<
array = {x \\ x <- [1 .. 10]}</
===Unboxed array===
Create an unboxed array of characters, also known as <tt>String</tt>.
<
array = {x \\ x <- ['a' .. 'z']}</
=={{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
Line 2,237:
// Array can be dynamically resized:
arr4 := ASize( arr4, 80 )</
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:
ADel( arr1, 1 )
// Assigning a value to array item
arr3[1,1,1] := 11.4</
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:
Line 2,256:
//Duplicate the whole or nested array:
arr5 := AClone( arr1 )
arr6 := AClone( arr1[3] )</
=={{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.
Line 2,292:
user=> (conj my-vec 300) ;adding to a vector always adds to the end of the vector
[1 2 3 4 5 6 300]</
=={{header|COBOL}}==
In COBOL, arrays are called ''tables''. Also, indexes begin from 1.
<
PROGRAM-ID. arrays.
Line 2,334:
GOBACK
.</
=={{header|CoffeeScript}}==
<
array1[0] = "Dillenidae"
array1[1] = "animus"
Line 2,344:
array2 = ["Cepphus", "excreta", "Gansu"]
alert "Value of array2[1]: " + array2[1] # excreta</
=={{header|ColdFusion}}==
Creating a one-dimensional Array:
<
Creating a two-dimensional Array in CFScript:
<
arr2 = ArrayNew(2);
</cfscript></
''ColdFusion Arrays are '''NOT''' zero-based, they begin at index '''1'''''
=={{header|Common Lisp}}==
<
(setf (aref array 0) 1
(aref array 1) 3)
(print array))</
Dynamic
<
(vector-push-extend 1 array)
(vector-push-extend 3 array)
(setf (aref array 0) 2)
(print array))</
Creates a one-dimensional array of length 10. The initial contents are undefined.
<syntaxhighlight lang
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
(make-array 4 :element-type 'integer :initial-contents '(1 2 3 4) :adjustable t)</
=={{header|Component Pascal}}==
Line 2,386:
<
MODULE TestArray;
(* Implemented in BlackBox Component Builder *)
Line 2,413:
END DoTwoDim;
END TestArray.</
=={{header|Computer/zero Assembly}}==
Line 2,422:
===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
Line 2,452:
8
9
10</
===Zero-terminated array===
<
BRZ done
Line 2,483:
9
10
0</
=={{header|Crystal}}==
<
# create an array with one object in it
a = ["foo"]
Line 2,507:
%w(one two three) # => ["one", "two", "three"]
%i(one two three) # => [:one, :two, :three]
</syntaxhighlight>
=={{header|D}}==
<
import std.stdio, core.stdc.stdlib;
Line 2,550:
writeln("D) Element 0: ", array4[0]);
writeln("D) Element 1: ", array4[1]);
}</
{{out}}
<pre>A) Element 0: 1
Line 2,561:
D) Element 1: 3</pre>
One more kind of built-in array:
<
void main() {
Line 2,571:
writeln("E) Element 0: ", vector5.array[0]);
writeln("E) Element 1: ", vector5.array[1]);
}</
{{out}}
<pre>E) Element 0: 1
Line 2,577:
=={{header|Dao}}==
<
a = [ 1, 2, 3 ] # a vector
b = [ 1, 2; 3, 4 ] # a 2X2 matrix
Line 2,586:
d = a[1]
e = b[0,1] # first row, second column
f = c[1]</
=={{header|Dart}}==
<
main(){
// Dart uses Lists which dynamically resize by default
Line 2,632:
}
</syntaxhighlight>
{{out}}
<pre>
Line 2,642:
=={{header|DBL}}==
<
; Arrays for DBL version 4 by Dario B.
;
Line 2,693:
VNUM2(1:5*8)=
CLEAR VALP1(1:5*8),VALP2(1:5*10)
VALP3(1:5*2*10)=</
=={{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
Line 2,733:
// Displaying both arrays (#13#10 = Carriage Return/Line Feed)
ShowMessage(StaticArrayText + #13#10 + DynamicArrayText);
end;</
=={{header|Diego}}==
<
set_base(0);
Line 2,852:
[myArray]_end(); // Retrieve last element in a matrix
reset_ns[];</
=={{header|Dragon}}==
<
array[0] = 42
showln array[2] </
=={{header|DWScript}}==
<
// dynamic array, extensible, this a reference type
var d : array of Integer;
Line 2,876:
// inline array constructor, works for both static and dynamic arrays
s := [1, 2, 3];
</syntaxhighlight>
=={{header|Dyalect}}==
<
var empty = []
var xs = [1, 2, 3]
Line 2,890:
//Access array elements
var x = xs[2]
xs[2] = x * x</
=={{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 []
Line 2,914:
#this prints Boo
!print pop-from l
</syntaxhighlight>
=={{header|E}}==
Line 2,922:
Literal lists are <code>ConstList</code>s.
<
# value: []
Line 2,932:
? numbers + [4,3,2,1]
# value: [1, 2, 3, 4, 5, 4, 3, 2, 1]</
Note that each of these operations returns a different list object rather than modifying the original. You can, for example, collect values:
<
# value: []
Line 2,943:
? numbers with= 2 # shorthand for same
# value: [1, 2]</
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()
Line 2,958:
? flex.snapshot()
# value: [1, 2, -3]</
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]].
Line 2,977:
for i range len f[]
print f[i]
.</
=={{header|EGL}}==
Line 2,983:
'''Fixed-length array'''
<
array int[10]; //optionally, add a braced list of values. E.g. array int[10]{1, 2, 3};
array[1] = 42;
SysLib.writeStdout(array[1]);
</syntaxhighlight>
{{out}}
<pre>
Line 3,008:
=={{header|Eiffel}}==
<
class
APPLICATION
Line 3,042:
my_static_array: ARRAY [STRING]
end
</syntaxhighlight>
=={{header|Elena}}==
Line 3,048:
Static array
<
Generic array
<
array[0] := 1;
array[1] := 2;
array[2] := 3;</
Stack allocated array
<
stackAllocatedArray[0] := 1;
stackAllocatedArray[1] := 2;
stackAllocatedArray[2] := 3;</
Dynamic array
<
dynamicArray.append:1;
dynamicArray.append:2;
dynamicArray.append:4;
dynamicArray[2] := 3;</
Printing an element
<
system'console.writeLine(stackAllocatedArray[1]);
system'console.writeLine(dynamicArray[2]);</
=={{header|Elixir}}==
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"}
ret == {:ok, "fun", 3.1415}</
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]
Line 3,104:
List.delete(my_list, :two) # => [1, "three"]
my_list -- ["three", 1] # => [:two]
my_list # => [1, :two, "three"]</
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)
Line 3,117:
true
iex(5)> tl(fruit) == [:banana, :cherry]
true</
=={{header|Erlang}}==
<
%% Create a fixed-size array with entries 0-9 set to 'undefined'
A0 = array:new(10).
Line 3,151:
{'EXIT',{badarg,_}} = (catch array:set(18, true, A3)).
{'EXIT',{badarg,_}} = (catch array:get(18, A3)).
</syntaxhighlight>
=={{header|ERRE}}==
Line 3,204:
=={{header|Euphoria}}==
<
--Arrays task for Rosetta Code wiki
--User:Lnettnay
Line 3,234:
end for
? dynarray
</syntaxhighlight>
{{out}}
<pre>
Line 3,250:
=={{header|F Sharp|F#}}==
'''Fixed-length arrays:'''
<
val it : char [] = [|'A'; 'A'; 'A'; 'A'; 'A'; 'A'|]
> Array.init 8 (fun i -> i * 10) ;;
Line 3,261:
val it : unit = ()
> arr;;
val it : int [] = [|0; 1; 2; 3; 65; 5; 6|]</
'''Dynamic arrays:'''
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);;
Line 3,280:
Parameter name: index ...
> arr;;
val it : ResizeArray<int> = seq [13]</
=={{header|Factor}}==
Line 3,287:
Directly in the listener :
<
{
[ "The initial array: " write . ]
Line 3,293:
[ "Modified array: " write . ]
[ "The element we modified: " write [ 1 ] dip nth . ]
} cleave</
The initial array: { 1 2 3 }
Modified array: { 1 42 3 }
Line 3,303:
{ 1 "coucou" f [ ] }
Arrays of growable length are called Vectors.
<
{
[ "The initial vector: " write . ]
[ [ 42 ] dip push ]
[ "Modified vector: " write . ]
} cleave</
The initial vector: V{ 1 2 3 }
Modified vector: V{ 1 2 3 42 }
Line 3,373:
For example, a static array of 10 cells in the dictionary, 5 initialized and 5 uninitialized:
<
here constant MyArrayEnd
Line 3,379:
MyArray 7 cells + @ . \ 30
: .array MyArrayEnd MyArray do I @ . cell +loop ;</
<
: array ( n -- )
create
Line 3,402:
5fillMyArray
.MyArray \ 1 2 3 4 5 0 30 0 0 0
</syntaxhighlight>
<
: array create dup , dup cells here swap 0 fill cells allot ;
: [size] @ ;
Line 3,419:
5fillMyArray
.MyArray \ 1 2 3 4 5 0 30 0 0 0
</syntaxhighlight>
=={{header|Fortran}}==
Line 3,425:
Basic array declaration:
<syntaxhighlight lang
<syntaxhighlight lang
<
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:
<syntaxhighlight lang
<
Array deallocation:
<syntaxhighlight lang
Array initialisation:
<
<
integer, dimension (10) :: a = (/(i * i, i = 1, 10)/)</
<
<
integer, dimension (10, 10) :: a = reshape ((/(i * i, i = 1, 100)/), (/10, 10/))</
Constant array declaration:
<
integer, dimension (10), parameter :: a = (/(i * i, i = 1, 10)/)</
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}}==
Line 3,519:
'''The default lower bound is always 0'''
<
' compile with: FBC -s console -exx to have boundary checks.
Line 3,600:
Print : Print "hit any key to end program"
Sleep
End</
{{out}}
<pre> The first dimension has a lower bound of 1 and a upper bound of 2
Line 3,635:
=={{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
Line 3,642:
b = [1, 2, 3]
</syntaxhighlight>
=={{header|Futhark}}==
Line 3,648:
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]
</syntaxhighlight>
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 x
</syntaxhighlight>
Semantically the <code>update</code> function returns a new array, but the compiler is at liberty to re-use the memory where array <code>as</code> is stored, rather than create a copy as is normally needed in pure languages. Whenever the compiler encounters a call <code>update(as,i,x)</code>, it checks that the <code>as</code> is not used again. This prevents the in-place update from being observable, except through the return value of <code>modify</code>.
Line 3,673:
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[]
Line 3,682:
myfruits[0] = "apple"
myfruits[1] = "banana"
</syntaxhighlight>
Line 3,688:
'''[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]
Line 3,706:
Print sFixedArray1[5] & sFixedArray1[6]
End</
Output:
<pre>
Line 3,715:
=={{header|GAP}}==
<
v := [ 10, 7, "bob", true, [ "inner", 5 ] ];
# [ 10, 7, "bob", true, [ "inner", 5 ] ]
Line 3,759:
Add(v, "added");
v;
# [ 10, 7, "bob", true, [ "inner", 5 ], 100,,,, 1000, 8, 9, "added" ]</
=={{header|Genie}}==
<
/*
Arrays, in Genie
Line 3,796:
dyn.add(dyn[0]+dyn[1])
stdout.printf("dyn size: %d\n", dyn.size)
stdout.printf("dyn[2] : %d\n", dyn[2])</
{{out}}
Line 3,811:
====Example of Fixed Length Array====
Array containing a space (" "), "A", "B", and "C":
<
array[1] = 'A'
array[2] = 'B'
array[3] = 'C'</
====Example of Arbitrary Length Array====
Array containing the set of all natural numbers from 1 through k:
<
array[i] = i + 1</
===2-Dimensional Array Examples===
====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
Line 3,835:
array[3,2] = 6
array[3,3] = 9
array[3,4] = 12</
====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)
array[i,j] = i * j</
=={{header|Go}}==
<
import (
Line 3,906:
// the cap()=10 array is no longer referenced
// and would be garbage collected eventually.
}</
{{out}}
<pre>len(a) = 5
Line 3,927:
In Golfscript, arrays are created writing their elements between []. Arrays can contain any kind of object. Once created, they are pushed on the stack, as any other object.
<
10,:a; # assign to a [0 1 2 3 4 5 6 7 8 9]
a 0= puts # pick element at index 0 (stack: 0)
a 10+puts # append 10 to the end of a
10 a+puts # prepend 10 to a</
Append and prepend works for integers or arrays only, since only in these cases the result is coerced to an array.
Line 3,937:
=={{header|Groovy}}==
Arrays and lists are synonymous in Groovy. They can be initialized with a wide range of operations and Groovy enhancements to the Collection and List classes.
<
def a = [0] * 100 // list of 100 zeroes
def b = 1..9 // range notation
Line 3,956:
d.each { print "["; it.each { elt -> printf "%7.1f ", elt }; println "]" }
println()
e.each { print "["; it.each { elt -> printf "%7.1f ", elt }; println "]" }</
{{out}}
Line 3,972:
Here is a more interesting example showing a function that creates and returns a square identity matrix of order N:
<
(1..n).collect { i -> (1..n).collect { j -> i==j ? 1.0 : 0.0 } }
}</
Test program:
<
def i15 = identity(15)
Line 3,983:
i2.each { print "["; it.each { elt -> printf "%4.1f ", elt }; println "]" }
println()
i15.each { print "["; it.each { elt -> printf "%4.1f ", elt }; println "]" }</
{{out}}
Line 4,007:
Groovy, like every other C-derived language in the known universe, uses ZERO-based array/list indexing.
<
println strings
Line 4,017:
strings[10] = 'strawberries'
println strings</
{{out}}
Line 4,026:
Negative indices are valid. They indicate indexing from the end of the list towards the start.
<syntaxhighlight lang
{{out}}
Line 4,034:
Groovy lists can be resequenced and subsequenced by providing lists or ranges of indices in place of a single index.
<
println strings[0..4]
println strings[0..3, -5]</
{{out}}
Line 4,048:
Graphical User Interface Support Script does not have variables or array storage of its own. However, it can make use of installed applications, so it is possible to utilize an installed spreadsheet application to create and manipulate arrays. Here we assume that a spreadsheet is installed and create an array containing three names:
<
=={{header|GW-BASIC}}==
Line 4,055:
(GW-BASIC User's Guide)
<
20 DIM A(9) ' Array with size 10 (9 is maximum subscript), all elements are set to 0
30 FOR I = 0 TO 9
Line 4,063:
70 A(4) = 400 ' Set 4th element of array
80 PRINT A(4)
</syntaxhighlight>
=={{header|Halon}}==
<
$array[] = 1;
Line 4,074:
echo $array[0];
echo $array["key"];</
=={{header|Harbour}}==
Harbour 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
Line 4,088:
// Array can be dynamically resized:
arr4 := ASize( arr4, 80 )</
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:
ADel( arr1, 1 )
// Assigning a value to array item
arr3[ 1, 1, 1 ] := 11.4</
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:
Line 4,107:
// Duplicate the whole or nested array:
arr5 := AClone( arr1 )
arr6 := AClone( arr1[ 3 ] )</
=={{header|Haskell}}==
You can read all about Haskell arrays [http://haskell.org/haskellwiki/Arrays here]. The following example is taken from that page:
<
main = do arr <- newArray (1,10) 37 :: IO (IOArray Int Int)
Line 4,117:
writeArray arr 1 64
b <- readArray arr 1
print (a,b)</
=={{header|hexiscript}}==
<
let a[0] 123 # index starting at 0
let a[1] "test" # can hold different types
println a[1]</
=={{header|HicEst}}==
<
Astat(2) = 2.22222222
Line 4,137:
ALIAS(Astat, n-1, last2ofAstat, 2)
WRITE(ClipBoard) last2ofAstat ! 2.22222222 0 </
=={{header|HolyC}}==
<
U8 array[10] = 1, 2, 3, 4, 5, 6, 7, 8, 9, 10;
Line 4,147:
// Access an element
Print("%d\n", array[0]);</
==Icon and Unicon==
==={{header|Icon}}===
<
procedure main()
Line 4,248:
S := A[-8 -: -3] # S is [30, 40, 50]
S := A[-5 +: -3] # S is [30, 40, 50]
end</
==={{header|Unicon}}===
This Icon solution works in Unicon.
<
# insert and delete work on lists allowing changes in the middle
# possibly others
</syntaxhighlight>
{{improve|Unicon|Need code examples for these extensions}}
=={{header|i}}==
<
//Fixed-length arrays.
f $= array.integer[1]()
Line 4,269:
d[+] $= 2
print(d[1])
}</
=={{header|Io}}==
<
foo at(1) println // bar
foo append("Foobarbaz")
foo println
foo atPut(2, "barbaz") // baz becomes barbaz</
<pre>Io> foo := list("foo", "bar", "baz")
Line 4,295:
=={{header|J}}==
In J, all data occurs in the form of rectangular (or generally [[wp:Hyperrectangle|orthotopic]]) arrays. This is true for both named and anonymous data.
<
1
NB. invoking any array produces that array as the result
Line 4,322:
Xbcde
fXhij
klXno</
Because arrays are so important in J, a large portion of the language applies to this topic.
Note also that J's arrays are (with some obscure exceptions) "constants". We can append to an existing array, creating a new array, but if we kept a reference to the original it would have remained unchanged.
<
B=: A, 9 5
B
7 11 9 5
A
7 11</
Thus, in recent versions of J, special syntax was introduced to refer to a value while discarding the reference: <
B=: A_:, 1 3 9 5
B
2 4 6 8 1 3 9 5
A
|value error: A</
=={{header|Java}}==
<
array[0] = 42;
System.out.println(array[3]);</
Dynamic arrays can be made using <code>List</code>s:
<
list.add(5); // appends to the end of the list
list.add(1, 6); // inserts an element at index 1
System.out.println(list.get(0));</
=={{header|JavaScript}}==
JavaScript arrays are Objects that inherit from Array prototype and have a special length property that is always one higher than the highest non–negative integer index. Methods inherited from Array.prototype are mostly generic and can be applied to other objects with a suitable length property and numeric property names.
Note that if the Array constructor is provided with one argument, it is treated as specifying the length of the new array, if more than one argument is supplied, they are treated as members of the new array.
<
var myArray = new Array();
Line 4,378:
// Elisions are supported, but are buggy in some implementations
var y = [0,1,,]; // length 3, or 4 in buggy implementations
</syntaxhighlight>
=={{header|jq}}==
jq arrays have the same syntax as JSON arrays, and there are similarities with Javascript arrays. For example, the index origin is 0; and if a is an array and if n is an integer less than the array's length, then a[n] is the n-th element. The length of any array, a, can be ascertained using the length filter: a|length.
There are, however, some interesting extensions, e.g. <tt>[][4] = null</tt> creates an array of length 5 as explained below.<
[]
Line 4,418:
a[1:] # => [1,2,3,4]
a[2:4] # => [2,3]
a[4:2] # null</
=={{header|Jsish}}==
From Javascript, with the differences that Jsi treats ''typeof [elements]'' as "array", not "object".
<
// Create a new array with length 0
var myArray = new Array();
Line 4,474:
myArray3.length ==> 4
=!EXPECTEND!=
*/</
{{out}}
Line 4,515:
=={{header|KonsolScript}}==
<
Array:New array[3]:Number;
Line 4,525:
array[0] = 5; //assign value
Konsol:Log(array[0]) //retrieve value and display
}</
=={{header|Kotlin}}==
<
var a = arrayOf(1, 2, 3, 4)
println(a.asList())
Line 4,534:
println(a.asList())
println(a.reversedArray().asList())
}</
{{out}}
<pre>[1, 2, 3, 4]
Line 4,544:
=={{header|Lambdatalk}}==
<
// Create a new array with length 0
{def myArray1 {A.new}}
Line 4,569:
and so on...
</syntaxhighlight>
=={{header|lang5}}==
<
1 append
['foo 'bar] append
2 reshape
0 remove 2 swap 2 compress collapse .</
=={{header|langur}}==
Langur uses 1-based indexing.
<
val .a2 = series 4..10
val .a3 = .a1 ~ .a2
Line 4,604:
writeln ".a2[5; 0]: ", .a2[5; 0]
writeln ".a2[10; 0]: ", .a2[10; 0]
writeln()</
{{out}}
Line 4,628:
Lasso Array [http://lassoguide.com/operations/containers.html?#array] objects store zero or more elements and provide random access to those elements by position. Positions are 1-based integers. Lasso Arrays will grow as needed to accommodate new elements. Elements can be inserted and removed from arrays at any position. However, inserting an element anywhere but at the end of an array results in all subsequent elements being moved down.
<
local(array1) = array
Line 4,660:
// Insert item at specific position
#array1->insert('0',1) // 0, a, c, c, z</
=== Static Arrays ===
Lasso also supports Static Arrays[http://lassoguide.com/operations/containers.html#staticarray]. A Lasso staticarray is a container object that is not resizable. Staticarrays are created with a fixed size. Objects can be reassigned within the staticarray, but new positions cannot be added or removed.
<
local(mystaticArray) = staticarray('a','b','c','d','e')
Line 4,675:
// Create an empty static array with a length of 32
local(mystaticArray) = staticarray_join(32,void)</
=={{header|Latitude}}==
Like everything in Latitude, arrays are simply objects. In particular, arrays store their elements in numerical slots rather than traditional symbolic ones. The translation scheme used to store them enables constant-time push and pop operations on either side of the array.
<
foo := [1, 2, 3].
Line 4,705:
println: foo popBack. ;; 3
println: foo popFront. ;; "front"
println: foo. ;; [1, 99]</
=={{header|LFE}}==
Using the LFE REPL, you can explore arrays in the following manner:
<
; Create a fixed-size array with entries 0-9 set to 'undefined'
> (set a0 (: array new 10))
Line 4,763:
in (array get 2)
</syntaxhighlight>
=={{header|Liberty BASIC}}==
Line 4,776:
DATA is READ into variables. It cannot be READ directly into arrays.
<br>To fill arrays with DATA items, first READ the item into a variable, then use that variable to fill an index of the array.
<syntaxhighlight lang=lb>
dim Array(10)
Line 4,791:
print Array( 0), Array( 10)
</syntaxhighlight>
=={{header|LIL}}==
Line 4,810:
For filter and foreach, the VARNAME fields are optional, LIL creates defaults inside the code block of '''x''' for filter and '''i''' for foreach if user names are not given.
<
set a [list abc def ghi]
set b [list 4 5 6]
Line 4,818:
append b [list 7 8 9]
print [count $b]
print $b</
{{out}}
Line 4,833:
=={{header|Lingo}}==
<
put a[2] -- or: put a.getAt(2)
-- 2
Line 4,847:
a.sort()
put a
-- [3, 5]</
In addition to the 'list' type shown above, for arrays of bytes (i.e. integers between 0 and 255) there is also the bytearray data type:
<
put ba
-- <ByteArrayObject length = 2 ByteArray = 0xff, 0xff >
Line 4,861:
ba[1] = 5
put ba
-- <ByteArrayObject length = 3 ByteArray = 0x5, 0x2, 0x3 ></
=={{header|Lisaac}}==
<
a := ARRAY(INTEGER).create 0 to 9;
a.put 1 to 0;
a.put 3 to 1;
a.item(1).print;</
=={{header|Little}}==
Arrays in Little are list of values of the same type and they grow dynamically.
<
They are zero-indexed. You can use END to get the last element of an array:
<syntaxhighlight lang=C>
puts(fruit[0]);
puts(fruit[1]);
puts(fruit[END]);
fruit[END+1] = "banana";</
=={{header|Logo}}==
<
(array 5 0) ; custom origin
make "a {1 2 3 4 5} ; array literal
setitem 1 :a "ten ; Logo is dynamic; arrays can contain different types
print item 1 :a ; ten</
=={{header|LOLCODE}}==
<
BTW declaring array
I HAS A array ITZ A BUKKIT
Line 4,906:
VISIBLE array'Z three
VISIBLE array'Z string
KTHXBYE</
=={{header|LSE64}}==
<
0 array 5 [] ! # store 0 at the sixth cell in the array
array 5 [] @ # contents of sixth cell in array</
=={{header|LSL}}==
LSL does not have Arrays, but it does have [http://wiki.secondlife.com/wiki/List lists] which can function similar to a one dimensional ArrayList in Java or C#.
<
default {
state_entry() {
Line 4,943:
llSay(0, "Deserialize a string CSV List\n(note that all elements are now string datatype)\nList=["+llList2CSV(lst)+"]\n");
}
}</
{{out}}
<pre>
Line 4,975:
=={{header|Lua}}==
Lua does not differentiate between arrays, lists, sets, dictionaries, maps, etc. It supports only one container: Table. Using Lua's simple yet powerful syntax, any of these containers can be emulated. All tables are dynamic. If a static array is necessary, that behavior can be created.
<
l[1] = 1 -- Index starts with 1, not 0.
l[0] = 'zero' -- But you can use 0 if you want
Line 4,981:
l.a = 3 -- Treated as l['a']. Any object can be used as index
l[l] = l -- Again, any object can be used as an index. Even other tables
for i,v in next,l do print (i,v) end</
=={{header|M2000 Interpreter}}==
Line 4,987:
We can copy multiple items from an array to another array (ore the same) with statement Stock. We can copy from memory to strings and place them to other address.
<
Module CheckArray {
\\ Array with parenthesis in name
Line 5,075:
}
CheckArray
</syntaxhighlight>
===Passing Arrays By Reference===
By default arrays passed by value. Here in make() we read reference in a variable A, which interpreter put then pointer to array, so it is a kind of reference (like in C). Using & we have normal reference. A ++ operator in a pointer of array add one to each element.
<
Dim a(10)=1
Print a() ' 1 1 1 1 1 1 1 1 1 1
Line 5,092:
A++
End Sub
</syntaxhighlight>
=={{header|Maple}}==
<
a := Array (1..5);
a := [ 0 0 0 0 0 ]
Line 5,111:
a := [ 9 2 3 4 5 6 ]
a[7] := 7;
Error, Array index out of range</
=={{header|Mathematica}} / {{header|Wolfram Language}}==
<
a[[1]]
Delete[a, 2]</
{{out}}
<pre>{Sin[1],Sin[2],Sin[3],Sin[4],Sin[5],Sin[6],Sin[7],Sin[8],Sin[9],Sin[10]}
Line 5,125:
Variables are not typed until they are initialized. So, if you want to create an array you simply assign a variable name the value of an array. Also, memory is managed by MATLAB so an array can be expanded, resized, and have elements deleted without the user dealing with memory. Array elements can be retrieved in two ways. The first way is to input the row and column indicies of the desired elements. The second way is to input the subscript of the array elements.
<
a =
Line 5,185:
2 35 10
7 9 42</
=={{header|Maxima}}==
<
array(a, flonum, 20, 20, 3)$
Line 5,212:
listarray(b);
/* [1000, 3/4] */</
=={{header|Mercury}}==
Line 5,218:
Mercury's arrays are a mutable non-functional type, and therefore are slightly more troublesome than functional types to A) accept as parameters to predicates, and B) involve in higher-order code, and C) include as a member of a composite data type. All of this is still very possible, but it requires an understanding of Mercury's variable instantiation system, as you can't just have 'in' and 'out' modes for parameters that involve arrays. Mercury has a 'bt_array' module with performance characteristics very similar to that of arrays, but which is a functional type and therefore is easier to work with. Especially if you're just starting out with Mercury, going with bt_array can be a big win for 'whippitupitude'.
<
:- interface.
:- import_module io.
Line 5,273:
else
true
).</
=={{header|MiniScript}}==
Line 5,301:
Example:
<
print arr[0]
arr.push "x"
print arr.pop</
=={{header|MIPS Assembly}}==
<
.data
array: .word 1, 2, 3, 4, 5, 6, 7, 8, 9 # creates an array of 9 32 Bit words.
Line 5,322:
li $v0, 10 # end program
syscall
</syntaxhighlight>
=={{header|Modula-2}}==
Line 5,328:
=={{header|Modula-3}}==
<
Defines a static array of 10 elements, indexed 1 through 10.
Static arrays can also be given initial values:
<
VAR staticArray2 := ARRAY [1..10] OF INTEGER {1, ..} (* Initialize all elements to 1. *)</
Open (dynamic) arrays can be be defined by creating a reference to an array of an unspecified size:
<
VAR openArray: TOpenIntArray;</
Defines an open array of a currently unknown size.
Open arrays must first be initialized via a call to the built-in function NEW, passing in the type and the size of the array.
The allocation is performed on the heap and all elements are initialized to 0:
<
Initializes the open array to hold 10 elements, indexed 0 through 9. Modula-3 uses garbage collection for heap allocated data by default, so once all references to the open array go out of scope, the memory it occupied is de-allocated automatically.
Retrieval or insertion of elements and determining array bounds is performed using the same built-in functions regardless of the array kind. Though open arrays must first be de-referenced when passing them to such functions. Assuming we have made the declarations above, we can do the following:
<
staticArraySize := NUMBER(staticArray);
staticArrayElement := staticArray[4];
openArraySize := NUMBER(openArray^); (* Note the dereference. *)
openArrayElement := openArray[9];</
<
openArray[1] := 200;</
=={{header|Monte}}==
<
To retrieve a value:
<syntaxhighlight lang
To change a value:
<
Now myArray is ['a','b','c','z'].
=={{header|Nanoquery}}==
<
arr = array(10)
Line 5,388:
// display the list
println l</
{{out}}
<pre>hello, world!
Line 5,394:
=={{header|Neko}}==
<
$print(myArray[0]);</
{{out}}
Line 5,402:
=={{header|Nemerle}}==
<
using System.Console;
using System.Collections;
Line 5,421:
foreach (i in dynamic) Write($"$i\t"); // Nemerle isn't great about displaying arrays, it's better with lists though
}
}</
=={{header|NetRexx}}==
'''Note:''' Dynamic arrays can be simulated via the [[Java]] [http://download.oracle.com/javase/6/docs/technotes/guides/collections/index.html Collections Framework] or by using [[NetRexx]] ''indexed strings'' (AKA: [[Creating an Associative Array|associative arrays]]).
<
options replace format comments java crossref symbols nobinary
Line 5,458:
loop x_ = 1 to cymru[0] by 1
say x_':' cymru[x_]
end x_</
{{out}}
Line 5,475:
=={{header|NewLISP}}==
This creates an array of 5 elements, initialized to <code>nil</code>:
<
→ (nil nil nil nil nil)</
The example below creates a multi-dimensional array (a 3-element array of 4-element arrays), initialized using the values returned by the function sequence (a list containing whole numbers from 1 to 12) and stores the newly created array in a variable called myarray. The return value of the set function is the array.
<
→ ((1 2 3 4) (5 6 7 8) (9 10 11 12))</
=={{header|Nim}}==
<
x = [1,2,3,4,5,6,7,8,9,10] # type and size automatically inferred
y: array[1..5, int] = [1,2,3,4,5] # starts at 1 instead of 0
Line 5,503:
a.add(200) # append another element
echo a.pop() # pop last item, removing and returning it
echo a</
=={{header|NS-HUBASIC}}==
<
20 A(1)=10
30 PRINT A(1)</
=={{header|NSIS}}==
Line 5,515:
NSIS does not have native support for arrays. Array support is provided by the [http://nsis.sourceforge.net/Arrays_in_NSIS NSISArray] plugin.
</div>
<
!include NSISArray.nsh
Function ArrayTest
Line 5,529:
Pop $0
FunctionEnd
</syntaxhighlight>
=={{header|Oberon-2}}==
<
MODULE Arrays;
IMPORT
Line 5,569:
Dynamic
END Arrays.
</syntaxhighlight>
=={{header|Objeck}}==
<
bundle Default {
class Arithmetic {
Line 5,583:
}
}
</syntaxhighlight>
=={{header|Objective-C}}==
<
// Create an array of NSString objects.
Line 5,609:
// No nil termination is then needed.
NSArray *thirdArray = @[ @"Hewey", @"Louie", @"Dewey", @1, @2, @3 ];
</syntaxhighlight>
=={{header|OCaml}}==
in the toplevel:
<
- : char array = [|'A'; 'A'; 'A'; 'A'; 'A'; 'A'|]
Line 5,629:
# arr ;;
- : int array = [|0; 1; 2; 3; 65; 5; 6|]</
=={{header|Oforth}}==
Line 5,636:
To create a mutable array, #new is used.
<
Array new dup addAll( [1, 2, 3] ) dup put( 2, 8.1 ) .
</syntaxhighlight>
{{out}}
Line 5,659:
The last element in a vector is indexed by minus one, and the first element is indexed by minus length of the vector.
<
; making a vector
> #(1 2 3 4 5)
Line 5,768:
[7 8 3]])
#false
</syntaxhighlight>
=={{header|ooRexx}}==
ooRexx arrays hold object references. Arrays will automatically increase in size if needed.
<
b = .array~new(10) -- create an array with initial size of 10
c = .array~of(1, 2, 3) -- create a 3 element array holding objects 1, 2, and 3
a[3] = "Fred" -- assign an item
b[2] = a[3] -- retrieve an item from the array
c~append(4) -- adds to end. c[4] == 4 now</
ooRexx provides a built-in array class that provides one- and more dimensional arrays
Line 5,796:
to all compound variables with that stem.
<
XXX.='*'
Say 'xxx.1='xxx.1 -- shows xxx.1=*
Line 5,802:
xxx.u='Joe'
Say 'xxx.u='xxx.17 -- shows xxx.u=Joe
</syntaxhighlight>
ooRexx introduces a notation a.[x,y] where x and y can actually be expressions.
Line 5,821:
must not exceed 250 bytes no longer applies to ooRexx and Regina.
XXX.u.v...='something'
<
v='John Doe'
XXX.u.v...='some value'
z='17.John Doe...'
Say xxx.z shows 'some value'</
When using a stem for storing structured data, as in
<
person.last='Pachl'</
it is advisable to use constant symbols such as 0first and 0last in the tail
since an accidental use of the variables first or last would render confusion.
=={{header|OxygenBasic}}==
<
'CREATING A STATIC ARRAY
Line 5,858:
print f(2) 'value set to 0.0
redim float f(0) 'release allocated memory '
</syntaxhighlight>
=={{header|Oz}}==
<
Arr = {Array.new 1 %% lowest index
10 %% highest index
Line 5,869:
{Show Arr.1}
Arr.1 := 64
{Show Arr.1}</
=={{header|PARI/GP}}==
<
v=concat(v,7);
v[1]</
=={{header|Pascal}}==
A modification of the Delphi example:
<
Program ArrayDemo;
uses
Line 5,912:
writeln(DynamicArrayText);
end.
</syntaxhighlight>
=={{header|Perl}}==
Line 5,918:
In-line
<
my @empty_too = ();
Line 5,926:
my $aref = ['This', 'That', 'And', 'The', 'Other'];
print $aref->[2]; # And
</syntaxhighlight>
Dynamic
<
push @arr, 1;
Line 5,937:
$arr[0] = 2;
print $arr[0];</
Two-dimensional
<
[0, 1, 2, 3],
[qw(a b c d e f g)],
[qw(! $ % & *)],
);
</syntaxhighlight>
=={{header|Phix}}==
Line 5,956:
without any need to worry about memory management issues.
<!--<
<span style="color: #000080;font-style:italic;">-- simple one-dimensional arrays:</span>
<span style="color: #004080;">sequence</span> <span style="color: #000000;">s1</span> <span style="color: #0000FF;">=</span> <span style="color: #0000FF;">{</span><span style="color: #000000;">0.5</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">1</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">4.7</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">9</span><span style="color: #0000FF;">},</span> <span style="color: #000080;font-style:italic;">-- length(s1) is now 4</span>
Line 6,031:
<span style="color: #0000FF;">?</span><span style="color: #000000;">s1</span>
<span style="color: #0000FF;">?</span><span style="color: #000000;">s2</span>
<!--</
{{out}}
Line 6,045:
=={{header|Phixmonti}}==
<
0 tolist /# create an empty array/list. '( )' is equivalent #/
Line 6,059:
3 2 slice /# extract the subarray/sublist [ 2 "Hello" ] #/
pstack /# show the content of the stack #/ </
=={{header|PHP}}==
===Writing To An Array===
====Single Dimension====
<
$LetterArray = array("a", "b", "c", "d", "e", "f");
$simpleForm = ['apple', 'orange'];</
====Multi-Dimensional====
<
array(0, 0, 0, 0, 0, 0),
array(1, 1, 1, 1, 1, 1),
array(2, 2, 2, 2, 2, 2),
array(3, 3, 3, 3, 3, 3)
);</
====Array push====
<
array_push($arr, 'pear');
print implode(',', $arr); // Returns apple,orange,pear</
===Reading From An Array===
====Single Dimension====
Read the 5th value in the array:
<
echo $LetterArray[5]; // Returns f</
====Multi-Dimensional====
Read the 2nd line, column 5
<
===Print a whole array===
This is useful while developing to view the contents of an array:
<syntaxhighlight lang
Which would give us:
<
0 => array(
0 => 0
Line 6,127:
5 => 3
)
)</
=== Set custom keys for values===
This example starts the indexing from 1 instead of 0
<
This example shows how you can apply any key you want
<
To read the 3rd value of the second array:
<
===Other Examples===
Create a blank array:
<
Set a value for the next key in the array:
<
Assign a value to a certain key:
<
=={{header|Picat}}==
Line 6,151:
Here are some examples how to use arrays.
<
go =>
Line 6,196:
nl.
</syntaxhighlight>
{{out}}
Line 6,218:
{{trans|Prolog}}
<
List = new_list(5), % create a list of length 5
nth(1,List,a), % put an a at position 1 , nth/3 uses indexing from 1
Line 6,231:
Value = List3[1], % get the value at position 1
println(value=Value). % will print out a
</syntaxhighlight>
{{out}}
Line 6,244:
=={{header|PicoLisp}}==
PicoLisp has no built-in array data type. Lists are used instead.
<
(mapc println A) # Show it</
{{out}}
<pre>(1 2 3)
Line 6,251:
((d e) NIL 777)</pre>
Replace 'b' with 'B' in middle row:
<
(mapc println A)</
{{out}}
<pre>(1 2 3)
Line 6,258:
((d e) NIL 777)</pre>
Insert '1' in front of the middle row:
<
(mapc println A)</
{{out}}
<pre>(1 2 3)
Line 6,265:
((d e) NIL 777)</pre>
Append '9' to the middle row:
<
(mapc println A)</
{{out}}
<pre>(1 2 3)
Line 6,273:
=={{header|Pike}}==
<
// Initial array, few random elements.
array arr = ({3,"hi",84.2});
Line 6,280:
write(arr[5] + "\n"); // And finally print element 5.
}</
=={{header|PL/I}}==
<
declare A(10) float initial (1, 9, 4, 6, 7, 2, 5, 8, 3, 10);
Line 6,303:
C = 0;
c(7) = 12;
put (C(9));</
=={{header|Plain English}}==
Arrays are a bit of a sticking point for Plain English, because its creators have not as yet devised a sufficiently elegant way to work with them within the constraints of the language. Only lists have high-level routine support. Nevertheless, the capability to build arrays ourselves exists within the language. Following is an example of how it could be done.
<
Start up.
Write "Creating an array of 100 numbers..." on the console.
Line 6,352:
Put the number array's first element pointer into a number pointer.
Add the offset to the number pointer.
Put the number into the number pointer's target.</
{{out}}
<pre>
Line 6,366:
Arrays are homogenous.
<
- - -
Line 6,382:
Fact(s == 3) // size of array 'other' is 3
other(1) = 40 // 'other' now is [10, 40, 30]
end</
=={{header|PostScript}}==
Line 6,402:
x 1 get
</syntaxhighlight>
=={{header|PowerShell}}==
Empty array:
<
Array initialized with only one member:
<
$a = @(2) # alternative</
Longer arrays can simply be created by separating the values with commas:
<
A value can be appended to an array using the <code>+=</code> operator:
<
Since arrays are immutable this simply creates a new array containing one more member.
Values can be retrieved using a fairly standard indexing syntax:
<syntaxhighlight lang
Similarly, those values can also be replaced:
<
The range operator <code>..</code> can be used to create contiguous ranges of integers as arrays:
<
Indexing for retrieval allows for arrays as well, the following shows a fairly complex example combining two ranges and an arbitrary array in the indexer:
<
Indexing from the end of the array can be done with negative numbers:
<
=={{header|Prolog}}==
Line 6,434:
retrieve and set elements.
<
singleassignment:-
functor(Array,array,100), % create a term with 100 free Variables as arguments
Line 6,444:
arg(4 ,Array,Value2), % get the value at position 4 which is a free Variable
print(Value2),nl. % will print that it is a free Variable followed by a newline
</syntaxhighlight>
To destructively set an array element, which is the "normal" way to set an element in most other
programming languages, setarg/3 can be used.
<
destructive:-
functor(Array,array,100), % create a term with 100 free Variables as arguments
Line 6,458:
arg(1 ,Array,Value1), % get the value at position 1
print(Value1),nl. % will print Value1 and therefore c followed by a newline
</syntaxhighlight>
Lists can be used as arrays.
<
listvariant:-
length(List,100), % create a list of length 100
Line 6,472:
nth1(1 ,List3,Value), % get the value at position 1
print(Value),nl. % will print out a
</syntaxhighlight>
=={{header|PureBasic}}==
Line 6,478:
'''Dim''' is used to create new arrays and initiate each element will be zero. An array in PureBasic can be of any types, including structured, and user defined types. Once an array is defined it can be resized with '''ReDim'''. Arrays are dynamically allocated which means than a variable or an expression can be used to size them.
<
Dim MyArray.i(22)
MyArray(0) = 7
MyArray(1) = 11
MyArray(7) = 23</
'''ReDim''' is used to 'resize' an already declared array while preserving its content. The new size can be both larger or smaller, but the number of dimension of the array can not be changed after initial creation.
<
ReDim MyArray(55)
MyArray(22) = 7
MyArray(33) = 11
MyArray(44) = 23</
<
For i=0 To ArraySize(MyArray())
If MyArray(i)
PrintN(Str(i)+" differs from zero.")
EndIf
Next</
<
Dim MultiArray.i(800, 600)
MultiArray(100, 200) = 640
MultiArray(130, 40) = 120</
<
PrintN( Str(ArraySize(MultiArray2(), 2)) ; Will tell that second dimension size is '128'</
=={{header|Python}}==
Python lists are dynamically resizeable.
<
array.append(1)
Line 6,511:
array[0] = 2
print array[0]</
A simple, single-dimensional array can also be initialized thus:
<
However this will not work as intended if one tries to generalize from the syntax:
<
This creates a list of "height" number of references to one list object ... which is a list of width instances of the number zero. Due to the differing semantics of immutables (strings, numbers) and mutables (dictionaries, lists), a change to any one of the "rows" will affect the values in all of them. Thus we need to ensure that we initialize each row with a newly generated list.
Line 6,525:
To initialize a list of lists one could use a pair of nested list comprehensions like so:
<
That is equivalent to:
<
for x in range(height):
myArray.append([0] * width)</
To retrieve an element in an array, use any of the following methods:
<
# Retrieve an element directly from the array.
item = array[index]
Line 6,545:
# Using a negative element counts from the end of the list.
item = array[-1] # Retrieve last element in a list.
</syntaxhighlight>
Python produces an IndexError when accessing elements out of range:
<
try:
# This will cause an exception, which will then be caught.
Line 6,555:
# Print the exception.
print e
</syntaxhighlight>
=={{header|QB64}}==
<
'Task
'Show basic array syntax in your language.
Line 6,676:
</syntaxhighlight>
=={{header|Quackery}}==
Line 6,749:
Dynamic
<
arr <- append(arr,3)
Line 6,755:
arr[1] <- 2
print(arr[1])</
=={{header|Racket}}==
<
;; import dynamic arrays
Line 6,770:
(gvector-ref gv 0) ; 1
(gvector-add! gv 5) ; increase size
</syntaxhighlight>
=={{header|Raku}}==
Line 6,776:
At its most basic, an array in Raku is quite similar to an array in Perl 5.
<
push @arr, 1;
Line 6,783:
@arr[0] = 2;
say @arr[0];</
===Some further exposition:===
Line 6,854:
=={{header|REBOL}}==
<
a: [] ; Empty.
b: ["foo"] ; Pre-initialized.
</syntaxhighlight>
Inserting and appending.
<
append a ["up" "down"] ; -> ["up" "down"]
insert a [left right] ; -> [left right "up" "down"]
</syntaxhighlight>
Getting specific values.
<
first a ; -> left
third a ; -> "up"
last a ; -> "down"
a/2 ; -> right (Note: REBOL is 1-based.)
</syntaxhighlight>
Getting subsequences. REBOL allows relative motion through a block (list).
Line 6,879:
you can even assign to it without destroying the list.
<
a ; -> [left right "up" "down"]
next a ; -> [right "up" "down"]
Line 6,890:
copy/part a 2 ; -> [left right]
copy/part skip a 2 2 ; -> ["up" "down"]
</syntaxhighlight>
=={{header|Red}}==
<
arr2: ["apple" "orange" 1 2 3] ;create an array with data
>> insert arr1 "blue"
Line 6,906:
== "black"
>> pick arr1 2
== "black"</
A vector! is a high-performance series! of items.
The items in a vector! must all have the same type.
The allowable item types are: integer! float! char! percent!
Vectors of string! are not allowed.
<
== make vector! [20 30 70]
>> vec1/2
Line 6,926:
*** Script Error: invalid argument: 3.0
*** Where: append
*** Stack:</
=={{header|ReScript}}==
<
let _ = Js.Array2.push(arr, 4)
Line 6,936:
arr[3] = 5
Js.log(Js.Int.toString(arr[3]))</
{{out}}
<pre>
Line 6,947:
Retro has a vocabulary for creating and working with arrays.
<
needs array'
Line 6,982:
( Create a quote from the values in an array )
d ^array'toQuote
</syntaxhighlight>
=={{header|REXX}}==
Line 6,989:
===simple arrays===
<
a.='not found' /*value for all a.xxx (so far).*/
do j=1 to 100 /*start at 1, define 100 elements*/
Line 6,997:
say 'element 50 is:' a.50
say 'element 3000 is:' a.3000
/*stick a fork in it, we're done.*/</
{{out}}
<pre>
Line 7,005:
===simple arrays, mimic other languages===
<
a. = 'not found' /*value for all a.xxx (so far). */
do j=1 to 100 /*start at 1, define 100 elements*/
Line 7,015:
exit /*stick a fork in it, we're done.*/
/*──────────────────────────────────A subroutine────────────────────────*/
a: _a_ = arg(1); return a._a_</
<pre>
element 50 is: -5000
Line 7,022:
===simple arrays, assigned default===
<
a. = 00 /*value for all a.xxx (so far). */
do j=1 to 100 /*start at 1, define 100 elements*/
Line 7,032:
exit /*stick a fork in it, we're done.*/
/*──────────────────────────────────A subroutine────────────────────────*/
a: _a_ = arg(1); return a._a_</
{{out}}
<pre>
Line 7,040:
===arrays with non-unity index start===
<
array. = 'out of range' /*define ALL elements to this. */
Line 7,049:
say g "squared is:" array.g
say 7000 "squared is:" array.7000
/*stick a fork in it, we're done.*/</
{{out}}
<pre>
Line 7,057:
===arrays, disjoint===
<
yr. = 'year not supported' /*value for all yr.xxx (so far).*/
Line 7,073:
year=1744
say 'DOB' year "is:" yr.year
/*stick a fork in it, we're done.*/</
{{out}}
<pre>
Line 7,081:
===sparse arrays and special indices===
<
yyy = -55 /*REXX must use this mechanism···*/
a.yyy = 1e9 /*··· when assigning neg indices.*/
Line 7,107:
│ identify stemmed arrays (the period). │
└────────────────────────────────────────────────────────────────────┘*/
/*stick a fork in it, we're done.*/</
=={{header|Ring}}==
Line 7,113:
Dynamic
<
a = ['foo']
Line 7,123:
# retrieve an element
see a[1]</
=={{header|RLaB}}==
<
// 1-D (row- or column-vectors)
// Static:
Line 7,158:
</syntaxhighlight>
=={{header|Robotic}}==
Robotic does not natively support arrays of any kind.
However, using [https://www.digitalmzx.net/wiki/index.php?title=Counter_interpolation Counter Interpolation], we can create a simple (faux) array.
<
set "index" to 0
. "Assign random values to array"
Line 7,173:
* "Value of index 50 is ('array('50')')."
end
</syntaxhighlight>
You can even create multi-dimensional arrays using the Counter Interpolation method.
<
set "xx" to 0
set "yy" to 0
Line 7,190:
* "Value of 16,16 is ('array('16'),('16')')."
end
</syntaxhighlight>
Because arrays aren't built in, there are no functions that allow you to manipulate the data you create within an array. You would have to create your own function when, for example, you want to sort numbers from least to greatest.
Line 7,198:
{{works with|ILE RPG}}
<
//-Static array
//--def of 10 el array of integers, initialised to zeros
Line 7,226:
/end-free
</syntaxhighlight>
=={{header|Ruby}}==
Line 7,232:
Dynamic
<
a = ['foo']
Line 7,251:
# retrieve an element
puts a[0]</
=={{header|Run BASIC}}==
<
print "Enter array 2 greater than 0"; : input a2
Line 7,262:
chrArray$(1,1) = "Hello"
numArray(1,1) = 987.2
print chrArray$(1,1);" ";numArray(1,1)</
=={{header|Rust}}==
Line 7,270:
By default, arrays are immutable unless defined otherwise.
<
let mut m = [1, 2, 3]; // mutable array
let zeroes = [0; 200]; // creates an array of 200 zeroes</
To get the length and iterate,
<
a.len();
for e in a.iter() {
e;
}</
Accessing a particular element uses subscript notation, starting from 0.
<
names[1]; // second element</
Dynamic arrays in Rust are called vectors.
<
However, this defines an immutable vector. To add elements to a vector, we need to define v to be mutable.
<
v.push(4);
v.len(); // 4</
=={{header|Sather}}==
<
a :ARRAY{INT};
-- create an array of five "void" elements
Line 7,309:
b[1] := c; -- syntactic sugar for b.aset(1, c)
-- append another array
b := b.append(|5.5|);</
=={{header|Scala}}==
Arrays are not used often in Scala, since they are mutable and act differently to other collections with respect to type erasure, but are necessary for interoperability with Java. Alternatives such as List, Seq, and Vector are more commonly used.
<
val a = new Array[Int](10)
Line 7,323:
// Retrieve item at element 2
val c = b(2)</
Dynamic arrays can be made using <code>ArrayBuffer</code>s:
<
a += 5 // Append value 5 to the end of the list
a(0) = 6 // Assign value 6 to element 0</
=={{header|Scheme}}==
Lists are more often used in Scheme than vectors.
<
(array2 (make-vector 5)) ; default is unspecified
(array3 (make-vector 5 0))) ; default 0
(vector-set! array 0 3)
(vector-ref array 0)) ; 3</
=={{header|Scratch}}==
Line 7,348:
Every type, which can be mapped to integer, can be used as index type.
<
const type: charArray is array [char] string; # Define an array type for arrays with char index.
Line 7,382:
array1 := array3[2 len 4]; # Assign a slice of four elements beginning with the second element.
array1 := array3 & array6; # Concatenate two arrays and assign the result to array1.
end func;</
=={{header|Self}}==
Line 7,390:
Creating simple vectors:
<syntaxhighlight lang
<
A polymorphic vector:
<
Using a vector:
<
"creates an vector that holds up to 20 elements"
v: vector copySize: 20.
Line 7,405:
(v at: 9) printLine.
"put 100 as second value"
vat: 1 Put: 100.</
Enumeration:
<
v copy mapBy: [:each | each squared].
v copy filterBy: [:each | each > 10].</
Using a squence:
<
"creates a new sequence"
s: sequence copyRemoveAll.
Line 7,423:
s removeFirst.
"Check size"
s size printLine.</
=={{header|SenseTalk}}==
<
set a to (1, 2, 3)
Line 7,454:
// Changing the values in the array
set the third item of a to "abc"
put a -- (2, 3, "abc", 6)</
=={{header|Sidef}}==
<
var arr = [];
Line 7,485:
# retrieve an element
say arr[-1]; #=> 'baz'</
=={{header|Simula}}==
<
PROCEDURE STATIC;
Line 7,523:
DYNAMIC(5)
END ARRAYS.
</syntaxhighlight>
{{out}}
<pre>
Line 7,530:
</pre>
One can write an ArrayList class like Java has in package java.util.
<
CLASS ITEM;;
Line 7,675:
END;
</syntaxhighlight>
{{out}}
<pre>EXPAND TO CAPACITY 20
Line 7,763:
=={{header|Slate}}==
<
{1. 2. 3}
slate[2]> x
Line 7,776:
1
slate[7]> x at: 0.
1</
=={{header|Smalltalk}}==
Line 7,787:
Literal Arrays (Array constants):
<
a polymorphic array containing integers, a string, a float, booleans, a nil, another array with integers and a character constant.
Programatic use:
<
"creates an array that holds up to 20 elements"
array := Array new: 20 .
Line 7,802:
array := Array withAll: #('an' 'apple' 'a' 'day' 'keeps' 'the' 'doctor' 'away').
"Replacing apple with orange"
array at: 2 put: 'orange'.</
<
"suppose array is bound to an array of 20 values"
array at: 5 put: 'substitute fifth element'.
Line 7,810:
[ array at: 21 put: 'error' ]
on: SystemExceptions.IndexOutOfRange
do: [ :sig | 'Out of range!' displayNl ].</
<
#($a $b $c) at: 2</
Enumeration:
<
array collect:[:each | each squared|
array select:[:each | each > 10]</
{{works with|Pharo}}
Line 7,824:
{{works with|Squeak}}
Constructing an Array from evaluated expressions:
<
this construct evaluates each expression and creates a 4-element array containing a time, int, date and string object.
OrderedCollection:
<
oc add:1. oc add:2. oc add:3.
foo := oc removeFirst.
Line 7,840:
oc findFirst:[:el | el isString]
"hundreds of other methods skipped here.."
</syntaxhighlight>
=={{header|SNOBOL4}}==
SNOBOL4 supports multi-dimensional arrays and array initialization.
<
fill i = LT(i, 3) i + 1 :F(display)
ar<i,1> = i
Line 7,853:
OUTPUT = "Row " ar<j,1> ": " ar<j,2>
+ :S(display)
END</
{{out}}
<pre>
Line 7,862:
=={{header|SPL}}==
<
a[2] = 3
a[3] = "Result is "
#.output(a[3],a[1]+a[2])</
{{out}}
<pre>
Line 7,901:
done: ; program continues</pre>
We are now in a position to translate this algorithm into SSEM instructions and run it. As always, the SSEM version is a bit fiddlier than the pseudocode because the SSEM has no <tt>load</tt> or <tt>add</tt> instructions; but it follows the pseudocode as closely as the instruction set allows, so it should be comparatively readable. As a test, we shall sum an array of the first four positive integers—a very significant operation for the Pythagoreans of old—and halt with the accumulator holding the result.
<
11101000000000010000000000000000 1. Sub. 23
00101000000001100000000000000000 2. c to 20
Line 7,927:
01000000000000000000000000000000 24. 2
11000000000000000000000000000000 25. 3
00100000000000000000000000000000 26. 4</
The program could easily be modified to work with arrays of unknown length, if required, along the lines of the second pseudocode example above.
=={{header|Standard ML}}==
<
(* create first array and assign elements *)
-val first = Array.tabulate (10,fn x=>x+10) ;
Line 7,943:
-Array.sub(second,4);
val it = 14: int
</syntaxhighlight>
=={{header|Stata}}==
In Stata, there are mainly two ways to work with arrays: the '''[http://www.stata.com/help.cgi?matrix matrix]''' command can create and manipulate arrays, either elementwise or using matrix functions. And there is Mata, a matrix programming language similar to MATLAB, R or SAS/IML.
Line 7,957:
=== Matrix command ===
<
display det(a)
matrix svd u d v = a
Line 7,964:
* store the u and v matrices in the current dataset
svmat u
svmat v</
=== Mata ===
<
a = 2,9,4\7,5,3\6,1,8
det(a)
Line 7,973:
// Notice that to reconstruct the matrix, v is not transposed here,
// while it is with -matrix svd- in Stata.
u*diag(s)*v</
=={{header|Suneido}}==
<
array.Add('three')
array.Add('five', at: 5)
array[4] = 'four'
Print(array[3]) --> 'three'</
=={{header|Swift}}==
<
var anyArray = [Any]()
anyArray.append("foo") // Adding to an Array
anyArray.append(1) // ["foo", 1]
anyArray.removeAtIndex(1) // Remove object
anyArray[0] = "bar" // ["bar"]</
=={{header|Tailspin}}==
<
// arrays are created as literals, by simply listing elements, or by a generator expression, or a combination.
def a: [1, 2, 3..7:2, 11];
Line 8,016:
// A mutable array can be appended
5 -> \(@: [1,2]; $ -> ..|@: $; $@ ! \) -> !OUT::write
</syntaxhighlight>
{{out}}
<pre>
Line 8,028:
=={{header|Tcl}}==
Tcl's lists are really dynamic array values behind the scenes. (Note that Tcl uses the term “array” to refer to an associative collection of variables.)
<
lappend ary 1
Line 8,035:
lset ary 0 2
puts [lindex $ary 0]</
Note also that serialization is automatic on treating as a string:
<
=={{header|Tern}}==
Arrays and lists are synonymous in Tern.
<
for(i in list) {
println(i);
}
</syntaxhighlight>
{{out}}
Line 8,060:
<br>'''List'''<br>
One dimensional arrays are lists, they can be set as a whole with the syntax:
<
using only numerical values separated by commas and enclosed by curly braces.<br>
Lists can be accessed as a whole using L1-L6 or a custom list name
Line 8,066:
You can also retrieve a single value from a list using the name of the list and
the position of the value, which starts at 1 on the left.
<
Disp L1(3)
0→L1(4)</
This would return 3 and set the fourth list element to 0.
<br>You can dynamically define or delete lists by:
<
DelVar L1
5→dim(∟MYLIST)
DelVar ∟MYLIST</
'''Matrix'''<br>
Two dimensional arrays are matrices. Similar, set them and retrieve numbers using the syntax:
<
Disp [A](1,3)
0→[A](4,2)</
This would return 13 and set the element (4,2) to 0.
<br>You can dynamically define or delete matrices by:
<
DelVar [A]</
=={{header|TorqueScript}}==
Arrays in TorqueScript:
<
$array[0] = "hi";
$array[1] = "hello";
for(%i=0;%i<2;%i++)
echo($array[%i]);</
=> hi
Line 8,099:
=> hello
<
$array["Greet",0] = "hi";
$array["Greet",1] = "hello";
for(%i=0;%i<2;%i++)
echo($array["Greet",%i]);</
=> hi
Line 8,117:
Vectors can be created as empty containers, or they can be initialized with some values at the time of creation.
<
v1: Vector<Int>(),
v2: Vector<String>(),
Line 8,125:
v5: [1.0, 2.5, 8.6], // Vector<Double>
v6: ["one","two","three"] // Vector<String>
}</
Individual elements in a vector can be read, appended, and deleted.
<
(textout (get v 1)) // <= 2
(erase v 1)
Line 8,135:
(append v 7)
(textout v) // <= [1, 3, 7]
)</
All standard container operations can be applied to vectors:
<
(textout (reverse v)) // <= [4, 2, 5, 1, 3]
(textout (sort v)) // <= [1, 2, 3, 4, 5]
(textout (shuffle v)) // <= [5, 3, 4, 1, 2]
)</
=={{header|TXR}}==
Line 8,210:
A complete program which turns comma-separated into tab-separated,
where the first and last field from each line are exchanged:
<
@line
@(bind f @(split-str line ","))
Line 8,216:
@{f[-1]}@\t@{f[1..-1] "\t"}@\t@{f[0]}
@(end)
@(end)</
====Other Kinds of Objects====
Line 8,226:
=={{header|uBasic/4tH}}==
uBasic/4tH has only one single, global array of 256 integers. Since it's fixed, it can't be declared.
<lang>Let @(0) = 5 : Print @(0)</
=={{header|Unicon}}==
Unicon's arrays are provided by the list type, which is a hybrid list/array type.
Lists of integers or reals, if not polluted by other types nor changed in size, may use a C-compatible internal representation (long and double).
<lang>L := list(100); L[12] := 7; a := array(100, 0.0); a[3] +:= a[1]+a[2]</
=={{header|UNIX Shell}}==
Line 8,241:
To create an array:
<
declare -a list2 # declare an empty list called "list2"
declare -a list3[0] # empty list called "list3"; the subscript is ignored
# create a 4 item list, with a specific order
list5=([3]=apple [2]=cherry [1]=banana [0]=strawberry)</
To obtain the number of items in an array:
<
echo "The number of items in alist is ${#alist[*]}"</
To iterate up over the items in the array:
<
while [[ $x < ${#alist[*]} ]]; do
echo "Item $x = ${alist[$x]}"
: $((x++))
done</
To iterate down over theitems in an array:
<
while [[ $x > 0 ]]; do # while there are items left
: $((x--)) # decrement first, because indexing is zero-based
echo "Item $x = ${alist[$x]}" # show the current item
done</
To append to an array, use the current number of items in the array as the next index:
<
To make appending easier, use a little shell function, let's call it "push", and design it to allow appending multiple values, while also preserving quoted values:
<
# push LIST VALUES ...
push() {
Line 8,274:
push alist "one thing to add"
push alist many words to add</
To delete a single array item, the first item:
<syntaxhighlight lang
To delete and return the last item in an array (e.g., "pop" function):
<
pop() {
Line 8,300:
c
pop alist
No items in alist</
To delete all the items in an array:
<syntaxhighlight lang
To delete the array itself (and all items in it, of course):
<syntaxhighlight lang
=={{header|உயிர்/Uyir}}==
<
இருபரிமாணணி வகை எண் அணி {3, 3};
இருபரிமாணணி2 வகை எண் அணி {3} அணி {3};
Line 8,317:
செவ்வகணி = அணி { அணி {10, 22, 43}, அணி {31, 58, 192}, அணி {46, 73, 65} };
முக்கோண்ணி = அணி { அணி {1}, அணி {2, 3}, அணி {4, 5, 6}, அணி {7, 8, 9, 1, 2} };
</syntaxhighlight>
=={{header|Vala}}==
Non-dynamic arrays:
<
int[] array = new int[10];
Line 8,328:
stdout.printf("%d\n", array[0]);
</syntaxhighlight>
{{libheader|Gee}}
Dynamic Arrays with Gee:
<
var array = new ArrayList<int> ();
Line 8,341:
stdout.printf("%d\n", array[0]);
</syntaxhighlight>
=={{header|VBA}}==
The Option Base statement is used at the module level to declare the default lower bound for array subscripts.
<syntaxhighlight lang
<
'create an array,
Dim a(3) As Integer
Line 8,374:
Debug.Print d(i)
Next i
End Sub</
{{out}}
<pre> 1 4 9 1 4 9 1 4 9 16 </pre>
=={{header|VBScript}}==
<
'create a static array
Line 8,423:
'Multi-Dimensional arrays
'The following creates a 5x4 matrix
Dim mat(4,3) </
{{out}}
<pre>
Line 8,434:
=={{header|VHDL}}==
<
entity Array_Test is
end entity Array_Test;
Line 8,492:
end architecture Example;
</syntaxhighlight>
=={{header|Vim Script}}==
Lists can be used for dynamic arrays. Indexing starts at 0.
<
let array = [3, 4]
Line 8,514:
call insert(array, 3, 2)
echo array</
{{Out}}
Line 8,520:
=={{header|Visual Basic .NET}}==
<
Dim numbers As Integer() = New Integer(9) {}
'Example of array of 4 string types:
Line 8,550:
list.Add(3)
list(0) = 2
Console.WriteLine(list(0))</
=={{header|Vlang}}==
<
// Tectonics: v run arrays.v
module main
Line 8,606:
println("array4: $array4")
println("array5: $array5")
}</
{{out}}
Line 8,627:
=={{header|Wee Basic}}==
<
let array$(1)="Hello!"
let array$(2)="Goodbye!"
print 1 array$(1)</
=={{header|Wren}}==
<
arr.add(1)
arr.add(2)
Line 8,646:
arr[-1] = 0
arr.insert(-1, 0) // [0, 0, 1, 0, 0]
arr.removeAt(2) // [0, 0, 0, 0]</
=={{header|X86 Assembly}}==
<
section .text
global _start
Line 8,728:
resd 1
resd 1
</syntaxhighlight>
Arrays in assembly are a reference to anything, from groups of data such as f/uArray to strings like _msg's or sArray.
Mutlidimentional arrays don't exist in assembly. To make a reference to one from assembly, we use a format as such. "row * r_len + column * member_size".
Line 8,734:
=={{header|XBS}}==
Arrays in [[XBS]] are very similar to [[JavaScript]].
<
log(Array[0]);
Array.push("Test");
log(?Array);
log(Array[?Array-1]);</
=={{header|XLISP}}==
Like some other languages, XLISP refers to one-dimensional arrays as vectors. Examples of vector and array syntax, from a REPL (interactive session):
<
A
Line 8,765:
[8] (array-ref d 1 2 3) ; and get the value of d_1,2,3
10</
=={{header|XPL0}}==
<
char A(10); \creates a static array of 10 bytes, pointed to by "A"
char B; \declares a variable for a pointer to a dynamic array
Line 8,775:
B(7):= 28;
IntOut(0, A(3)+B(7)); \displays 42
]</
=={{header|Yabasic}}==
<
// Indexed at your preference (0 to 9 or 1 to 10)
print arraysize(a(), 1) // this function return the element's higher number of an array
Line 8,805:
print arraysize(a$(), 1)
print a$(5) // show the content of an element of the array. Now is empty</
=={{header|Z80 Assembly}}==
An array is nothing more than a contiguous section of memory. Whether an array is mutable or not is solely determined by whether its memory location is in ROM or RAM.
<
byte 0,0,0,0,0
byte 0,0,0,0,0
byte 0,0,0,0,0
byte 0,0,0,0,0</
<i>Side note: Some systems, such as the Game Boy or other ROM cartridge-based computers, cannot use the above declaration to initialize an array in RAM at assemble time; only in ROM. While the label "Array" can be given to an arbitrary RAM location on any system, you won't be able to define a data block in RAM the same way you would on an assembly program meant to run on the Amstrad CPC or ZX Spectrum for example. The examples below will still work on any system, you just won't be able to "see" the array before running the program, if that makes sense. Clearing the system ram will suffice to initialize the array to zero.</i>
Line 8,821:
This code will assign a value of decimal 20 to the 1st (zero-indexed) row and 2nd (zero-indexed) column. The resulting array will look like this:
<
byte 0,0,0,0,0
byte 0,0,20,0,0
byte 0,0,0,0,0
byte 0,0,0,0,0</
<
ld hl,Array ;hl points to the 0th element of row 0.
Line 8,839:
ld a,20 ;get the value 20 which we want to store here
ld (hl),a ;store 20 into the desired slot. (Retrieving a value is the same process except we skip the step above and
; execute "ld a,(hl)" at this point instead.)</
The main takeaway from all this is that arrays are handled the same as any other type of memory, and have no "special" syntax, apart from the boilerplate pointer arithmetic of <code>*array = *array + (desired_row_number*row_length*bytes_per_element) + (desired_column_number*bytes_per_element)</code>. This is the case for most assembly languages, even though the methods of offsetting a pointer may vary.
Line 8,848:
In the example below, we wish to load the 13th (zero-indexed) element from the array MyTable.
<
;>LABEL means "the high byte of the address represented by LABEL
LD L,13 ;this was a lot faster than doing LD HL,&0400 and adding the desired index later.
Line 8,860:
byte 3,6,9,12,15
byte 4,8,12,16,20
byte 5,10,15,20,25</
But what if you're working with 16-bit data? If you've got bytes to burn, you can separate your data into two "byteplanes" - a pair of tables, one of which contains the low bytes and the other containing the high bytes, both sharing a common index. Using alignment you can guarantee that they are a multiple of &0100 bytes apart, which simplifies the lookup process greatly. You can get away with loading just the high byte of the pointer to the "low table" and incrementing that half of the pointer to get to the high byte, while leaving the index (which is stored in the low half of your pointer register) intact.
That might have been a bit confusing, so let's visualize the concept. Here's a practical example of storing a sine wave pattern. Instead of storing 16-bit data together like you normally would:
<
word &8000,&8327,&864e,&8973,&8c98,&8fba,&92da,&95f7
word &9911,&9c27,&9f38,&a244,&a54c,&a84d,&ab48,&ae3c
word &b12a,&b40f,&b6ed,&b9c2,&bc8e,&bf50,&c209,&c4b7
word &c75b,&c9f4,&cc81,&cf02,&d177,&d3e0,&d63b,&d889</
You can instead store it like this:
<
byte <&8000,<&8327,<&864e,<&8973,<&8c98,<&8fba,<&92da,<&95f7
byte <&9911,<&9c27,<&9f38,<&a244,<&a54c,<&a84d,<&ab48,<&ae3c
Line 8,881:
byte >&9911,>&9c27,>&9f38,>&a244,>&a54c,>&a84d,>&ab48,>&ae3c
byte >&b12a,>&b40f,>&b6ed,>&b9c2,>&bc8e,>&bf50,>&c209,>&c4b7
byte >&c75b,>&c9f4,>&cc81,>&cf02,>&d177,>&d3e0,>&d63b,>&d889</
If your assembler is cool like mine is, this will be valid despite looking like I'm trying to declare what is obviously 16-bit data as 8-bit data. Many Z80 assemblers have some sort of "low byte" and "high byte" operator, it might not be the same symbol but most have it. If yours doesn't, I'd recommend using one that does, because it's really necessary for optimizations like these. In addition it makes the code more readable as it communicates to the reader how the data is intended to be interpreted.
So let's say we want to read the last entry in "the table".
<
LD L,&1F ;desired index
ld a,(hl)
Line 8,892:
inc h ;LD h,&05. We can keep L the same since the index is the same.
;Effectively we did all the necessary pointer arithmetic for indexing the second table, just with this one instruction!
ld a,(hl) ;now we have the low byte in C and the high byte in A.</
That would have taken a lot more instructions had this been a single table of words with more than 128 entries. You'd have to do some bit shifting to offset the pointer to the table by the desired index, and it would have just taken a lot more time. If you're trying to get something done quickly (such as a raster interrupt) you want to spend as little time doing lookups as possible.
Line 8,898:
=={{header|zkl}}==
Core zkl does not support arrays or vectors of one type. It does support heterogeneous lists, which are usually a super set at the cost of space.
<
array=(0).pump(10,List().write,5).copy(); // [writable] array of size 10 filled with 5
array[3]=4;
array[3] //-->4
array+9; //append a 9 to the end, same as array.append(9)</
=={{header|zonnon}}==
<
var
a: array 10 of integer;
da: array * of cardinal;
</syntaxhighlight>
=={{header|ZX Spectrum Basic}}==
<
20 LET a(2)=128
30 PRINT a(2)</
{{omit from|X86-64 Assembly|the same as X86, Just R based registers(eax,rax)}}
|