def pi(nbits, es): # uses Bailey–Borwein–Plouffe formula q = Quire(0, nbits = nbits, es = es) q.q = q.family.pi return Posit(q)
def intpower(x): if type(x) != Posit: raise Exception("Argument must be posit") q = Quire(x) q.q = q.q.intpower() return Posit(q)
def exp(x): if type(x) != Posit: raise Exception("Argument must be posit") q = Quire(x) q.q = q.q.exp() return Posit(q)