Membership and other interested parties are invited to review the document and send comments via Git Hub (mailing list archives) through 13 April 2017.

Reason: A is a contiguous array, so an insertion causes a block shift which moves all elements after the point of insertion.This is an experiment to test the difference between C iterator of STL vector and list affected by erase operation and list performs like real linked list.The official saying or description about C iterators of vector and list are listed as follows: for list erase: Data races The container is modified. Concurrently accessing or modifying other elements is safe, although iterating ranges that include the removed elements is not.If the capacity is increased, the whole block is reallocated, potentially changing its address, and so the addresses of all elements.All iterators and references are invalidated, unless the inserted member is at an end (front or back) of the deque (in which case all iterators are invalidated, but references to elements are unaffected). Every iterator and reference after the point of erase is invalidated.The common API supports a simple set of content encryption capabilities, leaving application functions such as authentication and authorization to page authors.This is achieved by requiring content protection system-specific messaging to be mediated by the page rather than assuming out-of-band communication between the encryption system and a license or other server.