rubysl-bigdecimal 1.0.0 → 2.0.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 41333a9987e69d300bdf0e97e22079011ba40c5e
-  data.tar.gz: 02f1483d9986293cadfe6fcb9e1567a5e4c824c5
+  metadata.gz: e8aee01bd8b35b34018055abf853ab88ae679b3f
+  data.tar.gz: 550826ac7ea321b66c049b6edc8c086c58b787ca
 SHA512:
-  metadata.gz: 523d5b1fc0b0249f8447d1feda50be12faef1ee40380a2022ec82f81575b876a73bcfa7965918f823b77be2ee2e77d7d3b3ff6c19d2b98572be0ee8d9e888547
-  data.tar.gz: 7f0eb82bf50bccbffa147cf89482fd5398bfc68ea44071337271137d58f7b5f4bc5c7d8648c735235cc5b53340371afc9bbcebfe9b872845b1bc21c226063281
+  metadata.gz: a8c2b2bb3d238d9ff3833351c44ef7272ce841bdbb39b2b4ed679aeb6b54671f0f337d13f43dae0a3ff10ea35467d1648669dcb35a619b288b0e016d52ba69a2
+  data.tar.gz: 7c3118b06a6e2fd74b9f51fdefb211cd3ab68e201a547bf8d40026385a6c1767689bedcc98b6db7a4fd6d9cb30e33da5b035cc3c2bfa0b3803c117a519337a58

data/.travis.yml

@@ -1,8 +1,9 @@
 language: ruby
 before_install:
+  - rvm use $RVM --install --binary --fuzzy
   - gem update --system
   - gem --version
   - gem install rubysl-bundler
+env:
+  - RVM=rbx-nightly-d21 RUBYLIB=lib
 script: bundle exec mspec spec
-rvm:
-  - rbx-nightly-18mode

data/README.md

@@ -1,29 +1,60 @@
-# Rubysl::Bigdecimal
 
-TODO: Write a gem description
+  Ruby BIGDECIMAL(Variable Precision) extension library.
+  Copyright (C) 1999  by Shigeo Kobayashi(shigeo@tinyforest.gr.jp)
 
-## Installation
+BigDecimal is copyrighted free software by Shigeo Kobayashi <shigeo@tinyforest.gr.jp>.
+You can redistribute it and/or modify it under either the terms of the GPL
+(see COPYING file), or the conditions below:
 
-Add this line to your application's Gemfile:
+  1. You may make and give away verbatim copies of the source form of the
+     software without restriction, provided that you duplicate all of the
+     original copyright notices and associated disclaimers.
 
-    gem 'rubysl-bigdecimal'
+  2. You may modify your copy of the software in any way, provided that
+     you do at least ONE of the following:
 
-And then execute:
+       a) place your modifications in the Public Domain or otherwise
+          make them Freely Available, such as by posting said
+	  modifications to Usenet or an equivalent medium, or by allowing
+	  the author to include your modifications in the software.
 
-    $ bundle
+       b) use the modified software only within your corporation or
+          organization.
 
-Or install it yourself as:
+       c) rename any non-standard executables so the names do not conflict
+	  with standard executables, which must also be provided.
 
-    $ gem install rubysl-bigdecimal
+       d) make other distribution arrangements with the author.
 
-## Usage
+  3. You may distribute the software in object code or executable
+     form, provided that you do at least ONE of the following:
 
-TODO: Write usage instructions here
+       a) distribute the executables and library files of the software,
+	  together with instructions (in the manual page or equivalent)
+	  on where to get the original distribution.
 
-## Contributing
+       b) accompany the distribution with the machine-readable source of
+	  the software.
 
-1. Fork it
-2. Create your feature branch (`git checkout -b my-new-feature`)
-3. Commit your changes (`git commit -am 'Add some feature'`)
-4. Push to the branch (`git push origin my-new-feature`)
-5. Create new Pull Request
+       c) give non-standard executables non-standard names, with
+          instructions on where to get the original software distribution.
+
+       d) make other distribution arrangements with the author.
+
+  4. You may modify and include the part of the software into any other
+     software (possibly commercial).
+
+  5. THIS SOFTWARE IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR
+     IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
+     WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR
+     PURPOSE.
+
+* The Author
+
+Feel free to send comments and bug reports to the author.  Here is the 
+author's latest mail address:
+
+  shigeo@tinyforest.gr.jp
+
+-------------------------------------------------------
+created at: Thu Dec 22 1999

