*/
#include "BigUnsignedInABase.hh"
+#include <iostream>
namespace {
unsigned int bitLen(unsigned int x) {
return (a + b - 1) / b;
}
}
-
+ /*std::cout << "((( BigUnsigned ==> BigUnsignedInABase\n";
+ std::cout << "[ Parameter BigUnsigned @ " << (void *)(NumberlikeArray<BigUnsigned::Blk> *)(&x)
+ << ",\nresulting BigUnsignedInABase @ " << (void *)(NumberlikeArray<Digit> *)(this) << "]" << std::endl;*/
BigUnsignedInABase::BigUnsignedInABase(const BigUnsigned &x, Base base) {
// Check the base
// Save the actual length.
len = digitNum;
+ /*std::cout << "BigUnsigned ==> BigUnsignedInABase )))\n";*/
}
BigUnsignedInABase::operator BigUnsigned() const {
// This pattern is seldom seen in C++, but the analogous ``this.'' is common in Java.
this->base = base;
- // `s.length()' is a `size_t', while `len' is a `NumberlikeArray::Index',
- // also known as an `unsigned int'. Some compilers warn without this cast.
- len = Index(s.length());
+ len = s.length();
allocate(len);
Index digitNum, symbolNumInString;
}
BigUnsignedInABase::operator std::string() const {
+ //std::cout << "((( BigUnsignedInABase ==> std::string\n";
if (base > 36)
throw "BigUnsignedInABase ==> std::string: The default string conversion routines use the symbol set 0-9, A-Z and therefore support only up to base 36. You tried a conversion with a base over 36; write your own string conversion routine.";
if (len == 0)
}
std::string s2(s);
delete s;
+ //std::cout << "BigUnsignedInABase ==> std::string )))\n";
return s2;
}
* NumberlikeArray< whatever >::getLength;
*/
+/*debug*/
+#include <iostream>
+
template <class Blk>
class NumberlikeArray {
public:
// FIELDS
Index cap; // The current allocated capacity of this NumberlikeArray (in blocks)
Index len; // The actual length of the value stored in this NumberlikeArray (in blocks)
- Blk *blk; // Dynamically allocated array of the blocks
+ Blk *blk2; // Dynamically allocated array of the blocks
+
+ static Blk x; // trash that [] can return for out-of-range requests
+
+ void dump() const {
+ std::cout << "Dumping NumberlikeArray @ " << (void *)(this) << '\n';
+ std::cout << "Length " << (len) << ", capacity " << (cap) << '\n';
+ for (unsigned int i = 0; i < len; i++) {
+ std::cout << "Block " << i << ":" << blk2[i] << '\n';
+ }
+ }
+
+ struct BoundsCheckingBlk {
+ const NumberlikeArray *na;
+ BoundsCheckingBlk(NumberlikeArray *na) {
+ this->na = na;
+ }
+ Blk & operator [](Index index) const {
+ if (index >= na->len) {
+ std::cout << "== Out-of-bounds access to block " << index << ". Affected NumberlikeArray: ==\n";
+ na->dump();
+ std::cout << "== End of dump. ==" << std::endl;
+ return x;
+ } else
+ return na->blk2[index];
+ } // dangerous because it allows ``always writable'', but OK for now
+ /*const Blk & operator [](Index index) const {
+ if (index >= na->len)
+ std::cout << "OUT OF BOUNDS! Length " << (na->len) << ", accessed " << index << std::endl;
+ else
+ return na->blk[index];
+ }*/
+ /*operator Blk * () {
+ return na->blk2;
+ }*/
+ };
+
+ BoundsCheckingBlk blk;
/*
* Change made on 2005.01.06:
*/
// MANAGEMENT
- NumberlikeArray(Index c) : cap(c), len(0) { // Creates a NumberlikeArray with a capacity
- blk = (cap > 0) ? (new Blk[cap]) : NULL;
+ NumberlikeArray(Index c) : cap(c), len(0), blk(this) { // Creates a NumberlikeArray with a capacity
+ blk2 = (cap > 0) ? (new Blk[cap]) : NULL;
}
void allocate(Index c); // Ensures the array has at least the indicated capacity, maybe discarding contents
void allocateAndCopy(Index c); // Ensures the array has at least the indicated capacity, preserving its contents
* created a real `new'-allocated zero-length array. This array would then be lost,
* causing a small but annoying memory leak.
*/
- NumberlikeArray() : cap(0), len(0) {
- blk = NULL;
+ NumberlikeArray() : cap(0), len(0), blk(this) {
+ blk2 = NULL;
}
NumberlikeArray(const NumberlikeArray<Blk> &x); // Copy constructor
void operator=(const NumberlikeArray<Blk> &x); // Assignment operator
NumberlikeArray(const Blk *b, Index l); // Constructor from an array of blocks
~NumberlikeArray() { // Destructor
- delete [] blk; // Does nothing and causes no error if `blk' is null.
+ delete [] blk2; // Does nothing and causes no error if `blk' is null.
}
// PICKING APART
* so other files including NumberlikeArray will be able to generate real definitions.
*/
+template <class Blk>
+Blk NumberlikeArray<Blk>::x = 0;
+
template <class Blk>
const unsigned int NumberlikeArray<Blk>::N = 8 * sizeof(Blk);
// If the requested capacity is more than the current capacity...
if (c > cap) {
// Delete the old number array
- delete [] blk;
+ delete [] blk2;
// Allocate the new array
cap = c;
- blk = new Blk[cap];
+ blk2 = new Blk[cap];
}
}
void NumberlikeArray<Blk>::allocateAndCopy(Index c) {
// If the requested capacity is more than the current capacity...
if (c > cap) {
- Blk *oldBlk = blk;
+ Blk *oldBlk = blk2;
// Allocate the new number array
cap = c;
- blk = new Blk[cap];
+ blk2 = new Blk[cap];
// Copy number blocks
Index i;
for (i = 0; i < len; i++)
// Copy constructor
template <class Blk>
-NumberlikeArray<Blk>::NumberlikeArray(const NumberlikeArray<Blk> &x) : len(x.len) {
+NumberlikeArray<Blk>::NumberlikeArray(const NumberlikeArray<Blk> &x) : len(x.len), blk(this) {
// Create array
cap = len;
- blk = new Blk[cap];
+ blk2 = new Blk[cap];
// Copy blocks
Index i;
for (i = 0; i < len; i++)
// Constructor from an array of blocks
template <class Blk>
-NumberlikeArray<Blk>::NumberlikeArray(const Blk *b, Index l) : cap(l), len(l) {
+NumberlikeArray<Blk>::NumberlikeArray(const Blk *b, Index l) : cap(l), len(l), blk(this) {
// Create array
- blk = new Blk[cap];
+ blk2 = new Blk[cap];
// Copy blocks
Index i;
for (i = 0; i < len; i++)
BigInteger c(a); // Copy a BigInteger.
+ std::cout << "here 0" << std::endl;
+
BigInteger d(-314159265); // c is -314159265. The `int' literal is converted to a BigInteger.
// Ahem: that's too big to be an `int' literal (or even a `long' literal)!
// Disillusion yourself now -- this won't compile.
//BigInteger e(3141592653589793238462643383279);
+ std::cout << "here 1" << std::endl;
+
std::string s("3141592653589793238462643383279");
BigInteger f = easyStringToBI(s);
// Ah. The string is converted to a BigInteger, and strings can be as long as you want.
+ std::cout << "here 2" << std::endl;
+
std::string s2 = easyBItoString(f); // You can convert the other way too.
+ std::cout << "here 3" << std::endl;
+
std::cout << f << std::endl; // f is stringified and send to std::cout.
+ std::cout << "here 4" << std::endl;
+
/*
* Let's do some math!
*
std::cout << (g + h) << '\n' << (g - h) << '\n' << (g * h)
<< '\n' << (g / h) << '\n' << (g % h) << std::endl;
+ std::cout << "here 5" << std::endl;
+
BigInteger i(5), j(10), k;
// These two lines do the same thing: k is set to a BigInteger containing 15.
k = i + j;
k.add(i, j);
+ std::cout << "here 6" << std::endl;
+
// Let's do some heavy lifting.
std::cout << "Powers of 3" << std::endl;
std::cout << "How many do you want?" << std::endl;
Matt McCutchen's Web Site / bigint / bigint.git / commitdiff