Modify the ArrayDeque implementation so that it does not require the modulus (%) operator. The modulus operator is "expensive" on some systems. Instead, the implementation should make use of the fact...

Extracted text: Modify the ArrayDeque implementation so that it does not require the modulus (%) operator. The modulus operator is "expensive" on some systems. Instead, the implementation should make use of the fact that if a.length is a power of 2, then k % a.length = k & (a.length - 1). Here, & is the bitwise and operator. (p 61) Open Data Structures in Java, section 2.7