| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2015 Google Inc. All rights reserved. | 2 * Copyright (C) 2015 Google 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 are | 5 * modification, are permitted provided that the following conditions are |
| 6 * met: | 6 * met: |
| 7 * | 7 * |
| 8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
| 10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
| (...skipping 59 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 70 void appendDistributedNode(Node&); | 70 void appendDistributedNode(Node&); |
| 71 void appendDistributedNodesFrom(const HTMLSlotElement& other); | 71 void appendDistributedNodesFrom(const HTMLSlotElement& other); |
| 72 | 72 |
| 73 void updateDistributedNodesWithFallback(); | 73 void updateDistributedNodesWithFallback(); |
| 74 | 74 |
| 75 void lazyReattachDistributedNodesIfNeeded(); | 75 void lazyReattachDistributedNodesIfNeeded(); |
| 76 | 76 |
| 77 void attachLayoutTree(const AttachContext& = AttachContext()) final; | 77 void attachLayoutTree(const AttachContext& = AttachContext()) final; |
| 78 void detachLayoutTree(const AttachContext& = AttachContext()) final; | 78 void detachLayoutTree(const AttachContext& = AttachContext()) final; |
| 79 | 79 |
| 80 void attributeChanged(const QualifiedName&, | 80 void attributeChanged(const AttributeModificationParams&) final; |
| 81 const AtomicString& oldValue, | |
| 82 const AtomicString& newValue, | |
| 83 AttributeModificationReason) final; | |
| 84 | 81 |
| 85 int tabIndex() const override; | 82 int tabIndex() const override; |
| 86 AtomicString name() const; | 83 AtomicString name() const; |
| 87 | 84 |
| 88 // This method can be slow because this has to traverse the children of a | 85 // This method can be slow because this has to traverse the children of a |
| 89 // shadow host. This method should be used only when m_assignedNodes is | 86 // shadow host. This method should be used only when m_assignedNodes is |
| 90 // dirty. e.g. To detect a slotchange event in DOM mutations. | 87 // dirty. e.g. To detect a slotchange event in DOM mutations. |
| 91 bool hasAssignedNodesSlow() const; | 88 bool hasAssignedNodesSlow() const; |
| 92 bool findHostChildWithSameSlotName() const; | 89 bool findHostChildWithSameSlotName() const; |
| 93 | 90 |
| (...skipping 20 matching lines...) Expand all Loading... |
| 114 HeapVector<Member<Node>> m_assignedNodes; | 111 HeapVector<Member<Node>> m_assignedNodes; |
| 115 HeapVector<Member<Node>> m_distributedNodes; | 112 HeapVector<Member<Node>> m_distributedNodes; |
| 116 HeapVector<Member<Node>> m_oldDistributedNodes; | 113 HeapVector<Member<Node>> m_oldDistributedNodes; |
| 117 HeapHashMap<Member<const Node>, size_t> m_distributedIndices; | 114 HeapHashMap<Member<const Node>, size_t> m_distributedIndices; |
| 118 bool m_slotchangeEventEnqueued = false; | 115 bool m_slotchangeEventEnqueued = false; |
| 119 }; | 116 }; |
| 120 | 117 |
| 121 } // namespace blink | 118 } // namespace blink |
| 122 | 119 |
| 123 #endif // HTMLSlotElement_h | 120 #endif // HTMLSlotElement_h |
| OLD | NEW |