Indian-like code to partition matrix

  def partitioning(cats: ValueLevelCats, lastLevel: Int): Seq[Seq[Int]] = {
    if (lastLevel == 1) {
      val error = 0 until cats.normal
      val normal = cats.normal until cats.advanced
      val advanced = cats.advanced until cats.significant
      val significant = cats.significant until cats.extreme
      val extreme = cats.extreme until (ncats + 1)
      List(error, normal, advanced, significant, extreme)
    } else if (lastLevel == 2) {
      val error = 0 until cats.normal
      val normal = empty
      val advanced = cats.normal until cats.significant
      val significant = cats.significant until cats.extreme
      val extreme = cats.extreme until (ncats + 1)
      List(error, normal, advanced, significant, extreme)
    } else if (lastLevel == 3) {
      val error = 0 until cats.normal
      val normal = empty
      val advanced = empty
      val significant = cats.normal until cats.extreme
      val extreme = cats.extreme until (ncats + 1)
      List(error, normal, advanced, significant, extreme)
    } else {
      // if (lastLevel == 4)
      val error = 0 until cats.normal
      val normal = empty
      val advanced = empty
      val significant = empty
      val extreme = cats.normal until (ncats + 1)
      List(error, normal, advanced, significant, extreme)
    }
  }