appendToFront semantics

[Andrei Alexandrescu]

On 2/15/11 5:21 PM, Torarin wrote:
> 2011/2/15 Andrei Alexandrescu<SeeWebsiteForEmail at erdani.org>:
>> On 2/15/11 12:10 PM, Adam Ruppe wrote:
>>>
>>> One problem with "at least" is it might have to wait for two
>>> packets to come off the network interface; could be fairly slow.
>>
>> Another is that the stream may end... so there's no guarantee.
>>
>> Andrei
>>
>
> If the stream ends it would return short. Anyway, my main point was to
> allow it to read more than n elements. So if you give it the
> definition "try to append n elements or more" it caters for the "don't
> block and don't consume more memory than this" situation as well.
>
> Torarin

I think that would work!

Andrei