52 lines · cpp
1//===----------------------------------------------------------------------===//2//3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.4// See https://llvm.org/LICENSE.txt for license information.5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception6//7//===----------------------------------------------------------------------===//8 9// <deque>10 11// void pop_front()12 13// Erasing items from the beginning or the end of a deque shall not invalidate iterators14// to items that were not erased.15 16#include "asan_testing.h"17#include <deque>18#include <cassert>19 20#include "test_macros.h"21 22template <typename C>23void test(C c) {24 typename C::iterator it1 = c.begin() + 1;25 typename C::iterator it2 = c.end() - 1;26 27 c.pop_front();28 29 typename C::iterator it3 = c.begin();30 typename C::iterator it4 = c.end() - 1;31 assert(it1 == it3);32 assert(*it1 == *it3);33 assert(&*it1 == &*it3);34 assert(it2 == it4);35 assert(*it2 == *it4);36 assert(&*it2 == &*it4);37}38 39int main(int, char**) {40 std::deque<int> queue;41 for (int i = 0; i < 4098; ++i)42 queue.push_back(i);43 44 while (queue.size() > 1) {45 test(queue);46 queue.pop_back();47 LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(queue));48 }49 50 return 0;51}52