(tye)Re2: Efficient random hash stuff

Note that ([1,2],[3,4],[5,6],...) consumes quite a bit more memory (no, I haven't tested this) than ( [1,3,5,...], [2,4,6,...] ). I agree that this is less elegant, but if memory usage is a primary concern, then the elegance loss might be worth it.

- tye (but my friends call me "Tye")

Comment on (tye)Re2: Efficient random hash stuff Select or Download Code

Replies are listed 'Best First'.
Re: (tye)Re2: Efficient random hash stuff by japhy (Canon) on Nov 17, 2000 at 01:40 UTC
Ok, modified thus: `sub rand_element (\@); @array = ([1,3,5], [2,4,6]); # [keys], [values] ($k,$v) = rand_element(@array); sub rand_element (\@) { my $aref = shift; my $idx = rand @{$aref->[0]}; my ($k,$v) = ($aref->[0][$idx], $aref->[1][$idx]); my @last = (pop @{$aref->[0]}, pop @{$aref->[1]}); ($aref->[0][$idx],$aref->[1][$idx]) = @last if $idx < @{$aref->[0]}; return ($k,$v); }` [download] While not tested, I do belive it works -- the code has been changed only to allow for the different structure. Thanks again, tye/Tye. `$monks{japhy}++ while $posting;`	[reply] [d/l]

Replies are listed 'Best First'.

Re: (tye)Re2: Efficient random hash stuff
by japhy (Canon) on Nov 17, 2000 at 01:40 UTC

sub rand_element (\@);

@array = ([1,3,5], [2,4,6]);  # [keys], [values]
($k,$v) = rand_element(@array);

sub rand_element (\@) {
  my $aref = shift;
  my $idx = rand @{$aref->[0]};
  my ($k,$v) = ($aref->[0][$idx], $aref->[1][$idx]);
  my @last = (pop @{$aref->[0]}, pop @{$aref->[1]});
  ($aref->[0][$idx],$aref->[1][$idx]) = @last
    if $idx < @{$aref->[0]};
  return ($k,$v);
}
[download]

tye

Tye

$monks{japhy}++ while $posting;

[reply]
[d/l]