 }
 
 @inline(never)
+public func run_SetIsSubsetSeqInt(
+  _ a: Set<Int>,
+  _ b: Array<Int>,
+  _ r: Bool,
+  _ n: Int) {
+  for _ in 0 ..< n {
+    let isSubset = a.isSubset(of: identity(b))
+    CheckResults(isSubset == r)
+  }
+}
+
+@inline(never)
 public func run_SetIsStrictSubsetInt(
   _ a: Set<Int>,
   _ b: Set<Int>,

}

@inline(never)
func run_SetSymmetricDifferenceBox(
  _ a: Set<Box<Int>>,
  _ b: Set<Box<Int>>,

  return set
}()

// Construction of empty array.
let arrayE: Array<Int> = []
let arrayOE: Array<Box<Int>> = []

// Construction kit for arrays with 25% overlap
let arrayAB = Array(0 ..< size)                              //   0 ..< 400
let arrayCD = Array(size ..< 2 * size)                       // 400 ..< 800
let arrayBC = Array(size - quarter ..< 2 * size - quarter)   // 300 ..< 700
let arrayB = Array(size - quarter ..< size)                  // 300 ..< 400

let arrayOAB = arrayAB.map(Box.init)
let arrayOCD = arrayCD.map(Box.init)
let arrayOBC = arrayBC.map(Box.init)
let arrayOB = arrayB.map(Box.init)

// Construction kit for arrays with 50% overlap
let arrayXY = Array(0 ..< size)           //   0 ..< 400
let arrayYZ = Array(half ..< size + half) // 200 ..< 600
let arrayY = Array(half ..< size)         // 200 ..< 400

let arrayP = Array(0 ..< size)

// Construction of flexible sets.
var set: Set<Int> = []
var setBox: Set<Box<Int>> = []

func set(_ size: Int) {
  set = Set(0 ..< size)
}

func setBox(_ size: Int) {
  setBox = Set(Set(0 ..< size).map(Box.init))
}


public let SetTests = [
  // Mnemonic: number after name is percentage of common elements in input sets.
  BenchmarkInfo(
