[ < ] | [ > ] | [ << ] | [ Up ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
dimsup
dimensions at the end of
q1 and puts the result in q2; If dimsup is negative,
deletes the -dimsup
last dimensions of q1 and puts the
result in q2. q2 is supposed to have a sufficient size.
For each element dimsup
of that array, dimsup.nbdims
dimensions are inserted starting from rank dimsup.pos
(of the
initial vector). The coefficient q1[polka_dec+dimsup.pos]
is
pushed on the right. For instance, if the array tab is
[(0,2);(1,1);(2,3)]
,
[d,b, a_0, a_1, a_2,a_3,...,a_{d-1}]
[d,b,0,0,a_0,0,a_1,0,0,0,a_2,a_3,...,a_{d-1}]
.
[d,b,s,a_0,...,a_{d-1}]
becomes
[d,b,s,0,0,a_0,0,a_1,0,0,0,,a_2,a_3,...,a_{d-1}]
.
The array tab is supposed to be sorted in ascending order
w.r.t. tab[i].pos
. q2 is supposed to have a sufficient
size.
For each element dimsup
of that array, dimsup.nbdims
dimensions are deleted starting from rank dimsup.pos
(of the
initial vector). For instance, if the array tab is
[(0,2);(3,1);(5,3)]
,
[d,b,a_0,a_1,a_2,a_3,a_4,a_5,a_6,a_7,a_8,...,a_{d-1}]
[d,b, a_2, a_4, a_8, ...,a_{d-1}]
.
tab[i].pos
. q2 is supposed to have a sufficient
size.
size+dimsup-polka_dec
.
The permutation permutation defines a permutation (i.e., a
bijection) from [0..(size+dimsup-polka_dec)-1
to itself. BE
CAUTIOUS: value 0
in the permutation means columns
polka_dec
.
size-dimsup-polka_dec
.
The permutation permutation defines a permutation (i.e., a
bijection) from [0..(size-polka_dec)-1
to itself. BE CAUTIOUS: value
0
in the permutation means columns polka_dec
.
[ < ] | [ > ] | [ << ] | [ Up ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |