Mercurial > octave
view scripts/specfun/perms.m @ 30947:fe898ae23e0e stable
betainc.m: Use sophisticated technique for calculating exponents to avoid innacuracies (bug #62329)
* betainc.m: Use expm1() and log1p() to replace exponentiation operator ".^" in
special case code when a or b equals 1. Add BIST tests for bug #62329.
author | Nir Krakauer <nkrakauer@ccny.cuny.edu> |
---|---|
date | Tue, 19 Apr 2022 15:09:27 -0700 |
parents | 796f54d4ddbf |
children | 5d3faba0342e |
line wrap: on
line source
######################################################################## ## ## Copyright (C) 2001-2022 The Octave Project Developers ## ## See the file COPYRIGHT.md in the top-level directory of this ## distribution or <https://octave.org/copyright/>. ## ## This file is part of Octave. ## ## Octave is free software: you can redistribute it and/or modify it ## under the terms of the GNU General Public License as published by ## the Free Software Foundation, either version 3 of the License, or ## (at your option) any later version. ## ## Octave is distributed in the hope that it will be useful, but ## WITHOUT ANY WARRANTY; without even the implied warranty of ## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ## GNU General Public License for more details. ## ## You should have received a copy of the GNU General Public License ## along with Octave; see the file COPYING. If not, see ## <https://www.gnu.org/licenses/>. ## ######################################################################## ## -*- texinfo -*- ## @deftypefn {} {} perms (@var{v}) ## Generate all permutations of vector @var{v} with one row per permutation. ## ## Results are returned in inverse lexicographic order. The result has size ## @code{factorial (@var{n}) * @var{n}}, where @var{n} is the length of ## @var{v}. Any repetitions are included in the output. To generate just the ## unique permutations use @code{unique (perms (@var{v}), "rows")(end:-1:1,:)}. ## ## Example ## ## @example ## @group ## perms ([1, 2, 3]) ## @result{} ## 3 2 1 ## 3 1 2 ## 2 3 1 ## 2 1 3 ## 1 3 2 ## 1 2 3 ## @end group ## @end example ## ## Programming Note: The maximum length of @var{v} should be less than or ## equal to 10 to limit memory consumption. ## @seealso{permute, randperm, nchoosek} ## @end deftypefn ## FIXME: In principle it should be more efficient to do indexing using uint8 ## type. However, benchmarking shows doubles are faster. If this changes in ## a later version of Octave the index variables here can be made uint8. function A = perms (v) if (nargin < 1) print_usage (); endif v = v(:).'; if (isnumeric (v) || ischar (v)) ## Order of output is only dependent on the actual values for ## character and numeric arrays. v = sort (v, "ascend"); endif n = numel (v); if (n < 4) # special cases for small n switch (n) case 0 A = reshape (v, 1, 0); case 1 A = v; case 2 A = [v([2 1]);v]; case 3 A = v([3 2 1; 3 1 2; 2 3 1; 2 1 3; 1 3 2; 1 2 3]); endswitch else v = v(end:-1:1); n-= 1; idx = zeros (factorial (n), n); idx(1:6, n-2:n) = [1, 2, 3;1, 3, 2;2, 1, 3;2, 3, 1;3, 1, 2;3, 2, 1]+(n-3); f = 2; # jump-start for efficiency with medium n for j = 3:n-1 b = 1:n; f *= j; perm = idx(1:f, n-(j-1):n); idx(1:(j+1)*f, n-j) = (n-j:n)(ones (f, 1),:)(:); for i=0:j b(i+n-j) -= 1; idx((1:f)+i*f, n-(j-1):n) = b(perm); endfor endfor n += 1; f *= n-1; A = v(1)(ones (factorial (n), n)); A(:,1) = v(ones (f, 1),:)(:); for i = 1:n b = v([1:i-1 i+1:n]); A((1:f)+(i-1)*f, 2:end) = b(idx); endfor endif endfunction %!assert (rows (perms (1:6)), factorial (6)) %!assert (perms (pi), pi) %!assert (perms ([pi, e]), [pi, e; e, pi]) %!assert (perms ([1,2,3]), [3,2,1;3,1,2;2,3,1;2,1,3;1,3,2;1,2,3]) %!assert (perms (1:5), perms ([2 5 4 1 3]')) %!assert (perms ("abc"), char ("cba", "cab", "bca", "bac", "acb", "abc")) %!assert (perms ("fobar"), sortrows (unique (perms ("fobar"), "rows"), -(1:5))) %!assert (unique (perms (1:5)(:))', 1:5) %!assert (perms (int8 (1:4)), int8 (perms (1:4))) %!error <Invalid call> perms () ## Should work for any array type, such as cells and structs, and not ## only for numeric data. %!assert <*52431> (perms ({1}), {1}) %!assert <*52431> (perms ({0.1, "foo"}), {"foo", 0.1; 0.1, "foo"}) %!assert <*52431> (perms ({"foo", 0.1}), {0.1, "foo"; "foo", 0.1}) %!assert <*52431> (perms ({"foo"; 0.1}), {0.1, "foo"; "foo", 0.1}) %!assert <*52431> (perms ({0.1; "foo"}), {"foo", 0.1; 0.1, "foo"}) %!assert <*52431> (perms ({"foo", "bar"}), {"bar", "foo"; "foo", "bar"}) %!assert <*52431> (perms ({"bar", "foo"}), {"foo", "bar"; "bar", "foo"}) %! %!assert <*52431> (perms (struct ()), struct ()) %!assert <*52431> (perms (struct ("foo", {1, 2})), %! struct ("foo", {2, 1; 1, 2})) %!assert <*52431> (perms (struct ("foo", {1, 2}, "bar", {3, 4})), %! struct ("foo", {2, 1; 1, 2}, "bar", {4, 3; 3, 4})) ## Also sort logical input with order dependent on the input order and ## not their values. %!assert <*52431> (perms (logical ([1 0])), logical ([0 1;, 1 0])) %!assert <*52431> (perms (logical ([0 1])), logical ([1 0; 0 1])) %!assert <*52431> (perms (logical ([0 1 0])), %! logical ([0 1 0; 0 0 1; 1 0 0; 1 0 0; 0 0 1; 0 1 0])) %!assert <*52431> (perms (logical ([0 1 1])), %! logical ([1 1 0; 1 0 1; 1 1 0; 1 0 1; 0 1 1; 0 1 1])) %!assert <*52432> (perms ([]), reshape ([], 1, 0)) %!assert <*52432> (perms (single ([])), reshape (single ([]), 1, 0)) %!assert <*52432> (perms (int8 ([])), reshape (int8 ([]), 1, 0)) %!assert <*52432> (perms ({}), cell (1, 0)) %!test <*52432> %! s = struct (); %! s(1) = []; %! assert (perms (reshape (s, 0, 0)), reshape (s, 1, 0)); %! assert (perms (reshape (s, 0, 1)), reshape (s, 1, 0));