Steve Nelson wrote:
> On 2/5/07, Kent Johnson <[EMAIL PROTECTED]> wrote:
>> You can also do this operation easily with dicts (not tested!):
>
> Thank you - code now complete and tests passing. Would appreciate
> comments / criticisms. I did wonder if I should create a UrlAnalyser
> Class rather
On 2/5/07, Kent Johnson <[EMAIL PROTECTED]> wrote:
> You can also do this operation easily with dicts (not tested!):
Thank you - code now complete and tests passing. Would appreciate
comments / criticisms. I did wonder if I should create a UrlAnalyser
Class rather than have hanging methods:
#!/
Steve Nelson wrote:
> On 2/5/07, Steve Nelson <[EMAIL PROTECTED]> wrote:
>> What I want to do is now "group" these urls so that repeated urls have
>> as their "partner" a lsit of indexes. To take a test example of the
>> method I have in mind:
>>
>> def testGrouper(self):
>> """Group occurence
On 2/5/07, Steve Nelson <[EMAIL PROTECTED]> wrote:
> What I want to do is now "group" these urls so that repeated urls have
> as their "partner" a lsit of indexes. To take a test example of the
> method I have in mind:
>
> def testGrouper(self):
> """Group occurences of a record together"""
>
Hello,
I have to give a presentation this week on how the MapReduce (of
Google and Hadoop fame) algorithm works.
I understand how map() works, and how reduce() works, and having read
the google papers, I have an idea of their implementation (which I
must say takes certain liberties with FP-derive
