>>>>> "RA" == Rod Adams <[EMAIL PROTECTED]> writes:
>> >> My understanding is that all lists are conceptually >> lazy. "any(2..Inf)" is perfectly valid. >> >> RA> The list being fed into the junction can be lazy. But I believe that RA> the list gets iterated over completely in the creation of the RA> junction, so C< any(2..Inf) > is valid, but melts your processor RA> similar to C< sort 2..Inf >. i was under the impression that junctions could be smart about ranges like that and do it correctly. sort can't possibly handle that but some junctions and ranges would work fine. it isn't hard to convert that (with the proper boolean) to a boolean expression internally. RA> My impression has been that after the creation of a junction, the RA> values that junction has are set in stone. Allowing some form of lazy RA> list to add values at will seems a bit counter to me. But if @Cabal RA> think it's okay to have lazy junctions, I won't argue with them. lazy only when you can actually cheat IMO. uri -- Uri Guttman ------ [EMAIL PROTECTED] -------- http://www.stemsystems.com --Perl Consulting, Stem Development, Systems Architecture, Design and Coding- Search or Offer Perl Jobs ---------------------------- http://jobs.perl.org