1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283
|
/* -*- 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 .
*/
#ifndef INCLUDED_FORMS_SOURCE_XFORMS_COLLECTION_HXX
#define INCLUDED_FORMS_SOURCE_XFORMS_COLLECTION_HXX
#include "enumeration.hxx"
#include <cppuhelper/implbase.hxx>
#include <osl/diagnose.h>
#include <com/sun/star/container/ElementExistException.hpp>
#include <com/sun/star/container/NoSuchElementException.hpp>
#include <com/sun/star/container/XEnumeration.hpp>
#include <com/sun/star/container/XIndexReplace.hpp>
#include <com/sun/star/container/XSet.hpp>
#include <com/sun/star/container/XContainer.hpp>
#include <com/sun/star/container/XContainerListener.hpp>
#include <com/sun/star/lang/IllegalArgumentException.hpp>
#include <com/sun/star/lang/IndexOutOfBoundsException.hpp>
#include <com/sun/star/uno/Any.hxx>
#include <com/sun/star/uno/Reference.hxx>
#include <com/sun/star/uno/Type.hxx>
#include <vector>
typedef cppu::WeakImplHelper<
css::container::XIndexReplace,
css::container::XSet,
css::container::XContainer>
Collection_t;
template<class ELEMENT_TYPE>
class Collection : public Collection_t
{
public:
typedef ELEMENT_TYPE T;
typedef std::vector<css::uno::Reference<css::container::XContainerListener> > Listeners_t;
protected:
std::vector<T> maItems;
Listeners_t maListeners;
public:
Collection() {}
const T& getItem( sal_Int32 n ) const
{
OSL_ENSURE( isValidIndex(n), "invalid index" );
OSL_ENSURE( isValid( maItems[n] ), "invalid item found" );
return maItems[n];
}
void setItem( sal_Int32 n, const T& t)
{
OSL_ENSURE( isValidIndex(n), "invalid index" );
OSL_ENSURE( isValid ( t ), "invalid item" );
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 ) );
}
bool hasItems() const
{
return maItems.size() != 0;
}
sal_Int32 countItems() const
{
return static_cast<sal_Int32>( maItems.size() );
}
bool isValidIndex( sal_Int32 n ) const
{
return n >= 0 && n < static_cast<sal_Int32>( maItems.size() );
}
// the following method may be overridden by sub-classes for
// customized behaviour
/// called before insertion to determine whether item is valid
virtual bool isValid( const T& ) const { return true; }
protected:
// the following methods may be overridden by sub-classes for
// customized behaviour
/// called after item has been inserted into the collection
virtual void _insert( const T& ) { }
/// called before item is removed from the collection
virtual void _remove( const T& ) { }
public:
// XElementAccess
virtual css::uno::Type SAL_CALL getElementType() override
{
return cppu::UnoType<T>::get();
}
virtual sal_Bool SAL_CALL hasElements() override
{
return hasItems();
}
// XIndexAccess : XElementAccess
virtual sal_Int32 SAL_CALL getCount() override
{
return countItems();
}
virtual css::uno::Any SAL_CALL getByIndex( sal_Int32 nIndex ) override
{
if( !isValidIndex( nIndex ) )
throw css::lang::IndexOutOfBoundsException();
return css::uno::makeAny( getItem( nIndex ) );
}
// XIndexReplace : XIndexAccess
virtual void SAL_CALL replaceByIndex( sal_Int32 nIndex,
const css::uno::Any& aElement ) override
{
T t;
if( !isValidIndex( nIndex) )
throw css::lang::IndexOutOfBoundsException();
if( !( aElement >>= t ) || !isValid( t ) )
throw css::lang::IllegalArgumentException();
setItem( nIndex, t );
}
// XEnumerationAccess : XElementAccess
virtual css::uno::Reference<css::container::XEnumeration> SAL_CALL createEnumeration() override
{
return new Enumeration( this );
}
// XSet : XEnumerationAccess
virtual sal_Bool SAL_CALL has( const css::uno::Any& aElement ) override
{
T t;
return ( aElement >>= t ) && hasItem( t );
}
virtual void SAL_CALL insert( const css::uno::Any& aElement ) override
{
T t;
if( !( aElement >>= t ) || !isValid( t ) )
throw css::lang::IllegalArgumentException();
if( hasItem( t ) )
throw css::container::ElementExistException();
addItem( t );
}
virtual void SAL_CALL remove( const css::uno::Any& aElement ) override
{
T t;
if( !(aElement >>= t) )
throw css::lang::IllegalArgumentException();
if( !hasItem( t ) )
throw css::container::NoSuchElementException();
removeItem( t );
}
// XContainer
virtual void SAL_CALL addContainerListener(
const css::uno::Reference<css::container::XContainerListener>& xListener ) override
{
OSL_ENSURE( xListener.is(), "need listener!" );
if( std::find( maListeners.begin(), maListeners.end(), xListener)
== maListeners.end() )
maListeners.push_back( xListener );
}
virtual void SAL_CALL removeContainerListener(
const css::uno::Reference<css::container::XContainerListener>& xListener ) override
{
OSL_ENSURE( xListener.is(), "need listener!" );
Listeners_t::iterator aIter =
std::find( maListeners.begin(), maListeners.end(), xListener );
if( aIter != maListeners.end() )
maListeners.erase( aIter );
}
protected:
// call listeners:
void _elementInserted( sal_Int32 nPos )
{
OSL_ENSURE( isValidIndex(nPos), "invalid index" );
css::container::ContainerEvent aEvent(
static_cast<css::container::XIndexReplace*>( this ),
css::uno::makeAny( nPos ),
css::uno::makeAny( getItem( nPos ) ),
css::uno::Any() );
for (auto const& listener : maListeners)
{
listener->elementInserted( aEvent );
}
}
void _elementRemoved( const T& aOld )
{
css::container::ContainerEvent aEvent(
static_cast<css::container::XIndexReplace*>( this ),
css::uno::Any(),
css::uno::makeAny( aOld ),
css::uno::Any() );
for (auto const& listener : maListeners)
{
listener->elementRemoved( aEvent );
}
}
void _elementReplaced( const sal_Int32 nPos, const T& aNew )
{
OSL_ENSURE( isValidIndex(nPos), "invalid index" );
css::container::ContainerEvent aEvent(
static_cast<css::container::XIndexReplace*>( this ),
css::uno::makeAny( nPos ),
css::uno::makeAny( getItem( nPos ) ),
css::uno::makeAny( aNew ) );
for (auto const& listener : maListeners)
{
listener->elementReplaced( aEvent );
}
}
};
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|