data/{lib/bigdecimal/bigdecimal_en.html → bigdecimal_en.html}

@@ -1,4 +1,3 @@
-<!-- saved from url=(0022)http://internet.e-mail -->
 <HTML>
 <HEAD>
 <META HTTP-EQUIV="Content-Type" CONTENT="text/html">
@@ -32,18 +31,18 @@ pre
 <BODY BGCOLOR=#FFFFE0>
 <H1>BigDecimal(Variable Precision Floating Library for Ruby)</H1>
 <DIV align="right"><A HREF="./bigdecimal_ja.html">Japanese</A></DIV><BR>
-BigDecimal is an extension library for the Ruby interpreter. 
-Using BigDecimal class, you can obtain any number of significant digits in computation. 
+BigDecimal is an extension library for the Ruby interpreter.
+Using BigDecimal class, you can obtain any number of significant digits in computation.
 For the details about Ruby see:<BR>
 <UL>
 <LI><A HREF="http://www.ruby-lang.org/en/">http://www.ruby-lang.org/en/</A>:Official Ruby page(English).</LI>
 <LI><A HREF="http://kahori.com/ruby/ring/">http://kahori.com/ruby/ring/</A>:Mutually linked pages relating to Ruby(Japanese).
 </LI>
-</UL> 
+</UL>
 NOTE:<BR>
  This software is provided "AS IS" and without any express or
  implied warranties,including,without limitation,the implied
- warranties of merchantibility and fitness for a particular
+ warranties of merchantability and fitness for a particular
  purpose. For the details,see COPYING and README included in this
  distribution.
 <BR>
@@ -63,15 +62,15 @@ NOTE:<BR>
 <A NAME="#INTRO">
 <H2>Introduction</H2>
 Ruby already has builtin (variable length integer number) class Bignum. Using Bignum class,you can obtain
- any integer value in magnitude. But, variable length decimal number class is not yet built in. 
+ any integer value in magnitude. But, variable length decimal number class is not yet built in.
 This is why I made variable length floating class BigDecimal.
 Feel free to send any comments or bug reports to me.
 <A HREF="mailto:shigeo@tinyforest.gr.jp">shigeo@tinyforest.gr.jp</A>
