kotovalexarian-likes-github/ruby--ruby
1
0
Fork 0
mirror of https://github.com/ruby/ruby.git synced 2022-11-09 12:17:21 -05:00
Code Releases Activity

* array.c (rb_ary_permutation): small dirty hack by Matz to avoid

Browse source 
arrays on stack.

git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@13591 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
This commit is contained in:
matz 2007-10-01 23:37:02 +00:00
parent 04bc87e582
commit 209b950f3f
2 changed files with 8 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

3
ChangeLog
View file

@ -6,6 +6,9 @@ Tue Oct 2 08:25:50 2007 Yukihiro Matsumoto <matz@ruby-lang.org>
* array.c (rb_ary_combination): RDoc update to clarify. a patch
from David Flanagan. [ruby-core:12344]
* array.c (rb_ary_permutation): small dirty hack by Matz to avoid
arrays on stack.
Tue Oct 2 07:01:05 2007 Koichi Sasada <ko1@atdot.net>
* proc.c (proc_dup): proc->block.proc should be self.

7
array.c
View file

@ -3036,8 +3036,11 @@ rb_ary_permutation(VALUE ary, VALUE num)
}
else { /* this is the general case */
ary = rb_ary_dup(ary); /* private defensive copy of ary */
long p[n];
int used[n];
volatile VALUE t0 = rb_str_new(0, n*sizeof(long));
long *p = (long*)RSTRING_PTR(t0); /* array indexes of current permutation */
volatile VALUE t1 = rb_str_new(0, n*sizeof(int));
int *used = (int*)RSTRING_PTR(t1); /* booleans: which indexes are already used */
for(i = 0; i < n; i++) used[i] = 0; /* initialize array */
permute0(n,r,p,0,used,ary); /* compute and yield permutations */