1/* 2 * Copyright (C) 2011 Google Inc. All rights reserved. 3 * Copyright (C) 2013 Igalia S.L. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions are 7 * met: 8 * 9 * * Redistributions of source code must retain the above copyright 10 * notice, this list of conditions and the following disclaimer. 11 * * Redistributions in binary form must reproduce the above 12 * copyright notice, this list of conditions and the following disclaimer 13 * in the documentation and/or other materials provided with the 14 * distribution. 15 * * Neither the name of Google Inc. nor the names of its 16 * contributors may be used to endorse or promote products derived from 17 * this software without specific prior written permission. 18 * 19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 20 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 21 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 22 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 23 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 24 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 25 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 26 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 27 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 28 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 29 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 30 */ 31 32#include "config.h" 33#include "OrderIterator.h" 34 35#include "RenderBox.h" 36 37namespace WebCore { 38 39static const int cInvalidIndex = -1; 40 41OrderIterator::OrderIterator(RenderBox& containerBox) 42 : m_containerBox(containerBox) 43{ 44 reset(); 45} 46 47RenderBox* OrderIterator::first() 48{ 49 reset(); 50 return next(); 51} 52 53RenderBox* OrderIterator::next() 54{ 55 int endIndex = m_orderValues.size(); 56 do { 57 if (m_currentChild) { 58 m_currentChild = m_currentChild->nextSiblingBox(); 59 continue; 60 } 61 62 if (m_orderIndex == endIndex) 63 return nullptr; 64 65 if (m_orderIndex != cInvalidIndex) { 66 ++m_orderIndex; 67 if (m_orderIndex == endIndex) 68 return nullptr; 69 } else 70 m_orderIndex = 0; 71 72 m_currentChild = m_containerBox.firstChildBox(); 73 } while (!m_currentChild || m_currentChild->style().order() != m_orderValues[m_orderIndex]); 74 75 return m_currentChild; 76} 77 78void OrderIterator::reset() 79{ 80 m_currentChild = nullptr; 81 m_orderIndex = cInvalidIndex; 82} 83 84OrderIteratorPopulator::OrderIteratorPopulator(OrderIterator& iterator) 85 : m_iterator(iterator) 86{ 87 // Note that we don't release the memory here, we only invalidate the size 88 // This avoids unneeded reallocation if the size ends up not changing. 89 m_iterator.m_orderValues.shrink(0); 90} 91 92OrderIteratorPopulator::~OrderIteratorPopulator() 93{ 94 m_iterator.reset(); 95 96 if (m_iterator.m_orderValues.size() > 1) 97 removeDuplicatedOrderValues(); 98} 99 100void OrderIteratorPopulator::removeDuplicatedOrderValues() 101{ 102 auto& orderValues = m_iterator.m_orderValues; 103 104 std::sort(orderValues.begin(), orderValues.end()); 105 auto nextElement = std::unique(orderValues.begin(), orderValues.end()); 106 orderValues.shrinkCapacity(nextElement - orderValues.begin()); 107} 108 109void OrderIteratorPopulator::collectChild(const RenderBox& child) 110{ 111 m_iterator.m_orderValues.append(child.style().order()); 112} 113 114 115} // namespace WebCore 116