1. /*

  2.  * Copyright 1999,2004 The Apache Software Foundation.

  3.  *

  4.  * Licensed under the Apache License, Version 2.0 (the "License");

  5.  * you may not use this file except in compliance with the License.

  6.  * You may obtain a copy of the License at

  7.  *

  8.  *      http://www.apache.org/licenses/LICENSE-2.0

  9.  *

  10.  * Unless required by applicable law or agreed to in writing, software

  11.  * distributed under the License is distributed on an "AS IS" BASIS,

  12.  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.

  13.  * See the License for the specific language governing permissions and

  14.  * limitations under the License.

  15.  */

  16. package peaklau.eaglefund;

  17. 

  18. /**

  19.  * BigInteger class. <br>

  20.  * This class implements the big integer operation, eg: add, mul, div <br>

  21.  *  <br>

  22.  * @author peaklau <br>

  23.  *         email:<A HREF="mailto:peaklau@hotmail.com">peaklau@hotmail.com</A> <br>

  24.  *         <a href="http://www.peaklau.com/fund/english/">HomePage</a> 

  25.  * @version $Revision: 1.2 $ $Date: 2007/10/21 14:26:24 $

  26.  */

  27. 

  28. public class BigInteger {

  29.     private static long MAX=1000000;

  30.     

  31.     public long n1=0;//low

  32.     public long n2=0;

  33.     public long n3=0;

  34.     public long n4=0;

  35.     public long n5=0;//high

  36.     public boolean plus=true;

  37.     public BigInteger(long n){

  38.         if(n<0){

  39.             plus=false;

  40.             n=0-n;

  41.         }

  42.         n1=n%MAX;

  43.         n2=(nMAX)%MAX;

  44.         n3=(nMAXMAX)%MAX;

  45.         n4=(nMAXMAXMAX)%MAX;

  46.         n5=(nMAXMAXMAXMAX)%MAX;

  47.         //System.out.println(n5+" "+n4+" "+n3+" "+n2+" "+n1);

  48.     }

  49.     

  50.     public long getValue(){

  51.         long tmp=(((n5*MAX+n4)*MAX+n3)*MAX+n2)*MAX+n1;

  52.         //System.out.println("long "+(((((long)n5*MAX+n4)*MAX+n3)*MAX+n2)*MAX+n1));

  53.         return plus?tmp:(0-tmp);

  54.     }    

  55. 

  56.     /**

  57.      * compareIgnorePlus

  58.      * 

  59.      * @param a

  60.      * @param b

  61.      * @return

  62.      */

  63.     private static int compareIgnorePlus(BigInteger a,BigInteger b){

  64.         if(a.n5>b.n5){

  65.             return 1;

  66.         }else if(a.n5<b.n5){

  67.             return -1;

  68.         }else if(a.n4>b.n4){

  69.             return 1;

  70.         }else if(a.n4<b.n4){

  71.             return -1;

  72.         }else if(a.n3>b.n3){

  73.             return 1;

  74.         }else if(a.n3<b.n3){

  75.             return -1;

  76.         }else if(a.n2>b.n2){

  77.             return 1;

  78.         }else if(a.n2<b.n2){

  79.             return -1;

  80.         }else if(a.n1>b.n1){

  81.             return 1;

  82.         }else if(a.n1<b.n1){

  83.             return -1;

  84.         }else{

  85.             return 0;

  86.         }        

  87.     }

  88.     /**

  89.      * add 

  90.      * @param a

  91.      * @param b

  92.      * @return

  93.      */

  94.     public static BigInteger add(BigInteger a,BigInteger b){

  95.         BigInteger tmp=new BigInteger(0);

  96.         long aaa=0;

  97.         if((a.plus&&b.plus)||(!a.plus&&!b.plus)){

  98.             tmp.plus=a.plus;

  99.             aaa=a.n1+b.n1;

  100.             tmp.n1=aaa%MAX;

  101.             

  102.             aaa=a.n2+b.n2+aaaMAX;

  103.             tmp.n2=aaa%MAX;

  104.             

  105.             aaa=a.n3+b.n3+aaaMAX;

  106.             tmp.n3=aaa%MAX;

  107.             

  108.             aaa=a.n4+b.n4+aaaMAX;

  109.             tmp.n4=aaa%MAX;

  110.             

  111.             aaa=a.n5+b.n5+aaaMAX;

  112.             tmp.n5=aaa%MAX;

  113.             

  114.         }else if(compareIgnorePlus(a,b)>=0){

  115.             tmp.plus=a.plus;

  116.             aaa=MAX+a.n1-b.n1;

  117.             tmp.n1=aaa%MAX;

  118.             

  119.             aaa=MAX+a.n2-b.n2-(aaa<MAX?1:0);

  120.             tmp.n2=aaa%MAX;

  121.             

  122.             aaa=MAX+a.n3-b.n3-(aaa<MAX?1:0);

  123.             tmp.n3=aaa%MAX;

  124.             

  125.             aaa=MAX+a.n4-b.n4-(aaa<MAX?1:0);

  126.             tmp.n4=aaa%MAX;

  127.             

  128.             aaa=MAX+a.n5-b.n5-(aaa<MAX?1:0);

  129.             tmp.n5=aaa%MAX;

  130.         }else{

  131.             tmp.plus=b.plus;

  132.             aaa=MAX+b.n1-a.n1;

  133.             tmp.n1=aaa%MAX;

  134.             

  135.             aaa=MAX+b.n2-a.n2-(aaa<MAX?1:0);

  136.             tmp.n2=aaa%MAX;

  137.             

  138.             aaa=MAX+b.n3-a.n3-(aaa<MAX?1:0);

  139.             tmp.n3=aaa%MAX;

  140.             

  141.             aaa=MAX+b.n4-a.n4-(aaa<MAX?1:0);

  142.             tmp.n4=aaa%MAX;

  143.             

  144.             aaa=MAX+b.n5-a.n5-(aaa<MAX?1:0);

  145.             tmp.n5=aaa%MAX;            

  146.         }

  147.         return tmp;

  148.     }     

  149.     

  150.     /**

  151.      * mul

  152.      * @param a

  153.      * @param b

  154.      * @return

  155.      */

  156.     public static BigInteger mul(BigInteger a,BigInteger b){

  157.         BigInteger tmp=new BigInteger(0);

  158.         if((a.plus&&b.plus)||(!a.plus&&!b.plus)){

  159.             tmp.plus=true;

  160.         }else{

  161.             tmp.plus=false;

  162.         }

  163.         long aaa=0;

  164.         aaa=a.n1*b.n1;

  165.         tmp.n1=aaa%MAX;

  166.         

  167.         aaa=a.n1*b.n2+a.n2*b.n1+aaaMAX;

  168.         tmp.n2=aaa%MAX;

  169.         

  170.         aaa=a.n3*b.n1+a.n1*b.n3+a.n2*b.n2+aaaMAX;

  171.         tmp.n3=aaa%MAX;

  172.         

  173.         aaa=a.n4*b.n1+a.n1*b.n4+a.n3*b.n2+a.n2*b.n3+aaaMAX;

  174.         tmp.n4=aaa%MAX;

  175.         

  176.         aaa=a.n5*b.n1+a.n1*b.n5+a.n4*b.n2+a.n2*b.n4+a.n3*b.n3+aaaMAX;

  177.         tmp.n5=aaa%MAX;

  178.         

  179.         return tmp;

  180.     } 

  181. 

  182.     /**

  183.      * div

  184.      * @param a

  185.      * @param b

  186.      * @return

  187.      */

  188.     public static BigInteger div(BigInteger a,BigInteger b){

  189.         //System.out.println(a+" div "+b);

  190.         BigInteger tmp=new BigInteger(0);

  191.         if((a.plus&&b.plus)||(!a.plus&&!b.plus)){

  192.             tmp.plus=true;

  193.         }else{

  194.             tmp.plus=false;

  195.         }

  196.         if(b.getValue()==0){

  197.             return tmp;

  198.         }

  199.         if(compareIgnorePlus(a,b)<0){

  200.             return tmp;

  201.         }        

  202.         if(compareIgnorePlus(a,b)==0){

  203.             BigInteger result=new BigInteger(1);

  204.             result.plus=tmp.plus;

  205.             return result;

  206.         }        

  207. 

  208.         long base=0;

  209.         long range=Long.MAX_VALUE;        

  210.         while(range!=0){

  211.         	if(compareIgnorePlus(mul(new BigInteger(base+range),b),a)>0){

  212.         		range=range2;

  213.         	}else{

  214.         		base+=range;

  215.         	}

  216.             //System.out.println("base="+base);

  217.         }    

  218.         BigInteger result=new BigInteger(base);

  219.         result.plus=tmp.plus;

  220.         return result;

  221.     }

  222. 

  223. 

  224.         public String toString() {

  225.             StringBuffer buffer = new StringBuffer();

  226.             buffer.append("BigInteger[");

  227.             buffer.append("MAX = ").append(MAX);

  228.             buffer.append(", n1 = ").append(n1);

  229.             buffer.append(", n2 = ").append(n2);

  230.             buffer.append(", n3 = ").append(n3);

  231.             buffer.append(", n4 = ").append(n4);

  232.             buffer.append(", n5 = ").append(n5);

  233.             buffer.append(", plus = ").append(plus);

  234.             buffer.append(", value = ").append(this.getValue());

  235.             buffer.append("]");

  236.             return buffer.toString();

  237.         } 

  238.     

  239. /*

  240.     public static void main(String[]args){

  241.         long a=31758;

  242.         long b=100000;

  243.         //BigInteger bi=new BigInteger(a);

  244.         //System.out.println(bi.getValue());

  245.         //System.out.println(compareIgnorePlus(new BigInteger(a),new BigInteger(b)));

  246.         //System.out.println(add(new BigInteger(a),new BigInteger(b)).getValue()+" "+(a+b));

  247.         //System.out.println(mul(new BigInteger(a),new BigInteger(b)).getValue()+" "+((long)a*(long)b));

  248.         //System.out.println(div(new BigInteger(a),new BigInteger(b)).getValue()+" "+((long)a/(long)b));

  249.         //System.out.println(div(mul(new BigInteger(a),new BigInteger(b)),new BigInteger(10000)).getValue()+" "+((long)a*(long)b/(long)10000L));

  250.         long percent=-5217;

  251.         long quantity=2000000000;

  252.         long value=25934;

  253.         BigInteger oldValue=BigInteger.div(BigInteger.mul(new BigInteger(value),new BigInteger(1000000)),new BigInteger(percent+1000000));

  254.         System.out.println("oldValue "+oldValue.getValue());

  255.         BigInteger tmp1=BigInteger.mul(BigInteger.mul(oldValue,new BigInteger(quantity)),new BigInteger(percent));

  256.         System.out.println("tmp1 "+tmp1.getValue());

  257.         BigInteger tmp2=BigInteger.mul(BigInteger.mul(oldValue,new BigInteger(quantity)),new BigInteger(10000));

  258.         System.out.println("tmp2 "+tmp2.getValue());

  259.         BigInteger addPerDayPerFund=BigInteger.div(tmp1,BigInteger.mul(new BigInteger(10000),new BigInteger(1000000)));

  260.         System.out.println("addPerDayPerFund "+addPerDayPerFund.getValue());

  261.         

  262.         //System.out.println(div(mul(new BigInteger(a),new BigInteger(b)),new BigInteger(10000)).getValue()+" "+((long)a*(long)b/(long)10000L));

  263.     }     

  264. */    

  265. 

  266. }