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-exception
6//
7//===----------------------------------------------------------------------===//
8
9// <list>
10
11// void pop_front();
12
13#include <list>
14#include <cassert>
15
16#include "test_macros.h"
17#include "min_allocator.h"
18
19int main(int, char**)
20{
21 {
22 int a[] = {1, 2, 3};
23 std::list<int> c(a, a+3);
24 c.pop_front();
25 assert(c == std::list<int>(a+1, a+3));
26 c.pop_front();
27 assert(c == std::list<int>(a+2, a+3));
28 c.pop_front();
29 assert(c.empty());
30 }
31#if TEST_STD_VER >= 11
32 {
33 int a[] = {1, 2, 3};
34 std::list<int, min_allocator<int>> c(a, a+3);
35 c.pop_front();
36 assert((c == std::list<int, min_allocator<int>>(a+1, a+3)));
37 c.pop_front();
38 assert((c == std::list<int, min_allocator<int>>(a+2, a+3)));
39 c.pop_front();
40 assert(c.empty());
41 }
42#endif
43
44 return 0;
45}
46

source code of libcxx/test/std/containers/sequences/list/list.modifiers/pop_front.pass.cpp