def alpha_(self,x):
def alpha(xmin,x=x):<EOL><INDENT>"""<STR_LIT>"""<EOL>x = [i for i in x if i>=xmin]<EOL>n = sum(x)<EOL>divsum = sum([math.log(i/xmin) for i in x])<EOL>if divsum == <NUM_LIT:0>:<EOL><INDENT>return float('<STR_LIT>')<EOL><DEDENT>a = <NUM_LIT:1> + float(n) / divsum<EOL>return a<EOL><DEDENT>return alpha<EOL>
Create a mappable function alpha to apply to each xmin in a list of xmins.
        This is essentially the slow version of fplfit/cplfit, though I bet it could
        be speeded up with a clever use of parellel_map.  Not intended to be used by users.