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
|
/* -*- 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 .
*/
#ifndef INCLUDED_TOOLS_BIGINT_HXX
#define INCLUDED_TOOLS_BIGINT_HXX
#include <climits>
#include <rtl/ustring.hxx>
#include <tools/toolsdllapi.h>
#include <tools/solar.h>
class SvStream;
#define MAX_DIGITS 8
class Fraction;
class SAL_WARN_UNUSED TOOLS_DLLPUBLIC BigInt
{
private:
long nVal;
unsigned short nNum[MAX_DIGITS];
sal_uInt8 nLen : 5; // current length
bool bIsNeg : 1, // Is Sign negative?
bIsBig : 1, // sal_True == BigInt
bIsSet : 1; // Not "Null" (not "not 0")
TOOLS_DLLPRIVATE void MakeBigInt(BigInt const &);
TOOLS_DLLPRIVATE void Normalize();
TOOLS_DLLPRIVATE void Mult(BigInt const &, sal_uInt16);
TOOLS_DLLPRIVATE void Div(sal_uInt16, sal_uInt16 &);
TOOLS_DLLPRIVATE bool IsLess(BigInt const &) const;
TOOLS_DLLPRIVATE void AddLong(BigInt &, BigInt &);
TOOLS_DLLPRIVATE void SubLong(BigInt &, BigInt &);
TOOLS_DLLPRIVATE void MultLong(BigInt const &, BigInt &) const;
TOOLS_DLLPRIVATE void DivLong(BigInt const &, BigInt &) const;
TOOLS_DLLPRIVATE void ModLong(BigInt const &, BigInt &) const;
TOOLS_DLLPRIVATE bool ABS_IsLess(BigInt const &) const;
public:
BigInt()
: nVal(0)
, nLen(0)
, bIsNeg(false)
, bIsBig(false)
, bIsSet(false)
{
}
BigInt(short nValue)
: nVal(nValue)
, nLen(0)
, bIsNeg(false)
, bIsBig(false)
, bIsSet(true)
{
}
BigInt(long nValue)
: nVal(nValue)
, nLen(0)
, bIsNeg(false)
, bIsBig(false)
, bIsSet(true)
{
}
BigInt(int nValue)
: nVal(nValue)
, nLen(0)
, bIsNeg(false)
, bIsBig(false)
, bIsSet(true)
{
}
BigInt( double nVal );
BigInt(sal_uInt16 nValue)
: nVal(nValue)
, nLen(0)
, bIsNeg(false)
, bIsBig(false)
, bIsSet(true)
{
}
BigInt( sal_uInt32 nVal );
#if SAL_TYPES_SIZEOFLONG < SAL_TYPES_SIZEOFLONGLONG
BigInt( long long nVal );
#endif
BigInt( const BigInt& rBigInt );
BigInt( const OUString& rString );
operator short() const;
operator long() const;
operator int() const;
operator double() const;
operator sal_uInt16() const;
operator sal_uIntPtr() const;
bool IsSet() const { return bIsSet; }
bool IsNeg() const;
bool IsZero() const;
bool IsLong() const { return !bIsBig; }
void Abs();
BigInt& operator =( const BigInt& rVal );
BigInt& operator +=( const BigInt& rVal );
BigInt& operator -=( const BigInt& rVal );
BigInt& operator *=( const BigInt& rVal );
BigInt& operator /=( const BigInt& rVal );
BigInt& operator %=( const BigInt& rVal );
BigInt& operator =( const short nValue );
BigInt& operator =( const long nValue );
BigInt& operator =( const int nValue );
BigInt& operator =( const sal_uInt16 nValue );
friend inline BigInt operator +( const BigInt& rVal1, const BigInt& rVal2 );
friend inline BigInt operator -( const BigInt& rVal1, const BigInt& rVal2 );
friend inline BigInt operator *( const BigInt& rVal1, const BigInt& rVal2 );
friend inline BigInt operator /( const BigInt& rVal1, const BigInt& rVal2 );
friend inline BigInt operator %( const BigInt& rVal1, const BigInt& rVal2 );
TOOLS_DLLPUBLIC friend bool operator==( const BigInt& rVal1, const BigInt& rVal2 );
friend inline bool operator!=( const BigInt& rVal1, const BigInt& rVal2 );
TOOLS_DLLPUBLIC friend bool operator< ( const BigInt& rVal1, const BigInt& rVal2 );
TOOLS_DLLPUBLIC friend bool operator> ( const BigInt& rVal1, const BigInt& rVal2 );
friend inline bool operator<=( const BigInt& rVal1, const BigInt& rVal2 );
friend inline bool operator>=( const BigInt& rVal1, const BigInt& rVal2 );
friend class Fraction;
};
inline BigInt::operator short() const
{
if ( !bIsBig && nVal >= SHRT_MIN && nVal <= SHRT_MAX )
return (short)nVal;
else
return 0;
}
inline BigInt::operator long() const
{
if ( !bIsBig )
return nVal;
else
return 0;
}
inline BigInt::operator int() const
{
if ( !bIsBig && (nVal == (long)(int)nVal) )
return (int)nVal;
else
return 0;
}
inline BigInt::operator sal_uInt16() const
{
if ( !bIsBig && nVal >= 0 && nVal <= (long)USHRT_MAX )
return (sal_uInt16)nVal;
else
return 0;
}
inline BigInt& BigInt::operator =( const short nValue )
{
bIsSet = true;
bIsBig = false;
nVal = nValue;
return *this;
}
inline BigInt& BigInt::operator =( const long nValue )
{
bIsSet = true;
bIsBig = false;
nVal = nValue;
return *this;
}
inline BigInt& BigInt::operator =( const int nValue )
{
bIsSet = true;
bIsBig = false;
nVal = nValue;
return *this;
}
inline BigInt& BigInt::operator =( const sal_uInt16 nValue )
{
bIsSet = true;
bIsBig = false;
nVal = nValue;
return *this;
}
inline bool BigInt::IsNeg() const
{
if ( !bIsBig )
return (nVal < 0);
else
return (bool)bIsNeg;
}
inline bool BigInt::IsZero() const
{
if ( bIsBig )
return false;
else
return (nVal == 0);
}
inline void BigInt::Abs()
{
if ( bIsBig )
bIsNeg = false;
else if ( nVal < 0 )
nVal = -nVal;
}
inline BigInt operator+( const BigInt &rVal1, const BigInt &rVal2 )
{
BigInt aErg( rVal1 );
aErg += rVal2;
return aErg;
}
inline BigInt operator-( const BigInt &rVal1, const BigInt &rVal2 )
{
BigInt aErg( rVal1 );
aErg -= rVal2;
return aErg;
}
inline BigInt operator*( const BigInt &rVal1, const BigInt &rVal2 )
{
BigInt aErg( rVal1 );
aErg *= rVal2;
return aErg;
}
inline BigInt operator/( const BigInt &rVal1, const BigInt &rVal2 )
{
BigInt aErg( rVal1 );
aErg /= rVal2;
return aErg;
}
inline BigInt operator%( const BigInt &rVal1, const BigInt &rVal2 )
{
BigInt aErg( rVal1 );
aErg %= rVal2;
return aErg;
}
inline bool operator!=( const BigInt& rVal1, const BigInt& rVal2 )
{
return !(rVal1 == rVal2);
}
inline bool operator<=( const BigInt& rVal1, const BigInt& rVal2 )
{
return !( rVal1 > rVal2);
}
inline bool operator>=( const BigInt& rVal1, const BigInt& rVal2 )
{
return !(rVal1 < rVal2);
}
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
