:> tree if elements are missing, either directly, or by asking the file
:> system using the above call. It's the last step from the file back to a
:> parent directory that is the hardest. Alternatively, we can back off
:> dropping the intermediate nodes and see to what extent that hurts vs.
:> he
On 21 Feb, Robert Watson wrote:
>
> On Mon, 21 Feb 2005, Igor Shmukler wrote:
>
>> > So the first thing to do is to decied what your requirements are: are you
>> > willing to fail in the edge cases like the above? If so, life is a lot
>> > easier :-).
>>
>> I guess I am willing to fail :). Per
On Mon, 21 Feb 2005, Igor Shmukler wrote:
> > So the first thing to do is to decied what your requirements are: are you
> > willing to fail in the edge cases like the above? If so, life is a lot
> > easier :-).
>
> I guess I am willing to fail :). Perhaps in some distant future, we will
> look
3 matches
Mail list logo
