The function zip applies the binary function f to the components of two data sets u and v, creating a new data set $r$ defined as follows.  If m is the length of u and n is the length of v then $r$ is a data set of length $\min \left(m\,n\right)$ with $r_i=f\left(u_i\,v_i\right)$ for i in $1..\min \left(m\,n\right)$.

If u and v are Matrices of the same size, then zip applies the binary function f to the pairs of corresponding entries of the matrices u and v. The $i,j$-entry of the resulting matrix is $f\left(u_{i,j}\,v_{i,j}\right)$.

If u and v are not both rtables, Arrays, or lists (ie. both are scalars) then $f\left(u\,v\right)$ is returned. If only u is a scalar then $\mathrm{map2}\left(f\,u\,v\right)$ is computed. If only v is a scalar then $\mathrm{map}\left(f\,u\,v\right)$ is returned. In other words, zipping a matrix against a scalar is the same as zipping against a same-size matrix filled with that scalar at each entry.

If the optional fourth argument d is given, it is used as a default value for f when one of the data sets is shorter than the other. Thus $r$ is a data set of length $\max \left(m\,n\right)$ with $r_i=f\left(u_i\,v_i\right)$ for i in $1..\min \left(m\,n\right)$ and $r_i=f\left(t_i\,d\right)$ for $i$ in $1+\min \left(m\,n\right)..\max \left(m\,n\right)$ where $t$ is the longer of u and v.

If u and v are Matrices of the same size, then the optional fourth argument is accepted, but ignored.  Similarly, if either u or v are not matrices then the fourth argument is also ignored.

If u and v are not Matrices of the same size, then the size of the result is determined by the presence or absence of the optional fourth parameter. If this parameter is omitted in the calling sequence then the result object's dimensions are determined by taking the minimum of the corresponding dimensions of u and v.

The sparse and dense options control how zip is applied to zero data in sparse storage Arrays, Vectors, and Matrices.  The zip[sparse] command will apply f for each matched element in the array provided they are not both zero.  This scans the actual stored entries (zeros are not stored in sparse arrays).  The zip[dense] command will apply f for every matched element in the result index space, as if both input arrays were dense. By default sparse Array inputs, where f(0,0) is nonzero will have the zip[dense] algorithm applied.  Sparse Matrix and Vector inputs will have the zip[sparse] algorithm applied by default.  The zip[sparse] algorithm is used by default when zipping a sparse matrix against a scalar.

The inplace option only applies when u and v are both rtables of the same size, storage, and data type.  When this option is used, u will be modified in-place.  

The evalhf option only applies when u and v are both rtables of data type float[8] or complex[8]. When this option is used, evaluation of f will be done using the evalhf subsystem.  

$\mathrm{zip}\left(\left(x\,y\right)\mapsto x+y\,\left[1\,2\,3\right]\,\left[4\,5\,6\right]\right)$

$\left[5\,7\,9\right]$

$\mathrm{zip}\left(\gcd \,\left[0\,14\,8\right]\,\left[2\,6\,12\right]\right)$

$\left[2\,2\,4\right]$

$\mathrm{zip}\left(\mathrm{cat}\,\left[''trap''\,''hill''\right]\,\left[''door''\,''side''\right]\right)$

$\left[''trapdoor''\,''hillside''\right]$

$\mathrm{zip}\left(\mathrm{`>`}\,\left[x\,y\right]\,\left[4\,-2\right]\right)$

$\left[4<x\&comma;\mathrm{-2}<y\right]$

$\mathrm{zip}\left(\mathrm{op}\&comma;\left[2\&comma;1\right]\&comma;\left[x^2+3\&comma;x^2+3\right]\right)$

$\left[3\&comma;x^2\right]$

$\mathrm{zip}\left(\left(x\&comma;y\right)\mapsto x+y\&comma;\left[1\&comma;2\&comma;3\right]\&comma;\left[4\&comma;5\right]\&comma;0\right)$

