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
|
/* -*- 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 .
*/
#include <boost/unordered_set.hpp>
#include <rtl/strbuf.hxx>
#include <rtl/string.hxx>
// a buffer for unique strings
class StringContainer
{
boost::unordered_set< OString, OStringHash > m_aStrings;
public:
StringContainer() {}
~StringContainer() {}
const char* putString( const char* pString );
};
enum MODE_ENUM { MODE_MODELESS, MODE_APPLICATIONMODAL, MODE_SYSTEMMODAL };
enum JUSTIFY_ENUM { JUST_CENTER, JUST_RIGHT, JUST_LEFT };
enum SHOW_ENUM { SHOW_NORMAL, SHOW_MINIMIZED, SHOW_MAXIMIZED };
enum ENUMHEADER { HEADER_NAME, HEADER_NUMBER };
enum REF_ENUM { TYPE_NOTHING, TYPE_REF, TYPE_COPY };
struct RSCHEADER {
RscTop * pClass;
RscExpType nName1;
REF_ENUM nTyp;
RscTop * pRefClass;
RscExpType nName2;
};
/************** O b j e c t s t a c k ************************************/
struct Node
{
Node* pPrev;
RSCINST aInst;
sal_uInt32 nTupelRec; // Rekursionstiefe fuer Tupel
Node() { pPrev = NULL; nTupelRec = 0; }
};
class ObjectStack
{
private :
Node* pRoot;
public :
ObjectStack () { pRoot = NULL; }
const RSCINST & Top () { return pRoot->aInst; }
bool IsEmpty() { return( pRoot == NULL ); }
void IncTupelRec() { pRoot->nTupelRec++; }
void DecTupelRec() { pRoot->nTupelRec--; }
sal_uInt32 TupelRecCount() const { return pRoot->nTupelRec; }
void Push( RSCINST aInst )
{
Node* pTmp;
pTmp = pRoot;
pRoot = new Node;
pRoot->aInst = aInst;
pRoot->pPrev = pTmp;
}
void Pop()
{
Node* pTmp;
pTmp = pRoot;
pRoot = pTmp->pPrev;
delete pTmp;
}
};
/****************** F o r w a r d s **************************************/
#if defined ( SOLARIS )
extern "C" int yyparse(); // forward Deklaration fuer erzeugte Funktion
extern "C" void yyerror( const char * );
extern "C" int yylex( void );
#else
int yyparse(); // forward Deklaration fuer erzeugte Funktion
void yyerror( char * );
int yylex( void );
#endif
class RscTypCont;
class RscFileInst;
extern RscTypCont* pTC;
extern RscFileInst * pFI;
extern RscExpression * pExp;
extern ObjectStack S;
extern StringContainer* pStringContainer;
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
