Lines Matching defs:_height
120 return _height;
245 int _height;
253 _height(graph.height()),
265 if ( _width > 2 && _height > 2 ) {
269 for ( int i = 1 ; i != _height - 1 ; ++i ) {
299 if ( _height > 1 ) {
337 if ( _width > 2 && _height > 1 ) {
338 // Node *it = &((*this)[1][_height - 1]);
340 = graph.begin() + (_height - 1) * _width + 1;
341 Cell *cells_it = &_cells.front() + (_height - 1) * _width + 1;
348 _complexTopLeft(graph, graph_it, cells_it, i, _height - 1);
351 _complexTopRight(graph, graph_it, cells_it, i, _height - 1);
354 cells_it->vertices.push_back(Point<T>(i + 1, _height, false));
357 cells_it->vertices.push_back(Point<T>(i, _height, false));
362 if ( _height > 2 ) {
367 for ( int i = 1 ; i != _height - 1 ; ++i) {
387 for ( int i = 1 ; i != _height - 1 ; ++i) {
410 if ( _height > 2 && _width > 1 ) {
414 for ( int i = 1 ; i != _height - 1 ; ++i ) {
451 if ( _width > 1 && _height > 1 )
478 if ( _height > 1 )
485 if ( _height > 1 ) {
487 = graph.begin() + (_height - 1) * _width;
488 Cell *cells_it = &_cells.front() + (_height - 1) * _width;
494 cells_it->vertices.push_back(Point<T>(0, _height - 1, false));
498 _complexTopRight(graph, graph_it, cells_it, 0, _height - 1);
500 cells_it->vertices.push_back(Point<T>(1, _height - 1, false));
503 cells_it->vertices.push_back(Point<T>(1, _height, false));
506 cells_it->vertices.push_back(Point<T>(0, _height, false));
510 if ( _width > 1 && _height > 1 ) {
518 _complexTopLeft(graph, graph_it, cells_it, _width - 1, _height - 1);
521 cells_it->vertices.push_back(Point<T>(_width, _height - 1, false));
524 cells_it->vertices.push_back(Point<T>(_width, _height, false));
527 cells_it->vertices.push_back(Point<T>(_width - 1, _height, false));