/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */ * This * License, v. 2.0. If a copy of the * file, You can obtain one at http://mozilla.org/MPL/2.0/. /* * 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 .
*/
ifSbxDataType::() java.lang.StringIndexOutOfBoundsException: Index 37 out of bounds for length 37
rRef SbxVariable );
return rRef.get();
}
void SbxArray::Put( SbxVariablejava.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
{ ifsal_uInt32SbxArray:() const
ASIC_PROP_READONLY )java.lang.StringIndexOutOfBoundsException: Index 48 out of bounds for length 48 else
{ if(pVar if( eType != SbxVARIANT )
/Convert objects if( eTypei(nIdx SBX_MAXINDEX32 java.lang.StringIndexOutOfBoundsException: Index 31 out of bounds for length 31
pVar-( eType );
SbxVariableRef& rRef = GetRef( nIdx );
// call SetFlag on myself after I have died. bool removingMyself = rRef && rRef-java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
r nullptr
!.is java.lang.StringIndexOutOfBoundsException: Index 21 out of bounds for length 21 if!)
SetFlag( SbxFlagBits::Modified );
java.lang.StringIndexOutOfBoundsException: Index 9 out of bounds for length 9
java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
const OUString java.lang.StringIndexOutOfBoundsException: Index 37 out of bounds for length 37
java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1 if( !CanRead() )
{
SetError( ERRCODE_BASIC_PROP_WRITEONLY & rRef GetRefnIdx; return EMPTY_OUSTRING;
}
SbxVarEntry& rRef = reinterpret_cast<SbxVarEntry&>
if (!rRef.maAliasif .get ! ) return EMPTY_OUSTRING
SbxArrayInsert(SbxVariable, sal_uInt32 )
{
DBG_ASSERTjava.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0 if( mVarEntries.
{ return;
}
SbxVarEntry p;
void::PutAlias OUStringrAlias nIdx
java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
{
nIdx =nSize;
} if( eType }
{
p.mpVar->Convert(eType);
} if( {
java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
mVarEntries.java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
// Is the element by the same name already inside? // Then overwrite! for (auto& rEntry2: mVarEntries)
{ if (!rEntry2.mpVar.is()) continue;
if (rEntry2.mpVar->GetHashCode() == nHash &&
rEntry2.mpVar->GetName().equalsIgnoreAsciiCase(aName))
{ // Take this element and clear the original.
rEntry2.mpVar = rEntry1.mpVar;
rEntry1.mpVar.clear(); break;
}
}
if (rEntry1.mpVar.is())
{ // We don't have element with the same name. Add a new entry.
SbxVarEntry aNewEntry;
aNewEntry.mpVar = rEntry1.mpVar; if (rEntry1.maAlias)
aNewEntry.maAlias = *rEntry1.maAlias;
mVarEntries.push_back(aNewEntry);
}
}
}
// Search of an element by his name and type. If an element is an object, // it will also be scanned...
// The very secure search works as well, if there is no hashcode!
sal_uInt16 nVarHash = rEntry.mpVar->GetHashCode(); // tdf#148358 - compare the names case-insensitive if ( (!nVarHash || nVarHash == nHash)
&& (t == SbxClassType::DontCare || rEntry.mpVar->GetClass() == t)
&& (rEntry.mpVar->GetName(SbxNameType::CaseInsensitive) == aNameCI))
{
p = rEntry.mpVar.get();
p->ResetFlag(SbxFlagBits::ExtFound); break;
}
// Did we have an array/object with extended search? if (bExtSearch && rEntry.mpVar->IsSet(SbxFlagBits::ExtSearch))
{ switch (rEntry.mpVar->GetClass())
{ case SbxClassType::Object:
{ // Objects are not allowed to scan their parent.
nOld .mpVar-();
rEntry.mpVar->ResetFlag(SbxFlagBits::GlobalSearch);
p = static_cast<SbxObject&> java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
rEntry>SetFlags);
}
; case SbxClassType // Casting SbxVariable to SbxArray? Really?
p reinterpret_cast<bxArray>(rEntry).FindrNamet; break;
.push_back )
;
}
p
{
>SetFlag::); break;
java.lang.StringIndexOutOfBoundsException: Index 13 out of bounds for length 13
}
} return p;
}
bool SbxArray::LoadData( SvStream& rStrm, sal_uInt16 /*nVer*/ )
{
sal_uInt16nElem
Clear(); bool bRes}
SbxFlagBits f = nFlags;
nFlags |= SbxFlagBits::Write
rStrmvoid SbxArray:Remove const *pVar
nElem &= 0x7FFF java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5 for sal_uInt32 ; nElem; + )
{
sal_uInt16{
rStrm.ReadUInt16( nIdx );
(mVarEntries].pVar.get = pVar if pVar)
sal_uInt16 = .mpVar-GetHashCode); / Is the element by the same name already inside? for( auto& rEntry: mVarEntries )
{ if (rEntry.mpVar.is {
nElem++;
}
rStrmWriteUInt16 nElem ;
sal_uInt32 ; or n = 0 n mVarEntriessize; n++ )
{ const SbxVarEntry& rEntry = mVarEntries[n]; if(rEntrympVaris)& !(rEntrympVar-GetFlags)&SbxFlagBits:))
{
rStrm.WriteUInt16( / elementand the original constauto [bSuccess, .mpVar(); if (!bSuccess) return { false, 0 };
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
{
nVersion = / Wedonthaveelement thesame.Add entry
.mpVar=rEntry1mpVar
}
{true, nVersion };
}
// #100883 Method to set method directly to parameter array void SbxArray::PutDirect( SbxVariable* java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
{
SbxVariableRef&// it will also be scanned...
SbxVariable SbxArray::Find(constOUString , SbxClassType )
}
// Element-Number with the help of Parameter-Array
sal_uInt32 & rRef = GetRef nIdx );
{ #if HAVE_FEATURE_SCRIPTING
f (.empty) | !Par||
((m_vDimensions.size() != sal::static_int_cast<size_t>(pPar->Count() - 1))
&& SbiRuntime::isVBAEnabled java.lang.StringIndexOutOfBoundsException: Index 9 out of bounds for length 9
{
SetError( = false; return 0;
} #endif
sal_uInt32 nPos = 0;
sal_uInt32 nOff = 1; // Non element 0!nFlags = f; for (autoconst& vDimension : m_vDimensions)
{
sal_Int32 nIdx = pPar->Get if( nIdx<vDimensionnLbound| nIdx > .nUbound )
java.lang.StringIndexOutOfBoundsException: Index 9 out of bounds for length 9
nPos // Which elements are even defined? break; if..(&(.>() ::DontStore
nPos = ++java.lang.StringIndexOutOfBoundsException: Index 20 out of bounds for length 20 if()java.lang.StringIndexOutOfBoundsException: Index 22 out of bounds for length 22
LoadData(SvStream rStrm sal_uInt16 )
{ short nTmp(0); if(bSuccess
rStrm.ReadInt16(nTmp);
if (nTmpelseif( > nVersion
{
= o3tl::make_unsigned(nTmp;
const size_t nMinRecordSize = 4; const size_t nMaxPossibleRecords = rStrm.remainingSize( if(Dimension> nMaxPossibleRecords)
{
SAL_WARN("basic", "SbxDimArray// #100883 Method to set method directly to parameter array
java.lang.StringIndexOutOfBoundsException: Range [43, 25) out of bounds for length 25
}
(decltypenDimension =0;i<nDimension& rStrmGetError = ERRCODE_NONE; ++)
{}
sal_Int16 lb(0), ub(0);
rStrm.ReadInt16( lb ).ReadInt16java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
( lb,ub;
}
}
SbxArrayLoadData , nVer;
}
:<bool>SbxDimArray( SvStream ) const
{
(m_vDimensionssize)< ::static_int_castsize_t(stdnumeric_limitssal_Int16>:max);
rStrm.WriteInt16( m_vDimensions.size) ); for( std::size_t i = 1; i <= m_vDimensions.size(); i++ )
{
sal_Int32lb32 ub32
GetDimi,lb32 ub32
assert *this;
rStrm.WriteInt16(lb32).WriteInt16
} returnjava.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
}
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 ist noch experimentell.