/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */ /* * This file is part of the LibreOffice project. * * This Source Code Form is subject to the terms of the Mozilla Public * License, v. 2.0. If a copy of the MPL was not distributed with this * file, You can obtain one at http://mozilla.org/MPL/2.0/. * * This file incorporates work covered by the following license notice: * * Licensed to the Apache Software Foundation (ASF) under one or more * contributor license agreements. See the NOTICE file distributed * with this work for additional information regarding copyright * ownership. The ASF licenses this file to you under the Apache * License, Version 2.0 (the "License"); you may not use this file * except in compliance with the License. You may obtain a copy of * the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
T& aRef = maItems[ n ];
_elementReplaced( n, t );
_remove( aRef );
aRef = t;
_insert( t );
}
bool hasItem( const T& t ) const
{ return maItems.end() != std::find( maItems.begin(), maItems.end(), t );
}
sal_Int32 addItem( const T& t )
{
OSL_ENSURE( !hasItem( t ), "item to be added already present" );
OSL_ENSURE( isValid( t ), "invalid item" );
maItems.push_back( t );
_insert( t );
_elementInserted( maItems.size() - 1 ); return ( maItems.size() - 1 );
}
void removeItem( const T& t )
{
OSL_ENSURE( hasItem( t ), "item to be removed not present" );
OSL_ENSURE( isValid( t ), "an invalid item, funny that!" );
_elementRemoved( t );
_remove( t );
maItems.erase( std::find( maItems.begin(), maItems.end(), t ) );
}
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.