$\left[5\&comma;7\&comma;3\right]$

$a≔\mathrm{Matrix}\left(2\&comma;3\&comma;\left[1\&comma;2\&comma;3\&comma;4\&comma;5\&comma;6\right]\right)\&colon;$

$b≔\mathrm{Matrix}\left(2\&comma;3\&comma;\left[1\&comma;3\&comma;5\&comma;7\&comma;9\&comma;2\right]\right)\&colon;$

$\mathrm{zip}\left(\left(x\&comma;y\right)\mapsto x+y\&comma;a\&comma;b\right)$

$\left[\begin{array}{ccc}2& 5& 8\\ 11& 14& 8\end{array}\right]$

$\mathrm{zip}\left(\mathrm{`+`}\&comma;a\&comma;b\right)$

$\left[\begin{array}{ccc}2& 5& 8\\ 11& 14& 8\end{array}\right]$

$a≔\mathrm{Matrix}\left(3\&comma;4\&comma;\left[2\&comma;3\&comma;5\&comma;7\&comma;11\&comma;13\&comma;17\&comma;19\&comma;23\&comma;29\&comma;31\&comma;37\right]\right)\&colon;$

$b≔\mathrm{Matrix}\left(2\&comma;2\&comma;\mathrm{shape}=\mathrm{antisymmetric}\right)$

$b≔\left[\begin{array}{cc}0& 0\\ 0& 0\end{array}\right]$

$b\left[1,2\right]≔3$

$b_{1,2}≔3$

$\mathrm{zip}\left(\left(x\&comma;y\right)\mapsto x+y\&comma;a\&comma;b\right)$

$\left[\begin{array}{cc}2& 6\\ 8& 13\end{array}\right]$

$\mathrm{zip}\left(\left(x\&comma;y\right)\mapsto x+y\&comma;b\&comma;a\&comma;-1\right)$

$\left[\begin{array}{cccc}2& 6& 4& 6\\ 8& 13& 16& 18\\ 22& 28& 30& 36\end{array}\right]$

$\mathrm{zip}\left(\mathrm{`+`}\&comma;a\&comma;100\right)$

$\left[\begin{array}{cccc}102& 103& 105& 107\\ 111& 113& 117& 119\\ 123& 129& 131& 137\end{array}\right]$

$c≔\mathrm{Array}\left(\left[\left[1\&comma;0\right]\&comma;\left[0\&comma;1\right]\right]\right)\&colon;$

$d≔\mathrm{Matrix}\left(2\&comma;2\&comma;\left[3\&comma;0\&comma;2\&comma;5\right]\right)\&colon;$

$\mathrm{zip}\left(\left(x\&comma;y\right)\mapsto y\cdot x\&comma;c\&comma;d\right)$

$\left[\begin{array}{cc}3& 0\\ 0& 5\end{array}\right]$

$f≔\mathrm{Vector}\left(3\&comma;5\right)$

$f≔\left[\begin{array}{c}5\\ 5\\ 5\end{array}\right]$

$g≔\mathrm{Vector}\left[\mathrm{row}\right]\left(\left[1\&comma;2\right]\right)$

$g≔\left[\begin{array}{cc}1& 2\end{array}\right]$

$\mathrm{zip}\left(\left(x\&comma;y\right)\mapsto x-y\&comma;f\&comma;g\&comma;10\right)$

$\left[\begin{array}{ccc}4& 3& \mathrm{-5}\end{array}\right]$

$\mathrm{zip}\left(\mathrm{`[]`}\&comma;\left[1\&comma;2\&comma;3\right]\&comma;\left[4\&comma;5\&comma;6\right]\right)$

$\left[\left[1\&comma;4\right]\&comma;\left[2\&comma;5\right]\&comma;\left[3\&comma;6\right]\right]$

The zip command was updated in Maple 2021.

The inplace and evalhf options were introduced in Maple 2021.

For more information on Maple 2021 changes, see Updates in Maple 2021.