Lines Matching full:shape

51 and the shape of the array delimits the domain of the map.
61 but expressions have rank and shape, and one can view array expressions
121 * `RESHAPE(A,SHAPE=s)` without `ORDER=` must precompute the shape
123   in the storage order of `A` (whose shape must also be captured).
138 ## Determination of rank and shape
141 temporary storage is determining the shape of the result prior to,
149 * `SHAPE(SUM(X,DIM=d))` is `SHAPE(X)` with one element removed:
150   `PACK(SHAPE(X),[(j,j=1,RANK(X))]/=d)` in general.
152 * `SHAPE(MAXLOC(X))` is `[RANK(X)]`.
153 * `SHAPE(MAXLOC(X,DIM=d))` is `SHAPE(X)` with one element removed.
154 * `SHAPE(TRANSPOSE(M))` is a reversal of `SHAPE(M)`.
155 * `SHAPE(RESHAPE(..., SHAPE=S))` is `S`.
156 * `SHAPE(CSHIFT(X))` is `SHAPE(X)`; same with `EOSHIFT`.
157 * `SHAPE(PACK(A,VECTOR=V))` is `SHAPE(V)`
158 * `SHAPE(PACK(A,MASK=m))` with non-scalar `m` and without `VECTOR=` is `[COUNT(m)]`.
160 * `SHAPE(UNPACK(MASK=M))` is `SHAPE(M)`.
161 * `SHAPE(MATMUL(A,B))` drops one value from `SHAPE(A)` and another from `SHAPE(B)`.
162 * `SHAPE(SHAPE(X))` is `[RANK(X)]`.
163 * `SHAPE(SPREAD(A,DIM=d,NCOPIES=n))` is `SHAPE(A)` with `n` inserted at
177 The implementation would generate code to calculate the shape, use it
180 In cases where the analyzed shape is known at compile time, we should
188 new shape.
199   constituents are flattened; so `[X] => RESHAPE(X,SHAPE=[SIZE(X)})`.