On 3/4/24 22:09, Bruce Gray wrote:
On Mar 4, 2024, at 15:55, ToddAndMargo via perl6-users
wrote:
--snip--
$ raku -e '.say for .sort(*.split(/\d+/, :kv).map({ (try
.Numeric) // $_}).List)'
bk1
bk2
bk10
bk34
Yippee!
tony@rn6:/home/linuxutil1$ raku -e '.say for .sort: {
.comb(/ \d+ |
On 3/4/24 23:01, ToddAndMargo via perl6-users wrote:
No I have
Sould have been
Now I have
> On Mar 4, 2024, at 15:55, ToddAndMargo via perl6-users
> wrote:
--snip--
> $ raku -e '.say for .sort(*.split(/\d+/, :kv).map({ (try
> .Numeric) // $_}).List)'
> bk1
> bk2
> bk10
> bk34
>
> Yippee!
>
>
> tony@rn6:/home/linuxutil1$ raku -e '.say for .sort: {
> .comb(/ \d+ | \D+ /)
On 3/4/24 13:55, ToddAndMargo via perl6-users wrote:
On 3/4/24 12:40, Ralph Mellor wrote:
On Sat, Mar 2, 2024 at 6:26 AM ToddAndMargo via perl6-users
wrote:
@Sorted_List = @Sorted_List.sort: { .comb(/ \d+ | \D+ /) .map({ .Int
// .self })};
In case another answer is helpful...
First, a
On Sat, Mar 2, 2024 at 6:26 AM ToddAndMargo via perl6-users
wrote:
>
> @Sorted_List = @Sorted_List.sort: { .comb(/ \d+ | \D+ /) .map({ .Int // .self
> })};
In case another answer is helpful...
First, a simplified sort that produces the same
result as your code above:
@Sorted_List .= sort:
> @Sorted_List .= sort: *.match: / \d+ /;
> ...
> @Sorted_List .= sort: +*.match: / \d+ /;
Or perhaps easier to understand:
@Sorted_List .= sort: {m/ \d+ /.Str}
vs
@Sorted_List .= sort: {m/ \d+ /.Int}
love, raiph
On 3/4/24 12:40, Ralph Mellor wrote:
On Sat, Mar 2, 2024 at 6:26 AM ToddAndMargo via perl6-users
wrote:
@Sorted_List = @Sorted_List.sort: { .comb(/ \d+ | \D+ /) .map({ .Int // .self
})};
In case another answer is helpful...
First, a simplified sort that produces the same
result as your
