--- a/scripts/geometry/convhull.m	Thu Aug 30 01:05:44 2007 +0000
+++ b/scripts/geometry/convhull.m	Thu Aug 30 07:25:57 2007 +0000
@@ -18,8 +18,8 @@
 ## 02110-1301, USA.
 
 ## -*- texinfo -*-
-## @deftypefn {Loadable Function} {@var{H} =} convhull (@var{x}, @var{y})
-## @deftypefnx {Loadable Function} {@var{H} =} convhull (@var{x}, @var{y}, @var{opt})
+## @deftypefn {Function File} {@var{H} =} convhull (@var{x}, @var{y})
+## @deftypefnx {Function File} {@var{H} =} convhull (@var{x}, @var{y}, @var{opt})
 ## Returns the index vector to the points of the enclosing convex hull.  The
 ## data points are defined by the x and y vectors.
 ##

--- a/scripts/geometry/delaunay.m	Thu Aug 30 01:05:44 2007 +0000
+++ b/scripts/geometry/delaunay.m	Thu Aug 30 07:25:57 2007 +0000
@@ -18,8 +18,8 @@
 ## 02110-1301, USA.
 
 ## -*- texinfo -*-
-## @deftypefn {Loadable Function} {@var{tri}=} delaunay (@var{x}, @var{y})
-## @deftypefnx {Loadable Function} {@var{tri}=} delaunay (@var{x}, @var{y}, @var{opt})
+## @deftypefn {Function File} {@var{tri}=} delaunay (@var{x}, @var{y})
+## @deftypefnx {Function File} {@var{tri}=} delaunay (@var{x}, @var{y}, @var{opt})
 ## The return matrix of size [n, 3] contains a set triangles which are
 ## described by the indices to the data point x and y vector.
 ## The triangulation satisfies the Delaunay circumcircle criterion.

--- a/scripts/geometry/delaunay3.m	Thu Aug 30 01:05:44 2007 +0000
+++ b/scripts/geometry/delaunay3.m	Thu Aug 30 07:25:57 2007 +0000
@@ -18,8 +18,8 @@
 ## 02110-1301, USA.
 
 ## -*- texinfo -*-
-## @deftypefn {Loadable Function} {@var{T} =} delaunay3 (@var{x}, @var{y}, @var{z})
-## @deftypefnx {Loadable Function} {@var{T} =} delaunay3 (@var{x}, @var{y}, @var{z}, @var{opt})
+## @deftypefn {Function File} {@var{T} =} delaunay3 (@var{x}, @var{y}, @var{z})
+## @deftypefnx {Function File} {@var{T} =} delaunay3 (@var{x}, @var{y}, @var{z}, @var{opt})
 ## A matrix of size [n, 4] is returned. Each row contains a 
 ## set of tetrahedron which are
 ## described by the indices to the data point vectors (x,y,z).

--- a/scripts/geometry/delaunayn.m	Thu Aug 30 01:05:44 2007 +0000
+++ b/scripts/geometry/delaunayn.m	Thu Aug 30 07:25:57 2007 +0000
@@ -18,8 +18,8 @@
 ## 02110-1301, USA.
 
 ## -*- texinfo -*-
-## @deftypefn {Loadable Function} {@var{T} =} delaunayn (@var{P})
-## @deftypefnx {Loadable Function} {@var{T} =} delaunayn (@var{P}, @var{opt})
+## @deftypefn {Function File} {@var{T} =} delaunayn (@var{P})
+## @deftypefnx {Function File} {@var{T} =} delaunayn (@var{P}, @var{opt})
 ## Form the Delaunay triangulation for a set of points.
 ## The Delaunay triangulation is a tessellation of the convex hull of the
 ## points such that no n-sphere defined by the n-triangles contains

--- a/scripts/geometry/dsearch.m	Thu Aug 30 01:05:44 2007 +0000
+++ b/scripts/geometry/dsearch.m	Thu Aug 30 07:25:57 2007 +0000
@@ -18,8 +18,8 @@
 ## 02110-1301, USA.
 
 ## -*- texinfo -*-
-## @deftypefn {Loadable Function} {@var{idx} =} dsearch (@var{x}, @var{y}, @var{tri}, @var{xi}, @var{yi})
-## @deftypefnx {Loadable Function} {@var{idx} =} dsearch (@var{x}, @var{y}, @var{tri}, @var{xi}, @var{yi}, @var{s})
+## @deftypefn {Function File} {@var{idx} =} dsearch (@var{x}, @var{y}, @var{tri}, @var{xi}, @var{yi})
+## @deftypefnx {Function File} {@var{idx} =} dsearch (@var{x}, @var{y}, @var{tri}, @var{xi}, @var{yi}, @var{s})
 ## Returns the index @var{idx} or the closest point in @code{@var{x}, @var{y})}
 ## to the elements @code{[@var{xi}(:), @var{yi}(:)]}. The variable @var{s} is
 ## accepted but ignored for compatibility.

--- a/scripts/geometry/dsearchn.m	Thu Aug 30 01:05:44 2007 +0000
+++ b/scripts/geometry/dsearchn.m	Thu Aug 30 07:25:57 2007 +0000
@@ -18,10 +18,10 @@
 ## 02110-1301, USA.
 
 ## -*- texinfo -*-
-## @deftypefn {Loadable Function} {@var{idx} =} dsearchn (@var{x}, @var{tri}, @var{xi})
-## @deftypefnx {Loadable Function} {@var{idx} =} dsearchn (@var{x}, @var{tri}, @var{xi}, @var{outval})
-## @deftypefnx {Loadable Function} {@var{idx} =} dsearchn (@var{x}, @var{xi})
-## @deftypefnx {Loadable Function} {[@var{idx}, @var{d}] =} dsearchn (@dots{})
+## @deftypefn {Function File} {@var{idx} =} dsearchn (@var{x}, @var{tri}, @var{xi})
+## @deftypefnx {Function File} {@var{idx} =} dsearchn (@var{x}, @var{tri}, @var{xi}, @var{outval})
+## @deftypefnx {Function File} {@var{idx} =} dsearchn (@var{x}, @var{xi})
+## @deftypefnx {Function File} {[@var{idx}, @var{d}] =} dsearchn (@dots{})
 ## Returns the index @var{idx} or the closest point in @var{x} to the elements
 ## @var{xi}. If @var{outval} is supplied, then the values of @var{xi} that are
 ## not contained within one of the simplicies @var{tri} are set to 

--- a/scripts/geometry/tsearchn.m	Thu Aug 30 01:05:44 2007 +0000
+++ b/scripts/geometry/tsearchn.m	Thu Aug 30 07:25:57 2007 +0000
@@ -18,7 +18,7 @@
 ## 02110-1301, USA.
 
 ## -*- texinfo -*-
-## @deftypefn {Loadable Function} {[@var{idx}, @var{p}] =} tsearchn (@var{x}, @var{t}, @var{xi})
+## @deftypefn {Function File} {[@var{idx}, @var{p}] =} tsearchn (@var{x}, @var{t}, @var{xi})
 ## Searches for the enclosing Delaunay convex hull. For @code{@var{t} =
 ## delaunayn (@var{x})}, finds the index in @var{t} containing the
 ## points @var{xi}. For points outside the convex hull, @var{idx} is NaN.