# calculate numbers as string # # current useable operators and functions: # >=<, +-*/%, // # abs, floor, ceil, toInt, toDec # str, toIntArr # copy # # '18/06/26 # Flandre Scarlet(雨宮桜) # from sys import exit import re class StrNum: def __init__(self, val=0): s = str(val) if(re.match(r'^\-?\d*\.?\d*$', s) is None or s == ''): exit("Invalid value for class StrNum(val)") # check negative pos = 1 if s[0]=='-': pos *= -1 s = s[1:] # ignore leading and ending zeros s = s.split('.') s[0] = s[0].lstrip('0') if s[0] == '': s[0] = '0' if len(s)==1: s.append('0') s[1] = s[1].rstrip('0') if s[1]=='': s[1] = '0' # sign, int, dec self.sign = 0 if s[0] == '0' == s[1] else pos self.int = s[0] self.dec = s[1] def __setattr__(self, name, val=0): if not hasattr(self, name): self.__dict__[name] = val elif name == "sign": try: val = float(val) except: exit("non-number can't be assigned to property 'StrNum.sign'") if self.sign != 0: if val > 0: self.__dict__["sign"] = 1 elif val < 0: self.__dict__["sign"] = -1 else: self.__dict__["sign"] = 0 self.__dict__["int"] = '0' self.__dict__["dec"] = '0' elif name in ["int", "dec"]: val = str(val) if re.match(r'^\d+$', val) is None: exit("non-number can't be assigned to property 'StrNum."+name+"'") elif name == "int": val = val.lstrip('0') if val == '': self.__dict__ ["int"] = '0' if self.dec == '0': self.__dict__ ["sign"] = 0 else: self.__dict__ ["int"] = val elif name == "dec": val = val.rstrip('0') if val == '': self.__dict__ ["dec"] = '0' if self.int == '0': self.__dict__ ["sign"] = 0 else: self.__dict__ ["dec"] = val else: self.__dict__[name] = val def copy(self): return StrNum(self.str()) def str(self): return ("-" if self.sign<0 else "") + self.int + ("" if self.dec=='0' else "." + self.dec) def toStrNum(var): if var.__class__ is not StrNum: if re.match(r'^\-?\d*\.?\d*$', str(var)) is None or str(var) == '': exit(str(var) + " can not be converted to 'StrNum'") else: return StrNum(str(var)) else: return var def __eq__(self, other): other = StrNum.toStrNum(other) return self.sign==other.sign and self.int==other.int and self.dec==other.dec def __lt__(self, other): other = StrNum.toStrNum(other) if self.sign!=other.sign: return self.sign0 elif len(self.int)>len(other.int): return self.sign<0 else: si, sd = self.toIntArr()[1:] oi, od = other.toIntArr()[1:] for p in range(len(si)): if si[p]0 elif si[p]>oi[p]: return self.sign<0 for p in range(len(sd)): if p==len(od): return self.sign<0 elif sd[p]0 elif sd[p]>od[p]: return self.sign<0 return len(sd)0 def __le__(self, other): return self==other or self0: return s.toInt() else: return s.toInt()-1 def ceil(self): s = self.copy() if s.dec=='0': return s elif s>0: return s.toInt()+1 else: return s.toInt() def toInt(self): self.dec = '0' if self.int=='0': self.sign = 0 return self def toDec(self): self.int = '0' if self.dec=='0': self.sign = 0 return self # [sign, intArr, decArr] def toIntArr(self, partLength=5): l = partLength try: if l<1: l = 5 l = int(l) except: exit("Number expected for 'StrNum.toIntArr(partLength)'") sign = self.sign i, d = self.int, self.dec intArr, decArr = [], [] intl, decl = len(i), len(d) a = l # index while intl-a>=0: intArr.append(int(i[intl-a: intl-a+l])) a += l if intl%l>0: intArr.append(int(i[:intl%l])) intArr = intArr[::-1] a = 0 #index while ao.sign: return s - (-o) elif o.sign>s.sign: return o - (-s) elif s.sign<0: return -((-s) + (-o)) else: # pure positive + positive s,o = s.toIntArr(),o.toIntArr() if len(s[1]) 100000: c = 1 s[2][-p-1] -= 100000 for p in range(len(s[1])): #int s[1][-p-1] += c c = 0 if s[1][-p-1] > 100000: c = 1 s[1][-p-1] -= 100000 return StrNum(str(c) + "".join([("0000"+str(p))[-5:] for p in s[1]]) + "." + "".join([("0000"+str(p))[-5:] for p in s[2]])) def __sub__(self, other): s, o = self, StrNum.toStrNum(other) if s.sign==0: return -o elif o.sign==0: return s elif s.sign>o.sign: return s + (-o) elif o.sign>s.sign: return -((-s) + o) elif s.sign<0: return (-o) - (-s) elif s=1 else 100000 def hD(intArr): if len(intArr[1])>1: return len(intArr[1])-1 elif intArr[1][0] > 0: return 0 else: for p in range(len (intArr[2])): if intArr[2][p]>0: return -p-1 q = [] # quotion ql = hD(s.toIntArr()) - hD(o. toIntArr()) + 1 # q length for p in range(ql): q.append(0) # find quotion def findQR(n,p,d): #n=p*q e5d+r k = 16 q = 0 while k > -2: test=p*(q+1)*base**d if n>test: q += 2**k k -= 1 elif n==test: return [q+1,n-test] else: test-=p*base**d if n0 and digits>0: d =5 if digits>5 else digits r *= 10**d k = r.floorDiv_mod(o) res += k[0].str() r = k[1] digits -= d return StrNum(res)*sign def __truediv__(self, other): return self.div(other,10) n = StrNum(123.456) m = StrNum(-456789012.321) m.name = "abc" print(m.name) m.name = "def" print(m.name) print(m.__dict__) print(n.__dict__) print((m/(n*n)).toInt().str())

Number as String