Assertion: ended queue | /r/MadeOf | n elements
Facets:
value: in the rear list
type: LOCATION
value: in n elements
type: OTHER
Source sentences:
text: Note that, when a double-ended queue contains n elements in the front list and n elements in the rear list, then the inequality invariant remains satisfied after i insertions and d deletions when (i+d)/2 <= n .