Assertion: ended queue | /r/HasProperty | lenr
Facets:
Source sentences:
text: Intuitively, inserting an element x in front of the double-ended queue lenf, f, sf, lenr, sr leads almost to the double-ended queue lenf+1, CONS(x, f), drop(2, sf), lenr, r, drop(2, sr) , the head and the tail of the double-ended queue lenf, CONS(x, f), sf, lenr, r, sr are x and almost lenf-1, f, drop(2, sf), lenr, r, drop(2, sr) respectively, and the head and the tail of lenf, NIL, NIL, lenr, CONS(x, NIL), drop(2, sr) are x and 0, NIL, NIL,
text: Intuitively, inserting an element x in front of the double-ended queue lenf, f, sf, lenr, sr leads almost to the double-ended queue lenf+1, CONS(x, f), drop(2, sf), lenr, r, drop(2, sr) , the head and the tail of the double-ended queue lenf, CONS(x, f), sf, lenr, r, sr are x and almost lenf-1, f, drop(2, sf), lenr, r, drop(2, sr) respectively, and the head and the tail of lenf, NIL, NIL, lenr, CONS(x, NIL), drop(2, sr) are x and 0, NIL, NIL,