-
Notifications
You must be signed in to change notification settings - Fork 146
/
lib.py
81 lines (61 loc) · 2.43 KB
/
lib.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
# Licensed to the Apache Software Foundation (ASF) under one
# or more contributor license agreements. See the NOTICE file
# distributed with this work for additional information
# regarding copyright ownership. The ASF licenses this file
# to you under the Apache License, Version 2.0 (the
# "License"); you may not use this file except in compliance
# with the License. You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
import heapq
from itertools import chain, imap, izip
from math import sqrt
def identitymapper(key, value):
yield (key, value)
def identityreducer(key, values):
for value in values:
yield (key, value)
def sumreducer(key, values):
yield (key, sum(values))
def sumsreducer(key, values):
yield (key, tuple(imap(sum, izip(*values))))
def nlargestreducer(n, key=None):
def reducer(key_, values):
yield (key_, heapq.nlargest(n, chain(*values), key=key))
return reducer
def nlargestcombiner(n, key=None):
def combiner(key_, values):
yield (key_, heapq.nlargest(n, values, key=key))
return combiner
def nsmallestreducer(n, key=None):
def reducer(key_, values):
yield (key_, heapq.nsmallest(n, chain(*values), key=key))
return reducer
def nsmallestcombiner(n, key=None):
def combiner(key_, values):
yield (key_, heapq.nsmallest(n, values, key=key))
return combiner
def statsreducer(key, values):
columns = izip(*values)
s0 = sum(columns.next())
s1 = sum(columns.next())
s2 = sum(columns.next())
minimum = min(columns.next())
maximum = max(columns.next())
mean = float(s1) / s0
std = sqrt(s0 * s2 - s1**2) / s0
yield (key, (s0, mean, std, minimum, maximum))
def statscombiner(key, values):
columns = izip(*((1, value, value**2, value, value) for value in values))
s0 = sum(columns.next())
s1 = sum(columns.next())
s2 = sum(columns.next())
minimum = min(columns.next())
maximum = max(columns.next())
yield (key, (s0, s1, s2, minimum, maximum))