| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2012 Nokia Corporation and/or its subsidiary(-ies) | 2 * Copyright (C) 2012 Nokia Corporation and/or its subsidiary(-ies) |
| 3 * | 3 * |
| 4 * This library is free software; you can redistribute it and/or | 4 * This library is free software; you can redistribute it and/or |
| 5 * modify it under the terms of the GNU Library General Public | 5 * modify it under the terms of the GNU Library General Public |
| 6 * License as published by the Free Software Foundation; either | 6 * License as published by the Free Software Foundation; either |
| 7 * version 2 of the License, or (at your option) any later version. | 7 * version 2 of the License, or (at your option) any later version. |
| 8 * | 8 * |
| 9 * This library is distributed in the hope that it will be useful, | 9 * This library is distributed in the hope that it will be useful, |
| 10 * but WITHOUT ANY WARRANTY; without even the implied warranty of | 10 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| (...skipping 286 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 297 HeapHashSet<Member<Node>>::AddResult addResult = | 297 HeapHashSet<Member<Node>>::AddResult addResult = |
| 298 ancestorsToRespondersSet.insert(visitedNode); | 298 ancestorsToRespondersSet.insert(visitedNode); |
| 299 if (!addResult.isNewEntry) | 299 if (!addResult.isNewEntry) |
| 300 break; | 300 break; |
| 301 } | 301 } |
| 302 break; | 302 break; |
| 303 } | 303 } |
| 304 } | 304 } |
| 305 // Insert the detected responder for all the visited nodes. | 305 // Insert the detected responder for all the visited nodes. |
| 306 for (unsigned j = 0; j < visitedNodes.size(); j++) | 306 for (unsigned j = 0; j < visitedNodes.size(); j++) |
| 307 responderMap.add(visitedNodes[j], respondingNode); | 307 responderMap.insert(visitedNodes[j], respondingNode); |
| 308 | 308 |
| 309 if (respondingNode) | 309 if (respondingNode) |
| 310 candidates.push_back(node); | 310 candidates.push_back(node); |
| 311 } | 311 } |
| 312 | 312 |
| 313 // We compile the list of component absolute quads instead of using the | 313 // We compile the list of component absolute quads instead of using the |
| 314 // bounding rect to be able to perform better hit-testing on inline links on | 314 // bounding rect to be able to perform better hit-testing on inline links on |
| 315 // line-breaks. | 315 // line-breaks. |
| 316 for (unsigned i = 0; i < candidates.size(); i++) { | 316 for (unsigned i = 0; i < candidates.size(); i++) { |
| 317 Node* candidate = candidates[i]; | 317 Node* candidate = candidates[i]; |
| (...skipping 244 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 562 const HeapVector<Member<Node>>& nodes) { | 562 const HeapVector<Member<Node>>& nodes) { |
| 563 IntPoint targetPoint; | 563 IntPoint targetPoint; |
| 564 TouchAdjustment::SubtargetGeometryList subtargets; | 564 TouchAdjustment::SubtargetGeometryList subtargets; |
| 565 TouchAdjustment::compileZoomableSubtargets(nodes, subtargets); | 565 TouchAdjustment::compileZoomableSubtargets(nodes, subtargets); |
| 566 return TouchAdjustment::findNodeWithLowestDistanceMetric( | 566 return TouchAdjustment::findNodeWithLowestDistanceMetric( |
| 567 targetNode, targetPoint, targetArea, touchHotspot, touchArea, subtargets, | 567 targetNode, targetPoint, targetArea, touchHotspot, touchArea, subtargets, |
| 568 TouchAdjustment::zoomableIntersectionQuotient); | 568 TouchAdjustment::zoomableIntersectionQuotient); |
| 569 } | 569 } |
| 570 | 570 |
| 571 } // namespace blink | 571 } // namespace blink |
| OLD | NEW |