Lines Matching defs:level
53 return ( a.pt[Y] < b.pt[Y] );// a.pt[X] == b.pt[X] since we are supposed to be on the same level...
59 unsigned level;
116 elem.level = i;
126 unsigned lvl = temp[i].level, idx = temp[i].idx;
128 std::pair<unsigned,unsigned>next_data(temp[first_in_comp].level,temp[first_in_comp].idx);
133 std::pair<unsigned,unsigned> next_data(temp[i+1].level,temp[i+1].idx);
146 void findFirstUnused(unsigned &level, unsigned &idx){
147 level = size();
152 level = i;
165 void step(unsigned &level, unsigned &idx, int &direction){
168 if ( idx >= (*this)[level].size()-1 || (*this)[level][idx+1].used ) {
169 level = size();
174 if ( idx <= 0 || (*this)[level][idx-1].used ) {
175 level = size();
183 //double t = (*this)[level][idx].t;
184 double sign = ((*this)[level][idx].sign ? 1 : -1);
186 //level += 1;
188 if (level == size()){
194 next = (*this)[level][idx].next_on_curve;
196 next = (*this)[level][idx].prev_on_curve;
199 if ( level+1 != next.first || (*this)[next.first][next.second].used ) {
200 level = size();
203 level = next.first;