biginteger.c

   1 /* Copyright (c) 2008 Jérémie Laval, Marine Jourdain
   2
   3  * Permission is hereby granted, free of charge, to any person obtaining a copy
   4  * of this software and associated documentation files (the "Software"), to deal
   5  * in the Software without restriction, including without limitation the rights
   6  * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
   7  * copies of the Software, and to permit persons to whom the Software is
   8  * furnished to do so, subject to the following conditions:
   9
  10  * The above copyright notice and this permission notice shall be included in
  11  * all copies or substantial portions of the Software.
  12
  13  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  14  * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  15  * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  16  * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  17  * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  18  * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  19  * THE SOFTWARE.
  20  *
  21  */
  22
  23 #include <stdio.h>
  24 #include <stdlib.h>
  25 #include <math.h>
  26 #include <string.h>
  27
  28 #include "biginteger.h"
  29
  30 // Private Function Impl
  31
  32 #define ATOUI(str) ((unsigned int)strtoul(buffer, NULL, 10))
  33
  34 BigInteger CreateZeroBigInt()
  35 {
  36   BigInteger temp;
  37   temp.Sign = Undefined;
  38   temp.AbsValStart = NULL;
  39   temp.AbsValEnd = NULL;
  40   temp.Count = 0;
  41
  42   return temp;
  43 }
  44
  45 BigUnsignedInteger* InitBUint(unsigned int value)
  46 {
  47   BigUnsignedInteger* bigUint = malloc(sizeof(BigUnsignedInteger));
  48   bigUint->Value = value;
  49
  50   return bigUint;
  51 }
  52
  53 void PrependNode(BigUnsignedInteger* b1, BigUnsignedInteger* b2)
  54 {
  55   b1->Next = b2;
  56   b2->Previous = b1;
  57 }
  58
  59 // Used to push_front a value
  60 void PushFrontNode(BigInteger* bigInt, unsigned int value)
  61 {
  62   BigUnsignedInteger* bigUint = InitBUint(value);
  63
  64   // Do the magic swapping
  65   if (bigInt->AbsValStart != NULL)
  66         PrependNode(bigUint, bigInt->AbsValStart);
  67   // Update BigInt's head field
  68   bigInt->AbsValStart = bigUint;
  69
  70   // If it's the first node added, correctly set bigInt->AbsValEnd
  71   if (bigInt->AbsValEnd == NULL)
  72         bigInt->AbsValEnd = bigUint;
  73
  74   bigInt->Count++;
  75 }
  76
  77 void PushEndNode(BigInteger* bigInt, unsigned int value)
  78 {
  79   BigUnsignedInteger* buint = InitBUint(value);
  80
  81   // Do the magic swapping
  82   if (bigInt->AbsValEnd != NULL)
  83         PrependNode(bigInt->AbsValEnd, buint);
  84   // Update BigInt's head field
  85   bigInt->AbsValEnd = buint;
  86
  87   // If it's the first node added, correctly set bigInt->AbsValStart
  88   if (bigInt->AbsValStart == NULL)
  89         bigInt->AbsValStart = buint;
  90
  91   bigInt->Count++;
  92 }
  93
  94 // Used to insert a node in the *middle* of the BigInt.
  95 // It Do *not* check if we reproduce Push(Front|End)Node behavior
  96 // Use Push(Front|End)Node if you intend to do what these functions are meant for
  97 void InsertNode(BigInteger* bigInt, BigUnsignedInteger* next, unsigned int value)
  98 {
  99   BigUnsignedInteger* buint = InitBUint(value);
 100   BigUnsignedInteger* temp  = next->Previous;
 101
 102   PrependNode(buint, next);
 103   PrependNode(temp, buint);
 104
 105   bigInt->Count++;
 106 }
 107
 108 // End Private Function Impl
 109
 110
 111
 112 // Public Function Impl
 113
 114 BigInteger newBigInteger(char* desc)
 115 {
 116
 117 }
 118
 119 void printBigInteger(BigInteger bint)
 120 {
 121
 122 }
 123
 124 Boolean isNull(BigInteger bint)
 125 {
 126
 127 }
 128
 129 int signBigInt(BigInteger bint)
 130 {
 131
 132 }
 133
 134 Boolean equalsBigInt(BigInteger b1, BigInteger b2)
 135 {
 136
 137 }
 138
 139 int compareBigInt(BigInteger b1, BigInteger b2)
 140 {
 141
 142 }
 143
 144 BigInteger sumBigInt(BigInteger b1, BigInteger b2)
 145 {
 146
 147 }
 148
 149 BigInteger diffBigInt(BigInteger b1, BigInteger b2)
 150 {
 151
 152 }
 153
 154 // End Public Function Impl