Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 /* | 1 /* |
| 2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * Copyright (C) 2013 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 10 matching lines...) Expand all Loading... | |
| 21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 29 */ | 29 */ |
| 30 | 30 |
| 31 #ifndef Composition_h | 31 #ifndef WorkerPerformance_h |
| 32 #define Composition_h | 32 #define WorkerPerformance_h |
| 33 | 33 |
| 34 #include "bindings/v8/ScriptWrappable.h" | |
| 35 #include "wtf/PassRefPtr.h" | 34 #include "wtf/PassRefPtr.h" |
| 36 #include "wtf/RefCounted.h" | 35 #include "wtf/RefCounted.h" |
| 37 #include "wtf/RefPtr.h" | 36 #include "wtf/RefPtr.h" |
| 38 | 37 |
| 39 namespace WebCore { | 38 namespace WebCore { |
| 40 | 39 |
| 41 class Node; | 40 class WorkerContext; |
| 42 class Range; | |
| 43 | 41 |
| 44 class Composition : public RefCounted<Composition>, public ScriptWrappable { | 42 class WorkerPerformance : public RefCounted<WorkerPerformance> { |
| 45 public: | 43 public: |
| 46 static PassRefPtr<Composition> create(Node*, Range*); | 44 static PassRefPtr<WorkerPerformance> create(WorkerContext* context) { return adoptRef(new WorkerPerformance(context)); } |
| 47 ~Composition(); | 45 ~WorkerPerformance(); |
| 48 | 46 |
| 49 Node* text() const { return m_text.get(); } | 47 using RefCounted<WorkerPerformance>::ref; |
| 50 Range* caret() const { return m_caret.get(); } | 48 using RefCounted<WorkerPerformance>::deref; |
|
abarth-chromium
2013/06/12 23:11:41
These aren't needed.
James Simonsen
2013/06/13 00:01:36
Done. Thanks.
| |
| 49 | |
| 50 double now() const; | |
| 51 | 51 |
| 52 private: | 52 private: |
| 53 Composition(Node*, Range*); | 53 explicit WorkerPerformance(WorkerContext*); |
| 54 | 54 |
| 55 RefPtr<Node> m_text; | 55 WorkerContext* m_context; |
|
abarth-chromium
2013/06/12 23:11:41
Rather than holding a raw m_context pointer, this
James Simonsen
2013/06/13 00:01:36
Done.
| |
| 56 RefPtr<Range> m_caret; | |
| 57 }; | 56 }; |
| 58 | 57 |
| 59 } // namespace WebCore | 58 } |
| 60 | 59 |
| 61 #endif // Composition_h | 60 #endif // WorkerPerformance_h |
| OLD | NEW |