OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2011 Google Inc. All rights reserved. | 2 * Copyright (C) 2011 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 | 5 * modification, are permitted provided that the following conditions |
6 * are met: | 6 * are met: |
7 * 1. Redistributions of source code must retain the above copyright | 7 * 1. Redistributions of source code must retain the above copyright |
8 * notice, this list of conditions and the following disclaimer. | 8 * notice, this list of conditions and the following disclaimer. |
9 * 2. Redistributions in binary form must reproduce the above copyright | 9 * 2. Redistributions in binary form must reproduce the above copyright |
10 * notice, this list of conditions and the following disclaimer in the | 10 * notice, this list of conditions and the following disclaimer in the |
(...skipping 46 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
57 bool updateCueIndex(TextTrackCue*); | 57 bool updateCueIndex(TextTrackCue*); |
58 | 58 |
59 void trace(Visitor*); | 59 void trace(Visitor*); |
60 | 60 |
61 private: | 61 private: |
62 TextTrackCueList(); | 62 TextTrackCueList(); |
63 bool add(PassRefPtrWillBeRawPtr<TextTrackCue>, size_t, size_t); | 63 bool add(PassRefPtrWillBeRawPtr<TextTrackCue>, size_t, size_t); |
64 void clear(); | 64 void clear(); |
65 void invalidateCueIndexes(size_t); | 65 void invalidateCueIndexes(size_t); |
66 | 66 |
67 WillBeHeapVector<RefPtrWillBeMember<TextTrackCue> > m_list; | 67 WillBeHeapVector<RefPtrWillBeMember<TextTrackCue>> m_list; |
68 RefPtrWillBeMember<TextTrackCueList> m_activeCues; | 68 RefPtrWillBeMember<TextTrackCueList> m_activeCues; |
69 }; | 69 }; |
70 | 70 |
71 } // namespace blink | 71 } // namespace blink |
72 | 72 |
73 #endif // TextTrackCueList_h | 73 #endif // TextTrackCueList_h |
OLD | NEW |