| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2004, 2005, 2006, 2007 Apple Inc. All rights reserved. | 2 * Copyright (C) 2004, 2005, 2006, 2007 Apple Inc. All rights reserved. |
| 3 * | 3 * |
| 4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions | 5 * modification, are permitted provided that the following conditions |
| 6 * are met: | 6 * are met: |
| 7 * 1. Redistributions of source code must retain the above copyright | 7 * 1. Redistributions of source code must retain the above copyright |
| 8 * notice, this list of conditions and the following disclaimer. | 8 * notice, this list of conditions and the following disclaimer. |
| 9 * 2. Redistributions in binary form must reproduce the above copyright | 9 * 2. Redistributions in binary form must reproduce the above copyright |
| 10 * notice, this list of conditions and the following disclaimer in the | 10 * notice, this list of conditions and the following disclaimer in the |
| (...skipping 1489 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1500 hasEditableStyle(*secondList) // both lists are editable | 1500 hasEditableStyle(*secondList) // both lists are editable |
| 1501 && | 1501 && |
| 1502 rootEditableElement(*firstList) == | 1502 rootEditableElement(*firstList) == |
| 1503 rootEditableElement(*secondList) // don't cross editing boundaries | 1503 rootEditableElement(*secondList) // don't cross editing boundaries |
| 1504 && isVisiblyAdjacent(Position::inParentAfterNode(*firstList), | 1504 && isVisiblyAdjacent(Position::inParentAfterNode(*firstList), |
| 1505 Position::inParentBeforeNode(*secondList)); | 1505 Position::inParentBeforeNode(*secondList)); |
| 1506 // Make sure there is no visible content between this li and the previous list | 1506 // Make sure there is no visible content between this li and the previous list |
| 1507 } | 1507 } |
| 1508 | 1508 |
| 1509 bool isDisplayInsideTable(const Node* node) { | 1509 bool isDisplayInsideTable(const Node* node) { |
| 1510 if (!node || !node->isElementNode()) | 1510 return node && node->layoutObject() && isHTMLTableElement(node); |
| 1511 return false; | |
| 1512 | |
| 1513 LayoutObject* layoutObject = node->layoutObject(); | |
| 1514 return (layoutObject && layoutObject->isTable()); | |
| 1515 } | 1511 } |
| 1516 | 1512 |
| 1517 bool isTableCell(const Node* node) { | 1513 bool isTableCell(const Node* node) { |
| 1518 DCHECK(node); | 1514 DCHECK(node); |
| 1519 LayoutObject* r = node->layoutObject(); | 1515 LayoutObject* r = node->layoutObject(); |
| 1520 return r ? r->isTableCell() : isHTMLTableCellElement(*node); | 1516 return r ? r->isTableCell() : isHTMLTableCellElement(*node); |
| 1521 } | 1517 } |
| 1522 | 1518 |
| 1523 bool isEmptyTableCell(const Node* node) { | 1519 bool isEmptyTableCell(const Node* node) { |
| 1524 // Returns true IFF the passed in node is one of: | 1520 // Returns true IFF the passed in node is one of: |
| (...skipping 652 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2177 return InputType::DeleteWordBackward; | 2173 return InputType::DeleteWordBackward; |
| 2178 if (granularity == LineBoundary) | 2174 if (granularity == LineBoundary) |
| 2179 return InputType::DeleteLineBackward; | 2175 return InputType::DeleteLineBackward; |
| 2180 return InputType::DeleteContentBackward; | 2176 return InputType::DeleteContentBackward; |
| 2181 default: | 2177 default: |
| 2182 return InputType::None; | 2178 return InputType::None; |
| 2183 } | 2179 } |
| 2184 } | 2180 } |
| 2185 | 2181 |
| 2186 } // namespace blink | 2182 } // namespace blink |
| OLD | NEW |