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 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
#include "unotools/accessiblestatesethelper.hxx"
#include <tools/debug.hxx>
#include <comphelper/servicehelper.hxx>
// defines how many states the bitfield can contain
// it has the size of 64 because I use a uInt64
#define BITFIELDSIZE 64
using namespace ::utl;
using namespace ::rtl;
using namespace ::com::sun::star;
using namespace ::com::sun::star::accessibility;
class AccessibleStateSetHelperImpl
{
public:
AccessibleStateSetHelperImpl();
AccessibleStateSetHelperImpl(const AccessibleStateSetHelperImpl& rImpl);
~AccessibleStateSetHelperImpl();
sal_Bool IsEmpty () const
throw (uno::RuntimeException);
sal_Bool Contains (sal_Int16 aState) const
throw (uno::RuntimeException);
uno::Sequence<sal_Int16> GetStates() const
throw (uno::RuntimeException);
void AddState(sal_Int16 aState)
throw (uno::RuntimeException);
void RemoveState(sal_Int16 aState)
throw (uno::RuntimeException);
sal_Bool Compare(const AccessibleStateSetHelperImpl* pComparativeValue,
AccessibleStateSetHelperImpl* pOldStates,
AccessibleStateSetHelperImpl* pNewStates) const
throw (uno::RuntimeException);
inline void AddStates( const sal_Int64 _nStates ) SAL_THROW( ( ) );
private:
sal_uInt64 maStates;
};
AccessibleStateSetHelperImpl::AccessibleStateSetHelperImpl()
: maStates(0)
{
}
AccessibleStateSetHelperImpl::AccessibleStateSetHelperImpl(const AccessibleStateSetHelperImpl& rImpl)
: maStates(rImpl.maStates)
{
}
AccessibleStateSetHelperImpl::~AccessibleStateSetHelperImpl()
{
}
inline sal_Bool AccessibleStateSetHelperImpl::IsEmpty () const
throw (uno::RuntimeException)
{
return maStates == 0;
}
inline sal_Bool AccessibleStateSetHelperImpl::Contains (sal_Int16 aState) const
throw (uno::RuntimeException)
{
DBG_ASSERT(aState < BITFIELDSIZE, "the statesset is too small");
sal_uInt64 aTempBitSet(1);
aTempBitSet <<= aState;
return ((aTempBitSet & maStates) != 0);
}
inline uno::Sequence<sal_Int16> AccessibleStateSetHelperImpl::GetStates() const
throw (uno::RuntimeException)
{
uno::Sequence<sal_Int16> aRet(BITFIELDSIZE);
sal_Int16* pSeq = aRet.getArray();
sal_Int16 nStateCount(0);
for (sal_Int16 i = 0; i < BITFIELDSIZE; ++i)
if (Contains(i))
{
*pSeq = i;
++pSeq;
++nStateCount;
}
aRet.realloc(nStateCount);
return aRet;
}
inline void AccessibleStateSetHelperImpl::AddStates( const sal_Int64 _nStates ) SAL_THROW( ( ) )
{
maStates |= _nStates;
}
inline void AccessibleStateSetHelperImpl::AddState(sal_Int16 aState)
throw (uno::RuntimeException)
{
DBG_ASSERT(aState < BITFIELDSIZE, "the statesset is too small");
sal_uInt64 aTempBitSet(1);
aTempBitSet <<= aState;
maStates |= aTempBitSet;
}
inline void AccessibleStateSetHelperImpl::RemoveState(sal_Int16 aState)
throw (uno::RuntimeException)
{
DBG_ASSERT(aState < BITFIELDSIZE, "the statesset is too small");
sal_uInt64 aTempBitSet(1);
aTempBitSet <<= aState;
aTempBitSet = ~aTempBitSet;
maStates &= aTempBitSet;
}
inline sal_Bool AccessibleStateSetHelperImpl::Compare(
const AccessibleStateSetHelperImpl* pComparativeValue,
AccessibleStateSetHelperImpl* pOldStates,
AccessibleStateSetHelperImpl* pNewStates) const
throw (uno::RuntimeException)
{
sal_Bool bResult(sal_False);
if (pComparativeValue && pOldStates && pNewStates)
{
if (maStates == pComparativeValue->maStates)
bResult = sal_True;
else
{
sal_uInt64 aTempBitSet(maStates);
aTempBitSet ^= pComparativeValue->maStates;
pOldStates->maStates = aTempBitSet;
pOldStates->maStates &= maStates;
pNewStates->maStates = aTempBitSet;
pNewStates->maStates &= pComparativeValue->maStates;
}
}
return bResult;
}
//===== internal ============================================================
AccessibleStateSetHelper::AccessibleStateSetHelper ()
: mpHelperImpl(NULL)
{
mpHelperImpl = new AccessibleStateSetHelperImpl();
}
AccessibleStateSetHelper::AccessibleStateSetHelper ( const sal_Int64 _nInitialStates )
: mpHelperImpl(NULL)
{
mpHelperImpl = new AccessibleStateSetHelperImpl();
mpHelperImpl->AddStates( _nInitialStates );
}
AccessibleStateSetHelper::AccessibleStateSetHelper (const AccessibleStateSetHelper& rHelper)
: cppu::WeakImplHelper1<XAccessibleStateSet>()
, mpHelperImpl(NULL)
{
if (rHelper.mpHelperImpl)
mpHelperImpl = new AccessibleStateSetHelperImpl(*rHelper.mpHelperImpl);
else
mpHelperImpl = new AccessibleStateSetHelperImpl();
}
AccessibleStateSetHelper::~AccessibleStateSetHelper(void)
{
delete mpHelperImpl;
}
//===== XAccessibleStateSet ==============================================
/** Checks whether the current state set is empty.
@return
Returns <TRUE/> if there is no state in this state set and
<FALSE/> if there is at least one state set in it.
*/
sal_Bool SAL_CALL AccessibleStateSetHelper::isEmpty ()
throw (uno::RuntimeException)
{
osl::MutexGuard aGuard (maMutex);
return mpHelperImpl->IsEmpty();
}
/** Checks if the given state is a member of the state set of this
object.
@param aState
The state for which to check membership. This has to be one of
the constants of <type>AccessibleStateType</type>.
@return
Returns <TRUE/> if the given state is a memeber of this object's
state set and <FALSE/> otherwise.
*/
sal_Bool SAL_CALL AccessibleStateSetHelper::contains (sal_Int16 aState)
throw (uno::RuntimeException)
{
osl::MutexGuard aGuard (maMutex);
return mpHelperImpl->Contains(aState);
}
/** Checks if all of the given states are in this object's state
set.
@param aStateSet
This sequence of states is interpreted as set and every of its
members, duplicates are ignored, is checked for membership in
this object's state set. Each state has to be one of the
constants of <type>AccessibleStateType</type>.
@return
Returns <TRUE/> if all states of the given state set are members
of this object's state set. <FALSE/> is returned if at least
one of the states in the given state is not a member of this
object's state set.
*/
sal_Bool SAL_CALL AccessibleStateSetHelper::containsAll
(const uno::Sequence<sal_Int16>& rStateSet)
throw (uno::RuntimeException)
{
osl::MutexGuard aGuard (maMutex);
sal_Int32 nCount(rStateSet.getLength());
const sal_Int16* pStates = rStateSet.getConstArray();
sal_Int32 i = 0;
sal_Bool bFound(sal_True);
while (i < nCount)
{
bFound = mpHelperImpl->Contains(pStates[i]);
i++;
}
return bFound;
}
uno::Sequence<sal_Int16> SAL_CALL AccessibleStateSetHelper::getStates()
throw (uno::RuntimeException)
{
osl::MutexGuard aGuard(maMutex);
return mpHelperImpl->GetStates();
}
void AccessibleStateSetHelper::AddState(sal_Int16 aState)
throw (uno::RuntimeException)
{
osl::MutexGuard aGuard (maMutex);
mpHelperImpl->AddState(aState);
}
void AccessibleStateSetHelper::RemoveState(sal_Int16 aState)
throw (uno::RuntimeException)
{
osl::MutexGuard aGuard (maMutex);
mpHelperImpl->RemoveState(aState);
}
sal_Bool AccessibleStateSetHelper::Compare(
const AccessibleStateSetHelper& rComparativeValue,
AccessibleStateSetHelper& rOldStates,
AccessibleStateSetHelper& rNewStates)
throw (uno::RuntimeException)
{
osl::MutexGuard aGuard (maMutex);
return mpHelperImpl->Compare(rComparativeValue.mpHelperImpl,
rOldStates.mpHelperImpl, rNewStates.mpHelperImpl);
}
//===== XTypeProvider =======================================================
uno::Sequence< ::com::sun::star::uno::Type>
AccessibleStateSetHelper::getTypes (void)
throw (::com::sun::star::uno::RuntimeException)
{
const ::com::sun::star::uno::Type aTypeList[] = {
::getCppuType((const uno::Reference<
XAccessibleStateSet>*)0),
::getCppuType((const uno::Reference<
lang::XTypeProvider>*)0)
};
::com::sun::star::uno::Sequence< ::com::sun::star::uno::Type>
aTypeSequence (aTypeList, 2);
return aTypeSequence;
}
namespace
{
class theAccessibleStateSetHelperUnoTunnelId : public rtl::Static< UnoTunnelIdInit, theAccessibleStateSetHelperUnoTunnelId > {};
}
uno::Sequence<sal_Int8> SAL_CALL
AccessibleStateSetHelper::getImplementationId (void)
throw (::com::sun::star::uno::RuntimeException)
{
return theAccessibleStateSetHelperUnoTunnelId::get().getSeq();
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|