Partition - Partition list into n element piece
array n Partition
array n d Partition
[1 2 3 4 5 6 7 8 9 10] 2 2 Partition -> [[1 2] [3 4] [5 6] [7 8] [9 10]]
[1 2 3 4 5 6 7 8 9 10] 1 2 Partition -> [[1] [3] [5] [7] [9] [10]]
[1 2 3 4 5 6 7 8 9 10] 2 1 Partition ->
[[1 2] [2 3] [3 4] [4 5] [5 6] [6 7] [7 8] [8 9] [9 10]]
[4 5 6 7 8] 2 Partition -> [[4 5] [6 7]]
[4 5 6] 2 5 Partition -> [[4 5]]
[4 5 6] 5 1 Partition -> []
[4 5 6] 5 7 Partition -> []
Partition works like the corresponding Mathematica function. Partition
creates subarrays with n elements, and offset d.
n - length of subarray.
d - offset of subarray, defaults to n.
Raises error if n<0 or d<1
Still implements only part of Mathematica's functionality.
"The Mathematica Book"
Gewaltig, Diesmann
Jun 29 1999, Marc-Oliver Gewaltig
/var/www/debian/nest/nest-simulator-2.20.0/lib/sli/mathematica.sli