| 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 37 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 48 static SourceBufferList* create(ExecutionContext* context, GenericEventQueue
* asyncEventQueue) | 48 static SourceBufferList* create(ExecutionContext* context, GenericEventQueue
* asyncEventQueue) |
| 49 { | 49 { |
| 50 return adoptRefCountedGarbageCollectedWillBeNoop(new SourceBufferList(co
ntext, asyncEventQueue)); | 50 return adoptRefCountedGarbageCollectedWillBeNoop(new SourceBufferList(co
ntext, asyncEventQueue)); |
| 51 } | 51 } |
| 52 virtual ~SourceBufferList(); | 52 virtual ~SourceBufferList(); |
| 53 | 53 |
| 54 unsigned long length() const { return m_list.size(); } | 54 unsigned long length() const { return m_list.size(); } |
| 55 SourceBuffer* item(unsigned long index) const { return (index < m_list.size(
)) ? m_list[index].get() : 0; } | 55 SourceBuffer* item(unsigned long index) const { return (index < m_list.size(
)) ? m_list[index].get() : 0; } |
| 56 | 56 |
| 57 void add(SourceBuffer*); | 57 void add(SourceBuffer*); |
| 58 void insert(size_t position, SourceBuffer*); |
| 58 void remove(SourceBuffer*); | 59 void remove(SourceBuffer*); |
| 60 size_t find(SourceBuffer* buffer) { return m_list.find(buffer); } |
| 59 bool contains(SourceBuffer* buffer) { return m_list.find(buffer) != kNotFoun
d; } | 61 bool contains(SourceBuffer* buffer) { return m_list.find(buffer) != kNotFoun
d; } |
| 60 void clear(); | 62 void clear(); |
| 61 | 63 |
| 62 // EventTarget interface | 64 // EventTarget interface |
| 63 virtual const AtomicString& interfaceName() const OVERRIDE; | 65 virtual const AtomicString& interfaceName() const OVERRIDE; |
| 64 virtual ExecutionContext* executionContext() const OVERRIDE; | 66 virtual ExecutionContext* executionContext() const OVERRIDE; |
| 65 | 67 |
| 66 virtual void trace(Visitor*) OVERRIDE; | 68 virtual void trace(Visitor*) OVERRIDE; |
| 67 | 69 |
| 68 private: | 70 private: |
| 69 SourceBufferList(ExecutionContext*, GenericEventQueue*); | 71 SourceBufferList(ExecutionContext*, GenericEventQueue*); |
| 70 | 72 |
| 71 void scheduleEvent(const AtomicString&); | 73 void scheduleEvent(const AtomicString&); |
| 72 | 74 |
| 73 ExecutionContext* m_executionContext; | 75 ExecutionContext* m_executionContext; |
| 74 GenericEventQueue* m_asyncEventQueue; | 76 GenericEventQueue* m_asyncEventQueue; |
| 75 | 77 |
| 76 HeapVector<Member<SourceBuffer> > m_list; | 78 HeapVector<Member<SourceBuffer> > m_list; |
| 77 }; | 79 }; |
| 78 | 80 |
| 79 } // namespace blink | 81 } // namespace blink |
| 80 | 82 |
| 81 #endif // SourceBufferList_h | 83 #endif // SourceBufferList_h |
| OLD | NEW |