Changeset 2247

Timestamp:

Nov 1, 2004, 8:57:05 AM (22 years ago)

Author:

gusciora

Message:

Removed static declaration.

Location:

trunk/psLib/src

Files:

• dataManip/psMinimize.c (modified) (4 diffs)
• math/psMinimize.c (modified) (4 diffs)

trunk/psLib/src/dataManip/psMinimize.c

@@ -9 +9 @@
  *  @author GLG, MHPCC
  *
- *  @version $Revision: 1.78 $ $Name: not supported by cvs2svn $
- *  @date $Date: 2004-11-01 18:55:38 $
+ *  @version $Revision: 1.79 $ $Name: not supported by cvs2svn $
+ *  @date $Date: 2004-11-01 18:57:05 $
  *
  *  Copyright 2004 Maui High Performance Computing Center, University of Hawaii
@@ -1040 +1040 @@
 f(param + c * line).
  
-Algorithm: 
-XXX completely ad hoc: 
+Algorithm:
+XXX completely ad hoc:
 start with the user-supplied starting
 parameter and call that b.  Calculate a/c as a fractional amount
 smaller/larger than b.  Repeat this process until a local minimum is found.
  
-XXX: 
-new algorithm: 
+XXX:
+new algorithm:
 start at x=0, expand in one direction until the function
 decreases.  Then you have two points in the bracket.  Keep going until it
@@ -1053 +1053 @@
 direction.
  
-XXX: 
+XXX:
 This is F32 only.
  
-XXX: 
+XXX:
 output bracket vector should be an input as well.
 *****************************************************************************/
@@ -1230 +1230 @@
     }
 
-    static psVector *bracket = psVectorAlloc(3, PS_TYPE_F32);
+    psVector *bracket = psVectorAlloc(3, PS_TYPE_F32);
     tmp = psVectorAlloc(params->n, PS_TYPE_F32);
     a = -0.5;

trunk/psLib/src/math/psMinimize.c

@@ -9 +9 @@
  *  @author GLG, MHPCC
  *
- *  @version $Revision: 1.78 $ $Name: not supported by cvs2svn $
- *  @date $Date: 2004-11-01 18:55:38 $
+ *  @version $Revision: 1.79 $ $Name: not supported by cvs2svn $
+ *  @date $Date: 2004-11-01 18:57:05 $
  *
  *  Copyright 2004 Maui High Performance Computing Center, University of Hawaii
@@ -1040 +1040 @@
 f(param + c * line).
  
-Algorithm: 
-XXX completely ad hoc: 
+Algorithm:
+XXX completely ad hoc:
 start with the user-supplied starting
 parameter and call that b.  Calculate a/c as a fractional amount
 smaller/larger than b.  Repeat this process until a local minimum is found.
  
-XXX: 
-new algorithm: 
+XXX:
+new algorithm:
 start at x=0, expand in one direction until the function
 decreases.  Then you have two points in the bracket.  Keep going until it
@@ -1053 +1053 @@
 direction.
  
-XXX: 
+XXX:
 This is F32 only.
  
-XXX: 
+XXX:
 output bracket vector should be an input as well.
 *****************************************************************************/
@@ -1230 +1230 @@
     }
 
-    static psVector *bracket = psVectorAlloc(3, PS_TYPE_F32);
+    psVector *bracket = psVectorAlloc(3, PS_TYPE_F32);
     tmp = psVectorAlloc(params->n, PS_TYPE_F32);
     a = -0.5;