Softanza
StartFrançais
Softanza
Reference · stzGrid

Size()

INFORMATION METHODS

also written: NumberOfCells · NumberOfNodes

Basic examples (2)

Softanza
o1 = new stzGrid([6, 4])
? @@( o1.SizeXT() )
o1.MoveTo(6, 1)
? @@(o1.Position())
o1.MoveRight()
? @@(o1.Position())
Output
[ 6, 4 ]
[ 6, 1 ]
[ 6, 1 ]

run on 2026-10-02 04:22 inside the library at commit 0e72e2e2c; taken from 02_testing_hitting_the_right_boundary.ring(opens in a new tab)

Softanza
o1 = new stzGrid([6, 4])
? @@( o1.SizeXT() )
o1.MoveToNthNextNode(5)
? @@(o1.Position())
o1.MoveRight()
? @@(o1.Position())
Output
[ 6, 4 ]
[ 6, 1 ]
[ 6, 1 ]

run on 2026-10-02 04:22 inside the library at commit 0e72e2e2c; taken from 11_testing_hitting_the_right_boundary.ring(opens in a new tab)

Scope (4)

Softanza
o1 = new stzGrid([6, 4])
? @@( o1.SizeXT() )
? @@(o1.Position())
o1.MoveForwardNNodes(3)
? @@(o1.Position())
o1.MoveBackwardNNodes(2)
? @@(o1.Position())
Output
[ 6, 4 ]
[ 1, 1 ]
[ 4, 1 ]
[ 2, 1 ]

run on 2026-10-02 04:22 inside the library at commit 0e72e2e2c; taken from 10_testing_multi-node_movement.ring(opens in a new tab)

Softanza
o1 = new stzGrid([6, 4])
? @@( o1.SizeXT() )
o1.MoveDownNNodes(2)
? @@(o1.Position())
o1.MoveRightNNodes(3)
? @@(o1.Position())
? @@(o1.NthNodeUp(2))
o1.MoveUpNNodes(2)
? @@(o1.Position())
Output
[ 6, 4 ]
[ 1, 3 ]
[ 4, 3 ]
[ 4, 1 ]
[ 4, 1 ]

run on 2026-10-02 04:22 inside the library at commit 0e72e2e2c; taken from 12_testing_direction-specific_movements.ring(opens in a new tab)

Softanza
o1 = new stzGrid([6, 4])
? @@( o1.SizeXT() )
o1.MoveLeftNNodes(1)
? @@(o1.Position())
o1.MoveUpNNodes(1)
? @@(o1.Position())
o1.MoveToNode(6, 4)
? @@(o1.Position())
o1.MoveRightNNodes(1)
? @@(o1.Position())
o1.MoveDownNNodes(1)
? @@(o1.Position())
Output
[ 6, 4 ]
[ 1, 1 ]
[ 1, 1 ]
[ 6, 4 ]
[ 6, 4 ]
[ 6, 4 ]

run on 2026-10-02 04:22 inside the library at commit 0e72e2e2c; taken from 14_testing_boundary_cases_and_error_handling.ring(opens in a new tab)

Softanza
o1 = new stzGrid([6, 4])
? @@( o1.SizeXT() )
o1.MoveToNode(3, 2)
o1.SetDirection(:Forward)
? @@(o1.Position())
? o1.Direction()
? @@(o1.NextNthNode(2))
? @@(o1.PreviousNthNode(2))
o1.MoveToNextNthNode(2)
? @@(o1.Position())
o1.SetDirection(:Down)
? @@(o1.NextNthNode(1))
Output
[ 6, 4 ]
[ 3, 2 ]
forward
[ 5, 2 ]
[ 3, 2 ]
[ 5, 2 ]
[ 5, 3 ]

run on 2026-10-02 04:22 inside the library at commit 0e72e2e2c; taken from 13_testing_nextprevious_nth_node_methods.ring(opens in a new tab)

The extensions of this method

Each extension, and whether it exists for this method; an extension that exists combines with the others (FindSTCS).

Extension
Exists
What it adds · The names
Q
no
does what the method does, then returns the object, so the call can be chained
QQ
no
chains on the next, more specific type of object (the Q ladder)
QQQ
no
chains on the most specific type of object (the Q ladder)
QRT
no
returns the result as an object of the requested type
CS
no
takes a case-sensitivity flag
ST
no
takes the position to start from (StartingAt)
IB
no
takes bounds that are included (IncludingBounds)
XT
yes
the extended form: more parameters than the base method · SizeXT
XTT
no
yet another extension: a further extended form, after XT
Z
no
includes the position in what it returns
ZZ
no
returns positions as sections, [start, end]
W
no
selects by a condition
WF
no
selects by a condition, with the expressive keywords (@NextItem, @PreviousItem...)
D
no
takes a direction, forward or backward (Directional)
F
no
takes a function (the condition or the update is given as a function); the forms document also uses F for the future form, which defers the action
Many
no
works on a collection of items instead of one (the plural form)
Except
no
takes exceptions, what to leave out (the exceptional form)
U
no
returns the result without duplication

Every example is a test file of the library, run inside the library for this page; only those whose output kept every promise their file wrote are shown.

See also