Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright 2016 The Chromium Authors. All rights reserved. | 1 // Copyright 2016 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "core/dom/ElementVisibilityObserver.h" | 5 #include "core/dom/ElementVisibilityObserver.h" |
| 6 | 6 |
| 7 #include "core/dom/Element.h" | 7 #include "core/dom/Element.h" |
| 8 #include "core/dom/IntersectionObserver.h" | |
| 8 #include "core/dom/IntersectionObserverEntry.h" | 9 #include "core/dom/IntersectionObserverEntry.h" |
| 9 #include "wtf/Functional.h" | 10 #include "wtf/Functional.h" |
| 10 | 11 |
| 11 namespace blink { | 12 namespace blink { |
| 12 | 13 |
| 13 ElementVisibilityObserver::ElementVisibilityObserver(Element* element, std::uniq ue_ptr<VisibilityCallback> callback) | 14 ElementVisibilityObserver* ElementVisibilityObserver::create(Element* element, C lient* client) |
| 14 : m_element(element) | |
| 15 , m_callback(std::move(callback)) | |
| 16 { | 15 { |
| 16 ElementVisibilityObserver* observer = new ElementVisibilityObserver(client); | |
| 17 observer->start(element); | |
| 18 return observer; | |
| 17 } | 19 } |
| 18 | 20 |
| 19 ElementVisibilityObserver::~ElementVisibilityObserver() = default; | 21 ElementVisibilityObserver::ElementVisibilityObserver(Client* client) |
| 22 : m_client(client) | |
| 23 { | |
| 24 DCHECK(m_client); | |
| 25 } | |
| 20 | 26 |
| 21 void ElementVisibilityObserver::start() | 27 void ElementVisibilityObserver::start(Element* element) |
| 22 { | 28 { |
| 23 DCHECK(!m_intersectionObserver); | 29 DCHECK(!m_intersectionObserver); |
| 24 m_intersectionObserver = IntersectionObserver::create( | 30 m_intersectionObserver = IntersectionObserver::create( |
| 25 Vector<Length>(), Vector<float>({std::numeric_limits<float>::min()}), &m _element->document(), | 31 Vector<Length>(), Vector<float>({std::numeric_limits<float>::min()}), &e lement->document(), |
| 26 WTF::bind(&ElementVisibilityObserver::onVisibilityChanged, wrapWeakPersi stent(this))); | 32 WTF::bind(&ElementVisibilityObserver::onVisibilityChanged, wrapWeakPersi stent(this))); |
|
sof
2016/07/25 05:16:26
I'd prefer not using a WeakPersistent<> here also.
sof
2016/07/25 08:16:33
Now done - having two heap objects linked together
| |
| 27 DCHECK(m_intersectionObserver); | 33 DCHECK(m_intersectionObserver); |
| 28 m_intersectionObserver->observe(m_element.release()); | 34 m_intersectionObserver->observe(element); |
| 29 } | 35 } |
| 30 | 36 |
| 31 void ElementVisibilityObserver::stop() | 37 void ElementVisibilityObserver::stop() |
| 32 { | 38 { |
| 33 DCHECK(m_intersectionObserver); | 39 DCHECK(m_intersectionObserver); |
| 34 | 40 |
| 35 m_intersectionObserver->disconnect(); | 41 m_intersectionObserver->disconnect(); |
| 36 m_intersectionObserver = nullptr; | 42 m_intersectionObserver = nullptr; |
| 43 // Client will no longer be called upon, release. | |
| 44 m_client = nullptr; | |
| 45 } | |
| 46 | |
| 47 void ElementVisibilityObserver::onVisibilityChanged(const HeapVector<Member<Inte rsectionObserverEntry>>& entries) | |
| 48 { | |
| 49 DCHECK(m_client); | |
| 50 bool isVisible = entries.last()->intersectionRatio() > 0.f; | |
| 51 m_client->onVisibilityChanged(isVisible); | |
| 37 } | 52 } |
| 38 | 53 |
| 39 DEFINE_TRACE(ElementVisibilityObserver) | 54 DEFINE_TRACE(ElementVisibilityObserver) |
| 40 { | 55 { |
| 41 visitor->trace(m_element); | 56 visitor->trace(m_client); |
| 42 visitor->trace(m_intersectionObserver); | 57 visitor->trace(m_intersectionObserver); |
| 43 } | 58 } |
| 44 | 59 |
| 45 void ElementVisibilityObserver::onVisibilityChanged(const HeapVector<Member<Inte rsectionObserverEntry>>& entries) | |
| 46 { | |
| 47 bool isVisible = entries.last()->intersectionRatio() > 0.f; | |
| 48 (*m_callback.get())(isVisible); | |
| 49 } | |
| 50 | |
| 51 } // namespace blink | 60 } // namespace blink |
| OLD | NEW |