Re^3: Sort undef


Come for the quick hacks, stay for the epiphanies.
	PerlMonks

by choroba (Cardinal)

on Jun 12, 2017 at 13:55 UTC ( [id://1192590]=note: print w/replies, xml )

Need Help??

> actually it works undef is not cast to "" and hence less than empty string

No, it works because sort is stable and you declared the lucky case to be the input. Try again with

use List::Util qw{ shuffle };
my @array = shuffle((undef) x 3, qw/c b a/, ("") x 3);
[download]

($q=q:Sq=~/;[c](.)(.)/;chr(-||-|5+lengthSq)`"S|oS2"`map{chr |+ord
}map{substrSq`S_+|`|}3E|-|`7**2-3:)=~y+S|`+$1,++print+eval$q,q,a,
[download]

Comment on Re^3: Sort undef Select or Download Code

Replies are listed 'Best First'.

Re^4: Sort undef
by LanX (Saint) on Jun 12, 2017 at 14:18 UTC

> you declared the lucky case to be the input

In my defence:

To be sure I also tried

my @array = ( ("")x3, (undef)x 3, qw/c b a/, ("")x3, (undef) x3 );

which still gives for cmp_undef1

[
  "",
  "",
  "",
  "",
  "",
  "",
  "a",
  "b",
  "c",
  undef,
  undef,
  undef,
  undef,
  undef,
  undef,
]
[download]

which seems to be another "lucky case".

I don't know how "stable" is defined but it turns out to be not that easy to construct a counterexample without shuffle.

my @array = ( undef, "", qw/c b a/, "", undef );

["", "a", "b", "c", undef, "", undef]

Cheers Rolf
_{(addicted to the Perl Programming Language and ☆☆☆☆ :)

Je suis Charlie!}

Domain Nodelet^?

Node Status^?

node history
Node Type: note [id://1192590]
help

Chatterbox^?

How do I use this? • Last hour • Other CB clients

Other Users^?

Others rifling through the Monastery: (4)

As of 2024-04-19 03:20 GMT

Sections^?

Information^?

Find Nodes^?

Leftovers^?

Voting Booth^?

No recent polls found