X-Git-Url: http://gitweb.michael.orlitzky.com/?p=octave.git;a=blobdiff_plain;f=partition.m;h=ec1bc8bec617ab1e450a6f502157ce6e91cdc85e;hp=6568be38b39ba0580abef16b63d189ff4121e2fe;hb=fde7b1beb7c103ba562f35d27586c1b4d77eae75;hpb=99b641383e285ba62808678be74077485a61e024

diff --git a/partition.m b/partition.m
index 6568be3..ec1bc8b 100644
--- a/partition.m
+++ b/partition.m
@@ -1,28 +1,29 @@
 function [p,delta] = partition(integerN, a, b)
-  ## Partition the interval [a,b] into integerN subintervals. We do not
-  ## require that a<b.
-  ##
-  ## INPUTS:
-  ##
-  ##   * ``integerN`` - The number of subintervals.
-  ##
-  ##   * ``a`` - The "left" endpoint of the interval to partition.
-  ##
-  ##   * ``b`` - The "right" endpoint of the interval to partition.
-  ##
-  ##
-  ## OUTPUTS:
-  ##
-  ##   * ``p`` - The resulting partition, as a vector of length integerN+1.
-  ##
-  ##   * ``delta`` - The distance between x_i and x_{i+1} in the partition.
-  ##
-  ##
+  % Partition the interval [a,b] into integerN subintervals. We do not
+  % require that a<b.
+  %
+  % INPUT:
+  %
+  %   * ``integerN`` - The number of subintervals.
+  %
+  %   * ``a`` - The "left" endpoint of the interval to partition.
+  %
+  %   * ``b`` - The "right" endpoint of the interval to partition.
+  %
+  % OUTPUT:
+  %
+  %   * ``p`` - The resulting partition, as a column vector of length
+  %   integerN+1.
+  %
+  %   * ``delta`` - The distance between x_i and x_{i+1} in the
+  %   partition.
+  %
+  %
 
-  ## We don't use abs() here because `b` might be less than `a`. In that
-  ## case, we want delta negative so that when we add it to `a`, we move
-  ## towards `b`.
+  % We don't use abs() here because `b` might be less than `a`. In that
+  % case, we want delta negative so that when we add it to `a`, we move
+  % towards `b`.
   delta = (b - a)/integerN;
 
-  p = partition_delta(a,b,delta);
+  p = [a : delta : b]';
 end