manstey wrote:
> But will this work if I don't know parts in advance.
Yes it will work as long as the highest part number in the whole file
is not very high. The algorithm needs only store N records in memory,
where N is the highest part number in the whole file.
> I only know parts
> by reading
But will this work if I don't know parts in advance. I only know parts
by reading through the file, which has 450,000 lines.
--
http://mail.python.org/mailman/listinfo/python-list
manstey wrote:
> Hi,
>
> I have an xml file of about 140Mb like this:
>
>
>
> ...
> 1
>
>
> ...
> 2
>
>
> ...
> 1
>
>
>
> I want to traverse it from bottom to top and add another field to each
> record 1
> which would give the highest value of wordpartWT
Hi,
I have an xml file of about 140Mb like this:
...
1
...
2
...
1
I want to traverse it from bottom to top and add another field to each
record 1
which would give the highest value of wordpartWTS for each record for
each word
so if wordparts for the
