xref: /trunk/main/autodoc/source/parser_i/tokens/stmstar2.cxx (revision cdf0e10c4e3984b49a9502b011690b615761d4a3)
1*cdf0e10cSrcweir /*************************************************************************
2*cdf0e10cSrcweir  *
3*cdf0e10cSrcweir  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4*cdf0e10cSrcweir  *
5*cdf0e10cSrcweir  * Copyright 2000, 2010 Oracle and/or its affiliates.
6*cdf0e10cSrcweir  *
7*cdf0e10cSrcweir  * OpenOffice.org - a multi-platform office productivity suite
8*cdf0e10cSrcweir  *
9*cdf0e10cSrcweir  * This file is part of OpenOffice.org.
10*cdf0e10cSrcweir  *
11*cdf0e10cSrcweir  * OpenOffice.org is free software: you can redistribute it and/or modify
12*cdf0e10cSrcweir  * it under the terms of the GNU Lesser General Public License version 3
13*cdf0e10cSrcweir  * only, as published by the Free Software Foundation.
14*cdf0e10cSrcweir  *
15*cdf0e10cSrcweir  * OpenOffice.org is distributed in the hope that it will be useful,
16*cdf0e10cSrcweir  * but WITHOUT ANY WARRANTY; without even the implied warranty of
17*cdf0e10cSrcweir  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
18*cdf0e10cSrcweir  * GNU Lesser General Public License version 3 for more details
19*cdf0e10cSrcweir  * (a copy is included in the LICENSE file that accompanied this code).
20*cdf0e10cSrcweir  *
21*cdf0e10cSrcweir  * You should have received a copy of the GNU Lesser General Public License
22*cdf0e10cSrcweir  * version 3 along with OpenOffice.org.  If not, see
23*cdf0e10cSrcweir  * <http://www.openoffice.org/license.html>
24*cdf0e10cSrcweir  * for a copy of the LGPLv3 License.
25*cdf0e10cSrcweir  *
26*cdf0e10cSrcweir  ************************************************************************/
27*cdf0e10cSrcweir 
28*cdf0e10cSrcweir #include <precomp.h>
29*cdf0e10cSrcweir #include <tokens/stmstar2.hxx>
30*cdf0e10cSrcweir 
31*cdf0e10cSrcweir 
32*cdf0e10cSrcweir // NOT FULLY DECLARED SERVICES
33*cdf0e10cSrcweir #include <x_parse2.hxx>
34*cdf0e10cSrcweir 
35*cdf0e10cSrcweir 
36*cdf0e10cSrcweir 
37*cdf0e10cSrcweir StmArrayStatu2::StmArrayStatu2( intt            i_nStatusSize,
38*cdf0e10cSrcweir                                 const INT16 *   in_aArrayModel,
39*cdf0e10cSrcweir                                 uintt           i_nTokenId,
40*cdf0e10cSrcweir                                 bool            in_bIsDefault )
41*cdf0e10cSrcweir     :   dpBranches(new StmStatu2::Branch[i_nStatusSize]),
42*cdf0e10cSrcweir         nNrOfBranches(i_nStatusSize),
43*cdf0e10cSrcweir         nTokenId(UINT16(i_nTokenId)),
44*cdf0e10cSrcweir         bIsADefault(in_bIsDefault)
45*cdf0e10cSrcweir {
46*cdf0e10cSrcweir     // KORR_FUTURE: Interface of StmArrayStatu2() has to be changed.
47*cdf0e10cSrcweir     csv_assert(i_nTokenId < 64536);
48*cdf0e10cSrcweir 
49*cdf0e10cSrcweir     if (in_aArrayModel != 0)
50*cdf0e10cSrcweir     {
51*cdf0e10cSrcweir         intt count = 0;
52*cdf0e10cSrcweir         for (const INT16 * get = in_aArrayModel; count < nNrOfBranches; count++, get++)
53*cdf0e10cSrcweir             dpBranches[count] = *get;
54*cdf0e10cSrcweir     }
55*cdf0e10cSrcweir     else //
56*cdf0e10cSrcweir     {
57*cdf0e10cSrcweir         memset(dpBranches, 0, nNrOfBranches);
58*cdf0e10cSrcweir     }  // endif
59*cdf0e10cSrcweir }
60*cdf0e10cSrcweir 
61*cdf0e10cSrcweir StmArrayStatu2::~StmArrayStatu2()
62*cdf0e10cSrcweir {
63*cdf0e10cSrcweir     delete [] dpBranches;
64*cdf0e10cSrcweir }
65*cdf0e10cSrcweir 
66*cdf0e10cSrcweir bool
67*cdf0e10cSrcweir StmArrayStatu2::SetBranch( intt              in_nBranchIx,
68*cdf0e10cSrcweir                            StmStatu2::Branch in_nBranch )
69*cdf0e10cSrcweir {
70*cdf0e10cSrcweir     if ( csv::in_range(intt(0), in_nBranchIx, intt(nNrOfBranches) ) )
71*cdf0e10cSrcweir     {
72*cdf0e10cSrcweir         dpBranches[in_nBranchIx] = in_nBranch;
73*cdf0e10cSrcweir         return true;
74*cdf0e10cSrcweir     }
75*cdf0e10cSrcweir     return false;
76*cdf0e10cSrcweir }
77*cdf0e10cSrcweir 
78*cdf0e10cSrcweir 
79*cdf0e10cSrcweir StmStatu2::Branch
80*cdf0e10cSrcweir StmArrayStatu2::NextBy(intt in_nIndex) const
81*cdf0e10cSrcweir {
82*cdf0e10cSrcweir     if (in_nIndex < 0)
83*cdf0e10cSrcweir         throw X_AutodocParser(X_AutodocParser::x_InvalidChar);
84*cdf0e10cSrcweir 
85*cdf0e10cSrcweir     return in_nIndex < nNrOfBranches
86*cdf0e10cSrcweir                 ?   dpBranches[in_nIndex]
87*cdf0e10cSrcweir                 :   dpBranches[nNrOfBranches - 1];
88*cdf0e10cSrcweir }
89*cdf0e10cSrcweir 
90*cdf0e10cSrcweir 
91*cdf0e10cSrcweir bool
92*cdf0e10cSrcweir StmArrayStatu2::IsADefault() const
93*cdf0e10cSrcweir {
94*cdf0e10cSrcweir     return bIsADefault;
95*cdf0e10cSrcweir }
96*cdf0e10cSrcweir 
97*cdf0e10cSrcweir StmArrayStatu2 *
98*cdf0e10cSrcweir StmArrayStatu2::AsArray()
99*cdf0e10cSrcweir {
100*cdf0e10cSrcweir     return this;
101*cdf0e10cSrcweir }
102*cdf0e10cSrcweir 
103