1*cdf0e10cSrcweir /************************************************************************* 2*cdf0e10cSrcweir * 3*cdf0e10cSrcweir * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4*cdf0e10cSrcweir * 5*cdf0e10cSrcweir * Copyright 2000, 2010 Oracle and/or its affiliates. 6*cdf0e10cSrcweir * 7*cdf0e10cSrcweir * OpenOffice.org - a multi-platform office productivity suite 8*cdf0e10cSrcweir * 9*cdf0e10cSrcweir * This file is part of OpenOffice.org. 10*cdf0e10cSrcweir * 11*cdf0e10cSrcweir * OpenOffice.org is free software: you can redistribute it and/or modify 12*cdf0e10cSrcweir * it under the terms of the GNU Lesser General Public License version 3 13*cdf0e10cSrcweir * only, as published by the Free Software Foundation. 14*cdf0e10cSrcweir * 15*cdf0e10cSrcweir * OpenOffice.org is distributed in the hope that it will be useful, 16*cdf0e10cSrcweir * but WITHOUT ANY WARRANTY; without even the implied warranty of 17*cdf0e10cSrcweir * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 18*cdf0e10cSrcweir * GNU Lesser General Public License version 3 for more details 19*cdf0e10cSrcweir * (a copy is included in the LICENSE file that accompanied this code). 20*cdf0e10cSrcweir * 21*cdf0e10cSrcweir * You should have received a copy of the GNU Lesser General Public License 22*cdf0e10cSrcweir * version 3 along with OpenOffice.org. If not, see 23*cdf0e10cSrcweir * <http://www.openoffice.org/license.html> 24*cdf0e10cSrcweir * for a copy of the LGPLv3 License. 25*cdf0e10cSrcweir * 26*cdf0e10cSrcweir ************************************************************************/ 27*cdf0e10cSrcweir 28*cdf0e10cSrcweir // MARKER(update_precomp.py): autogen include statement, do not remove 29*cdf0e10cSrcweir #include "precompiled_sw.hxx" 30*cdf0e10cSrcweir 31*cdf0e10cSrcweir #include "bparr.hxx" 32*cdf0e10cSrcweir #include <algorithm> 33*cdf0e10cSrcweir 34*cdf0e10cSrcweir BigPtrArray::BigPtrArray() 35*cdf0e10cSrcweir { 36*cdf0e10cSrcweir //container_.reserve(1000); 37*cdf0e10cSrcweir } 38*cdf0e10cSrcweir 39*cdf0e10cSrcweir sal_uLong BigPtrArray::Count() const 40*cdf0e10cSrcweir { 41*cdf0e10cSrcweir return container_.size(); 42*cdf0e10cSrcweir } 43*cdf0e10cSrcweir 44*cdf0e10cSrcweir void BigPtrArray::Move(sal_uLong fromPos, sal_uLong toPos) 45*cdf0e10cSrcweir { 46*cdf0e10cSrcweir DBG_ASSERT(fromPos < container_.size() && toPos < container_.size(), "BigPtrArray.Move precondition violation"); 47*cdf0e10cSrcweir Insert(container_[fromPos], toPos); 48*cdf0e10cSrcweir Remove(toPos < fromPos ? fromPos + 1 : fromPos, 1); 49*cdf0e10cSrcweir } 50*cdf0e10cSrcweir 51*cdf0e10cSrcweir void BigPtrArray::ForEach(sal_uLong fromPos, sal_uLong toPos, FnForEach fn, void* pArgs) 52*cdf0e10cSrcweir { 53*cdf0e10cSrcweir DBG_ASSERT(fromPos < toPos && fromPos < container_.size() && toPos < container_.size(), "BigPtrArray::ForEach precondition violation"); 54*cdf0e10cSrcweir Container_t::const_iterator iter = container_.begin() + fromPos; 55*cdf0e10cSrcweir Container_t::const_iterator iter_end = container_.begin() + toPos; 56*cdf0e10cSrcweir for (/*no init*/; iter != iter_end; ++iter) 57*cdf0e10cSrcweir fn(*iter, pArgs); 58*cdf0e10cSrcweir } 59*cdf0e10cSrcweir 60*cdf0e10cSrcweir void BigPtrArray::ForEach(FnForEach fn, void* pArgs) 61*cdf0e10cSrcweir { 62*cdf0e10cSrcweir Container_t::const_iterator iter = container_.begin(); 63*cdf0e10cSrcweir Container_t::const_iterator iter_end = container_.end(); 64*cdf0e10cSrcweir for ( /*no init*/; iter != iter_end; ++iter) 65*cdf0e10cSrcweir fn(*iter, pArgs); 66*cdf0e10cSrcweir } 67*cdf0e10cSrcweir 68*cdf0e10cSrcweir ElementPtr BigPtrArray::operator[](sal_uLong pos) const 69*cdf0e10cSrcweir { 70*cdf0e10cSrcweir DBG_ASSERT(pos < container_.size(), "BigPtrArray::operator[] precondition violation"); 71*cdf0e10cSrcweir return container_[pos]; 72*cdf0e10cSrcweir } 73*cdf0e10cSrcweir 74*cdf0e10cSrcweir void BigPtrArray::Insert(const ElementPtr& rElem, sal_uLong pos) 75*cdf0e10cSrcweir { 76*cdf0e10cSrcweir DBG_ASSERT(pos <= container_.size(), "BigPtrArray::Insert precondition violation"); 77*cdf0e10cSrcweir 78*cdf0e10cSrcweir rElem->pBigPtrArray_ = this; 79*cdf0e10cSrcweir rElem->pos_ = pos; 80*cdf0e10cSrcweir 81*cdf0e10cSrcweir if (pos == container_.size()) 82*cdf0e10cSrcweir container_.push_back(rElem); 83*cdf0e10cSrcweir else 84*cdf0e10cSrcweir { 85*cdf0e10cSrcweir container_.insert(container_.begin() + pos, rElem); 86*cdf0e10cSrcweir FixElementIndizes(container_.begin(), container_.end()); 87*cdf0e10cSrcweir } 88*cdf0e10cSrcweir } 89*cdf0e10cSrcweir 90*cdf0e10cSrcweir void BigPtrArray::Remove( sal_uLong pos, sal_uLong n ) 91*cdf0e10cSrcweir { 92*cdf0e10cSrcweir DBG_ASSERT((pos < container_.size()) && ((container_.begin() + pos + n) < container_.end()), "BigPtrArray.Remove precondition violation") 93*cdf0e10cSrcweir container_.erase(container_.begin() + pos, container_.begin() + pos + n); 94*cdf0e10cSrcweir FixElementIndizes(container_.begin(), container_.end()); 95*cdf0e10cSrcweir } 96*cdf0e10cSrcweir 97*cdf0e10cSrcweir void BigPtrArray::Replace(sal_uLong pos, const ElementPtr& rElem) 98*cdf0e10cSrcweir { 99*cdf0e10cSrcweir DBG_ASSERT(pos < container_.size(), "BigPtrArray::Replace precondition violation"); 100*cdf0e10cSrcweir rElem->pBigPtrArray_ = this; 101*cdf0e10cSrcweir rElem->pos_ = pos; 102*cdf0e10cSrcweir container_[pos] = rElem; 103*cdf0e10cSrcweir } 104*cdf0e10cSrcweir 105*cdf0e10cSrcweir void BigPtrArray::FixElementIndizes(Container_t::const_iterator begin, Container_t::const_iterator end) const 106*cdf0e10cSrcweir { 107*cdf0e10cSrcweir Container_t::const_iterator iter = begin; 108*cdf0e10cSrcweir for (int i = 0; iter != end; ++iter, i++) 109*cdf0e10cSrcweir (*iter)->pos_ = i; 110*cdf0e10cSrcweir } 111