-I will try(but can't promise) to fix bugs reported. 
+I will try(but can't promise) to fix bugs reported.
 <hr>
 <H2>Installation</H2>
 The Ruby latest version can be downloaded from <A HREF="http://www.ruby-lang.org/en/">Official Ruby page</A>.
-Once decompress the downloaded Ruby archive,follow the normal installation procedures according to the 
+Once decompress the downloaded Ruby archive,follow the normal installation procedures according to the
 documents included.
 
 <A NAME="#SPEC">
@@ -90,7 +89,7 @@ to create BigDecimal objects,the program would like:<BR>
 In 32 bits integer system,every 4 digits(in decimal) are computed simultaneously.
 This means the number of significant digits in BigDecimal is always a multiple of 4.
 <P>
-Some more methods are available in Ruby code (not C code). 
+Some more methods are available in Ruby code (not C code).
 Functions such as sin,cos ...,are in math.rb in bigdecimal directory.
 To use them,require math.rb as:
 <CODE><PRE>
@@ -111,11 +110,11 @@ For details,see the util.rb code.
 a=BigDecimal::new(s[,n]) or<BR>
 a=BigDecimal(s[,n]) or<BR>
 where:<BR>
-s: Initial value string. Spaces will be ignored. Any unrecognizable character for 
+s: Initial value string. Spaces will be ignored. Any unrecognizable character for
 representing initial value terminates the string.<BR>
 n: Maximum number of significant digits of a. n must be a Fixnum object.
 If n is omitted or is equal to 0,then the maximum number of significant digits of a is determined from the length of s.
-Actual number of digits handled in computations are usually gretaer than n.<BR>
+Actual number of digits handled in computations are usually greater than n.<BR>
 n is useful when performing divisions like
 <CODE><PRE>
 BigDecimal("1")    / BigDecimal("3")    # => 0.3333333333 33E0
@@ -141,13 +140,13 @@ f = BigDecimal::mode(BigDecimal::EXCEPTION_ZERODIVIDE,flag)<BR>
 f = BigDecimal::mode(BigDecimal::EXCEPTION_ALL,flag)<BR>
 </BLOCKQUOTE>
 EXCEPTION_NaN controls the execution when computation results to NaN.<BR>
-EXCEPTION_INFINITY controls the execution when computation results to Infinity(�}Infinity).<BR>
+EXCEPTION_INFINITY controls the execution when computation results to Infinity.<BR>
 EXCEPTION_UNDERFLOW controls the execution when computation underflows.<BR>
 EXCEPTION_OVERFLOW controls the execution when computation overflows.<BR>
-EXCEPTION_ZERODIVIDE controls the execution when zero-division occures.<BR>
-EXCEPTION_ALL controls the execution for any exception defined occures.<BR>
+EXCEPTION_ZERODIVIDE controls the execution when zero-division occurs.<BR>
+EXCEPTION_ALL controls the execution when any defined exception occurs.<BR>
 If the flag is true,then the relating exception is thrown.<BR>
-No exception is thrown when the flag is false(default) and computation 
+No exception is thrown when the flag is false(default) and computation
 continues with the result:<BR>
 <BLOCKQUOTE>
 EXCEPTION_NaN results to NaN<BR>
@@ -160,7 +159,7 @@ EXCEPTION_INFINITY,EXCEPTION_OVERFLOW, and EXCEPTION_ZERODIVIDE are
  currently the same.<BR>
 The return value of mode method is the value set.<BR>
 If nil is specified for the second argument,then current setting is returned.<BR>
-Suppose the return value of the mode method is f,then 
+Suppose the return value of the mode method is f,then
  f &amp; BigDecimal::EXCEPTION_NaN !=0 means EXCEPTION_NaN is set to on.
 <P>
 <B>[ROUND error control]</B><P>
@@ -181,12 +180,12 @@ where flag must be one of:
 </TABLE>
 New rounding mode is returned. If nil is specified for the second argument,then current setting is returned.<BR>
 The digit location for rounding operation can not be specified by this mode method,
-use truncate/round/ceil/floor/add/sub/mult/div mthods for each instance instead.
+use truncate/round/ceil/floor/add/sub/mult/div methods for each instance instead.
 </BLOCKQUOTE>
 
 <LI><B>limit[(n)]</B></LI><BLOCKQUOTE>
 Limits the maximum digits that the newly created BigDecimal objects can hold never exceed n.
-This means the rounding operation specified by BigDecimal.mode is 
+This means the rounding operation specified by BigDecimal.mode is
 performed if necessary.
 limit returns the value before set if n is nil or is not specified.
 Zero,the default value,means no upper limit.<BR>
@@ -195,7 +194,7 @@ mf = BigDecimal::limit(n)<BR>
 </BLOCKQUOTE>
 
 <LI><B>double_fig</B></LI><BLOCKQUOTE>
-double_fig is a class method which returns the number of digits 
+double_fig is a class method which returns the number of digits
 the Float class can have.
 <CODE><PRE>
   p BigDecimal::double_fig  # ==> 20 (depends on the CPU etc.)
@@ -291,7 +290,7 @@ returns the maximum integer value (in BigDecimal) which is less than or equal to
  c = BigDecimal("-1.23456").floor #  ==> -2
 </PRE></CODE>
 
-As shown in the following example,an optional integer argument (n) specifying the position 
+As shown in the following example,an optional integer argument (n) specifying the position
 of the target digit can be given.<BR>
 If n> 0,then the (n+1)th digit counted from the decimal point in fraction part is processed(resulting number of fraction part digits is less than or equal to n).<BR>
 If n<0,then the n-th digit counted from the decimal point in integer part is processed(at least n 0's are placed from the decimal point to left).
@@ -309,7 +308,7 @@ returns the minimum integer value (in BigDecimal) which is greater than or equal
  c = BigDecimal("-1.23456").ceil #  ==> -1
 </PRE></CODE>
 
-As shown in the following example,an optional integer argument (n) specifying the position 
+As shown in the following example,an optional integer argument (n) specifying the position
 of the target digit can be given.<BR>
 If n>0,then the (n+1)th digit counted from the decimal point in fraction part is processed(resulting number of fraction part digits is less than or equal to n).<BR>
 If n<0,then the n-th digit counted from the decimal point in integer part is processed(at least n 0's are placed from the decimal point to left).
@@ -321,14 +320,14 @@ If n<0,then the n-th digit counted from the decimal point in integer part is pro
 </BLOCKQUOTE>
 <LI><B>round[(n[,b])]</B></LI><BLOCKQUOTE>
 c = a.round<BR>
-round a to the nearest 1(default)�D<BR>
+round a to the nearest 1(default)ÅD<BR>
 <CODE><PRE>
  c = BigDecimal("1.23456").round  #  ==> 1
  c = BigDecimal("-1.23456").round #  ==> -1
 </PRE></CODE>
 The rounding operation changes according to BigDecimal::mode(BigDecimal::ROUND_MODE,flag) if specified.
 
-As shown in the following example,an optional integer argument (n) specifying the position 
+As shown in the following example,an optional integer argument (n) specifying the position
 of the target digit can be given.<BR>
 If n>0,then the (n+1)th digit counted from the decimal point in fraction part is processed(resulting number of fraction  part digits is less than or equal to n).<BR>
 If n<0,then the n-th digit counted from the decimal point in integer part is processed(at least n 0's are placed from the decimal point to left).
@@ -346,8 +345,8 @@ c = BigDecimal::new("1.23356").round(3,BigDecimal::ROUND_HALF_EVEN)   #  ==> 1.2
 </BLOCKQUOTE>
 <LI><B>truncate[(n)]</B></LI><BLOCKQUOTE>
 c = a.truncate<BR>
-truncate a to the nearest 1�D<BR>
-As shown in the following example,an optional integer argument (n) specifying the position 
+truncate a to the nearest 1ÅD<BR>
+As shown in the following example,an optional integer argument (n) specifying the position
 of the target digit can be given.<BR>
 If n>0,then the (n+1)th digit counted from the decimal point in fraction part is processed(resulting number of fraction part digits is less than or equal to n).<BR>
 If n<0,then the n-th digit counted from the decimal point in integer part is processed(at least n 0's are placed from the decimal point to left).
@@ -374,7 +373,7 @@ converts to string(default results look like "0.xxxxxEn").
 <CODE><PRE>
 BigDecimal("1.23456").to_s  #  ==> "0.123456E1"
 </PRE></CODE>
-If n(>0) is given,then a space is inserted to each of two parts divided by the decimal point 
+If n(>0) is given,then a space is inserted to each of two parts divided by the decimal point
 after every n digits for readability.
 <CODE><PRE>
 BigDecimal("0.1234567890123456789").to_s(10)   #  ==> "0.1234567890 123456789E0"
@@ -391,7 +390,7 @@ BigDecimal("0.1234567890123456789").to_s("+10") #  ==> "+0.1234567890 123456789E
 BigDecimal("-0.1234567890123456789").to_s("10") #  ==> "-0.1234567890 123456789E0"
 </PRE></CODE>
 
-At the end of the string,'E'(or 'e') or 'F'(or 'f') can be specified to change 
+At the end of the string,'E'(or 'e') or 'F'(or 'f') can be specified to change
 number representation.
 <CODE><PRE>
 BigDecimal("1234567890.123456789").to_s("E")  #  ==> "0.1234567890123456789E10"
@@ -409,7 +408,7 @@ means a = 0.xxxxxxx*10**n.
 
 <LI><B>precs</B></LI><BLOCKQUOTE>
 n,m = a.precs <BR>
-prec returns number of significant digits (n) and maximum number of 
+precs returns number of significant digits (n) and maximum number of
 significant digits (m) of a.
 </BLOCKQUOTE>
 
@@ -439,11 +438,11 @@ a.nan? returns True when a is NaN.
 
 </BLOCKQUOTE>
 <LI><B>infinite?</B></LI><BLOCKQUOTE>
-a.infinite? returns 1 when a is +��,-1 when a is -��, nil otherwise.
+a.infinite? returns 1 when a is Infinity, -1 when a is -Infinity, nil otherwise.
 
 </BLOCKQUOTE>
 <LI><B>finite?</B></LI><BLOCKQUOTE>
-a.finite? returns true when a is neither �� nor NaN.
+a.finite? returns true when a is neither Infinity nor NaN.
 </BLOCKQUOTE>
 
 <LI><B>zero?</B></LI><BLOCKQUOTE>
@@ -474,7 +473,7 @@ p a=BigDecimal::new("3.14",10)<BR>
 should produce output like "#&lt;0x112344:'0.314E1',4(12)%gt;".
 where "0x112344" is the address,
 '0.314E1' is the value,4 is the number of the significant digits,
-and 12 is the maximum number of the significant digits 
+and 12 is the maximum number of the significant digits
 the object can hold.
 </BLOCKQUOTE>
 
@@ -526,14 +525,14 @@ same as ==,used in case statement.
 <DT> 1.Both A and B are BigDecimal objects</DT>
 <DD> A op B is normally performed.</DD>
 <DT> 2.A is the BigDecimal object but B is other than BigDecimal object</DT>
-<DD> Operation is performed,after B is translated to correcponding BigDecimal object(because BigDecimal supports coerce method).</DD>
+<DD> Operation is performed,after B is translated to corresponding BigDecimal object(because BigDecimal supports coerce method).</DD>
 <DT> 3.A is not the BigDecimal object but B is BigDecimal object</DT>
-<DD>If A has coerce mthod,then B will translate A to corresponding 
+<DD>If A has coerce method,then B will translate A to corresponding
 BigDecimal object and the operation is performed,otherwise an error occures.</DD>
 </DL>
 
 String is not translated to BigDecimal in default.
-Uncomment /* #define ENABLE_NUMERIC_STRING */ in bigdecimal.c, compile and install 
+Uncomment /* #define ENABLE_NUMERIC_STRING */ in bigdecimal.c, compile and install
 again if you want to enable string to BigDecimal conversion.
 Translation stops without error at the character representing non digit.
 For instance,"10XX" is translated to 10,"XXXX" is translated to 0.<BR>
@@ -564,7 +563,7 @@ and define coerce method within the new class.<BR>
 Infinite numbers and NaN can be represented by string writing "+Infinity"(or "Infinity"),"-Infinity",and "NaN" respectively in your program.
 Infinite numbers can be obtained by 1.0/0.0(=Infinity) or -1.0/0.0(=-Infinity).
 <BR><BR>
-NaN(Not a number) can be obtained by undefined computation like 0.0/0.0 
+NaN(Not a number) can be obtained by undefined computation like 0.0/0.0
 or Infinity-Infinity.
 Any computation including NaN results to NaN.
 Comparisons with NaN never become true,including comparison with NaN itself.
@@ -573,7 +572,7 @@ Zero has two different variations as +0.0 and -0.0.
 But,still, +0.0==-0.0 is true.
 <BR><BR>
 Computation results including Infinity,NaN,+0.0 or -0.0 become complicated.
-Run following program and comfirm the results.
+Run following program and confirm the results.
 Send me any incorrect result if you find.
 
 <CODE><PRE>
@@ -603,12 +602,9 @@ where 'x' is any digit representing mantissa(kept in the array frac[]),
 BASE is base value(=10000 in 32 bit integer system),
 and n is the exponent value.<BR>
 Larger BASE value enables smaller size of the array frac[],and increases computation speed.
-The value of BASE is defined ind VpInit(). In 32 bit integer system,this value is 
-10000. In 64 bit integer system,the value becomes larger.
-BigDecimal has not yet been compiled and tested on 64 bit integer system.
-It will be very nice if anyone try to run BigDecimal on 64 bit system and
- inform me the results.
-When BASE is 10000,an element of the array frac[] can have vale of from 0 to 9999.
+The value of BASE is defined ind VpInit(). In 32 bit integer system, this value is
+10000. In 64 bit integer system, the value is 1000000000.
+When BASE is 10000,an element of the array frac[] can have value of from 0 to 9999.
 (up to 4 digits).<BR>
 The structure Real is defined in bigdecimal.h as:<BR>
 <CODE><PRE>
@@ -626,7 +622,7 @@ The structure Real is defined in bigdecimal.h as:<BR>
                             /*   -3 : -Infinity         */
      unsigned short flag;   /* Control flag             */
      int      exponent;     /* Exponent value(0.xxxx*BASE**exponent) */
-     unsigned long frac[1]; /* An araay holding mantissa(Variable)   */
+     unsigned long frac[1]; /* An array holding mantissa(Variable)   */
   } Real;
 </CODE></PRE>
 The decimal value 1234.56784321 is represented as(BASE=10000):<BR>
@@ -634,7 +630,7 @@ The decimal value 1234.56784321 is represented as(BASE=10000):<BR>
     0.1234 5678 4321*(10000)**1
 </PRE>
 where frac[0]=1234,frac[1]=5678,frac[2]=4321,
-Prec=3,sign=2,exponent=1. MaxPrec can be any value greater than or equal to 
+Prec=3,sign=2,exponent=1. MaxPrec can be any value greater than or equal to
 Prec.
 <hr>
 
@@ -661,29 +657,29 @@ The reason why I adopted decimal number representation for BigDecimal is:<BR>
    end
 </PRE></CODE>
 
-If the internal representation is binary,translation from decimal to 
+If the internal representation is binary,translation from decimal to
 binary is required and the translation error is inevitable.
 For example, 0.1 can not exactly be represented in binary.<BR>
 0.1 => b1*2**(-1)+b1*2**(-2)+b3*2**(-3)+b4*2**(-4)....<BR>
 where b1=0,b2=0,b3=0,b4=1...<BR>
 bn(n=1,2,3,...) is infinite series of digit with value of 0 or 1,
 and rounding operation is necessary but where we should round the series ?
-Of cource,exact "0.1" is printed if the rouding operation is properly done,
+Of course, exact "0.1" is printed if the rounding operation is properly done,
 <DT>Significant digit we can have is automatically determined
 <DD>In binary representation,0.1 can not be represented in finite series of digit.
 
 But we only need one element(frac[0]=1) in decimal representation.
-This means that we can always determine the size of the array frac[] in Real 
+This means that we can always determine the size of the array frac[] in Real
 structure.
 </DL>
 
 <H3>Disadvantage of decimal representation</H3>
-Because most computers have no internal decimal representaion.
+Because most computers have no internal decimal representation.
 Once you use BigDecimal,you need to keep using it without
 considering computation cost if exact computation is required.
 
 <H4>Which is the first input?</H4>
-Because most people uses decimal notatin for numeric data representation,
+Because most people uses decimal notation for numeric data representation,
 BigDecimal can handle numeric data without loss of translation error.
 <hr>
 
@@ -693,23 +689,23 @@ For the fundamental arithmetics such as addition,subtraction,
 multiplication,and division,I prepared 2 group of methods<BR>
 
 <H3>1. +,-,*,/</H3>
-For the operation + - * /,you can not specify the resulting 
+For the operation + - * /,you can not specify the resulting
 number of significant digits.<BR>
 Resulting number of significant digits are defined as:<BR>
-1.1 For *,resulting number of significant digits is the sum of the 
-significant digits of both side of the operator. For / ,resulting number of significant digits is the sum of the 
+1.1 For *,resulting number of significant digits is the sum of the
+significant digits of both side of the operator. For / ,resulting number of significant digits is the sum of the
 maximum significant digits of both side of the operator.<BR>
 1.2 For + and -,resulting number of significant digits is determined so that
  no round operation is needed. <br>
-For example, c has more than 100 siginificant digits if c is computed as:<BR>
+For example, c has more than 100 significant digits if c is computed as:<BR>
 c = 0.1+0.1*10**(-100)<br>
 <BR>
 As +,-,and * are always exact(no round operation is performed unless BigDecimal.limit is specified),
-which means more momories are required to keep computation results.
+which means more memory is required to keep computation results.
 But,the division such as c=1.0/3.0 will always be rounded.<BR>
 
 <H3>2. add,sub,mult,div</H3>
-The length of the significant digits obtained from +,-,*,/ 
+The length of the significant digits obtained from +,-,*,/
 is always defined by that of right and left side of the operator.
 To specify the length of the significant digits by your self,
 use methos add,sub,mult,div.
@@ -728,8 +724,8 @@ decimal point.
 
 
 <H3>4. Example</H3>
-Following example compute the ratio of the circumference of a circle to 
-its dirmeter(pi=3.14159265358979....) using J.Machin's formula.
+Following example compute the ratio of the circumference of a circle to
+its diameter(pi=3.14159265358979....) using J.Machin's formula.
 <BR><BR>
 <CODE><PRE>
 #!/usr/local/bin/ruby
@@ -750,7 +746,7 @@ def big_pi(sig) # sig: Number of significant figures
   k = BigDecimal::new("1")
   w = BigDecimal::new("1")
   t = BigDecimal::new("-80")
-  while (u.nonzero? && u.exponent >= exp) 
+  while (u.nonzero? && u.exponent >= exp)
     t   = t*m25
     u   = t.div(k,sig)
     pi  = pi + u