| 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 35 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 46 | 46 |
| 47 const HeapVector<Member<Node>>& assignedNodes(); | 47 const HeapVector<Member<Node>>& assignedNodes(); |
| 48 const HeapVector<Member<Node>>& getDistributedNodes(); | 48 const HeapVector<Member<Node>>& getDistributedNodes(); |
| 49 const HeapVector<Member<Node>> getDistributedNodesForBinding(); | 49 const HeapVector<Member<Node>> getDistributedNodesForBinding(); |
| 50 const HeapVector<Member<Node>> assignedNodesForBinding( | 50 const HeapVector<Member<Node>> assignedNodesForBinding( |
| 51 const AssignedNodesOptions&); | 51 const AssignedNodesOptions&); |
| 52 | 52 |
| 53 Node* firstDistributedNode() const { | 53 Node* firstDistributedNode() const { |
| 54 DCHECK(supportsDistribution()); | 54 DCHECK(supportsDistribution()); |
| 55 return m_distributedNodes.isEmpty() ? nullptr | 55 return m_distributedNodes.isEmpty() ? nullptr |
| 56 : m_distributedNodes.first().get(); | 56 : m_distributedNodes.front().get(); |
| 57 } | 57 } |
| 58 Node* lastDistributedNode() const { | 58 Node* lastDistributedNode() const { |
| 59 DCHECK(supportsDistribution()); | 59 DCHECK(supportsDistribution()); |
| 60 return m_distributedNodes.isEmpty() ? nullptr | 60 return m_distributedNodes.isEmpty() ? nullptr |
| 61 : m_distributedNodes.back().get(); | 61 : m_distributedNodes.back().get(); |
| 62 } | 62 } |
| 63 | 63 |
| 64 Node* distributedNodeNextTo(const Node&) const; | 64 Node* distributedNodeNextTo(const Node&) const; |
| 65 Node* distributedNodePreviousTo(const Node&) const; | 65 Node* distributedNodePreviousTo(const Node&) const; |
| 66 | 66 |
| (...skipping 47 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 114 HeapVector<Member<Node>> m_assignedNodes; | 114 HeapVector<Member<Node>> m_assignedNodes; |
| 115 HeapVector<Member<Node>> m_distributedNodes; | 115 HeapVector<Member<Node>> m_distributedNodes; |
| 116 HeapVector<Member<Node>> m_oldDistributedNodes; | 116 HeapVector<Member<Node>> m_oldDistributedNodes; |
| 117 HeapHashMap<Member<const Node>, size_t> m_distributedIndices; | 117 HeapHashMap<Member<const Node>, size_t> m_distributedIndices; |
| 118 bool m_slotchangeEventEnqueued = false; | 118 bool m_slotchangeEventEnqueued = false; |
| 119 }; | 119 }; |
| 120 | 120 |
| 121 } // namespace blink | 121 } // namespace blink |
| 122 | 122 |
| 123 #endif // HTMLSlotElement_h | 123 #endif // HTMLSlotElement_h |
| OLD | NEW |