office-gobmx/autodoc/source/parser/tokens/tkpstama.cxx
Vladimir Glazounov fd0ef8e6be INTEGRATION: CWS adc17 (1.6.18); FILE MERGED
2007/08/31 14:45:36 np 1.6.18.1: #i80569# remove wrong pchs.
2007-09-18 13:22:15 +00:00

216 lines
5.8 KiB
C++

/*************************************************************************
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: tkpstama.cxx,v $
*
* $Revision: 1.7 $
*
* last change: $Author: vg $ $Date: 2007-09-18 14:17:57 $
*
* The Contents of this file are made available subject to
* the terms of GNU Lesser General Public License Version 2.1.
*
*
* GNU Lesser General Public License Version 2.1
* =============================================
* Copyright 2005 by Sun Microsystems, Inc.
* 901 San Antonio Road, Palo Alto, CA 94303, USA
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software Foundation.
*
* This library 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 for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston,
* MA 02111-1307 USA
*
************************************************************************/
#include <precomp.h>
#include <tokens/tkpstama.hxx>
// NOT FULLY DECLARED SERVICES
// #include <srcfind.hxx>
#include <tokens/stmstarr.hxx>
//#include <parseinc.hxx>
#include <tools/tkpchars.hxx>
const intt C_nStatuslistResizeValue = 32;
const intt C_nTopStatus = 0;
StateMachine::StateMachine( intt in_nStatusSize,
intt in_nInitial_StatusListSize )
: pStati(new StmStatus*[in_nInitial_StatusListSize]),
nCurrentStatus(C_nTopStatus),
nPeekedStatus(C_nTopStatus),
nStatusSize(in_nStatusSize),
nNrofStati(0),
nStatiSpace(in_nInitial_StatusListSize)
{
precond(in_nStatusSize > 0);
precond(in_nInitial_StatusListSize > 0);
memset(pStati, 0, sizeof(StmStatus*) * nStatiSpace);
}
intt
StateMachine::AddStatus(StmStatus * let_dpStatus)
{
if (nNrofStati == nStatiSpace)
{
ResizeStati();
}
pStati[nNrofStati] = let_dpStatus;
return nNrofStati++;
}
void
StateMachine::AddToken( const char * in_sToken,
TextToken::F_CRTOK in_fTokenCreateFunction,
const INT16 * in_aBranches,
INT16 in_nBoundsStatus )
{
if (csv::no_str(in_sToken))
return;
// Durch existierende Stati durchhangeln:
nCurrentStatus = 0;
nPeekedStatus = 0;
for ( const char * pChar = in_sToken;
*pChar != NULCH;
++pChar )
{
Peek(*pChar);
StmStatus & rPst = Status(nPeekedStatus);
if ( rPst.IsADefault() OR rPst.AsBounds() != 0 )
{
nPeekedStatus = AddStatus( new StmArrayStatus(nStatusSize, in_aBranches, 0, false ) );
CurrentStatus().SetBranch( *pChar, nPeekedStatus );
}
nCurrentStatus = nPeekedStatus;
} // end for
StmArrayStatus & rLastStatus = CurrentStatus();
rLastStatus.SetTokenCreateFunction(in_fTokenCreateFunction);
for (intt i = 0; i < nStatusSize; i++)
{
if (Status(rLastStatus.NextBy(i)).AsBounds() != 0)
rLastStatus.SetBranch(i,in_nBoundsStatus);
} // end for
}
StateMachine::~StateMachine()
{
for (intt i = 0; i < nNrofStati; i++)
{
delete pStati[i];
}
delete [] pStati;
}
StmBoundsStatus &
StateMachine::GetCharChain( TextToken::F_CRTOK & o_nTokenCreateFunction,
CharacterSource & io_rText )
{
nCurrentStatus = C_nTopStatus;
Peek(io_rText.CurChar());
while (BoundsStatus() == 0)
{
nCurrentStatus = nPeekedStatus;
Peek(io_rText.MoveOn());
}
o_nTokenCreateFunction = CurrentStatus().TokenCreateFunction();
return *BoundsStatus();
}
void
StateMachine::ResizeStati()
{
intt nNewSize = nStatiSpace + C_nStatuslistResizeValue;
intt i = 0;
StatusList pNewStati = new StmStatus*[nNewSize];
for ( ; i < nNrofStati; i++)
{
pNewStati[i] = pStati[i];
}
memset( pNewStati+i,
0,
(nNewSize-i) * sizeof(StmStatus*) );
delete [] pStati;
pStati = pNewStati;
nStatiSpace = nNewSize;
}
StmStatus &
StateMachine::Status(intt in_nStatusNr) const
{
csv_assert( csv::in_range(intt(0), in_nStatusNr, intt(nNrofStati)) );
return *pStati[in_nStatusNr];
}
StmArrayStatus &
StateMachine::CurrentStatus() const
{
StmArrayStatus * pCurSt = Status(nCurrentStatus).AsArray();
csv_assert(pCurSt != 0);
// if(pCurSt == 0)
// csv_assert(false);
return *pCurSt;
}
StmBoundsStatus *
StateMachine::BoundsStatus() const
{
return Status(nPeekedStatus).AsBounds();
}
void
StateMachine::Peek(intt in_nBranch)
{
StmArrayStatus & rSt = CurrentStatus();
nPeekedStatus = rSt.NextBy(in_nBranch);
}
void
StateMachine::PrintOut()
{
const intt anzahl = nNrofStati;
for (int i = 0; i < anzahl; i++)
{
Cout() << i << ':';
StmArrayStatus * pArrSt = pStati[i]->AsArray();
if (pArrSt != 0)
{
Cout() << Endl();
for (int b = 0; b < 128; b++)
{
Cout().width(4);
Cout() << pArrSt->NextBy(b);
if (b%16 == 15)
Cout() << Endl();
}
}
else if (pStati[i]->AsBounds() != 0)
{
Cout() << "Bounds ";
}
else
Cout() << "Error! ";
Cout() << (pStati[i]->IsADefault() ? "DEF" : "---")
<< Endl();
} // for
}