File: loop-convert-structured-binding.cpp

package info (click to toggle)
llvm-toolchain-17 1%3A17.0.6-22
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,799,624 kB
  • sloc: cpp: 6,428,607; ansic: 1,383,196; asm: 793,408; python: 223,504; objc: 75,364; f90: 60,502; lisp: 33,869; pascal: 15,282; sh: 9,684; perl: 7,453; ml: 4,937; awk: 3,523; makefile: 2,889; javascript: 2,149; xml: 888; fortran: 619; cs: 573
file content (49 lines) | stat: -rw-r--r-- 1,263 bytes parent folder | download | duplicates (10)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
// RUN: %check_clang_tidy -std=c++17-or-later %s modernize-loop-convert %t

struct S {
  int a{0};
  int b{1};
};

template <typename T, unsigned long Size>
struct array {

  T *begin() { return data; }
  const T* cbegin() const { return data; }
  T *end() { return data + Size; }
  const T *cend() const { return data + Size; }

  T data[Size];
};

const int N = 6;
S Arr[N];

void f() {
  int Sum = 0;

  for (int I = 0; I < N; ++I) {
    auto [a, b] = Arr[I];
    Sum += a + b;
  }
  // CHECK-MESSAGES: :[[@LINE-4]]:3: warning: use range-based for loop instead [modernize-loop-convert]
  // CHECK-FIXES: for (auto [a, b] : Arr) {
  // CHECK-FIXES-NEXT: Sum += a + b;

  array<S, N> arr;
  for (auto* It = arr.begin(); It != arr.end(); ++It) {
    auto [a, b] = *It;
    Sum = a + b;
  }
  // CHECK-MESSAGES: :[[@LINE-4]]:3: warning: use range-based for loop instead [modernize-loop-convert]
  // CHECK-FIXES: for (auto [a, b] : arr) {
  // CHECK-FIXES-NEXT: Sum = a + b;

  for (auto* It = arr.cbegin(); It != arr.cend(); ++It) {
    auto [a, b] = *It;
    Sum = a + b;
  }
  // CHECK-MESSAGES: :[[@LINE-4]]:3: warning: use range-based for loop instead [modernize-loop-convert]
  // CHECK-FIXES: for (auto [a, b] : arr) {
  // CHECK-FIXES-NEXT: Sum = a + b;
}