nobu	2009-09-22 04:49:32 +0900 (Tue, 22 Sep 2009)

  New Revision: 25026

  http://svn.ruby-lang.org/cgi-bin/viewvc.cgi?view=rev&revision=25026

  Log:
    * ext/bigdecimal/lib/*.rb: fixed indent.

  Modified files:
    trunk/ext/bigdecimal/lib/bigdecimal/jacobian.rb
    trunk/ext/bigdecimal/lib/bigdecimal/ludcmp.rb
    trunk/ext/bigdecimal/lib/bigdecimal/util.rb

Index: ext/bigdecimal/lib/bigdecimal/util.rb
===================================================================
--- ext/bigdecimal/lib/bigdecimal/util.rb	(revision 25025)
+++ ext/bigdecimal/lib/bigdecimal/util.rb	(revision 25026)
@@ -31,23 +31,23 @@
   # Converts a BigDecimal to a String of the form "nnnnnn.mmm".
   # This method is deprecated; use BigDecimal#to_s("F") instead.
   def to_digits
-     if self.nan? || self.infinite? || self.zero?
-        self.to_s
-     else
-       i       = self.to_i.to_s
-       s,f,y,z = self.frac.split
-       i + "." + ("0"*(-z)) + f
-     end
+    if self.nan? || self.infinite? || self.zero?
+      self.to_s
+    else
+      i       = self.to_i.to_s
+      s,f,y,z = self.frac.split
+      i + "." + ("0"*(-z)) + f
+    end
   end
 end
 
 class Rational < Numeric
   # Converts a Rational to a BigDecimal
   def to_d(nFig=0)
-     num = self.numerator.to_s
-     if nFig<=0
-        nFig = BigDecimal.double_fig*2+1
-     end
-     BigDecimal.new(num).div(self.denominator,nFig)
+    num = self.numerator.to_s
+    if nFig<=0
+      nFig = BigDecimal.double_fig*2+1
+    end
+    BigDecimal.new(num).div(self.denominator,nFig)
   end
 end
Index: ext/bigdecimal/lib/bigdecimal/ludcmp.rb
===================================================================
--- ext/bigdecimal/lib/bigdecimal/ludcmp.rb	(revision 25025)
+++ ext/bigdecimal/lib/bigdecimal/ludcmp.rb	(revision 25026)
@@ -12,24 +12,24 @@
       nrmrow  = zero
       ixn = i*n
       for j in 0...n do
-         biggst = a[ixn+j].abs
-         nrmrow = biggst if biggst>nrmrow
+        biggst = a[ixn+j].abs
+        nrmrow = biggst if biggst>nrmrow
       end
       if nrmrow>zero then
-         scales <<= one.div(nrmrow,prec)
+        scales <<= one.div(nrmrow,prec)
       else
-         raise "Singular matrix"
+        raise "Singular matrix"
       end
     end
     n1          = n - 1
     for k in 0...n1 do # Gaussian elimination with partial pivoting.
       biggst  = zero;
       for i in k...n do
-         size = a[ps[i]*n+k].abs*scales[ps[i]]
-         if size>biggst then
-            biggst = size
-            pividx  = i
-         end
+        size = a[ps[i]*n+k].abs*scales[ps[i]]
+        if size>biggst then
+          biggst = size
+          pividx  = i
+        end
       end
       raise "Singular matrix" if biggst<=zero
       if pividx!=k then
@@ -42,10 +42,10 @@
         psin = ps[i]*n
         a[psin+k] = mult = a[psin+k].div(pivot,prec)
         if mult!=zero then
-           pskn = ps[k]*n
-           for j in (k+1)...n do
-             a[psin+j] -= mult.mult(a[pskn+j],prec)
-           end
+          pskn = ps[k]*n
+          for j in (k+1)...n do
+            a[psin+j] -= mult.mult(a[pskn+j],prec)
+          end
         end
       end
     end
@@ -72,12 +72,12 @@
       x <<= b[ps[i]] - dot
     end
     (n-1).downto(0) do |i|
-       dot = zero
-       psin = ps[i]*n
-       for j in (i+1)...n do
-         dot = a[psin+j].mult(x[j],prec) + dot
-       end
-       x[i]  = (x[i]-dot).div(a[psin+i],prec)
+      dot = zero
+      psin = ps[i]*n
+      for j in (i+1)...n do
+        dot = a[psin+j].mult(x[j],prec) + dot
+      end
+      x[i]  = (x[i]-dot).div(a[psin+i],prec)
     end
     x
   end
Index: ext/bigdecimal/lib/bigdecimal/jacobian.rb
===================================================================
--- ext/bigdecimal/lib/bigdecimal/jacobian.rb	(revision 25025)
+++ ext/bigdecimal/lib/bigdecimal/jacobian.rb	(revision 25026)
@@ -26,13 +26,13 @@
     aa = a.abs
     bb = b.abs
     if aa == zero &&  bb == zero then
-          true
+      true
     else
-          if ((a-b)/(aa+bb)).abs < e then
-             true
-          else
-             false
-          end
+      if ((a-b)/(aa+bb)).abs < e then
+        true
+      else
+        false
+      end
     end
   end
   #++
@@ -52,17 +52,17 @@
       s = f.zero
       deriv = []
       if(nRetry>100) then
-         raise "Singular Jacobian matrix. No change at x[" + i.to_s + "]"
+        raise "Singular Jacobian matrix. No change at x[" + i.to_s + "]"
       end
       dx = dx*f.two
       x[i] += dx
       fxNew = f.values(x)
       for j in 0...n do
         if !isEqual(fxNew[j],fx[j],f.zero,f.eps) then
-           ok += 1
-           deriv <<= (fxNew[j]-fx[j])/dx
+          ok += 1
+          deriv <<= (fxNew[j]-fx[j])/dx
         else
-           deriv <<= f.zero
+          deriv <<= f.zero
         end
       end
       x[i] = xSave
@@ -77,7 +77,7 @@
     for i in 0...n do
       df = dfdxi(f,fx,x,i)
       for j in 0...n do
-         dfdx[j*n+i] = df[j]
+        dfdx[j*n+i] = df[j]
       end
     end
     dfdx

--
ML: ruby-changes@q...
Info: http://www.atdot.net/~ko1/quickml/