// Copyright 2017 The Chromium Authors // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. #ifndef THIRD_PARTY_BLINK_RENDERER_CORE_DOM_LIVE_NODE_LIST_REGISTRY_H_ #define THIRD_PARTY_BLINK_RENDERER_CORE_DOM_LIVE_NODE_LIST_REGISTRY_H_ #include <algorithm> #include "third_party/blink/renderer/core/core_export.h" #include "third_party/blink/renderer/core/dom/node_list_invalidation_type.h" #include "third_party/blink/renderer/platform/heap/garbage_collected.h" #include "third_party/blink/renderer/platform/heap/member.h" #include "third_party/blink/renderer/platform/wtf/allocator/allocator.h" #include "third_party/blink/renderer/platform/wtf/vector.h" namespace blink { class LiveNodeListBase; // Weakly holds (node list, invalidation type) pairs, and allows efficient // queries of whether nodes matching particular invalidation types are present. // Entries are automatically removed when a node list is collected by the GC. // // Adding elements and querying are both efficient, and the data structure is // reasonably compact (and attempts to remain so). Removal (especially manual // removal) is somewhat expensive, but expected to be infrequent. // // It is invalid to add a (list, type) pair that is already present, or to // remove one which is not. class CORE_EXPORT LiveNodeListRegistry { … }; } // namespace blink #endif // THIRD_PARTY_BLINK_RENDERER_CORE_DOM_LIVE_NODE_LIST_REGISTRY_H_