Searched refs:right_node (Results 1 – 2 of 2) sorted by relevance
102 Node* right_node; member106 Basin() : left_node(NULL), bottom_node(NULL), right_node(NULL), width(0.0), left_highest(false) in Basin()114 right_node = NULL; in Clear()
498 tcx.basin.right_node = tcx.basin.bottom_node; in FillBasin()499 while (tcx.basin.right_node->next in FillBasin()500 && tcx.basin.right_node->point->y < tcx.basin.right_node->next->point->y) { in FillBasin()501 tcx.basin.right_node = tcx.basin.right_node->next; in FillBasin()503 if (tcx.basin.right_node == tcx.basin.bottom_node) { in FillBasin()508 tcx.basin.width = tcx.basin.right_node->point->x - tcx.basin.left_node->point->x; in FillBasin()509 tcx.basin.left_highest = tcx.basin.left_node->point->y > tcx.basin.right_node->point->y; in FillBasin()523 if (node->prev == tcx.basin.left_node && node->next == tcx.basin.right_node) { in FillBasinReq()531 } else if (node->next == tcx.basin.right_node) { in FillBasinReq()556 height = tcx.basin.right_node->point->y - node.point->y; in IsShallow()