In an arithmetic right shift, the bits shifted beyond the rightmost bit position are discarded, and the leftmost bit is propagated into the bit positions vacated at the left.
在算术右移位运算中,将丢弃移出最右侧数位位置的数位,并将最左侧的数位传播到左端空出的数位位置。
2
Specifies that if more than one match is possible then any match is an acceptable result: this will still find the leftmost match, but may not find the "best" match at that position.