in reply to Re^3: Adding Unique Elements to Array
in thread Adding Unique Elements to Array

I'm not sure whether you're making your case based on cargo cultism or micro-optimization; neither is a good idea. Abusing undef benchmarks at about 20% faster than assigning empty list, but it relies on undocumented behavior.

You can get within 2% by saying

@hash{@list} x= 0;
which is still odd (and gives a warning for using uninitialized values), but is at least documented, if your code is bottlenecking at your key-creation section. In the absence of a bottleneck, it is better to write clear code than marginally faster code.

Caution: Contents may have been coded under pressure.

Replies are listed 'Best First'.
Re^5: Adding Unique Elements to Array
by ihb (Deacon) on Mar 01, 2005 at 03:19 UTC

    The fact is that your x= tricks works as just as much as the undef() because of undocumented behaviour. This is shown by

    my $foo; sub context :lvalue { $foo = wantarray ? 'list' : 'scalar' } context() x= 1; print $foo; __END__ scalar
    or using simpler means:
    use Data::Dumper; my %foo = qw/ a 1 b 2 /; @foo{qw/ a b /} x= 0; print Dumper \%foo; __END__ $VAR1 = { 'a' => '1', 'b' => '' };
    A trick that does work though is the reference trick. All these other solutions work because of autovivification. So let's use \ whose behaviour explicitly is documented.
    \@foo{@list};

    ihb

    See perltoc if you don't know which perldoc to read!

      The fact is that your x= tricks works is just as much as the undef() because of undocumented behaviour.
      No, the behavior of assignment and the x operator are defined for array slices. If you don't like the zero, one works just as well.

      That said, I like the ref trick. It's fast, documented, and not too bizarre. ++

      I've thought about it a little more, and I wonder whether it actually is documented behavior. Is \ documented for array slices? Dumper tells me it's behaving like \(), making a list of references, which is sensible. I guess a slice is a list, even without surrounding parentheses...


      Caution: Contents may have been coded under pressure.

        No, the behavior of assignment and the x operator are defined for array slices.

        Both () x EXPR and () = EXPR are defined, but () x= EXPR is another operator and doesn't work like you'd expect; in fact, () x= isn't documented and x is the only operator that can be used with = that has special semantics for its LHS operand. All other force scalar context so it's a no-brainer how they'll work for list assignment. perlop says that it works like in C, and you can then assume the following paragraph is about scalar assignment and it always talks about a singular lvalue. Only in the last paragraph list assignment is covered.

        In (context()) = EXPR the subroutine &context is called in list context; in (context()) x= EXPR it's called in scalar context. However, the lvalue of all elements in the list in (LIST) x= EXPR are taken (hence the autovivification), just as for

        sub foo {} foo(@foo{qw/a b/}); print keys %foo; # ab
        The lvalues are then put in scalar context making them not a list anymore but a sequence of scalars with the scalar-comma between them (see perlop). Why this happens I have no idea. As a consequence of the "list" of elements being "comma-separated in scalar context" all values but the last are put in void context and the last in scalar context. Example:
        use warnings; sub context { defined $_[0] ? $_[0] ? 'list' : 'scalar' : 'void' } sub foo :lvalue { print context(wantarray); my $dummy = '' } sub bar :lvalue { print context(wantarray); my $dummy = '' } my $baz; ($baz, foo(), bar()) x= 3; __END__ Useless use of private variable in void context void scalar

        Is \ documented for array slices?

        From perlref

        Taking a reference to an enumerated list is not the same as using square brackets--instead it's the same as creating a list of references!

        The explicit parenthesis isn't needed. (Just consider \qw/ foo bar /.) @foo[@bar] is a listop called aslice. I don't know if it's documented that aslice may be used instead of a list, so you may be right. It's at least more documented than the other tricks. ;-)

        ihb

        See perltoc if you don't know which perldoc to read!

Re^5: Adding Unique Elements to Array
by RazorbladeBidet (Friar) on Mar 01, 2005 at 13:34 UTC
    My only argument was to show some sort of precedence, benchmark results and optional ways of doing things. Of course there are going to be sub-optimal ways of doing things, balancing out clarity and performance. I think it is inappropriate to charge either of those with "cargo cultism" or "micro-optimization".

    The two ways presented were simply options at the disposal of the user. I agree undocumented or obfuscated code should be used with care or not at all, however I also know plenty of people that tend away from "use strict". To each their own.
    --------------
    It's sad that a family can be torn apart by such a such a simple thing as a pack of wild dogs
      When I pointed out that your examples were not good code, your response was to direct me, without further explanation, to another post which had recommended the same thing based on a slight speed advantage. So I had to surmise your reasoning: if you were defending the code based on the fact that someone else did it, it's cargo cultism; if you were defending the code based on the slight speed advantage, it's micro-optimization.

      The OP's question indicates a low level of experience (it is in the FAQ, after all -- perldoc -q duplicate). Novices especially need to be given good examples. You can't just throw bad examples at them without any warning. They don't have the experience they need to be able to judge for themselves.

      If you didn't realize that they were bad examples, well, that's why we have the ability to respond. Everybody throws out bad answers once in a while, and having them corrected is a Good Thing.


      Caution: Contents may have been coded under pressure.