Searched refs:left_node (Results 1 – 2 of 2) sorted by relevance
100 Node* left_node; member106 Basin() : left_node(NULL), bottom_node(NULL), right_node(NULL), width(0.0), left_highest(false) in Basin()112 left_node = NULL; in Clear()
482 tcx.basin.left_node = node.next->next; in FillBasin()484 tcx.basin.left_node = node.next; in FillBasin()488 tcx.basin.bottom_node = tcx.basin.left_node; in FillBasin()493 if (tcx.basin.bottom_node == tcx.basin.left_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()525 } else if (node->prev == tcx.basin.left_node) { in FillBasinReq()554 height = tcx.basin.left_node->point->y - node.point->y; in IsShallow()