Chromium Code Reviews| Index: Source/core/dom/NthIndexCache.h |
| diff --git a/Source/core/dom/NthIndexCache.h b/Source/core/dom/NthIndexCache.h |
| new file mode 100644 |
| index 0000000000000000000000000000000000000000..28eeb182530c184262fecd62684dc9c59aaaec6e |
| --- /dev/null |
| +++ b/Source/core/dom/NthIndexCache.h |
| @@ -0,0 +1,107 @@ |
| +// Copyright 2015 The Chromium Authors. All rights reserved. |
| +// Use of this source code is governed by a BSD-style license that can be |
| +// found in the LICENSE file. |
| + |
| +#ifndef NthIndexCache_h |
| +#define NthIndexCache_h |
| + |
| +#include "core/dom/Element.h" |
| +#include "core/dom/ElementTraversal.h" |
| +#include "platform/heap/Handle.h" |
| +#include "wtf/HashMap.h" |
| +#include "wtf/OwnPtr.h" |
| +#include "wtf/RefPtr.h" |
| + |
| +namespace blink { |
| + |
| +class Document; |
| + |
| +class NthIndexCache : NoBaseWillBeGarbageCollected<NthIndexCache> { |
|
sof
2015/03/30 20:55:17
nit: add final.
rune
2015/03/30 22:01:45
Done. Same for NthIndexData.
|
| + WTF_MAKE_NONCOPYABLE(NthIndexCache); |
| +public: |
| + static PassOwnPtr<NthIndexCache> create(Document& document) |
| + { |
| + return adoptPtr(new NthIndexCache(document)); |
| + } |
| + |
|
sof
2015/03/30 20:55:17
nit: it wouldn't hurt to define a dtor for non-Oil
rune
2015/03/30 22:01:45
Done. Did the same for NthIndexData, but had to ha
|
| + unsigned nthChildIndex(Element&); |
| + unsigned nthLastChildIndex(Element&); |
| + |
| + void clear(); |
| + |
| + DECLARE_TRACE(); |
| + |
| +private: |
| + NthIndexCache(Document& document) |
|
sof
2015/03/30 20:55:17
nit: add explicit
rune
2015/03/30 22:01:45
Done.
|
| + : m_document(document) { } |
| + |
| + class NthIndexData : public NoBaseWillBeGarbageCollected<NthIndexData> { |
| + WTF_MAKE_NONCOPYABLE(NthIndexData); |
| + public: |
| + NthIndexData() : m_count(0) { } |
| + |
| + inline unsigned nthIndex(Element&); |
| + inline unsigned nthLastIndex(Element&); |
| + |
| + unsigned cacheNthIndices(Element&); |
| + |
| + WillBeHeapHashMap<RawPtrWillBeMember<Element>, unsigned> m_elementIndexMap; |
| + unsigned m_count; |
| + |
| + DECLARE_TRACE(); |
| + }; |
| + |
| + NthIndexData& ensureNthIndexDataFor(Node&); |
| + inline unsigned nthIndex(Element&); |
| + |
| + using ParentMap = WillBeHeapHashMap<RefPtrWillBeMember<Node>, OwnPtrWillBeMember<NthIndexData>>; |
| + |
| + OwnPtrWillBeMember<ParentMap> m_parentMap; |
| + RawPtrWillBeMember<Document> m_document; |
| +}; |
| + |
| +class NthIndexCacheScope { |
| + STACK_ALLOCATED(); |
| + WTF_MAKE_NONCOPYABLE(NthIndexCacheScope); |
| +public: |
| + NthIndexCacheScope(Document&); |
| + ~NthIndexCacheScope(); |
| +private: |
| + RawPtrWillBeMember<Document> m_document; |
| +}; |
| + |
| +inline unsigned NthIndexCache::NthIndexData::nthIndex(Element& element) |
| +{ |
| + if (!m_count) |
| + return cacheNthIndices(element); |
| + |
| + unsigned index = 0; |
| + for (Element* sibling = &element; sibling; sibling = ElementTraversal::previousSibling(*sibling), index++) { |
| + auto it = m_elementIndexMap.find(sibling); |
| + if (it != m_elementIndexMap.end()) |
| + return it->value + index; |
| + } |
| + return index; |
| +} |
| + |
| +inline unsigned NthIndexCache::NthIndexData::nthLastIndex(Element& element) |
| +{ |
| + unsigned index = nthIndex(element); |
| + return m_count - index + 1; |
| +} |
| + |
| +inline unsigned NthIndexCache::nthChildIndex(Element& element) |
| +{ |
| + ASSERT(element.parentNode()); |
| + return ensureNthIndexDataFor(*element.parentNode()).nthIndex(element); |
| +} |
| + |
| +inline unsigned NthIndexCache::nthLastChildIndex(Element& element) |
| +{ |
| + ASSERT(element.parentNode()); |
| + return ensureNthIndexDataFor(*element.parentNode()).nthLastIndex(element); |
| +} |
| + |
| +} // namespace blink |
| + |
| +#endif // NthIndexCache_h |