| OLD | NEW |
| 1 /* | 1 /* |
| 2 * (C) 1999 Lars Knoll (knoll@kde.org) | 2 * (C) 1999 Lars Knoll (knoll@kde.org) |
| 3 * (C) 2000 Gunnstein Lye (gunnstein@netcom.no) | 3 * (C) 2000 Gunnstein Lye (gunnstein@netcom.no) |
| 4 * (C) 2000 Frederik Holljen (frederik.holljen@hig.no) | 4 * (C) 2000 Frederik Holljen (frederik.holljen@hig.no) |
| 5 * (C) 2001 Peter Kelly (pmk@post.com) | 5 * (C) 2001 Peter Kelly (pmk@post.com) |
| 6 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All | 6 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All |
| 7 * rights reserved. | 7 * rights reserved. |
| 8 * Copyright (C) 2011 Motorola Mobility. All rights reserved. | 8 * Copyright (C) 2011 Motorola Mobility. All rights reserved. |
| 9 * | 9 * |
| 10 * This library is free software; you can redistribute it and/or | 10 * This library is free software; you can redistribute it and/or |
| (...skipping 1623 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1634 | 1634 |
| 1635 void Range::getBorderAndTextQuads(Vector<FloatQuad>& quads) const { | 1635 void Range::getBorderAndTextQuads(Vector<FloatQuad>& quads) const { |
| 1636 Node* startContainer = m_start.container(); | 1636 Node* startContainer = m_start.container(); |
| 1637 Node* endContainer = m_end.container(); | 1637 Node* endContainer = m_end.container(); |
| 1638 Node* stopNode = pastLastNode(); | 1638 Node* stopNode = pastLastNode(); |
| 1639 | 1639 |
| 1640 HeapHashSet<Member<Node>> nodeSet; | 1640 HeapHashSet<Member<Node>> nodeSet; |
| 1641 for (Node* node = firstNode(); node != stopNode; | 1641 for (Node* node = firstNode(); node != stopNode; |
| 1642 node = NodeTraversal::next(*node)) { | 1642 node = NodeTraversal::next(*node)) { |
| 1643 if (node->isElementNode()) | 1643 if (node->isElementNode()) |
| 1644 nodeSet.add(node); | 1644 nodeSet.insert(node); |
| 1645 } | 1645 } |
| 1646 | 1646 |
| 1647 for (Node* node = firstNode(); node != stopNode; | 1647 for (Node* node = firstNode(); node != stopNode; |
| 1648 node = NodeTraversal::next(*node)) { | 1648 node = NodeTraversal::next(*node)) { |
| 1649 if (node->isElementNode()) { | 1649 if (node->isElementNode()) { |
| 1650 // Exclude start & end container unless the entire corresponding | 1650 // Exclude start & end container unless the entire corresponding |
| 1651 // node is included in the range. | 1651 // node is included in the range. |
| 1652 if (!nodeSet.contains(node->parentNode()) && | 1652 if (!nodeSet.contains(node->parentNode()) && |
| 1653 (startContainer == endContainer || (!node->contains(startContainer) && | 1653 (startContainer == endContainer || (!node->contains(startContainer) && |
| 1654 !node->contains(endContainer)))) { | 1654 !node->contains(endContainer)))) { |
| (...skipping 59 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1714 .data() | 1714 .data() |
| 1715 << "start offset: " << range->startOffset() | 1715 << "start offset: " << range->startOffset() |
| 1716 << ", end offset: " << range->endOffset(); | 1716 << ", end offset: " << range->endOffset(); |
| 1717 } else { | 1717 } else { |
| 1718 LOG(INFO) << "Cannot show tree if range is null, or if boundary points are " | 1718 LOG(INFO) << "Cannot show tree if range is null, or if boundary points are " |
| 1719 "invalid."; | 1719 "invalid."; |
| 1720 } | 1720 } |
| 1721 } | 1721 } |
| 1722 | 1722 |
| 1723 #endif | 1723 #endif |
| OLD | NEW |