Lines Matching defs:left
79 m_root->left = 0;
93 freeNode(node->left);
106 if (!m_root->left && m_root->largestFree.width() > 0) {
131 parent->left = m_root;
135 right->left = 0;
180 // Go down a level and determine if the left or right
182 Node* left = node->left;
184 if (left && fitsWithin(size, left->largestFree)) {
186 if (left->largestFree.width() < right->largestFree.width()
187 || left->largestFree.height() < right->largestFree.height()) {
189 // so try the left sub-tree and then the right sub-tree.
190 IntPoint point = allocateFromNode(size, left);
197 node = left;
200 else if (left || right) {
211 && node->parent->left->rect.x() == node->parent->right->rect.x())
232 // Split the node, then go around again using the left sub-tree.
245 Node* left = new Node();
248 left->parent = node;
249 left->left = 0;
250 left->right = 0;
252 right->left = 0;
254 node->left = left;
258 left->rect = IntRect(node->rect.x(), node->rect.y(),
260 right->rect = IntRect(left->rect.maxX(), node->rect.y(),
263 left->rect = IntRect(node->rect.x(), node->rect.y(),
265 right->rect = IntRect(node->rect.x(), left->rect.maxY(),
269 left->largestFree = left->rect.size();
272 return left;
279 std::max(node->left->largestFree.width(), node->right->largestFree.width()),
280 std::max(node->left->largestFree.height(), node->right->largestFree.height())
291 if (node->left && node->left->rect.contains(point))
292 node = node->left;
308 if (node->parent->left == node) {
312 if (node->parent->left->largestFree != node->parent->left->rect.size())
316 freeNode(node->left);
319 node->left = 0;