Chromium Code Reviews| OLD | NEW |
|---|---|
| (Empty) | |
| 1 /* | |
|
yosin_UTC9
2014/06/06 01:24:27
nit: Please use below licence header:
http://dev.c
huangs
2014/06/06 20:42:28
Done.
| |
| 2 * Copyright (C) 2014 Google Inc. All rights reserved. | |
| 3 * | |
| 4 * Redistribution and use in source and binary forms, with or without | |
| 5 * modification, are permitted provided that the following conditions are | |
| 6 * met: | |
| 7 * | |
| 8 * * Redistributions of source code must retain the above copyright | |
| 9 * notice, this list of conditions and the following disclaimer. | |
| 10 * * Redistributions in binary form must reproduce the above | |
| 11 * copyright notice, this list of conditions and the following disclaimer | |
| 12 * in the documentation and/or other materials provided with the | |
| 13 * distribution. | |
| 14 * * Neither the name of Google Inc. nor the names of its | |
| 15 * contributors may be used to endorse or promote products derived from | |
| 16 * this software without specific prior written permission. | |
| 17 * | |
| 18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
| 19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
| 20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
| 21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
| 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
| 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
| 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
| 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. | |
| 29 */ | |
| 30 | |
| 31 #ifndef CompositionUnderlineIterator_h | |
| 32 #define CompositionUnderlineIterator_h | |
| 33 | |
| 34 #include "core/editing/CompositionUnderline.h" | |
| 35 #include "wtf/Vector.h" | |
| 36 | |
| 37 namespace WebCore { | |
| 38 | |
| 39 // A visitor class to yield elements of a sorted (by startOffset) list of underl ines, | |
| 40 // visiting only elements that inersect with specified inclusive range [indexLo, indexHi]. | |
| 41 class CompositionUnderlineIterator { | |
| 42 WTF_MAKE_NONCOPYABLE(CompositionUnderlineIterator); | |
| 43 public: | |
| 44 CompositionUnderlineIterator(const Vector<CompositionUnderline>& underlines, size_t indexLo, size_t indexHi) | |
| 45 : m_underlines(underlines) | |
| 46 , m_indexLo(indexLo) | |
| 47 , m_indexHi(indexHi) | |
| 48 , m_nextIndex(0) { } | |
| 49 | |
| 50 // Finds the next valid element in m_underlines. Ff found, writes the pointe r to the | |
| 51 // next element to |underlineOut|, and returns true. Otherwise returns false . | |
| 52 bool next(const CompositionUnderline** underlineOut); | |
| 53 | |
| 54 private: | |
| 55 // Assume that elements of |m_underlines| are sorted by |.startOffset|. | |
| 56 const Vector<CompositionUnderline>& m_underlines; | |
| 57 const size_t m_indexLo; | |
| 58 const size_t m_indexHi; | |
| 59 size_t m_nextIndex; | |
| 60 }; | |
| 61 | |
| 62 } // namespace WebCore | |
| 63 | |
| 64 #endif | |
| OLD | NEW |