| 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 45 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 56 void appendAssignedNode(Node&); | 56 void appendAssignedNode(Node&); |
| 57 | 57 |
| 58 void resolveDistributedNodes(); | 58 void resolveDistributedNodes(); |
| 59 void appendDistributedNode(Node&); | 59 void appendDistributedNode(Node&); |
| 60 void appendDistributedNodesFrom(const HTMLSlotElement& other); | 60 void appendDistributedNodesFrom(const HTMLSlotElement& other); |
| 61 | 61 |
| 62 void updateDistributedNodesWithFallback(); | 62 void updateDistributedNodesWithFallback(); |
| 63 | 63 |
| 64 void lazyReattachDistributedNodesIfNeeded(); | 64 void lazyReattachDistributedNodesIfNeeded(); |
| 65 | 65 |
| 66 void attach(const AttachContext& = AttachContext()) final; | 66 void attachLayoutTree(const AttachContext& = AttachContext()) final; |
| 67 void detach(const AttachContext& = AttachContext()) final; | 67 void detach(const AttachContext& = AttachContext()) final; |
| 68 | 68 |
| 69 void attributeChanged(const QualifiedName&, const AtomicString& oldValue, co
nst AtomicString& newValue, AttributeModificationReason = ModifiedDirectly) fina
l; | 69 void attributeChanged(const QualifiedName&, const AtomicString& oldValue, co
nst AtomicString& newValue, AttributeModificationReason = ModifiedDirectly) fina
l; |
| 70 | 70 |
| 71 short tabIndex() const override; | 71 short tabIndex() const override; |
| 72 AtomicString name() const; | 72 AtomicString name() const; |
| 73 | 73 |
| 74 // This method can be slow because this has to traverse the children of a sh
adow host. | 74 // This method can be slow because this has to traverse the children of a sh
adow host. |
| 75 // This method should be used only when m_assignedNodes is dirty. | 75 // This method should be used only when m_assignedNodes is dirty. |
| 76 // e.g. To detect a slotchange event in DOM mutations. | 76 // e.g. To detect a slotchange event in DOM mutations. |
| (...skipping 21 matching lines...) Expand all Loading... |
| 98 HeapVector<Member<Node>> m_assignedNodes; | 98 HeapVector<Member<Node>> m_assignedNodes; |
| 99 HeapVector<Member<Node>> m_distributedNodes; | 99 HeapVector<Member<Node>> m_distributedNodes; |
| 100 HeapVector<Member<Node>> m_oldDistributedNodes; | 100 HeapVector<Member<Node>> m_oldDistributedNodes; |
| 101 HeapHashMap<Member<const Node>, size_t> m_distributedIndices; | 101 HeapHashMap<Member<const Node>, size_t> m_distributedIndices; |
| 102 bool m_slotchangeEventEnqueued = false; | 102 bool m_slotchangeEventEnqueued = false; |
| 103 }; | 103 }; |
| 104 | 104 |
| 105 } // namespace blink | 105 } // namespace blink |
| 106 | 106 |
| 107 #endif // HTMLSlotElement_h | 107 #endif // HTMLSlotElement_h |
| OLD | NEW |