2all? ( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... ? ) -- ... ? )
Factor handbook > The language > Collections > Sequence operations > Sequence combinators > Pair-wise sequence combinators

Prev:2map-reduce ( ..a seq1 seq2 map-quot: ( ..a elt1 elt2 -- ..b intermediate ) reduce-quot: ( ..b prev intermediate -- ..a next ) -- ..a result )


Vocabulary
sequences

Inputs and outputs
seq1a sequence
seq2a sequence
quota quotation with stack effect ( ... elt1 elt2 -- ... ? )
?a boolean


Word description
Tests the predicate pairwise against elements of seq1 and seq2. If the sequences have different lengths, then only the smallest sequences items are compared with the other.

Examples
USING: math prettyprint sequences ; { 1 2 3 4 } { 2 4 6 8 } [ <= ] 2all? .
t


Definition


: 2all?
( ... seq1 seq2 quot: ( ... elt1 elt2 -- ... ? ) -- ... ? )
(2each) all-integers? ; inline