def join[A, B, C, D, E, F, G, H, I]()

in src/main/scala/com/twitter/stitch/Stitch.scala [811:860]

• 49 lines of code
• 1 McCabe index (conditional complexity)

  def join[A, B, C, D, E, F, G, H, I](
    a: Stitch[A],
    b: Stitch[B],
    c: Stitch[C],
    d: Stitch[D],
    e: Stitch[E],
    f: Stitch[F],
    g: Stitch[G],
    h: Stitch[H],
    i: Stitch[I]
  ): Stitch[(A, B, C, D, E, F, G, H, I)] =
    joinMap(a, b, c, d, e, f, g, h, i)(tuple9).asInstanceOf[Stitch[(A, B, C, D, E, F, G, H, I)]]

  def joinMap[A, B, C, D, E, F, G, H, I, Z](
    a: Stitch[A],
    b: Stitch[B],
    c: Stitch[C],
    d: Stitch[D],
    e: Stitch[E],
    f: Stitch[F],
    g: Stitch[G],
    h: Stitch[H],
    i: Stitch[I]
  )(
    z: (A, B, C, D, E, F, G, H, I) => Z
  ): Stitch[Z] = {
    val buf = new ArrayBuffer[Stitch[Any]](9)
    buf += a
    buf += b
    buf += c
    buf += d
    buf += e
    buf += f
    buf += g
    buf += h
    buf += i
    collectNoCopy(buf).map { ss =>
      z(
        ss(0).asInstanceOf[A],
        ss(1).asInstanceOf[B],
        ss(2).asInstanceOf[C],
        ss(3).asInstanceOf[D],
        ss(4).asInstanceOf[E],
        ss(5).asInstanceOf[F],
        ss(6).asInstanceOf[G],
        ss(7).asInstanceOf[H],
        ss(8).asInstanceOf[I]
      )
    }
  }