<commit_before>//===--- ArraySubscript.swift ---------------------------------------------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2017 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://swift.org/LICENSE.txt for license information
// See https://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
//
//===----------------------------------------------------------------------===//

// This test checks the performance of modifying an array element.
import TestsUtils

public let ArraySubscript = BenchmarkInfo(
  name: "ArraySubscript",
  runFunction: run_ArraySubscript,
  tags: [.validation, .api, .Array],
  legacyFactor: 4)

@inline(never)
public func run_ArraySubscript(_ N: Int) {
  SRand()

  let numArrays = 50
  let numArrayElements = 100

  func bound(_ x: Int) -> Int { return min(x, numArrayElements-1) }

  for _ in 1...N {

  var arrays = [[Int]](repeating: [], count: numArrays)
  for i in 0..<numArrays {
    for _ in 0..<numArrayElements {
      arrays[i].append(Int(truncatingIfNeeded: Random()))
    }
  }

  // Do a max up the diagonal.
  for i in 1..<numArrays {
    arrays[i][bound(i)] =
      max(arrays[i-1][bound(i-1)], arrays[i][bound(i)])
  }
  CheckResults(arrays[0][0] <= arrays[numArrays-1][bound(numArrays-1)])

  }
}<commit_msg>[benchmark] Gardening: Indent ArraySubscript loop<commit_after>//===--- ArraySubscript.swift ---------------------------------------------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2017 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://swift.org/LICENSE.txt for license information
// See https://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
//
//===----------------------------------------------------------------------===//

// This test checks the performance of modifying an array element.
import TestsUtils

public let ArraySubscript = BenchmarkInfo(
  name: "ArraySubscript",
  runFunction: run_ArraySubscript,
  tags: [.validation, .api, .Array],
  legacyFactor: 4)

@inline(never)
public func run_ArraySubscript(_ N: Int) {
  SRand()

  let numArrays = 50
  let numArrayElements = 100

  func bound(_ x: Int) -> Int { return min(x, numArrayElements-1) }

  for _ in 1...N {
    var arrays = [[Int]](repeating: [], count: numArrays)
    for i in 0..<numArrays {
      for _ in 0..<numArrayElements {
        arrays[i].append(Int(truncatingIfNeeded: Random()))
      }
    }

    // Do a max up the diagonal.
    for i in 1..<numArrays {
      arrays[i][bound(i)] =
        max(arrays[i-1][bound(i-1)], arrays[i][bound(i)])
    }
    CheckResults(arrays[0][0] <= arrays[numArrays-1][bound(numArrays-1)])
  }
}
{'fraction_non_alphanumeric': 0.21463245492371705, 'fraction_numerical': 0.01872399445214979, 'mean_word_length': 2.390129259694477, 'pattern_counts': {'":': 0, '<': 11, '<?xml version=': 0, '>': 5, 'https://': 4, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '5553559', 'n_tokens_mistral': 921, 'n_tokens_neox': 860, 'n_words': 256}