Lines Matching defs:lvlRank

107   const Level lvlRank = enc.getLvlRank();
113   for (Level l = 0; l < lvlRank; /*l += 1 or l += AoSCooLen*/) {
216     const Level lvlRank = enc.getLvlRank();
217     if (lvl.value() >= cooStart && lvl.value() < lvlRank) {
219       stride = lvlRank - cooStart;
607       const Level lvlRank = dlm.getLvlRank();
608       for (Level lvl = 0; lvl < lvlRank; lvl++)
867   const Level lvlRank = lvlTypes.size();
868   if (lvlRank == 0)
871   const Dimension dimRank = dimToLvl ? dimToLvl.getNumDims() : lvlRank;
873     if (dimToLvl.getNumResults() != lvlRank)
876              << dimToLvl.getNumResults() << " != " << lvlRank;
883     if (dimRank > lvlRank)
885                          << " to " << lvlRank;
894     if (dimRank != lvlRank)
897              << dimRank << " != " << lvlRank;
1001   for (Level l = startLvl + 1; l < lvlRank; ++l)
1005   // that is, when lvlRank == 1, the only compressed level is unique,
1006   // and when lvlRank > 1, the last singleton is unique.
1007   return !isUnique || isUniqueLvl(lvlRank - 1);
1013   lvlTypes.reserve(lvlRank);
1017       *buildLevelType(LevelFormat::Compressed, ordered, lvlRank == 1));
1018   if (lvlRank > 1) {
1020     std::fill_n(std::back_inserter(lvlTypes), lvlRank - 2,
1261   const Level lvlRank = enc.getLvlRank();
1273     if (l >= lvlRank)