X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;ds=sidebyside;f=partition.m;fp=partition.m;h=0000000000000000000000000000000000000000;hb=437324f2edf6b26c772080f8cbe3b321dda8d70f;hp=96ded5e194103e5a5ecaf92b0203ad74b97a87f7;hpb=f32a60e5aceefce5b4b7497b9d295c8175297110;p=octave.git

diff --git a/partition.m b/partition.m
deleted file mode 100644
index 96ded5e..0000000
--- a/partition.m
+++ /dev/null
@@ -1,28 +0,0 @@
-function [p,delta] = partition(integerN, a, b)
-  ## Partition the interval [a,b] into integerN subintervals. We do not
-  ## requite 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.
-  ##
-  ##
-
-  ## 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 = [a : delta : b];
-end