Name	Size	Mode	Actions
abc.cpython-39.opt-1.pyc	5775	0644	editdlrm
abc.cpython-39.opt-2.pyc	3216	0644	editdlrm
abc.cpython-39.pyc	5775	0644	editdlrm
aifc.cpython-39.opt-1.pyc	25266	0644	editdlrm
aifc.cpython-39.opt-2.pyc	20059	0644	editdlrm
aifc.cpython-39.pyc	25266	0644	editdlrm
antigravity.cpython-39.opt-1.pyc	819	0644	editdlrm
antigravity.cpython-39.opt-2.pyc	675	0644	editdlrm
antigravity.cpython-39.pyc	819	0644	editdlrm
argparse.cpython-39.opt-1.pyc	63543	0644	editdlrm
argparse.cpython-39.opt-2.pyc	54179	0644	editdlrm
argparse.cpython-39.pyc	63654	0644	editdlrm
ast.cpython-39.opt-1.pyc	52332	0644	editdlrm
ast.cpython-39.opt-2.pyc	43787	0644	editdlrm
ast.cpython-39.pyc	52383	0644	editdlrm
asynchat.cpython-39.opt-1.pyc	6822	0644	editdlrm
asynchat.cpython-39.opt-2.pyc	5447	0644	editdlrm
asynchat.cpython-39.pyc	6822	0644	editdlrm
asyncore.cpython-39.opt-1.pyc	16036	0644	editdlrm
asyncore.cpython-39.opt-2.pyc	14832	0644	editdlrm
asyncore.cpython-39.pyc	16036	0644	editdlrm
base64.cpython-39.opt-1.pyc	16323	0644	editdlrm
base64.cpython-39.opt-2.pyc	10803	0644	editdlrm
base64.cpython-39.pyc	16455	0644	editdlrm
bdb.cpython-39.opt-1.pyc	24540	0644	editdlrm
bdb.cpython-39.opt-2.pyc	15503	0644	editdlrm
bdb.cpython-39.pyc	24540	0644	editdlrm
binhex.cpython-39.opt-1.pyc	12965	0644	editdlrm
binhex.cpython-39.opt-2.pyc	12431	0644	editdlrm
binhex.cpython-39.pyc	12965	0644	editdlrm
bisect.cpython-39.opt-1.pyc	2350	0644	editdlrm
bisect.cpython-39.opt-2.pyc	1038	0644	editdlrm
bisect.cpython-39.pyc	2350	0644	editdlrm
bz2.cpython-39.opt-1.pyc	11545	0644	editdlrm
bz2.cpython-39.opt-2.pyc	6529	0644	editdlrm
bz2.cpython-39.pyc	11545	0644	editdlrm
calendar.cpython-39.opt-1.pyc	27031	0644	editdlrm
calendar.cpython-39.opt-2.pyc	22439	0644	editdlrm
calendar.cpython-39.pyc	27031	0644	editdlrm
cgi.cpython-39.opt-1.pyc	26482	0644	editdlrm
cgi.cpython-39.opt-2.pyc	18056	0644	editdlrm
cgi.cpython-39.pyc	26482	0644	editdlrm
cgitb.cpython-39.opt-1.pyc	10186	0644	editdlrm
cgitb.cpython-39.opt-2.pyc	8587	0644	editdlrm
cgitb.cpython-39.pyc	10186	0644	editdlrm
chunk.cpython-39.opt-1.pyc	4841	0644	editdlrm
chunk.cpython-39.opt-2.pyc	2697	0644	editdlrm
chunk.cpython-39.pyc	4841	0644	editdlrm
cmd.cpython-39.opt-1.pyc	12676	0644	editdlrm
cmd.cpython-39.opt-2.pyc	7251	0644	editdlrm
cmd.cpython-39.pyc	12676	0644	editdlrm
code.cpython-39.opt-1.pyc	9916	0644	editdlrm
code.cpython-39.opt-2.pyc	4645	0644	editdlrm
code.cpython-39.pyc	9916	0644	editdlrm
codecs.cpython-39.opt-1.pyc	33888	0644	editdlrm
codecs.cpython-39.opt-2.pyc	18316	0644	editdlrm
codecs.cpython-39.pyc	33888	0644	editdlrm
codeop.cpython-39.opt-1.pyc	6458	0644	editdlrm
codeop.cpython-39.opt-2.pyc	2398	0644	editdlrm
codeop.cpython-39.pyc	6458	0644	editdlrm
colorsys.cpython-39.opt-1.pyc	3260	0644	editdlrm
colorsys.cpython-39.opt-2.pyc	2654	0644	editdlrm
colorsys.cpython-39.pyc	3260	0644	editdlrm
compileall.cpython-39.opt-1.pyc	12589	0644	editdlrm
compileall.cpython-39.opt-2.pyc	9330	0644	editdlrm
compileall.cpython-39.pyc	12589	0644	editdlrm
configparser.cpython-39.opt-1.pyc	45869	0644	editdlrm
configparser.cpython-39.opt-2.pyc	30729	0644	editdlrm
configparser.cpython-39.pyc	45869	0644	editdlrm
contextlib.cpython-39.opt-1.pyc	19528	0644	editdlrm
contextlib.cpython-39.opt-2.pyc	13943	0644	editdlrm
contextlib.cpython-39.pyc	19538	0644	editdlrm
contextvars.cpython-39.opt-1.pyc	245	0644	editdlrm
contextvars.cpython-39.opt-2.pyc	245	0644	editdlrm
contextvars.cpython-39.pyc	245	0644	editdlrm
copy.cpython-39.opt-1.pyc	6963	0644	editdlrm
copy.cpython-39.opt-2.pyc	4660	0644	editdlrm
copy.cpython-39.pyc	6963	0644	editdlrm
copyreg.cpython-39.opt-1.pyc	4411	0644	editdlrm
copyreg.cpython-39.opt-2.pyc	3609	0644	editdlrm
copyreg.cpython-39.pyc	4430	0644	editdlrm
cProfile.cpython-39.opt-1.pyc	5116	0644	editdlrm
cProfile.cpython-39.opt-2.pyc	4655	0644	editdlrm
cProfile.cpython-39.pyc	5116	0644	editdlrm
crypt.cpython-39.opt-1.pyc	3513	0644	editdlrm
crypt.cpython-39.opt-2.pyc	2851	0644	editdlrm
crypt.cpython-39.pyc	3513	0644	editdlrm
csv.cpython-39.opt-1.pyc	11849	0644	editdlrm
csv.cpython-39.opt-2.pyc	9808	0644	editdlrm
csv.cpython-39.pyc	11849	0644	editdlrm
dataclasses.cpython-39.opt-1.pyc	23217	0644	editdlrm
dataclasses.cpython-39.opt-2.pyc	19778	0644	editdlrm
dataclasses.cpython-39.pyc	23217	0644	editdlrm
datetime.cpython-39.opt-1.pyc	56974	0644	editdlrm
datetime.cpython-39.opt-2.pyc	48530	0644	editdlrm
datetime.cpython-39.pyc	58115	0644	editdlrm
decimal.cpython-39.opt-1.pyc	359	0644	editdlrm
decimal.cpython-39.opt-2.pyc	359	0644	editdlrm
decimal.cpython-39.pyc	359	0644	editdlrm
difflib.cpython-39.opt-1.pyc	58558	0644	editdlrm
difflib.cpython-39.opt-2.pyc	25024	0644	editdlrm
difflib.cpython-39.pyc	58580	0644	editdlrm
dis.cpython-39.opt-1.pyc	15820	0644	editdlrm
dis.cpython-39.opt-2.pyc	12013	0644	editdlrm
dis.cpython-39.pyc	15820	0644	editdlrm
doctest.cpython-39.opt-1.pyc	75832	0644	editdlrm
doctest.cpython-39.opt-2.pyc	40526	0644	editdlrm
doctest.cpython-39.pyc	76039	0644	editdlrm
enum.cpython-39.opt-1.pyc	26020	0644	editdlrm
enum.cpython-39.opt-2.pyc	21098	0644	editdlrm
enum.cpython-39.pyc	26020	0644	editdlrm
filecmp.cpython-39.opt-1.pyc	8622	0644	editdlrm
filecmp.cpython-39.opt-2.pyc	6084	0644	editdlrm
filecmp.cpython-39.pyc	8622	0644	editdlrm
fileinput.cpython-39.opt-1.pyc	13790	0644	editdlrm
fileinput.cpython-39.opt-2.pyc	8182	0644	editdlrm
fileinput.cpython-39.pyc	13790	0644	editdlrm
fnmatch.cpython-39.opt-1.pyc	3870	0644	editdlrm
fnmatch.cpython-39.opt-2.pyc	2662	0644	editdlrm
fnmatch.cpython-39.pyc	3942	0644	editdlrm
formatter.cpython-39.opt-1.pyc	17539	0644	editdlrm
formatter.cpython-39.opt-2.pyc	15099	0644	editdlrm
formatter.cpython-39.pyc	17539	0644	editdlrm
fractions.cpython-39.opt-1.pyc	18049	0644	editdlrm
fractions.cpython-39.opt-2.pyc	10849	0644	editdlrm
fractions.cpython-39.pyc	18049	0644	editdlrm
ftplib.cpython-39.opt-1.pyc	28694	0644	editdlrm
ftplib.cpython-39.opt-2.pyc	18550	0644	editdlrm
ftplib.cpython-39.pyc	28694	0644	editdlrm
functools.cpython-39.opt-1.pyc	28723	0644	editdlrm
functools.cpython-39.opt-2.pyc	22002	0644	editdlrm
functools.cpython-39.pyc	28723	0644	editdlrm
genericpath.cpython-39.opt-1.pyc	4541	0644	editdlrm
genericpath.cpython-39.opt-2.pyc	3358	0644	editdlrm
genericpath.cpython-39.pyc	4541	0644	editdlrm
getopt.cpython-39.opt-1.pyc	6242	0644	editdlrm
getopt.cpython-39.opt-2.pyc	3688	0644	editdlrm
getopt.cpython-39.pyc	6260	0644	editdlrm
getpass.cpython-39.opt-1.pyc	4200	0644	editdlrm
getpass.cpython-39.opt-2.pyc	3014	0644	editdlrm
getpass.cpython-39.pyc	4200	0644	editdlrm
gettext.cpython-39.opt-1.pyc	18073	0644	editdlrm
gettext.cpython-39.opt-2.pyc	17382	0644	editdlrm
gettext.cpython-39.pyc	18073	0644	editdlrm
glob.cpython-39.opt-1.pyc	4505	0644	editdlrm
glob.cpython-39.opt-2.pyc	3645	0644	editdlrm
glob.cpython-39.pyc	4544	0644	editdlrm
graphlib.cpython-39.opt-1.pyc	7522	0644	editdlrm
graphlib.cpython-39.opt-2.pyc	4086	0644	editdlrm
graphlib.cpython-39.pyc	7568	0644	editdlrm
gzip.cpython-39.opt-1.pyc	18494	0644	editdlrm
gzip.cpython-39.opt-2.pyc	14627	0644	editdlrm
gzip.cpython-39.pyc	18494	0644	editdlrm
hashlib.cpython-39.opt-1.pyc	5205	0644	editdlrm
hashlib.cpython-39.opt-2.pyc	4880	0644	editdlrm
hashlib.cpython-39.pyc	5205	0644	editdlrm
heapq.cpython-39.opt-1.pyc	14040	0644	editdlrm
heapq.cpython-39.opt-2.pyc	11024	0644	editdlrm
heapq.cpython-39.pyc	14040	0644	editdlrm
hmac.cpython-39.opt-1.pyc	7123	0644	editdlrm
hmac.cpython-39.opt-2.pyc	4604	0644	editdlrm
hmac.cpython-39.pyc	7123	0644	editdlrm
imaplib.cpython-39.opt-1.pyc	40507	0644	editdlrm
imaplib.cpython-39.opt-2.pyc	27824	0644	editdlrm
imaplib.cpython-39.pyc	42688	0644	editdlrm
imghdr.cpython-39.opt-1.pyc	4140	0644	editdlrm
imghdr.cpython-39.opt-2.pyc	3825	0644	editdlrm
imghdr.cpython-39.pyc	4140	0644	editdlrm
imp.cpython-39.opt-1.pyc	9851	0644	editdlrm
imp.cpython-39.opt-2.pyc	7486	0644	editdlrm
imp.cpython-39.pyc	9851	0644	editdlrm
inspect.cpython-39.opt-1.pyc	81230	0644	editdlrm
inspect.cpython-39.opt-2.pyc	56102	0644	editdlrm
inspect.cpython-39.pyc	81472	0644	editdlrm
io.cpython-39.opt-1.pyc	3408	0644	editdlrm
io.cpython-39.opt-2.pyc	1919	0644	editdlrm
io.cpython-39.pyc	3408	0644	editdlrm
ipaddress.cpython-39.opt-1.pyc	65682	0644	editdlrm
ipaddress.cpython-39.opt-2.pyc	39702	0644	editdlrm
ipaddress.cpython-39.pyc	65682	0644	editdlrm
keyword.cpython-39.opt-1.pyc	916	0644	editdlrm
keyword.cpython-39.opt-2.pyc	512	0644	editdlrm
keyword.cpython-39.pyc	916	0644	editdlrm
linecache.cpython-39.opt-1.pyc	4028	0644	editdlrm
linecache.cpython-39.opt-2.pyc	2795	0644	editdlrm
linecache.cpython-39.pyc	4028	0644	editdlrm
locale.cpython-39.opt-1.pyc	34696	0644	editdlrm
locale.cpython-39.opt-2.pyc	30078	0644	editdlrm
locale.cpython-39.pyc	34696	0644	editdlrm
lzma.cpython-39.opt-1.pyc	12094	0644	editdlrm
lzma.cpython-39.opt-2.pyc	5896	0644	editdlrm
lzma.cpython-39.pyc	12094	0644	editdlrm
mailbox.cpython-39.opt-1.pyc	60546	0644	editdlrm
mailbox.cpython-39.opt-2.pyc	53942	0644	editdlrm
mailbox.cpython-39.pyc	60600	0644	editdlrm
mailcap.cpython-39.opt-1.pyc	7239	0644	editdlrm
mailcap.cpython-39.opt-2.pyc	5669	0644	editdlrm
mailcap.cpython-39.pyc	7239	0644	editdlrm
mimetypes.cpython-39.opt-1.pyc	16015	0644	editdlrm
mimetypes.cpython-39.opt-2.pyc	10000	0644	editdlrm
mimetypes.cpython-39.pyc	16015	0644	editdlrm
modulefinder.cpython-39.opt-1.pyc	16082	0644	editdlrm
modulefinder.cpython-39.opt-2.pyc	15173	0644	editdlrm
modulefinder.cpython-39.pyc	16128	0644	editdlrm
netrc.cpython-39.opt-1.pyc	3783	0644	editdlrm
netrc.cpython-39.opt-2.pyc	3545	0644	editdlrm
netrc.cpython-39.pyc	3783	0644	editdlrm
nntplib.cpython-39.opt-1.pyc	31763	0644	editdlrm
nntplib.cpython-39.opt-2.pyc	20163	0644	editdlrm
nntplib.cpython-39.pyc	31763	0644	editdlrm
ntpath.cpython-39.opt-1.pyc	14271	0644	editdlrm
ntpath.cpython-39.opt-2.pyc	12220	0644	editdlrm
ntpath.cpython-39.pyc	14271	0644	editdlrm
nturl2path.cpython-39.opt-1.pyc	1746	0644	editdlrm
nturl2path.cpython-39.opt-2.pyc	1327	0644	editdlrm
nturl2path.cpython-39.pyc	1746	0644	editdlrm
numbers.cpython-39.opt-1.pyc	12319	0644	editdlrm
numbers.cpython-39.opt-2.pyc	8362	0644	editdlrm
numbers.cpython-39.pyc	12319	0644	editdlrm
opcode.cpython-39.opt-1.pyc	5223	0644	editdlrm
opcode.cpython-39.opt-2.pyc	5082	0644	editdlrm
opcode.cpython-39.pyc	5223	0644	editdlrm
operator.cpython-39.opt-1.pyc	13784	0644	editdlrm
operator.cpython-39.opt-2.pyc	11395	0644	editdlrm
operator.cpython-39.pyc	13784	0644	editdlrm
optparse.cpython-39.opt-1.pyc	47888	0644	editdlrm
optparse.cpython-39.opt-2.pyc	35573	0644	editdlrm
optparse.cpython-39.pyc	47943	0644	editdlrm
os.cpython-39.opt-1.pyc	31630	0644	editdlrm
os.cpython-39.opt-2.pyc	19440	0644	editdlrm
os.cpython-39.pyc	31646	0644	editdlrm
pathlib.cpython-39.opt-1.pyc	43528	0644	editdlrm
pathlib.cpython-39.opt-2.pyc	34668	0644	editdlrm
pathlib.cpython-39.pyc	43528	0644	editdlrm
pdb.cpython-39.opt-1.pyc	47547	0644	editdlrm
pdb.cpython-39.opt-2.pyc	33476	0644	editdlrm
pdb.cpython-39.pyc	47586	0644	editdlrm
pickle.cpython-39.opt-1.pyc	47012	0644	editdlrm
pickle.cpython-39.opt-2.pyc	41142	0644	editdlrm
pickle.cpython-39.pyc	47098	0644	editdlrm
pickletools.cpython-39.opt-1.pyc	66293	0644	editdlrm
pickletools.cpython-39.opt-2.pyc	57200	0644	editdlrm
pickletools.cpython-39.pyc	67107	0644	editdlrm
pipes.cpython-39.opt-1.pyc	7795	0644	editdlrm
pipes.cpython-39.opt-2.pyc	4928	0644	editdlrm
pipes.cpython-39.pyc	7795	0644	editdlrm
pkgutil.cpython-39.opt-1.pyc	18566	0644	editdlrm
pkgutil.cpython-39.opt-2.pyc	11867	0644	editdlrm
pkgutil.cpython-39.pyc	18566	0644	editdlrm
platform.cpython-39.opt-1.pyc	26416	0644	editdlrm
platform.cpython-39.opt-2.pyc	18348	0644	editdlrm
platform.cpython-39.pyc	26416	0644	editdlrm
plistlib.cpython-39.opt-1.pyc	23496	0644	editdlrm
plistlib.cpython-39.opt-2.pyc	21137	0644	editdlrm
plistlib.cpython-39.pyc	23547	0644	editdlrm
poplib.cpython-39.opt-1.pyc	13754	0644	editdlrm
poplib.cpython-39.opt-2.pyc	8824	0644	editdlrm
poplib.cpython-39.pyc	13754	0644	editdlrm
posixpath.cpython-39.opt-1.pyc	10642	0644	editdlrm
posixpath.cpython-39.opt-2.pyc	8927	0644	editdlrm
posixpath.cpython-39.pyc	10642	0644	editdlrm
pprint.cpython-39.opt-1.pyc	16797	0644	editdlrm
pprint.cpython-39.opt-2.pyc	14640	0644	editdlrm
pprint.cpython-39.pyc	16830	0644	editdlrm
profile.cpython-39.opt-1.pyc	14223	0644	editdlrm
profile.cpython-39.opt-2.pyc	11245	0644	editdlrm
profile.cpython-39.pyc	14411	0644	editdlrm
pstats.cpython-39.opt-1.pyc	23752	0644	editdlrm
pstats.cpython-39.opt-2.pyc	20843	0644	editdlrm
pstats.cpython-39.pyc	23752	0644	editdlrm
pty.cpython-39.opt-1.pyc	3956	0644	editdlrm
pty.cpython-39.opt-2.pyc	3111	0644	editdlrm
pty.cpython-39.pyc	3956	0644	editdlrm
pyclbr.cpython-39.opt-1.pyc	10449	0644	editdlrm
pyclbr.cpython-39.opt-2.pyc	6848	0644	editdlrm
pyclbr.cpython-39.pyc	10449	0644	editdlrm
pydoc.cpython-39.opt-1.pyc	85428	0644	editdlrm
pydoc.cpython-39.opt-2.pyc	75546	0644	editdlrm
pydoc.cpython-39.pyc	85460	0644	editdlrm
py_compile.cpython-39.opt-1.pyc	7396	0644	editdlrm
py_compile.cpython-39.opt-2.pyc	3658	0644	editdlrm
py_compile.cpython-39.pyc	7396	0644	editdlrm
queue.cpython-39.opt-1.pyc	10876	0644	editdlrm
queue.cpython-39.opt-2.pyc	6526	0644	editdlrm
queue.cpython-39.pyc	10876	0644	editdlrm
quopri.cpython-39.opt-1.pyc	5603	0644	editdlrm
quopri.cpython-39.opt-2.pyc	4567	0644	editdlrm
quopri.cpython-39.pyc	5747	0644	editdlrm
random.cpython-39.opt-1.pyc	22043	0644	editdlrm
random.cpython-39.opt-2.pyc	14596	0644	editdlrm
random.cpython-39.pyc	22043	0644	editdlrm
re.cpython-39.opt-1.pyc	14362	0644	editdlrm
re.cpython-39.opt-2.pyc	6024	0644	editdlrm
re.cpython-39.pyc	14362	0644	editdlrm
reprlib.cpython-39.opt-1.pyc	5307	0644	editdlrm
reprlib.cpython-39.opt-2.pyc	5151	0644	editdlrm
reprlib.cpython-39.pyc	5307	0644	editdlrm
rlcompleter.cpython-39.opt-1.pyc	5806	0644	editdlrm
rlcompleter.cpython-39.opt-2.pyc	3143	0644	editdlrm
rlcompleter.cpython-39.pyc	5806	0644	editdlrm
runpy.cpython-39.opt-1.pyc	9385	0644	editdlrm
runpy.cpython-39.opt-2.pyc	6943	0644	editdlrm
runpy.cpython-39.pyc	9385	0644	editdlrm
sched.cpython-39.opt-1.pyc	6633	0644	editdlrm
sched.cpython-39.opt-2.pyc	3605	0644	editdlrm
sched.cpython-39.pyc	6633	0644	editdlrm
secrets.cpython-39.opt-1.pyc	2180	0644	editdlrm
secrets.cpython-39.opt-2.pyc	1122	0644	editdlrm
secrets.cpython-39.pyc	2180	0644	editdlrm
selectors.cpython-39.opt-1.pyc	17245	0644	editdlrm
selectors.cpython-39.opt-2.pyc	13136	0644	editdlrm
selectors.cpython-39.pyc	17245	0644	editdlrm
shelve.cpython-39.opt-1.pyc	9544	0644	editdlrm
shelve.cpython-39.opt-2.pyc	5393	0644	editdlrm
shelve.cpython-39.pyc	9544	0644	editdlrm
shlex.cpython-39.opt-1.pyc	7734	0644	editdlrm
shlex.cpython-39.opt-2.pyc	7176	0644	editdlrm
shlex.cpython-39.pyc	7734	0644	editdlrm
shutil.cpython-39.opt-1.pyc	38497	0644	editdlrm
shutil.cpython-39.opt-2.pyc	26429	0644	editdlrm
shutil.cpython-39.pyc	38497	0644	editdlrm
signal.cpython-39.opt-1.pyc	3006	0644	editdlrm
signal.cpython-39.opt-2.pyc	2782	0644	editdlrm
signal.cpython-39.pyc	3006	0644	editdlrm
site.cpython-39.opt-1.pyc	17229	0644	editdlrm
site.cpython-39.opt-2.pyc	11555	0644	editdlrm
site.cpython-39.pyc	17229	0644	editdlrm
smtpd.cpython-39.opt-1.pyc	26524	0644	editdlrm
smtpd.cpython-39.opt-2.pyc	23904	0644	editdlrm
smtpd.cpython-39.pyc	26524	0644	editdlrm
smtplib.cpython-39.opt-1.pyc	35885	0644	editdlrm
smtplib.cpython-39.opt-2.pyc	19523	0644	editdlrm
smtplib.cpython-39.pyc	35930	0644	editdlrm
sndhdr.cpython-39.opt-1.pyc	6993	0644	editdlrm
sndhdr.cpython-39.opt-2.pyc	5718	0644	editdlrm
sndhdr.cpython-39.pyc	6993	0644	editdlrm
socket.cpython-39.opt-1.pyc	28976	0644	editdlrm
socket.cpython-39.opt-2.pyc	20437	0644	editdlrm
socket.cpython-39.pyc	29000	0644	editdlrm
socketserver.cpython-39.opt-1.pyc	25515	0644	editdlrm
socketserver.cpython-39.opt-2.pyc	14799	0644	editdlrm
socketserver.cpython-39.pyc	25515	0644	editdlrm
sre_compile.cpython-39.opt-1.pyc	14959	0644	editdlrm
sre_compile.cpython-39.opt-2.pyc	14545	0644	editdlrm
sre_compile.cpython-39.pyc	15154	0644	editdlrm
sre_constants.cpython-39.opt-1.pyc	6336	0644	editdlrm
sre_constants.cpython-39.opt-2.pyc	5911	0644	editdlrm
sre_constants.cpython-39.pyc	6336	0644	editdlrm
sre_parse.cpython-39.opt-1.pyc	21772	0644	editdlrm
sre_parse.cpython-39.opt-2.pyc	21724	0644	editdlrm
sre_parse.cpython-39.pyc	21809	0644	editdlrm
ssl.cpython-39.opt-1.pyc	45106	0644	editdlrm
ssl.cpython-39.opt-2.pyc	34122	0644	editdlrm
ssl.cpython-39.pyc	45106	0644	editdlrm
stat.cpython-39.opt-1.pyc	4372	0644	editdlrm
stat.cpython-39.opt-2.pyc	3589	0644	editdlrm
stat.cpython-39.pyc	4372	0644	editdlrm
statistics.cpython-39.opt-1.pyc	31784	0644	editdlrm
statistics.cpython-39.opt-2.pyc	15911	0644	editdlrm
statistics.cpython-39.pyc	31978	0644	editdlrm
string.cpython-39.opt-1.pyc	7165	0644	editdlrm
string.cpython-39.opt-2.pyc	6059	0644	editdlrm
string.cpython-39.pyc	7165	0644	editdlrm
stringprep.cpython-39.opt-1.pyc	9946	0644	editdlrm
stringprep.cpython-39.opt-2.pyc	9728	0644	editdlrm
stringprep.cpython-39.pyc	9986	0644	editdlrm
struct.cpython-39.opt-1.pyc	306	0644	editdlrm
struct.cpython-39.opt-2.pyc	306	0644	editdlrm
struct.cpython-39.pyc	306	0644	editdlrm
subprocess.cpython-39.opt-1.pyc	44310	0644	editdlrm
subprocess.cpython-39.opt-2.pyc	32272	0644	editdlrm
subprocess.cpython-39.pyc	44386	0644	editdlrm
sunau.cpython-39.opt-1.pyc	16817	0644	editdlrm
sunau.cpython-39.opt-2.pyc	12227	0644	editdlrm
sunau.cpython-39.pyc	16817	0644	editdlrm
symbol.cpython-39.opt-1.pyc	2579	0644	editdlrm
symbol.cpython-39.opt-2.pyc	2503	0644	editdlrm
symbol.cpython-39.pyc	2579	0644	editdlrm
symtable.cpython-39.opt-1.pyc	11088	0644	editdlrm
symtable.cpython-39.opt-2.pyc	10359	0644	editdlrm
symtable.cpython-39.pyc	11166	0644	editdlrm
sysconfig.cpython-39.opt-1.pyc	16204	0644	editdlrm
sysconfig.cpython-39.opt-2.pyc	13826	0644	editdlrm
sysconfig.cpython-39.pyc	16204	0644	editdlrm
tabnanny.cpython-39.opt-1.pyc	7065	0644	editdlrm
tabnanny.cpython-39.opt-2.pyc	6132	0644	editdlrm
tabnanny.cpython-39.pyc	7065	0644	editdlrm
tarfile.cpython-39.opt-1.pyc	73763	0644	editdlrm
tarfile.cpython-39.opt-2.pyc	58505	0644	editdlrm
tarfile.cpython-39.pyc	73778	0644	editdlrm
telnetlib.cpython-39.opt-1.pyc	18331	0644	editdlrm
telnetlib.cpython-39.opt-2.pyc	10829	0644	editdlrm
telnetlib.cpython-39.pyc	18331	0644	editdlrm
tempfile.cpython-39.opt-1.pyc	23656	0644	editdlrm
tempfile.cpython-39.opt-2.pyc	17130	0644	editdlrm
tempfile.cpython-39.pyc	23656	0644	editdlrm
textwrap.cpython-39.opt-1.pyc	13463	0644	editdlrm
textwrap.cpython-39.opt-2.pyc	6254	0644	editdlrm
textwrap.cpython-39.pyc	13521	0644	editdlrm
this.cpython-39.opt-1.pyc	1259	0644	editdlrm
this.cpython-39.opt-2.pyc	1259	0644	editdlrm
this.cpython-39.pyc	1259	0644	editdlrm
threading.cpython-39.opt-1.pyc	41716	0644	editdlrm
threading.cpython-39.opt-2.pyc	24529	0644	editdlrm
threading.cpython-39.pyc	42181	0644	editdlrm
timeit.cpython-39.opt-1.pyc	11756	0644	editdlrm
timeit.cpython-39.opt-2.pyc	5902	0644	editdlrm
timeit.cpython-39.pyc	11756	0644	editdlrm
token.cpython-39.opt-1.pyc	2496	0644	editdlrm
token.cpython-39.opt-2.pyc	2463	0644	editdlrm
token.cpython-39.pyc	2496	0644	editdlrm
tokenize.cpython-39.opt-1.pyc	17137	0644	editdlrm
tokenize.cpython-39.opt-2.pyc	13373	0644	editdlrm
tokenize.cpython-39.pyc	17165	0644	editdlrm
trace.cpython-39.opt-1.pyc	19759	0644	editdlrm
trace.cpython-39.opt-2.pyc	16744	0644	editdlrm
trace.cpython-39.pyc	19759	0644	editdlrm
traceback.cpython-39.opt-1.pyc	20440	0644	editdlrm
traceback.cpython-39.opt-2.pyc	11487	0644	editdlrm
traceback.cpython-39.pyc	20440	0644	editdlrm
tracemalloc.cpython-39.opt-1.pyc	17935	0644	editdlrm
tracemalloc.cpython-39.opt-2.pyc	16522	0644	editdlrm
tracemalloc.cpython-39.pyc	17935	0644	editdlrm
tty.cpython-39.opt-1.pyc	1078	0644	editdlrm
tty.cpython-39.opt-2.pyc	969	0644	editdlrm
tty.cpython-39.pyc	1078	0644	editdlrm
types.cpython-39.opt-1.pyc	9236	0644	editdlrm
types.cpython-39.opt-2.pyc	8014	0644	editdlrm
types.cpython-39.pyc	9236	0644	editdlrm
typing.cpython-39.opt-1.pyc	71805	0644	editdlrm
typing.cpython-39.opt-2.pyc	50557	0644	editdlrm
typing.cpython-39.pyc	71935	0644	editdlrm
uu.cpython-39.opt-1.pyc	3847	0644	editdlrm
uu.cpython-39.opt-2.pyc	3603	0644	editdlrm
uu.cpython-39.pyc	3847	0644	editdlrm
uuid.cpython-39.opt-1.pyc	22397	0644	editdlrm
uuid.cpython-39.opt-2.pyc	14684	0644	editdlrm
uuid.cpython-39.pyc	22510	0644	editdlrm
warnings.cpython-39.opt-1.pyc	13166	0644	editdlrm
warnings.cpython-39.opt-2.pyc	10891	0644	editdlrm
warnings.cpython-39.pyc	13605	0644	editdlrm
wave.cpython-39.opt-1.pyc	17844	0644	editdlrm
wave.cpython-39.opt-2.pyc	11852	0644	editdlrm
wave.cpython-39.pyc	17873	0644	editdlrm
weakref.cpython-39.opt-1.pyc	20271	0644	editdlrm
weakref.cpython-39.opt-2.pyc	16986	0644	editdlrm
weakref.cpython-39.pyc	20285	0644	editdlrm
webbrowser.cpython-39.opt-1.pyc	17565	0644	editdlrm
webbrowser.cpython-39.opt-2.pyc	15086	0644	editdlrm
webbrowser.cpython-39.pyc	17582	0644	editdlrm
xdrlib.cpython-39.opt-1.pyc	8243	0644	editdlrm
xdrlib.cpython-39.opt-2.pyc	7758	0644	editdlrm
xdrlib.cpython-39.pyc	8243	0644	editdlrm
zipapp.cpython-39.opt-1.pyc	5985	0644	editdlrm
zipapp.cpython-39.opt-2.pyc	4809	0644	editdlrm
zipapp.cpython-39.pyc	5985	0644	editdlrm
zipfile.cpython-39.opt-1.pyc	59867	0644	editdlrm
zipfile.cpython-39.opt-2.pyc	50879	0644	editdlrm
zipfile.cpython-39.pyc	59888	0644	editdlrm
zipimport.cpython-39.opt-1.pyc	17159	0644	editdlrm
zipimport.cpython-39.opt-2.pyc	13641	0644	editdlrm
zipimport.cpython-39.pyc	17237	0644	editdlrm
_aix_support.cpython-39.opt-1.pyc	3046	0644	editdlrm
_aix_support.cpython-39.opt-2.pyc	1691	0644	editdlrm
_aix_support.cpython-39.pyc	3046	0644	editdlrm
_bootlocale.cpython-39.opt-1.pyc	1217	0644	editdlrm
_bootlocale.cpython-39.opt-2.pyc	992	0644	editdlrm
_bootlocale.cpython-39.pyc	1227	0644	editdlrm
_bootsubprocess.cpython-39.opt-1.pyc	2245	0644	editdlrm
_bootsubprocess.cpython-39.opt-2.pyc	2016	0644	editdlrm
_bootsubprocess.cpython-39.pyc	2245	0644	editdlrm
_collections_abc.cpython-39.opt-1.pyc	31731	0644	editdlrm
_collections_abc.cpython-39.opt-2.pyc	26241	0644	editdlrm
_collections_abc.cpython-39.pyc	31731	0644	editdlrm
_compat_pickle.cpython-39.opt-1.pyc	5435	0644	editdlrm
_compat_pickle.cpython-39.opt-2.pyc	5435	0644	editdlrm
_compat_pickle.cpython-39.pyc	5488	0644	editdlrm
_compression.cpython-39.opt-1.pyc	4198	0644	editdlrm
_compression.cpython-39.opt-2.pyc	3984	0644	editdlrm
_compression.cpython-39.pyc	4198	0644	editdlrm
_markupbase.cpython-39.opt-1.pyc	7626	0644	editdlrm
_markupbase.cpython-39.opt-2.pyc	7248	0644	editdlrm
_markupbase.cpython-39.pyc	7777	0644	editdlrm
_osx_support.cpython-39.opt-1.pyc	11582	0644	editdlrm
_osx_support.cpython-39.opt-2.pyc	8892	0644	editdlrm
_osx_support.cpython-39.pyc	11582	0644	editdlrm
_pydecimal.cpython-39.opt-1.pyc	160613	0644	editdlrm
_pydecimal.cpython-39.opt-2.pyc	78996	0644	editdlrm
_pydecimal.cpython-39.pyc	160613	0644	editdlrm
_pyio.cpython-39.opt-1.pyc	74367	0644	editdlrm
_pyio.cpython-39.opt-2.pyc	51570	0644	editdlrm
_pyio.cpython-39.pyc	74387	0644	editdlrm
_py_abc.cpython-39.opt-1.pyc	4634	0644	editdlrm
_py_abc.cpython-39.opt-2.pyc	3421	0644	editdlrm
_py_abc.cpython-39.pyc	4656	0644	editdlrm
_sitebuiltins.cpython-39.opt-1.pyc	3501	0644	editdlrm
_sitebuiltins.cpython-39.opt-2.pyc	2977	0644	editdlrm
_sitebuiltins.cpython-39.pyc	3501	0644	editdlrm
_strptime.cpython-39.opt-1.pyc	16015	0644	editdlrm
_strptime.cpython-39.opt-2.pyc	12287	0644	editdlrm
_strptime.cpython-39.pyc	16015	0644	editdlrm
_sysconfigdata__linux_x86_64-linux-gnu.cpython-39.opt-1.pyc	30788	0644	editdlrm
_sysconfigdata__linux_x86_64-linux-gnu.cpython-39.opt-2.pyc	30788	0644	editdlrm
_sysconfigdata__linux_x86_64-linux-gnu.cpython-39.pyc	30788	0644	editdlrm
_threading_local.cpython-39.opt-1.pyc	6506	0644	editdlrm
_threading_local.cpython-39.opt-2.pyc	3186	0644	editdlrm
_threading_local.cpython-39.pyc	6506	0644	editdlrm
_weakrefset.cpython-39.opt-1.pyc	7724	0644	editdlrm
_weakrefset.cpython-39.opt-2.pyc	7724	0644	editdlrm
_weakrefset.cpython-39.pyc	7724	0644	editdlrm
__future__.cpython-39.opt-1.pyc	4126	0644	editdlrm
__future__.cpython-39.opt-2.pyc	2154	0644	editdlrm
__future__.cpython-39.pyc	4126	0644	editdlrm
__phello__.foo.cpython-39.opt-1.pyc	129	0644	editdlrm
__phello__.foo.cpython-39.opt-2.pyc	129	0644	editdlrm
__phello__.foo.cpython-39.pyc	129	0644	editdlrm

a �i:}� @spdZgd
�
Z
eZdZdZdZddlZddlZ ddl Z zddlmZ
e dd �ZWneyh


d d�ZYn0dZd ZdZdZdZdZdZdZdZdZe jdkr�dZdZdZndZdZdZeedZGdd�de�Z Gdd�de �Z!Gdd �d e �Z"Gd!d"�d"e"�Z#Gd#d$�d$e e$�Z%Gd%d&�d&e"�Z&Gd'd(�d(e"e$�Z'Gd)d*�d*e �Z(Gd+d,�d,e"�Z)Gd-d.�d.e �Z*Gd/d0�d0e �Z+Gd1d2�d2e(e*�Z,Gd3d4�d4e(e*e+�Z-Gd5d6�d6e e.�Z/e!e%e(e,e*e-e"e+e/g Z0e#e"e&e"e'e"e)e"iZ1eeeeeeeefZ2ddl3Z3e3�4d7�
Z5d8d9�Z6d:d;�Z7[3d�dd?�d?e9�Z:d�dAdB�
Z;e j<�=e:�

GdCdD�dDe9�Z>GdEdF�dFe9�Z?GdGdH�dHe9�Z@d�dIdJ�
ZAeBjCZDdKdL�ZEdMdN�ZFdOdP�ZGdQdR�ZHd�dTdU�
ZIdVdW�ZJdXdY�ZKGdZd[�d[e9�ZLeL�jMZNd�d\d]�
ZOd^d_�ZPd`da�ZQdbdcdddedfdgdhdidjdk� f
dldm�
ZRd�dndo�
ZSd�dpdq�
ZTe?dree%e,e"ggdsdtdddu�ZUe?dvee%e,e"e!e-ggdw�ZVe?dveggdw�ZWddlXZXeX�YdxeXjZeXj[B�j\Z]eX�Ydy�
j\Z^eX�Ydz�
j\Z_eX�Yd{eXjZeXj`B�Za[XzddlbZcWne�y�


Yn0d�d|d}�
Zdd~d�Zed�d��Zfd�d�d��
Zgd�d��Zhd�d��Zie:d��
Zje:d��
Zke:d��
Zle:d�
Zme:d�
Zne:d��
ZoejekfZpe jqjrZse jqjtZue jqjvZwexdiesd�es�Zy[ dS)�a� This is an implementation of decimal floating point arithmetic based on the General Decimal Arithmetic Specification: http://speleotrove.com/decimal/decarith.html and IEEE standard 854-1987: http://en.wikipedia.org/wiki/IEEE_854-1987 Decimal floating point has finite precision with arbitrarily large bounds. The purpose of this module is to support arithmetic using familiar "schoolhouse" rules and to avoid some of the tricky representation issues associated with binary floating point. The package is especially useful for financial applications or for contexts where users have expectations that are at odds with binary floating point (for instance, in binary floating point, 1.00 % 0.1 gives 0.09999999999999995 instead of 0.0; Decimal('1.00') % Decimal('0.1') returns the expected Decimal('0.00')). Here are some examples of using the decimal module: >>> from decimal import * >>> setcontext(ExtendedContext) >>> Decimal(0) Decimal('0') >>> Decimal('1') Decimal('1') >>> Decimal('-.0123') Decimal('-0.0123') >>> Decimal(123456) Decimal('123456') >>> Decimal('123.45e12345678') Decimal('1.2345E+12345680') >>> Decimal('1.33') + Decimal('1.27') Decimal('2.60') >>> Decimal('12.34') + Decimal('3.87') - Decimal('18.41') Decimal('-2.20') >>> dig = Decimal(1) >>> print(dig / Decimal(3)) 0.333333333 >>> getcontext().prec = 18 >>> print(dig / Decimal(3)) 0.333333333333333333 >>> print(dig.sqrt()) 1 >>> print(Decimal(3).sqrt()) 1.73205080756887729 >>> print(Decimal(3) ** 123) 4.85192780976896427E+58 >>> inf = Decimal(1) / Decimal(0) >>> print(inf) Infinity >>> neginf = Decimal(-1) / Decimal(0) >>> print(neginf) -Infinity >>> print(neginf + inf) NaN >>> print(neginf * inf) -Infinity >>> print(dig / 0) Infinity >>> getcontext().traps[DivisionByZero] = 1 >>> print(dig / 0) Traceback (most recent call last): ... ... ... decimal.DivisionByZero: x / 0 >>> c = Context() >>> c.traps[InvalidOperation] = 0 >>> print(c.flags[InvalidOperation]) 0 >>> c.divide(Decimal(0), Decimal(0)) Decimal('NaN') >>> c.traps[InvalidOperation] = 1 >>> print(c.flags[InvalidOperation]) 1 >>> c.flags[InvalidOperation] = 0 >>> print(c.flags[InvalidOperation]) 0 >>> print(c.divide(Decimal(0), Decimal(0))) Traceback (most recent call last): ... ... ... decimal.InvalidOperation: 0 / 0 >>> print(c.flags[InvalidOperation]) 1 >>> c.flags[InvalidOperation] = 0 >>> c.traps[InvalidOperation] = 0 >>> print(c.divide(Decimal(0), Decimal(0))) NaN >>> print(c.flags[InvalidOperation]) 1 >>> )%�Decimal�Context�DecimalTuple�DefaultContext�BasicContext�ExtendedContext�DecimalException�Clamped�InvalidOperation�DivisionByZero�Inexact�Rounded� Subnormal�Overflow� Underflow�FloatOperation�DivisionImpossible�InvalidContext�ConversionSyntax�DivisionUndefined� ROUND_DOWN� ROUND_HALF_UP�ROUND_HALF_EVEN� ROUND_CEILING�ROUND_FLOOR�ROUND_UP�ROUND_HALF_DOWN� ROUND_05UP� setcontext� getcontext�localcontext�MAX_PREC�MAX_EMAX�MIN_EMIN� MIN_ETINY�HAVE_THREADS�HAVE_CONTEXTVARZdecimalz1.70z2.4.2�N)
� namedtuplerzsign digits exponentc

Gs|S�
N�)
�argsr)r)�"/usr/lib64/python3.9/_pydecimal.py���r,rrrrrrrrTl����l��N�Zol������N�Zoi@�Ti����
c@seZ
dZd
Zdd�ZdS)ra1Base exception class. Used exceptions derive from this. If an exception derives from another exception besides this (such as Underflow (Inexact, Rounded, Subnormal) that indicates that it is only called if the others are present. This isn't actually used for anything, though. handle -- Called when context._raise_error is called and the trap_enabler is not set. First argument is self, second is the context. More arguments can be given, those being after the explanation in _raise_error (For example, context._raise_error(NewError, '(-x)!', self._sign) would call NewError().handle(context, self._sign).) To define a new exception, it should be sufficient to have it derive from DecimalException. c
GsdSr(r)��self�contextr*r)r)r+�handle�s
zDecimalException.handleN��__name__� __module__�__qualname__�__doc__r2r)r)r)r+r�s
rc
@seZ
dZd
ZdS)ra)Exponent of a 0 changed to fit bounds. This occurs and signals clamped if the exponent of a result has been altered in order to fit the constraints of a specific concrete representation. This may occur when the exponent of a zero result would be outside the bounds of a representation, or when a large normal number would have an encoded exponent that cannot be represented. In this latter case, the exponent is reduced to fit and the corresponding number of zero digits are appended to the coefficient ("fold-down"). N�r4r5r6r7r)r)r)r+r�s
rc@seZ
dZd
Zdd�ZdS)r a0An invalid operation was performed. Various bad things cause this: Something creates a signaling NaN -INF + INF 0 * (+-)INF (+-)INF / (+-)INF x % 0 (+-)INF % x x._rescale( non-integer ) sqrt(-x) , x > 0 0 ** 0 x ** (non-integer) x ** (+-)INF An operand is invalid The result of the operation after these is a quiet positive NaN, except when the cause is a signaling NaN, in which case the result is also a quiet NaN, but with the original sign, and an optional diagnostic information. cGs,|r(t|d
j
|d
jdd�}|�|
�
StS)Nr&�
nT)�_dec_from_triple�_sign�_int�_fix_nan�_NaN)r0r1r*�ansr)r)r+r2�s



zInvalidOperation.handleNr3r)r)r)r+r �s
r c@seZ
dZd
Zdd�ZdS)rz�Trying to convert badly formed string. This occurs and signals invalid-operation if a string is being converted to a number and it does not conform to the numeric string syntax. The result is [0,qNaN]. c
GstSr(�
r>r/r)r)r+r2
s
zConversionSyntax.handleNr3r)r)r)r+r
s
rc@seZ
dZd
Zdd�ZdS)r a�
Division by 0. This occurs and signals division-by-zero if division of a finite number by zero was attempted (during a divide-integer or divide operation, or a power operation with negative right-hand operand), and the dividend was not zero. The result of the operation is [sign,inf], where sign is the exclusive or of the signs of the operands for divide, or is 1 for an odd power of -0, for power. cGst|Sr()
�_SignedInfinity�r0r1�signr*r)r)r+r2
s
zDivisionByZero.handleNr3r)r)r)r+r
s
r c@seZ
dZd
Zdd�ZdS)rz�Cannot perform the division adequately. This occurs and signals invalid-operation if the integer result of a divide-integer or remainder operation had too many digits (would be longer than precision). The result is [0,qNaN]. c
GstSr(r@r/r)r)r+r2"
s
zDivisionImpossible.handleNr3r)r)r)r+r
s
rc@seZ
dZd
Zdd�ZdS)rz�Undefined result of division. This occurs and signals invalid-operation if division by zero was attempted (during a divide-integer, divide, or remainder operation), and the dividend is also zero. The result is [0,qNaN]. c
GstSr(r@r/r)r)r+r2-
s
zDivisionUndefined.handleNr3r)r)r)r+r%
s
rc
@seZ
dZd
ZdS)ra�
Had to round, losing information. This occurs and signals inexact whenever the result of an operation is not exact (that is, it needed to be rounded and any discarded digits were non-zero), or if an overflow or underflow condition occurs. The result in all cases is unchanged. The inexact signal may be tested (or trapped) to determine if a given operation (or sequence of operations) was inexact. Nr8r)r)r)r+r0
s
rc@seZ
dZd
Zdd�ZdS)ra�
Invalid context. Unknown rounding, for example. This occurs and signals invalid-operation if an invalid context was detected during an operation. This can occur if contexts are not checked on creation and either the precision exceeds the capability of the underlying concrete representation or an unknown or unsupported rounding was specified. These aspects of the context need only be checked when the values are required to be used. The result is [0,qNaN]. c
GstSr(r@r/r)r)r+r2G
s
zInvalidContext.handleNr3r)r)r)r+r<
s
 rc
@seZ
dZd
ZdS)ra�
Number got rounded (not necessarily changed during rounding). This occurs and signals rounded whenever the result of an operation is rounded (that is, some zero or non-zero digits were discarded from the coefficient), or if an overflow or underflow condition occurs. The result in all cases is unchanged. The rounded signal may be tested (or trapped) to determine if a given operation (or sequence of operations) caused a loss of precision. Nr8r)r)r)r+rJ
s
rc
@seZ
dZd
ZdS)r a�
Exponent < Emin before rounding. This occurs and signals subnormal whenever the result of a conversion or operation is subnormal (that is, its adjusted exponent is less than Emin, before any rounding). The result in all cases is unchanged. The subnormal signal may be tested (or trapped) to determine if a given or operation (or sequence of operations) yielded a subnormal result. Nr8r)r)r)r+r V
s
r c@seZ
dZd
Zdd�ZdS)raNumerical overflow. This occurs and signals overflow if the adjusted exponent of a result (from a conversion or from an operation that is not an attempt to divide by zero), after rounding, would be greater than the largest value that can be handled by the implementation (the value Emax). The result depends on the rounding mode: For round-half-up and round-half-even (and for round-half-down and round-up, if implemented), the result of the operation is [sign,inf], where sign is the sign of the intermediate result. For round-down, the result is the largest finite number that can be represented in the current precision, with the sign of the intermediate result. For round-ceiling, the result is the same as for round-down if the sign of the intermediate result is 1, or is [0,inf] otherwise. For round-floor, the result is the same as for round-down if the sign of the intermediate result is 0, or is [1,inf] otherwise. In all cases, Inexact and Rounded will also be raised. cGs�|
jt
tttfvrt|S|d
krR|
jtkr4t|St|d|
j|
j |
jd�S|dkr�|
jt krlt|St|d|
j|
j |
jd�SdS)Nr&�
9r.)�roundingrrrrrArr:�prec�EmaxrrBr)r)r+r2w
s

�




�



�zOverflow.handleNr3r)r)r)r+ra
s
rc
@seZ
dZd
ZdS)raxNumerical underflow with result rounded to 0. This occurs and signals underflow if a result is inexact and the adjusted exponent of the result would be smaller (more negative) than the smallest value that can be handled by the implementation (the value Emin). That is, the result is both inexact and subnormal. The result after an underflow will be a subnormal number rounded, if necessary, so that its exponent is not less than Etiny. This may result in 0 with the sign of the intermediate result and an exponent of Etiny. In all cases, Inexact, Rounded, and Subnormal will also be raised. Nr8r)r)r)r+r�
s
rc
@seZ
dZd
ZdS)ra�Enable stricter semantics for mixing floats and Decimals. If the signal is not trapped (default), mixing floats and Decimals is permitted in the Decimal() constructor, context.create_decimal() and all comparison operators. Both conversion and comparisons are exact. Any occurrence of a mixed operation is silently recorded by setting FloatOperation in the context flags. Explicit conversions with Decimal.from_float() or context.create_decimal_from_float() do not set the flag. Otherwise (the signal is trapped), only equality comparisons and explicit conversions are silent. All other mixed operations raise FloatOperation. Nr8r)r)r)r+r�
s
rZdecimal_contextc
Cs6z t�
�WSty0


t�}t�|�

|YS0d
S)z�Returns this thread's context. If this thread does not yet have a context, returns a new context and sets this thread's context. New contexts are copies of DefaultContext. N)�_current_context_var�get�LookupErrorr�set�
r1r)r)r+r�
s




rc

Cs,|tt
tfvr|��}|��
t�|�

d
S)z%Set this thread's context to context.N)rrr�copy�clear_flagsrHrKrLr)r)r+r�
s


rc

Cs|d
urt�}t
|�
S)abReturn a context manager for a copy of the supplied context Uses a copy of the current context if no context is specified The returned context manager creates a local decimal context in a with statement: def sin(x): with localcontext() as ctx: ctx.prec += 2 # Rest of sin calculation algorithm # uses a precision 2 greater than normal return +s # Convert result to normal precision def sin(x): with localcontext(ExtendedContext): # Rest of sin calculation algorithm # uses the Extended Context from the # General Decimal Arithmetic Specification return +s # Convert result to normal context >>> setcontext(DefaultContext) >>> print(getcontext().prec) 28 >>> with localcontext(): ... ctx = getcontext() ... ctx.prec += 2 ... print(ctx.prec) ... 30 >>> with localcontext(ExtendedContext): ... print(getcontext().prec) ... 9 >>> print(getcontext().prec) 28 N)r�_ContextManager)
�ctxr)r)r+r�
s$
rc @s�eZ
dZd
ZdZd�dd�
Zedd��
Zd d �Zdd�Z d�d d�
Z dd�Zdd�Zdd�Z d�dd�
Zd�dd�
Zd�dd�
Zd�dd�
Zd�dd�
Zd�dd �
Zd!d"�Zd#d$�Zd%d&�Zd'd(�Zd�d*d+�
Zd�d,d-�
Zd�d.d/�
Zd�d0d1�
Zd�d3d4�
Zd�d5d6�
ZeZ�
dd7d8�
Z�
d
d9d:�
Z �
dd;d<�
Z!e!Z"�
dd=d>�
Z#d?d@�Z$�
ddAdB�
Z%�
ddCdD�
Z&�
ddEdF�
Z'�
ddGdH�
Z(�
ddIdJ�
Z)�
d dKdL�
Z*�
d dMdN�
Z+�
ddOdP�
Z,dQdR�Z-dSdT�Z.e.Z/e0dUdV��
Z1e0dWdX��
Z2dYdZ�Z3d[d\�Z4d]d^�Z5d_d`�Z6dadb�Z7dcdd�Z8dedf�Z9dgdh�Z:didj�Z;dkdl�Ze?e7e8e9e:e;edq�Z@�
ddrds�
ZAdtdu�ZBdvdw�ZC�
d dxdy�
ZD�
ddzd{�
ZEd|d}�ZF�
dd~d�
ZG�
dd�d��
ZH�
dd�d��
ZI�
dd�d��
ZJ�
dd�d��
ZKd�d��ZLd�d��ZM�
dd�d��
ZN�
dd�d��
ZOeOZP�
dd�d��
ZQ�
dd�d��
ZR�
dd�d��
ZSd�d��ZTd�d��ZUd�d��ZVd�d��ZW�
dd�d��
ZX�
dd�d��
ZY�
dd�d��
ZZd�d��Z[d�d��Z\�
dd�d��
Z]�
dd�d��
Z^d�d��Z_d�d��Z`d�d��Zad�d��Zb�
dd�d��
Zcd�d��Zdd�d��Zed�d��Zf�
dd�d��
Zgd�d��Zhd�d��Zi�
d d�dÄ
Zjd�dńZk�
d!d�dDŽ
Zl�
d"d�dɄ
Zmd�d˄Znd�d̈́Zo�
d#d�dτ
Zp�
d$d�dф
Zq�
d%d�dӄ
Zr�
d&d�dՄ
Zs�
d'd�dׄ
Zt�
d(d�dل
Zu�
d)d�dۄ
Zv�
d*d�d݄
Zw�
d+d�d߄
Zx�
d,d�d�
Zyd�d�Zz�
d-d�d�
Z{�
d.d�d�
Z|�
d/d�d�
Z}d�d�Z~d�d�Zd�d�Z��
d0d�d�
Z�dS(1
r
z,Floating point class for decimal arithmetic.)�_expr<r;�_is_special�
0NcCs�t�
|�
}t|
t��
r$t|
���d
d��
}|durP|dur@t�}|�t d|
�S|� d�
dkrfd|_nd|_|� d �
}|du
r�|� d �
p�d}t|� d�
p�d�
}tt||�
�
|_ |t|�
|_d |_nZ|� d�
}|du
�
rtt|p�d�
�
�d�
|_ |� d�
�
rd|_nd|_nd|_ d|_d|_|St|
t��
rf|
dk�
rBd|_nd|_d|_tt|
�
�
|_ d |_|St|
t��
r�|
j|_|
j|_|
j |_ |
j|_|St|
t��
r�|
j|_t|
j�
|_ t|
j�
|_d |_|St|
ttf��r"t|
�
dk�
r�td�
�
t|
dt��r|
ddv�std�
�
|
d|_|
ddk�rHd|_ |
d|_d|_n�g} |
dD]R} t| t��r�d| k
�r|dk
�r�n
n| �s�| dk�r�| �| �

ntd�
�
�qT|
ddv�r�d�tt| ��
|_ |
d|_d|_nDt|
dt��rd�tt| �p�dg
��
|_ |
d|_d |_ntd�
�
|St|
t��rx|du�r>t�}|�td�
t�|
�
}
|
j|_|
j|_|
j |_ |
j|_|St d|
�
�
dS)a�
Create a decimal point instance. >>> Decimal('3.14') # string input Decimal('3.14') >>> Decimal((0, (3, 1, 4), -2)) # tuple (sign, digit_tuple, exponent) Decimal('3.14') >>> Decimal(314) # int Decimal('314') >>> Decimal(Decimal(314)) # another decimal instance Decimal('314') >>> Decimal(' 3.14 \n') # leading and trailing whitespace okay Decimal('3.14') �
_�NzInvalid literal for Decimal: %rrC�
-r.r&�intZfrac�exprSF�diag�signal�
Nr9�
FT�ztInvalid tuple size in creation of Decimal from list or tuple. The list or tuple should have exactly three elements.�r&r.z|Invalid sign. The first value in the tuple should be an integer; either 0 for a positive number or 1 for a negative number.�� zTThe second value in the tuple must be composed of integers in the range 0 through 9.�r9r[zUThe third value in the tuple must be an integer, or one of the strings 'F', 'n', 'N'.�;strict semantics for mixing floats and Decimals are enabledzCannot convert %r to Decimal)!�object�__new__� isinstance�str�_parser�strip�replacer�_raise_errorr�groupr;rWr<�lenrQrR�lstrip�absr
�_WorkReprCrX�list�tuple� ValueError�append�join�map�floatr� from_float� TypeError)�cls�valuer1r0�
m�intpart�fracpartrXrY�digitsZdigitr)r)r+rd s� 





�




































(









�




zDecimal.__new__cCs�t|
t
�r,|
d
krd
nd}d
}tt|
�
�
}nzt|
t�r�t�|
�
sJt�|
�
rV|t|
�
�
St� d|
�dkrld
}nd}t|
�
� �\}}|��d}t|d|�
}ntd�
�
t |||�}|tur�|S||�
SdS)a.Converts a float to a decimal number, exactly. Note that Decimal.from_float(0.1) is not the same as Decimal('0.1'). Since 0.1 is not exactly representable in binary floating point, the value is stored as the nearest representable value which is 0x1.999999999999ap-4. The exact equivalent of the value in decimal is 0.1000000000000000055511151231257827021181583404541015625. >>> Decimal.from_float(0.1) Decimal('0.1000000000000000055511151231257827021181583404541015625') >>> Decimal.from_float(float('nan')) Decimal('NaN') >>> Decimal.from_float(float('inf')) Decimal('Infinity') >>> Decimal.from_float(-float('inf')) Decimal('-Infinity') >>> Decimal.from_float(-0.0) Decimal('-0') r&r.g�?�zargument must be int or float.N)rerWrfrnrv�_math�isinf�isnan�repr�copysign�as_integer_ratio� bit_lengthrxr:r
)ry�
frC�
k�coeffr9�
d�resultr)r)r+rw�s$












zDecimal.from_floatc
Cs(|jr$|j
}
|
d
krdS|
dkr$dSdS)zrReturns whether the number is not actually one. 0 if a number 1 if NaN 2 if sNaN r9r.r[r_r&)rRrQ)r0rXr)r)r+�_isnan�s





zDecimal._isnanc

Cs|jd
kr|j
rdSdSdS)zyReturns whether the number is infinite 0 if finite or not a number 1 if +INF -1 if -INF r\�����r.r&)rQr;�
r0r)r)r+�_isinfinity�s 



zDecimal._isinfinitycCs||��}|
d
urd}n|
��}|s&|rx|d
ur4t
�}|dkrJ|�td|�S|dkr`|�td|
�S|rn|�|�
S|
�|�
SdS)z�Returns whether the number is not actually one. if self, other are sNaN, signal if self, other are NaN return nan return 0 Done before operations. NFr_�sNaNr&)r�rrjr r=)r0�otherr1�self_is_nan�other_is_nanr)r)r+�_check_nans�s& 





�

�

zDecimal._check_nanscCsv|d
urt�}|j
s|
j
rr|��r0|�td|�S|
��rF|�td|
�S|��r\|�td|�S|
��rr|�td|
�SdS)aC
Version of _check_nans used for the signaling comparisons compare_signal, __le__, __lt__, __ge__, __gt__. Signal InvalidOperation if either self or other is a (quiet or signaling) NaN. Signaling NaNs take precedence over quiet NaNs. Return 0 if neither operand is a NaN. Nzcomparison involving sNaNzcomparison involving NaNr&)rrR�is_snanrjr �is_qnan�r0r�r1r)r)r+�_compare_check_nans s0




�


�


�


�zDecimal._compare_check_nansc

Cs|jp|j
d
kS)zuReturn True if self is nonzero; otherwise return False. NaNs and infinities are considered nonzero. rS�rRr<r�r)r)r+�__bool__*szDecimal.__bool__cCs
|js|
jr8|�
�}|
�
�}||kr(d
S||kr4dSdS|sP|
sDd
Sd|
jS|
s^d|jS|
j|jkrndS|j|
jkr~dS|��}|
��}||kr�|jd|j|
j}|
jd|
j|j}||kr�d
S||kr�d|jSd|jSn ||k�
rd|jSd|jSdS)z�Compare the two non-NaN decimal instances self and other. Returns -1 if self < other, 0 if self == other and 1 if self > other. This routine is for internal use only.r&r�r.rSN)rRr�r;�adjustedr<rQ)r0r�Zself_infZ other_inf� self_adjustedZother_adjusted�self_paddedZother_paddedr)r)r+�_cmp1s>






















zDecimal._cmpcCs<t||
d
d�\}}
|
t
ur|
S|�|
|�r.dS|�|
�
dkS)NT)
�equality_opFr&)�_convert_for_comparison�NotImplementedr�r�r�r)r)r+�__eq__qs





zDecimal.__eq__cCs<t||
�\}}
|
t
ur|
S|�|
|�}|r.d
S|�|
�
dkS�NFr&�r�r�r�r��r0r�r1r?r)r)r+�__lt__ys






zDecimal.__lt__cCs<t||
�\}}
|
t
ur|
S|�|
|�}|r.d
S|�|
�
dk
Sr�r�r�r)r)r+�__le__�s






zDecimal.__le__cCs<t||
�\}}
|
t
ur|
S|�|
|�}|r.d
S|�|
�
dkSr�r�r�r)r)r+�__gt__�s






zDecimal.__gt__cCs<t||
�\}}
|
t
ur|
S|�|
|�}|r.d
S|�|
�
dkSr�r�r�r)r)r+�__ge__�s






zDecimal.__ge__cCs>t|
d
d�}
|j
s|
r0|
j
r0|�|
|�}|r0|St|�|
�
�
S)z�Compare self to other. Return a decimal value: a or b is a NaN ==> Decimal('NaN') a < b ==> Decimal('-1') a == b ==> Decimal('0') a > b ==> Decimal('1') T�
�raiseit)�_convert_otherrRr�r
r�r�r)r)r+�compare�s


zDecimal.comparec
Cs�|jr4|�
�rtd
�
�
n|��r$tS|jr0tStS|jdkrNtd|jt �}
ntt |jt �}
t|j�
|
t }|dkr||n|}|dkr�dS|S)zx.__hash__() <==> hash(x)z"Cannot hash a signaling NaN value.r&� r������) rRr�rx�is_nan�_PyHASH_NANr;�_PyHASH_INFrQ�pow�_PyHASH_MODULUS� _PyHASH_10INVrWr<)r0Zexp_hashZhash_r?r)r)r+�__hash__�s








zDecimal.__hash__c

Cst|j
ttt|j��
|j�S)
zeRepresents the number as a triple tuple. To show the internals exactly as they are. )rr;rqrurWr<rQr�r)r)r+�as_tuple�szDecimal.as_tuplec
Cs�|jr |�
�rtd
�
�
ntd�
�
|s(dSt|j�
}
|jdkrR|
d|jd}
}nn|j}|dkr�|
ddkr�|
d}
|d8}qZ|j}t|
|
@��d|�}|r�|
|L}
||8}d||>}|j r�|
}
|
|fS)a�
Express a finite Decimal instance in the form n / d. Returns a pair (n, d) of integers. When called on an infinity or NaN, raises OverflowError or ValueError respectively. >>> Decimal('3.14').as_integer_ratio() (157, 50) >>> Decimal('-123e5').as_integer_ratio() (-12300000, 1) >>> Decimal('0.00').as_integer_ratio() (0, 1) z#cannot convert NaN to integer ratioz(cannot convert Infinity to integer ratior^r&r�r.r) rRr�rr� OverflowErrorrWr<rQ�minr�r;)r0r9r�Zd5Zd2Zshift2r)r)r+r��s,












zDecimal.as_integer_ratioc

Csd
t|�
S)z0Represents the number as an instance of Decimal.z Decimal('%s'))
rfr�r)r)r+�__repr__szDecimal.__repr__Fc Csb
d
dg|j}|j
rL|jdkr&|dS|jdkr>|d|jS|d|jS|jt|j�
}|jdk
rt|d krt|}n6|
s~d }n,|jdkr�|d dd }n|d dd }|dk
r�d}d d||j}nL|t|j�
kr�|jd|t|j�
}d
}n |jd|�}d |j|d�}||k�
r(d
}n*|du�
r8t�}ddg|jd||}||||S)z�Return string representation of the number in scientific notation. Captures all of the information in the underlying representation. rUrVr\ZInfinityr9�NaNr�r&�����r.rSr]�
.N�
e�
Ez%+d)r;rRrQr<rlr�capitals) r0�engr1rC� leftdigits�dotplacer|r}rXr)r)r+�__str__s:
















zDecimal.__str__cCs|jd
|
d�S)a,
Convert to a string, using engineering notation if an exponent is needed. Engineering notation has an exponent which is a multiple of 3. This can leave up to 3 digits to the left of the decimal place and may require the addition of either one or two trailing zeros. T)r�r1)
r��r0r1r)r)r+� to_eng_string;szDecimal.to_eng_stringcCsR|jr|j
|
d
�
}|r|S|
dur(t�}
|s@|
jtkr@|��}n|��}|�|
�
S)zRReturns a copy with the sign switched. Rounds, if it has reason. rLN)rRr�rrEr�copy_abs�copy_negate�_fix�r0r1r?r)r)r+�__neg__Ds



 zDecimal.__neg__cCsR|jr|j
|
d
�
}|r|S|
dur(t�}
|s@|
jtkr@|��}nt|�
}|�|
�
S)zhReturns a copy, unless it is a sNaN. Rounds the number (if more than precision digits) rLN)rRr�rrErr�r
r�r�r)r)r+�__pos__Zs



 zDecimal.__pos__TcCsJ|
s|��S|j
r&|j|d
�
}|r&|S|jr:|j|d
�
}n|j|d
�
}|S)z�Returns the absolute value of self. If the keyword argument 'round' is false, do not round. The expression self.__abs__(round=False) is equivalent to self.copy_abs(). rL)r�rRr�r;r�r�)r0�roundr1r?r)r)r+�__abs__os




zDecimal.__abs__c Csht|
�
}
|
t
ur|
S|d
ur"t�}|js.|
jr�|�|
|�}|rB|S|��rr|j|
jkrj|
��rj|�td�St |�
S|
��r�t |
�
St |j|
j�}d}|jt kr�|j|
jkr�d}|s�|
s�t |j|
j�}|r�d}t|d|�}|�|�
}|S|�
st||
j|jd�}|
�||j�}|�|�
}|S|
�
sVt||j|jd�}|�||j�}|�|�
}|St|�
}t|
�
}t|||j�\}}t�} |j|jk�
r�|j|jk�
r�t|d|�}|�|�
}|S|j|jk�
r�||}}|jdk�
r�d| _|j|j|_|_nd| _n&|jdk�rd| _d\|_|_nd| _|jdk�r<|j|j| _n|j|j| _|j| _t | �
}|�|�
}|S)zbReturns self + other. -INF + INF (or the reverse) cause InvalidOperation errors. Nz -INF + INFr&r.rS)r&r&)r�r�rrRr�r�r;rjr r
r�rQrErr:r��maxrF�_rescalero� _normalizerCrWrX) r0r�r1r?rXZnegativezerorC�op1�op2r�r)r)r+�__add__�s|











































zDecimal.__add__cCsHt|
�
}
|
t
ur|
S|js |
jr6|j|
|d
�}|r6|S|j|
��|d
�S)zReturn self - otherrL)r�r�rRr�r�r�r�r)r)r+�__sub__�s




zDecimal.__sub__cCs"t|
�
}
|
t
ur|
S|
j||d
�S)zReturn other - selfrL)r�r�r�r�r)r)r+�__rsub__�s

zDecimal.__rsub__cCs@
t|
�
}
|
t
ur|
S|d
ur"t�}|j|
jA}|js:|
jr�|�|
|�}|rN|S|��rn|
sf|�td�St |S|
��r�|s�|�td�St |S|j |
j }|r�|
s�t|d|�}|�|�
}|S|j dkr�t||
j |�}|�|�
}|S|
j dk�
r t||j |�}|�|�
}|St|�
}t|
�
}t|t|j|j�
|�}|�|�
}|S)z\Return self * other. (+-) INF * 0 (or its reverse) raise InvalidOperation. Nz(+-)INF * 0z0 * (+-)INFrS�
1)r�r�rr;rRr�r�rjr rArQr:r�r<rorfrW)r0r�r1Z resultsignr?Z resultexpr�r�r)r)r+�__mul__�sH






















zDecimal.__mul__cCs�
t|
�
}
|
t
urt
S|d
ur"t�}|j|
jA}|js:|
jr�|�|
|�}|rN|S|��rj|
��rj|�td�S|��rzt |S|
��r�|�t d�
t|d|���S|
s�|s�|�t d�S|�td|�S|s�|j|
j}d}n�t|
j�
t|j�
|jd}|j|
j|}t|�
}t|
�
} |dk�
r:t|jd || j�\}} nt|j| jd |�\}} | �
rt|d dk�
r�|d7}n8|j|
j}||k�
r�|d dk�
r�|d }|d7}�
q�t|t|�
|�}|�|�
S)zReturn self / other.Nz(+-)INF/(+-)INFzDivision by infinityrSz0 / 0zx / 0r&r.r�r)r�r�rr;rRr�r�rjr rArr:�Etinyrr rQrlr<rFro�divmodrWrfr�)r0r�r1rCr?rXr��shiftr�r�� remainder� ideal_expr)r)r+�__truediv__,sP

























zDecimal.__truediv__cCs
|j|
jA}|
�
�r|j}nt|j|
j�}|��|
��}|rN|
�
�sN|d
k
rht|dd�|�||j�fS||jk
�
r t |�
}t |
�
}|j |j kr�|jd|j |j 9_n|jd|j |j 9_t|j|j�\}} |d|jk�
r t|t |�
d�t|jt | �
|�fS|�td�} | | fS)z�Return (self // other, self % other), to context.prec precision. Assumes that neither self nor other is a NaN, that self is not infinite and that other is nonzero. r�rSr&r�z%quotient too large in //, % or divmod)r;r�rQr�r�r:r�rErFrorXrWr�rfrjr)r0r�r1rCr��expdiffr�r��
q�
rr?r)r)r+�_dividegs0




�







�
�zDecimal._dividecCs"t|
�
}
|
t
ur|
S|
j||d
�S)z)Swaps self/other and returns __truediv__.rL)r�r�r�r�r)r)r+�__rtruediv__�s


zDecimal.__rtruediv__cCs�t|
�
}
|
t
ur|
S|d
ur"t�}|�|
|�}|r:||fS|j|
jA}|��r~|
��rj|�td�}||fSt||�td�fS|
s�|s�|�t d�}||fS|�t d|�|�td�fS|�|
|�\}}|�|�
}||fS)z6 Return (self // other, self % other) Nzdivmod(INF, INF)�INF % xzdivmod(0, 0)�x // 0�x % 0) r�r�rr�r;r�rjr rArr r�r�)r0r�r1r?rCZquotientr�r)r)r+� __divmod__�s4









�



�

zDecimal.__divmod__cCs"t|
�
}
|
t
ur|
S|
j||d
�S)z(Swaps self/other and returns __divmod__.rL)r�r�r�r�r)r)r+�__rdivmod__�s


zDecimal.__rdivmod__cCs�t|
�
}
|
t
ur|
S|d
ur"t�}|�|
|�}|r6|S|��rJ|�td�S|
sj|r^|�td�S|�td�S|�|
|�d}|� |�
}|S)z self % other Nr�r�z0 % 0r.) r�r�rr�r�rjr rr�r�)r0r�r1r?r�r)r)r+�__mod__�s"










zDecimal.__mod__cCs"t|
�
}
|
t
ur|
S|
j||d
�S)z%Swaps self/other and returns __mod__.rL)r�r�r�r�r)r)r+�__rmod__�s


zDecimal.__rmod__cCs�
|d
urt�}t
|
dd�}
|�|
|�}|r.|S|��rB|�td�S|
sb|rV|�td�S|�td�S|
��r|t|�
}|�|�
St |j |
j �}|s�t|jd|�}|�|�
S|� �|
� �}||jdkr�|�t�
S|d k
r�|�||j�}|�|�
St|�
}t|
�
}|j|jk�
r(|jd |j|j9_n|jd |j|j9_t|j|j�\}} d| |d@|jk�
r~| |j8} |d7}|d |jk�
r�|�t�
S|j} | dk�
r�d| } | } t| t| �
|�}|�|�
S) zI Remainder nearest to 0- abs(remainder-near) <= other/2 NTr�zremainder_near(infinity, x)zremainder_near(x, 0)zremainder_near(0, 0)rSr.r�r�r_r&)rr�r�r�rjr rr
r�r�rQr:r;r�rFrr�rErorXrWr�rf)r0r�r1r?�ideal_exponentr�r�r�r�r�rCr)r)r+�remainder_near�s`




�


�
�


















zDecimal.remainder_nearcCs�t|
�
}
|
t
ur|
S|d
ur"t�}|�|
|�}|r6|S|��rb|
��rR|�td�St|j|
jAS|
s�|r�|�t d|j|
jA�S|�t d�S|�|
|�dS)z self // otherNz INF // INFr�z0 // 0r&)r�r�rr�r�rjr rAr;r rr�r�r)r)r+�__floordiv__'s&









�zDecimal.__floordiv__cCs"t|
�
}
|
t
ur|
S|
j||d
�S)z*Swaps self/other and returns __floordiv__.rL)r�r�r�r�r)r)r+� __rfloordiv__Cs


zDecimal.__rfloordiv__c
Cs8|��r(|�
�rtd
�
�
|jr"dnd}
nt|�
}
t|
�
S)zFloat representation.z%Cannot convert signaling NaN to floatz-nan�nan)r�r�rrr;rfrv�r0�
sr)r)r+� __float__Js



zDecimal.__float__c
Cst|jr(|�
�rtd
�
�
n|��r(td�
�
d|j}
|jdkrT|
t|j�
d|jS|
t|jd|j�pjd�
SdS)z1Converts self to an int, truncating if necessary.zCannot convert NaN to integerz"Cannot convert infinity to integerr�r&r�NrS) rRr�rrr�r�r;rQrWr<r�r)r)r+�__int__Ts






zDecimal.__int__c


Cs|Sr(r)r�r)r)r+�realcszDecimal.realc

Cstd
�
S)Nr&�
r
r�r)r)r+�imaggszDecimal.imagc


Cs|Sr(r)r�r)r)r+� conjugateks
zDecimal.conjugatec

Cstt
|�
�
Sr()�complexrvr�r)r)r+�__complex__ns
zDecimal.__complex__cCsR|j}|
j
|
j}t|�
|krJ|t|�
|d
��d�
}t|j||jd�St|�
S)z2Decapitate the payload of a NaN to fit the contextNrST) r<rF�clamprlrmr:r;rQr
)r0r1�payloadZmax_payload_lenr)r)r+r=qs



zDecimal._fix_nancCsX|jr |�
�r|�|
�
St|�
S|
��}|
��}|s�|
j|g|
j}tt |j |�|�}||j krx|
�t�

t |jd
|�St|�
St|j�
|j |
j}||kr�|
�td|j�}|
�t�

|
�t�

|S||k}|r�|}|j |k�
r�t|j�
|j |} | dk�
rt |jd|d�}d} |j|
j} | || �}|jd| ��
p>d
}|dk�
r~tt|�
d�
}t|�
|
jk�
r~|dd�}|d7}||k�
r�|
�td|j�}nt |j||�}|�
r�|�
r�|
�t�

|�
r�|
�t�

|�
r�|
�t�

|
�t�

|�
s�|
�t�

|S|�r|
�t�

|
jdk�rP|j |k�rP|
�t�

|jd
|j |} t |j| |�St|�
S)z�Round if it is necessary to keep self within prec precision. Rounds and fixes the exponent. Does not raise on a sNaN. Arguments: self - Decimal instance context - context used. rS� above Emaxr&r�r.Nr�)rRr�r=r
r��EtoprGr�r�r�rQrjrr:r;rlr<rFrrr�_pick_rounding_functionrErfrWrr )r0r1r�r��exp_maxZnew_expZexp_minr?Zself_is_subnormalr~Zrounding_method�changedr�r�r)r)r+r�}sn 
 





































zDecimal._fixcCst|j
|
�rd
SdSdS)z(Also known as round-towards-0, truncate.r&r�N)� _all_zerosr<�r0rFr)r)r+�_round_down�s
zDecimal._round_downcCs|�|
�
S)
zRounds away from 0.)
r
r
r)r)r+� _round_up�szDecimal._round_upcCs*|j|
d
vrdSt
|j|
�r"dSdSdS)zRounds 5 up (away from 0)Z56789r.r&r�N)r<r

r
r)r)r+�_round_half_up�s 


zDecimal._round_half_upcCst|j
|
�rd
S|�|
�
SdS)zRound 5 downr�N��_exact_halfr<r
r
r)r)r+�_round_half_down�s
zDecimal._round_half_downcCs8t|j
|
�r*|
d
ks&|j
|
ddvr*dS|�|
�
SdS)z!Round 5 to even, rest to nearest.r&r.�02468r�Nr
r
r)r)r+�_round_half_even�s
�
�zDecimal._round_half_evencCs |jr|�
|
�
S|�
|
�
Sd
S)z(Rounds up (not away from 0 if negative.)N�r;r
r
r)r)r+�_round_ceilings
zDecimal._round_ceilingcCs |js|�
|
�
S|�
|
�
Sd
S)z'Rounds down (not towards 0 if negative)Nr
r
r)r)r+�_round_floor s
zDecimal._round_floorcCs0|
r |j|
d
dv
r |�
|
�
S|�
|
�
SdS)z)Round down unless digit prec-1 is 0 or 5.r.Z05N)r<r
r
r)r)r+�_round_05ups
zDecimal._round_05up)rrrrrrrrcCsb|
d
u
r2t|
t
�std�
�
tdd|
�}|�|�
S|jrR|��rJtd�
�
ntd�
�
t
|� dt ��
S)a�Round self to the nearest integer, or to a given precision. If only one argument is supplied, round a finite Decimal instance self to the nearest integer. If self is infinite or a NaN then a Python exception is raised. If self is finite and lies exactly halfway between two integers then it is rounded to the integer with even last digit. >>> round(Decimal('123.456')) 123 >>> round(Decimal('-456.789')) -457 >>> round(Decimal('-3.0')) -3 >>> round(Decimal('2.5')) 2 >>> round(Decimal('3.5')) 4 >>> round(Decimal('Inf')) Traceback (most recent call last): ... OverflowError: cannot round an infinity >>> round(Decimal('NaN')) Traceback (most recent call last): ... ValueError: cannot round a NaN If a second argument n is supplied, self is rounded to n decimal places using the rounding mode for the current context. For an integer n, round(self, -n) is exactly equivalent to self.quantize(Decimal('1En')). >>> round(Decimal('123.456'), 0) Decimal('123') >>> round(Decimal('123.456'), 2) Decimal('123.46') >>> round(Decimal('123.456'), -2) Decimal('1E+2') >>> round(Decimal('-Infinity'), 37) Decimal('NaN') >>> round(Decimal('sNaN123'), 0) Decimal('NaN123') Nz+Second argument to round should be integralr&r��cannot round a NaN�cannot round an infinity)rerWrxr:�quantizerRr�rrr�r�r)r0r9rXr)r)r+� __round__&s/





zDecimal.__round__c

Cs0|jr |�
�rtd
�
�
ntd�
�
t|�dt��
S)z�Return the floor of self, as an integer. For a finite Decimal instance self, return the greatest integer n such that n <= self. If self is infinite or a NaN then a Python exception is raised. r
r
r&)rRr�rrr�rWr�rr�r)r)r+� __floor__ds 


zDecimal.__floor__c

Cs0|jr |�
�rtd
�
�
ntd�
�
t|�dt��
S)z�Return the ceiling of self, as an integer. For a finite Decimal instance self, return the least integer n such that n >= self. If self is infinite or a NaN then a Python exception is raised. r
r
r&)rRr�rrr�rWr�rr�r)r)r+�__ceil__ss 


zDecimal.__ceil__cCs
t|
d
d�}
t|d
d�}|j
s$|
j
r�|dur2t�}|jdkrJ|�td|�S|
jdkrb|�td|
�S|jdkrr|}nf|
jdkr�|
}nV|jdkr�|
s�|�td�St|j|
jA}n*|
jdkr�|s�|�td �St|j|
jA}n0t|j|
jAt t |j�
t |
j�
�
|j|
j�}|�||�S) a:
Fused multiply-add. Returns self*other+third with no rounding of the intermediate product self*other. self and other are multiplied together, with no rounding of the result. The third operand is then added to the result, and a single final rounding is performed. Tr�Nr[r�r9r\zINF * 0 in fmaz0 * INF in fma) r�rRrrQrjr rAr;r:rfrWr<r�)r0r��thirdr1�productr)r)r+�fma�s<














�



�

�zDecimal.fmacCs�
t|
�
}
|
t
ur|
St|�
}|t
ur(|S|d
ur6t�}|��}|
��}|��}|sZ|sZ|r�|dkrp|�td|�S|dkr�|�td|
�S|dkr�|�td|�S|r�|�|�
S|r�|
�|�
S|�|�
S|��r�|
��r�|��s�|�td�S|
dkr�|�td�S|�
s|�td�S|��|j k�
r(|�td�S|
�
s@|�
s@|�td �S|
� ��
rPd}n|j}tt |�
�
}t|���
}t|
���
} |j |td |j|�|}t| j�
D]} t|d |�}�
q�t|| j |�}t|t|�
d�S)z!Three argument version of __pow__Nr_r�z@pow() 3rd argument not allowed unless all arguments are integersr&zApow() 2nd argument cannot be negative when 3rd argument specifiedzpow() 3rd argument cannot be 0zSinsufficient precision: pow() 3rd argument must not have more than precision digitszXat least one of pow() 1st argument and 2nd argument must be nonzero; 0**0 is not definedr�)r�r�rr�rjr r=� _isintegerr�rF�_isevenr;rnrWro�to_integral_valuer�rX�ranger:rf)r0r��modulor1r�r�Z modulo_is_nanrC�base�exponent�
ir)r)r+� _power_modulo�s�











�

�

�




��
�

�

�

�

�





zDecimal._power_modulocCs�t|�
}|j
|j}}|d
dkr4|d
}|d7}qt|
�
}|j
|j}}|d
dkrh|d
}|d7}qJ|dk�
r||9}|d
dkr�|d
}|d7}qz|dkr�dS|d
|} |jdkr�| } |
��r�|
jdkr�|jt
|
�
} t| | |d�}nd}tddd|| |�S|jdk�r�|d
}|dv�
r�||@|k�
rBdSt |�
d} |dd }|t t|�
�
k�
rpdSt| ||�} t|||�}| du�
s�|du�
r�dS| |k�
r�dSd | }n�|d k�r�t |�
dd } t d | |�\}}|�
r�dS|d dk�r|d }| d8} �
q�|d
d}|t t|�
�
k�r6dSt| ||�} t|||�}| du�sf|du�rjdS| |k�rxdSd | }ndS|d
|k�r�dS| |}tdt|�
|�S|dk�r�|d
|d}}n�|dk�r�t tt||�
�
�
|k
�r�dSt |�
}|dk�r,t tt|�
|�
�
|k
�r,dS|d
|}}|d |d k�r\dk�rtn
n|d }|d }�q<|d |d k�r�dk�r�n
n|d }|d }�qt|dk�rX|dk�r�||k
�r�dSt ||�\}}|dk�r�dSdt |�
|>}t |||d�\}}||k
�r$�q|S|sPt|jdd�S|
j|
��g|
j }t |j�
}|j}|j|ddkr�||kr�|d7}|d8}qtt|j|jd
|�|�S)z?Normalize- strip trailing 0s, change anything equal to 0 to 0e0NrLrSr&r.) rrRr�r�r�r:r;rGr�r�rlr<rQ)r0r1r?�dupr��endrXr)r)r+� normalize� s$













zDecimal.normalizecCs�
t|
d
d�}
|durt
�}|dur(|j}|js4|
jr||�|
|�}|rH|S|
��sX|��r||
��rp|��rpt|�
S|�td�S|� �|
j k
r�|jk
s�n
|�td�S|s�t|j d|
j �}|�|�
S|��}||jkr�|�td�S||
j d|jk�
r|�td �S|�|
j |�}|��|jk�
r.|�td�St|j�
|jk�
rL|�td �S|�
rl|��|jk�
rl|�t�

|j |j k�
r�||k�
r�|�t�

|�t�

|�|�
}|S) z�Quantize self so its exponent is the same as that of exp. Similar to self._rescale(exp._exp) but with error checking. Tr�Nzquantize with one INFz)target exponent out of bounds in quantizerSz9exponent of quantize result too large for current contextr.z7quantize result has too many digits for current context)r�rrErRr�r�r
rjr r�rQrGr:r;r�r�rFr�rlr<�Eminr rr)r0rXrEr1r?r�r)r)r+r
� s`









�

�




�

�


�

�





zDecimal.quantizecCsDt|
d
d�}
|j
s|
j
r8|��r(|
��p6|��o6|
��S|j|
jkS)a=
Return True if self and other have the same exponent; otherwise return False. If either operand is a special value, the following rules are used: * return True if both operands are infinities * return True if both operands are NaNs * otherwise, return False. Tr�)r�rRr��is_infiniterQr�r)r)r+�same_quantum% s 


�zDecimal.same_quantumcCs�|jrt
|�
S|s t|jd
|
�S|j|
krHt|j|jd
|j|
|
�St|j�
|j|
}|dkrzt|jd|
d�}d}|j|}|||�}|jd|�p�d
}|dkr�tt |�
d�
}t|j||
�S)as
Rescale self so that the exponent is exp, either by padding with zeros or by truncating digits, using the given rounding mode. Specials are returned without change. This operation is quiet: it raises no flags, and uses no information from the context. exp = exp to scale to (an integer) rounding = rounding mode rSr&r�r.N) rRr
r:r;rQr<rlr�rfrW)r0rXrEr~Z this_functionr
r�r)r)r+r�4 s$


 
�








zDecimal._rescalecCsf|
d
k
rtd�
�
|j
s|s"t|�
S|�|��d|
|�}|��|��krb|�|��d|
|�}|S)a"
Round a nonzero, nonspecial Decimal to a fixed number of significant figures, using the given rounding mode. Infinities, NaNs and zeros are returned unaltered. This operation is quiet: it raises no flags, and uses no information from the context. r&z'argument should be at least 1 in _roundr.)rrrRr
r�r�)r0�placesrEr?r)r)r+�_roundV s 





zDecimal._roundcCs�|jr"|j
|d
�
}|r|St|�
S|jdkr4t|�
S|sFt|jdd�S|durTt�}|
durb|j}
|�d|
�}||kr�|� t �

|� t�

|S)aV
Rounds to a nearby integer. If no rounding mode is specified, take the rounding mode from the context. This method raises the Rounded and Inexact flags when appropriate. See also: to_integral_value, which does exactly the same as this method except that it doesn't raise Inexact or Rounded. rLr&rSN)rRr�r
rQr:r;rrEr�rjrr�r0rEr1r?r)r)r+�to_integral_exactm s$ 
















zDecimal.to_integral_exactcCs`|d
urt�}|
d
ur|j
}
|jr>|j|d�
}|r6|St|�
S|jdkrPt|�
S|�d|
�Sd
S)z@Rounds to the nearest integer, without raising inexact, rounded.NrLr&)rrErRr�r
rQr�rI
r)r)r+r
� s









zDecimal.to_integral_valuecCs�
|
d
urt�}
|j
rB|j|
d�
}|r(|S|��rB|jdkrBt|�
S|sdt|jd|jd�}|�|
�
S|jdkrz|
� t d�S|
jd}t|�
}|j d?}|j d@r�|jd}t|j�
d?d}n|j}t|j�
dd?}||}|dkr�|d |9}d } nt|d |�\}} | } ||8}d|}||}||k
�
r:�
qJn||d?}�
q"| �
oZ|||k} | �
r�|dk�
rz|d|}n|d|9}||7}n|ddk�
r�|d7}tdt|�
|�}|
��}
|
�t�
} |�|
�
}| |
_|S)zReturn the square root of self.NrLr&rSr_r.zsqrt(-x), x > 0r�r'
Tr)rrRr�r�r;r
r:rQr�rjr rFrorXrWrlr<r�rf� _shallow_copy� _set_roundingrrE)r0r1r?rF�opr��
c�
lr�r;
r�r9r�rEr)r)r+�sqrt� s^






 












 




zDecimal.sqrtcCs�t|
d
d�}
|durt
�}|js&|
jr~|��}|
��}|s>|r~|dkrX|dkrX|�|�
S|dkrr|dkrr|
�|�
S|�|
|�S|�|
�
}|dkr�|�|
�
}|dkr�|
}n|}|�|�
S)z�Returns the larger value. Like max(self, other) except if one is not a number, returns NaN (and signals if one is sNaN). Also rounds. Tr�Nr.r&r��r�rrRr�r�r�r�� compare_total�r0r�r1ZsnZonrN
r?r)r)r+r�s&








 
zDecimal.maxcCs�t|
d
d�}
|durt
�}|js&|
jr~|��}|
��}|s>|r~|dkrX|dkrX|�|�
S|dkrr|dkrr|
�|�
S|�|
|�S|�|
�
}|dkr�|�|
�
}|dkr�|}n|
}|�|�
S)z�Returns the smaller value. Like min(self, other) except if one is not a number, returns NaN (and signals if one is sNaN). Also rounds. Tr�Nr.r&r�rQ
rS
r)r)r+r�*s&










zDecimal.minc
Cs8|jr d
S|j
dkrdS|j|j
d�}
|
dt|
�
kS)z"Returns whether self is an integerFr&TNrS)rRrQr<rl)r0�restr)r)r+r
Ls




zDecimal._isintegerc

Cs&|r|jd
krdS|j
d|jdvS)z:Returns True if self is even. Assumes self is an integer.r&Tr�r
)rQr<r�r)r)r+r
Us

zDecimal._isevenc

Cs0z|jt
|j�
d
WSty*


YdS0dS)z$Return the adjusted exponent of selfr.r&N)rQrlr<rxr�r)r)r+r�[s

zDecimal.adjustedc


Cs|S)
z�Returns the same Decimal object. As we do not have different encodings for the same number, the received object already is in its canonical form. r)r�r)r)r+� canonicalcszDecimal.canonicalcCs.t|
d
d�}
|�
|
|�}|r |S|j|
|d�S)z�Compares self to the other operand numerically. It's pretty much like compare(), but all NaNs signal, with signaling NaNs taking precedence over quiet NaNs. Tr�rL)r�r�r�r�r)r)r+�compare_signalks 



zDecimal.compare_signalcCs`
t|
d
d�}
|j
r|
j
stS|j
s,|
j
r,tS|j
}|��}|
��}|sL|�
r||kr�t|j�
|jf}t|
j�
|
jf}||kr�|r�tStS||kr�|r�tStStS|r�|dkr�tS|dkr�tS|dkr�tS|dkr�tSn2|dkr�tS|dkr�tS|dkr�tS|dk�
rtS||
k�
rtS||
k�
r$tS|j|
jk�
r@|�
rReturn True if self is a qNaN or sNaN; otherwise return False.rar`
r�r)r)r+r�;szDecimal.is_nancCs*|js |sd
S|
durt
�}
|
j|��k
S)z?Return True if self is a normal number; otherwise return False.FN)rRrrD
r�r�r)r)r+� is_normal?s 



zDecimal.is_normalc

Cs |jd
kS)z;Return True if self is a quiet NaN; otherwise return False.r9r`
r�r)r)r+r�GszDecimal.is_qnanc

Cs |jd
kS)z8Return True if self is negative; otherwise return False.r.)
r;r�r)r)r+� is_signedKszDecimal.is_signedc

Cs |jd
kS)z?Return True if self is a signaling NaN; otherwise return False.r[r`
r�r)r)r+r�OszDecimal.is_snancCs*|js |sd
S|
durt
�}
|��|
jkS)z9Return True if self is subnormal; otherwise return False.FN)rRrr�rD
r�r)r)r+�is_subnormalSs 



zDecimal.is_subnormalc

Cs|jo|j
d
kS)z6Return True if self is a zero; otherwise return False.rSr�r�r)r)r+�is_zero[szDecimal.is_zeroc
Cs�|jt
|j�
d
}
|
d
kr4t
t|
dd�
�
d
S|
dk
rXt
td|
dd�
�
d
St|�
}|j|j}}|
dkr�t|d|�
}t|�
}t
|�
t
|�
||kS|t
td||�
�
d
S)z�Compute a lower bound for the adjusted exponent of self.ln(). In other words, compute r such that self.ln() >= 10**r. Assumes that self is finite and positive and that self != 1. r.�r�r�r�r&�rQrlr<rfrorWrX�r0r]
rM
rN
r��numZdenr)r)r+� _ln_exp_bound_s






zDecimal._ln_exp_boundc Cs
|
d
urt�}
|j
|
d�
}|r"|S|s*tS|��dkr:tS|tkrFtS|jdkr\|
�t d�St |�
}|j|j}}|
j }||��d}t|||�}|ddttt|�
�
�
|dr�q�|d7}q�tt|d k�
tt|�
�
|�}|
��}
|
�t�
} |�|
�
}| |
_|S) z/Returns the natural (base e) logarithm of self.NrLr.zln of a negative valuer_rr�r]r&)rr��_NegativeInfinityr�� _Infinityr5
rX
r;rjr rorWrXrFri
�_dlogrlrfrnr:rK
rL
rr�rE� r0r1r?rM
rN
r�r+
rG
r�rEr)r)r+�lnxs:







�

$






z Decimal.lnc
Cs�|jt
|j�
d
}
|
d
kr,t
t|
�
�
d
S|
dk
rHt
td|
�
�
d
St|�
}|j|j}}|
dkr�t|d|�
}td|�
}t
|�
t
|�
||kdStd||�
}t
|�
||dkd
S) z�Compute a lower bound for the adjusted exponent of self.log10(). In other words, find r such that self.log10() >= 10**r. Assumes that self is finite and positive and that self != 1. r.r�r�r&r���r_Z231rf
rg
r)r)r+r6
�s







zDecimal._log10_exp_boundc CsF
|
d
urt�}
|j
|
d�
}|r"|S|s*tS|��dkr:tS|jdkrP|
�td�S|jddkr�|jdd
�dt |j�
dkr�t |jt |j�
d�
}n�t|�
}|j |j}}|
j}||��d}t|||�}|d d t tt|�
�
�
|dr��
q|d7}q�tt |dk�
tt|�
�
|�}|
��}
|
�t�
} |�|
�
}| |
_|S)z&Returns the base 10 logarithm of self.NrLr.zlog10 of a negative valuer&r�rSr_rr�r])rr�rj
r�rk
r;rjr r<rlr
rQrorWrXrFr6
�_dlog10rfrnr:rK
rL
rr�rErm
r)r)r+�log10�s:






�.

$






z Decimal.log10cCsV|j|
d
�
}|r|S|
dur"t
�}
|��r.tS|s@|
�tdd�St|���
}|�|
�
S)aM
Returns the exponent of the magnitude of self's MSD. The result is the integer which is the exponent of the magnitude of the most significant digit of self (as though it were truncated to a single digit while maintaining the value of that digit and without limiting the resulting exponent). rLNzlogb(0)r.) r�rr�rk
rjr r
r�r�r�r)r)r+�logb�s 





zDecimal.logbc
Cs6|jd
ks|j
d
krdS|jD]}
|
dv
r
dSqdS)z�Return True if self is a logical operand. For being logical, it must be a finite number with a sign of 0, an exponent of 0, and a coefficient whose digits must all be either 0 or 1. r&FZ01T)r;rQr<)r0�digr)r)r+� _islogical s




zDecimal._islogicalcCs�|
jt
|�
}|d
kr$d||}n|d
kr<||
jd�}|
jt
|�
}|d
kr`d||}n|d
krx||
jd�}||fS)Nr&rS)rFrl)r0r1�opa�opbZdifr)r)r+� _fill_logical' s










zDecimal._fill_logicalcCsz|d
urt�}t
|
dd�}
|��r*|
��s4|�t�
S|�||j|
j�\}}d�dd�t||�D�
�
}t d|� d�
ptdd�S) z;Applies an 'and' operation between self and other's digits.NTr�rUc
Ss$g|]\}
}tt
|
�
t
|�
@�
�qSr)�rfrW��.0r3
�
br)r)r+� B r-z'Decimal.logical_and..r&rS�rr�rt
rjr rw
r<rt�zipr:rm�r0r�r1ru
rv
r�r)r)r+�logical_and4 s


zDecimal.logical_andcCs(|
d
urt�}
|�
tdd|
jd�|
�S)zInvert all its digits.Nr&r�)r�logical_xorr:rFr�r)r)r+�logical_invertE s 


�zDecimal.logical_invertcCsz|d
urt�}t
|
dd�}
|��r*|
��s4|�t�
S|�||j|
j�\}}d�dd�t||�D�
�
}t d|� d�
ptdd�S) z:Applies an 'or' operation between self and other's digits.NTr�rUc
Ss$g|]\}
}tt
|
�
t
|�
B�
�qSr)rx
ry
r)r)r+r|
Z r-z&Decimal.logical_or..r&rSr}
r
r)r)r+� logical_orL s


zDecimal.logical_orcCsz|d
urt�}t
|
dd�}
|��r*|
��s4|�t�
S|�||j|
j�\}}d�dd�t||�D�
�
}t d|� d�
ptdd�S) z;Applies an 'xor' operation between self and other's digits.NTr�rUc
Ss$g|]\}
}tt
|
�
t
|�
A�
�qSr)rx
ry
r)r)r+r|
k r-z'Decimal.logical_xor..r&rSr}
r
r)r)r+r�
] s


zDecimal.logical_xorcCs�t|
d
d�}
|durt
�}|js&|
jr~|��}|
��}|s>|r~|dkrX|dkrX|�|�
S|dkrr|dkrr|
�|�
S|�|
|�S|���|
���
}|dkr�|�|
�
}|dkr�|
}n|}|�|�
S�z8Compares the values numerically with their sign ignored.Tr�Nr.r&r�� r�rrRr�r�r�r�r�rR
rS
r)r)r+�max_magn s&










zDecimal.max_magcCs�t|
d
d�}
|durt
�}|js&|
jr~|��}|
��}|s>|r~|dkrX|dkrX|�|�
S|dkrr|dkrr|
�|�
S|�|
|�S|���|
���
}|dkr�|�|
�
}|dkr�|}n|
}|�|�
Sr�
r�
rS
r)r)r+�min_mag� s&










zDecimal.min_magcCs�|
d
urt�}
|j
|
d�
}|r"|S|��dkr2tS|��dkrTtdd|
j|
���S|
��}
|
�t �

|
� �
|�|
�
}||kr�|S|�tdd|
� �d�|
�S)z=Returns the largest representable number smaller than itself.NrLr�r.r&rDr�)rr�r�rj
r:rFr�rMrL
r�_ignore_all_flagsr�r�r��r0r1r?Znew_selfr)r)r+� next_minus� s$












�zDecimal.next_minuscCs�|
d
urt�}
|j
|
d�
}|r"|S|��dkr2tS|��dkrTtdd|
j|
���S|
��}
|
�t �

|
� �
|�|
�
}||kr�|S|�tdd|
� �d�|
�S)z=Returns the smallest representable number larger than itself.NrLr.r�rDr&r�)rr�r�rk
r:rFr�rMrL
rr�
r�r�r�r�
r)r)r+� next_plus� s$












�zDecimal.next_pluscCs�t|
d
d�}
|durt
�}|�|
|�}|r.|S|�|
�
}|dkrJ|�|
�
S|dkr^|�|�
}n |�|�
}|��r�|�t d|j �
|�t�

|�t�

nD|� �|jkr�|�t�

|�t�

|�t�

|�t�

|s�|�t�

|S)a�
Returns the number closest to self, in the direction towards other. The result is the closest representable number to self (excluding self) that is in the direction towards other, unless both have the same value. If the two operands are numerically equal, then the result is a copy of self with the sign set to be the same as the sign of other. Tr�Nr&r�z Infinite result from next_toward)r�rr�r�r[
r�
r�
r�rjrr;rrr�rD
rr r)r0r�r1r?Z comparisonr)r)r+�next_toward� s6 





 


�






zDecimal.next_towardcCs�|��rd
S|�
�rdS|��}|dkr,dS|dkr8dS|��rN|jrJdSdS|
d ur\t�}
|j|
d �
rv|jrrdSdS|jr�d SdSd S)a
Returns an indication of the class of self. The class is one of the following strings: sNaN NaN -Infinity -Normal -Subnormal -Zero +Zero +Subnormal +Normal +Infinity r�r�r.z +Infinityr�z -Infinityz-Zeroz+ZeroNrLz -Subnormalz +Subnormalz-Normalz+Normal)r�r�r�rd
r;rrc
)r0r1�infr)r)r+�number_classs,
















zDecimal.number_classc

Cstd
�
S)z'Just returns 10, as this is Decimal, :)r�r�r�r)r)r+�radix0sz Decimal.radixcCs�|d
urt�}t
|
dd�}
|�|
|�}|r.|S|
jdkrB|�t�
S|jt|
�
k
r`|jk
sln
|�t�
S|��r|t |�
St|
�
}|j }|jt|�
}|dkr�d||}n|dkr�||d
�}||d
�|d
|�}t|j |�d�
p�d|j�S)z5Returns a rotated copy of self, value-of-other times.NTr�r&rS�rr�r�rQrjr rFrWr�r
r<rlr:r;rm)r0r�r1r?�torot�rotdig�topadZrotatedr)r)r+�rotate4s.














�zDecimal.rotatecCs�|d
urt�}t
|
dd�}
|�|
|�}|r.|S|
jdkrB|�t�
Sd|j|j}d|j|j}|t|
�
k
rz|k
s�n
|�t�
S|� �r�t |�
St|j|j |jt|
�
�}|�|�
}|S)z>Returns self operand after adding the second value to its exp.NTr�r&r�r_)rr�r�rQrjr rGrFrWr�r
r:r;r<r�)r0r�r1r?ZliminfZlimsupr�r)r)r+�scalebUs"










zDecimal.scalebcCs
|d
urt�}t
|
dd�}
|�|
|�}|r.|S|
jdkrB|�t�
S|jt|
�
k
r`|jk
sln
|�t�
S|��r|t |�
St|
�
}|j }|jt|�
}|dkr�d||}n|dkr�||d
�}|dkr�|d
|�}n|d|}||jd
�}t|j |�d�
�
p d|j�S)z5Returns a shifted copy of self, value-of-other times.NTr�r&rSr�
)r0r�r1r?r�
r�
r�
Zshiftedr)r)r+r�ns4















�z Decimal.shiftc

Cs|jt
|�
f
fSr()� __class__rfr�r)r)r+� __reduce__�s
zDecimal.__reduce__c

Cst|�
t
ur|S|�t|�
�
Sr(��typer
r�
rfr�r)r)r+�__copy__�s


zDecimal.__copy__cCst|�
t
ur|S|�t|�
�
Sr(r�
)r0�memor)r)r+�__deepcopy__�s


zDecimal.__deepcopy__cCsJ|d
urt�}t
|
|d�}|jrXt|j|�}t|���
}|ddkrL|d7}t|||�S|dd
urvddg|j|d<|ddkr�t |j|j |jd�}|j}|d}|d
u
�
r|dd vr�|� |d |�}nF|ddvr�|�||�}n*|ddv�
rt|j �
|k�
r|� ||�}|�
s@|jd k�
r@|ddv�
r@|�d |�}|jt|j �
} |dd v�
r~|�
sx|d
u
�
rxd |} nd } nB|ddv�
r�| } n.|ddv�
r�|jd k
�
r�| dk�
r�| } nd } | d k�
r�d}d| |j }nP| t|j �
k�r|j d| t|j �
}d}n"|j d
| ��p d}|j | d
�}| | } t|j||| |�S)a|
Format a Decimal instance according to the given specifier. The specifier should be a standard format specifier, with the form described in PEP 3101. Formatting types 'e', 'E', 'f', 'F', 'g', 'G', 'n' and '%' are supported. If the formatting type is omitted it defaults to 'g' or 'G', depending on the value of context.capitals. N)
�_localeconvr�
�
%�
g�
Gr_� precision�eEr.zfF%ZgGr&r�rSrU)r�_parse_format_specifierrR�_format_signr;rfr�� _format_alignr�r:r<rQrErH
r�rl�_format_number)r0Z specifierr1r�
�specrC�bodyrEr�
r�r�r|r}rXr)r)r+� __format__�sZ































zDecimal.__format__)rSN)NN)
N)
N)
N)
N)
N)
N)FN)
N)
N)
N)TN)
N)
N)
N)
N)
N)
N)
N)
N)
N)
N)
N)
N)
N)
N)
N)
N)NN)
N)
N)NN)
N)NN)NN)
N)
N)
N)
N)
N)
N)
N)
N)
N)
N)
N)
N)
N)
N)
N)
N)
N)
N)
N)
N)
N)
N)
N)
N)
N)
N)NN)�r4r5r6r7� __slots__rd�classmethodrwr�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r��__radd__r�r�r��__rmul__r�r�r�r�r�r�r�r�r�r�r�r�� __trunc__�propertyr�r�r�r�r=r�r
r
r
r
r
r
r
r
�dictr�r
r
r
r
r
r4
r?
r@
rC
r
rF
r�rH
rJ
r
�to_integralrP
r�r�r
r
r�rU
rV
rR
rZ
r�r�r[
rXr^
r_
rE
r�ra
r�rb
r�rc
rd
ri
rn
r6
rq
rr
rt
rw
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�r�
r�
r�
r�
r)r)r)r+r

s

 
, !@  2 4    V7;!$K  

f 







�>,UnY="c*" IK23 .*!'r
FcCs&t�
t�
}||_|
|_||_||_|S)
z�Create a decimal instance directly, without any validation, normalization (e.g. removal of leading zeros) or argument conversion. This function is for *internal use only*. )rcrdr
r;r<rQrR)rCZcoefficientr
Zspecialr0r)r)r+r:�s



r:c@s(eZ
dZd
Zdd�Zdd�Zdd�ZdS) rOz�Context manager class to support localcontext(). Sets a copy of the supplied context in __enter__() and restores the previous decimal context in __exit__() cCs|
��|_
dSr()rM�new_context)r0r�
r)r)r+�__init__s
z_ContextManager.__init__c

Cst�|_
t|j�

|jSr()r� saved_contextrr�
r�r)r)r+� __enter__s


z_ContextManager.__enter__cCst|j
�

dSr()rr�
)r0�
t�
v�tbr)r)r+�__exit__s
z_ContextManager.__exit__N)r4r5r6r7r�
r�
r�
r)r)r)r+rOs
rOc @s�eZ
dZd
Zd�dd�
Zdd�Zdd�Zd d �Zdd�Zd d�Z dd�Z dd�Zdd�Zdd�Z dd�ZeZd�dd�
Zdd�Zdd�Zdd �ZdZd!d"�Zd#d$�Zd%d&�Zd�d(d)�
Zd*d+�Zd,d-�Zd.d/�Zd0d1�Zd2d3�Zd4d5�Zd6d7�Zd8d9�Z d:d;�Z!dd?�Z#d@dA�Z$dBdC�Z%dDdE�Z&dFdG�Z'dHdI�Z(dJdK�Z)dLdM�Z*dNdO�Z+dPdQ�Z,dRdS�Z-dTdU�Z.dVdW�Z/dXdY�Z0dZd[�Z1d\d]�Z2d^d_�Z3d`da�Z4dbdc�Z5ddde�Z6dfdg�Z7dhdi�Z8djdk�Z9dldm�Z:dndo�Z;dpdq�Zdvdw�Z?dxdy�Z@dzd{�ZAd|d}�ZBd~d�ZCd�d��ZDd�d��ZEd�d��ZFd�d��ZGd�d�d��
ZHd�d��ZId�d��ZJd�d��ZKd�d��ZLd�d��ZMd�d��ZNd�d��ZOd�d��ZPd�d��ZQd�d��ZRd�d��ZSd�d��ZTd�d��ZUd�d��ZVeVZWdS)�ra�Contains the context for a Decimal instance. Contains: prec - precision (for use in rounding, division, square roots..) rounding - rounding type (how you round) traps - If traps[exception] = 1, then the exception is raised when it is caused. Otherwise, a value is substituted in. flags - When an exception is caused, flags[exception] is set. (Whether or not the trap_enabler is set) Should be reset by user of Decimal instance. Emin - Minimum exponent Emax - Maximum exponent capitals - If 1, 1*10^1 is printed as 1E+1. If 0, printed as 1e1 clamp - If 1, change exponents if too high (Default 0) Nc s<
zt} Wnt
y


Yn0|
du
r(|
n| j|_|du
r<|n| j|_|du
rP|n| j|_|du
rd|n| j|_|du
rx|n| j|_|du
r�|n| j|_| dur�g|_n| |_�
dur�| j � �|_ n.t�
t�s�t�
f
d
d�t �
D�
�
|_ n�
|_ �du�
rt�t d�|_n0t�t��
s2t�f
dd�t �D�
�
|_n�|_dS)Nc
3s|]}
|
t|
�v�
fV
qdSr(�
rW�rz
r��
r9
r)r+� Ir-z#Context.__init__..r&c
3s|]}
|
t|
�v�
fV
qdSr(r�
r�
�
r:
r)r+r�
Pr-)r� NameErrorrFrErD
rGr�r��_ignored_flagsr9
rMrer�
r8
�fromkeysr:
)r0rFrErD
rGr�r�r:
r9
r�
Zdcr))r:
r9
r+r�
0s.














zContext.__init__cCs�t|t
�std
|
�
�
|dkr<||kr�td|
|||f�
�
nJ|dkrb||kr�td|
|||f�
�
n$||ksr||kr�td|
|||f�
�
t�||
|�S)Nz%s must be an integer�-infz%s must be in [%s, %d]. got: %sr�
z%s must be in [%d, %s]. got: %sz%s must be in [%d, %d]. got %s)rerWrxrrrc�__setattr__)r0�namerzZvminZvmaxr)r)r+�_set_integer_checkTs









zContext._set_integer_checkcCs`t|t
�std
|�
�
|D]}|tv
rtd|�
�
qtD]}||v
r8td|�
�
q8t�||
|�S)Nz%s must be a signal dictz%s is not a valid signal dict)rer�
rxr8
�KeyErrorrcr�
)r0r�
r��keyr)r)r+�_set_signal_dictbs








zContext._set_signal_dictcCs�|
d
kr|�|
|dd�S|
dkr0|�|
|dd�S|
dkrH|�|
|dd�S|
dkr`|�|
|dd�S|
d krx|�|
|dd�S|
d kr�|t
v
r�td|�
�
t�||
|�S|
dks�|
d kr�|�|
|�S|
dkr�t�||
|�Std|
�
�
dS)NrFr.r�
rD
r�
r&rGr�r�rEz%s: invalid rounding moder:
r9
r�
z.'decimal.Context' object has no attribute '%s')r�
�_rounding_modesrxrcr�
r�
�AttributeError)r0r�
rzr)r)r+r�
ms*

















�zContext.__setattr__cCstd
|
�
�
dS)Nz%s cannot be deleted)
r�
)r0r�
r)r)r+�__delattr__�s
zContext.__delattr__c
 CsNd
d�|j�
�D�
}
dd�|j�
�D�
}|j|j|j|j|j|j|j |
|ffS)Nc
Ssg|]\}
}|r|
�qSr)r)�rz
�sigr�
r)r)r+r|
�r-z&Context.__reduce__..c
Ssg|]\}
}|r|
�qSr)r)r�
r)r)r+r|
�r-) r:
�itemsr9
r�
rFrErD
rGr�r�)r0r:
r9
r)r)r+r�
�s




��zContext.__reduce__c
Cs|g}
|
�d
t
|�
�

dd�|j��D�
}|
�dd�|�
d�

dd�|j��D�
}|
�dd�|�
d�

d�|
�
d S) zShow the current context.zrContext(prec=%(prec)d, rounding=%(rounding)s, Emin=%(Emin)d, Emax=%(Emax)d, capitals=%(capitals)d, clamp=%(clamp)dc
Ssg|]\}
}|r|
j�qSr)�
r4)rz
r�r�
r)r)r+r|
�r-z$Context.__repr__..zflags=[z, �
]c
Ssg|]\}
}|r|
j�qSr)r�
)rz
r�
r�
r)r)r+r|
�r-ztraps=[�
))rs�varsr:
r�
rtr9
)r0r��namesr)r)r+r��s
�



zContext.__repr__c
Cs|jD]}
d
|j|
<qdS)zReset all flags to zeror&Nr�
�r0�flagr)r)r+rN�s
zContext.clear_flagsc
Cs|jD]}
d
|j|
<qdS)zReset all traps to zeror&Nr�
r�
r)r)r+�clear_traps�s
zContext.clear_trapsc
 Cs.t|j
|j|j|j|j|j|j|j|j � }
|
S)
z!Returns a shallow copy from self.) rrFrErD
rGr�r�r:
r9
r�
�r0Zncr)r)r+rK
�s 

�zContext._shallow_copyc
 Cs6t|j
|j|j|j|j|j|j��|j ��|j � }
|
S)
zReturns a deep copy from self.)rrFrErD
rGr�r�r:
rMr9
r�
r�
r)r)r+rM�s


�zContext.copycGs^t�
|
|
�}||jvr*|�j|g
|�
R�Sd
|j|<|j|sR|
�j|g
|�
R�S||�
�
dS)a#
Handles an error If the flag is in _ignored_flags, returns the default response. Otherwise, it sets the flag, then, if the corresponding trap_enabler is set, it reraises the exception. Otherwise, it returns the default value after setting the flag. r.N)�_condition_maprIr�
r2r:
r9
)r0Z conditionZexplanationr*�errorr)r)r+rj�s

zContext._raise_errorc

Cs |jt
�S)
z$Ignore all flags, if they are raised)� _ignore_flagsr8
r�r)r)r+r�
�szContext._ignore_all_flagsc
Gs|jt
|
�
|_t
|
�
S)
z$Ignore the flags, if they are raised)r�
rp)r0r:
r)r)r+r�
�s
zContext._ignore_flagsc
Gs8|
rt|
d
t
tf�r|
d
}
|
D]}|j�|�

q"dS)z+Stop ignoring the flags, if they are raisedr&N)rerqrpr�
�remove)r0r:
r�
r)r)r+� _regard_flags�s


zContext._regard_flagsc

Cst|j
|jd
�
S)z!Returns Etiny (= Emin - prec + 1)r.)rWrD
rFr�r)r)r+r��sz Context.Etinyc

Cst|j
|jd
�
S)z,Returns maximum exponent (= Emax - prec + 1)r.)rWrGrFr�r)r)r+r��szContext.EtopcCs|j}|
|_|S)
a�
Sets the rounding type. Sets the rounding type, and returns the current (previous) rounding type. Often used like: context = context.copy() # so you don't change the calling context # if an error occurs in the middle. rounding = context._set_rounding(ROUND_UP) val = self.__sub__(other, context=context) context._set_rounding(rounding) This will make it round up for that operation. )
rE)r0r�
rEr)r)r+rL
�s

zContext._set_roundingrScCsjt|
t
�r*|
|
��ksd
|
vr*|�td�St|
|d�}|��r`t|j�
|j |j kr`|�td�S|�|�
S)z�Creates a new Decimal instance but using self as context. This method implements the to-number operation of the IBM Decimal specification.rTzAtrailing or leading whitespace and underscores are not permitted.rLzdiagnostic info too long in NaN)rerfrhrjrr
r�rlr<rFr�r�)r0rh
r�r)r)r+�create_decimal�s

�


�zContext.create_decimalcCst�
|
�
}|�|�
S)
a�
Creates a new Decimal instance from a float but rounding using self as the context. >>> context = Context(prec=5, rounding=ROUND_DOWN) >>> context.create_decimal_from_float(3.1415926535897932) Decimal('3.1415') >>> context = Context(prec=5, traps=[Inexact]) >>> context.create_decimal_from_float(3.1415926535897932) Traceback (most recent call last): ... decimal.Inexact: None )r
rwr�)r0r�r�r)r)r+�create_decimal_from_floats
z!Context.create_decimal_from_floatcCst|
d
d�}
|
j
|d�
S)a[Returns the absolute value of the operand. If the operand is negative, the result is the same as using the minus operation on the operand. Otherwise, the result is the same as using the plus operation on the operand. >>> ExtendedContext.abs(Decimal('2.1')) Decimal('2.1') >>> ExtendedContext.abs(Decimal('-100')) Decimal('100') >>> ExtendedContext.abs(Decimal('101.5')) Decimal('101.5') >>> ExtendedContext.abs(Decimal('-101.5')) Decimal('101.5') >>> ExtendedContext.abs(-1) Decimal('1') Tr�rL)r�r��r0r3
r)r)r+rn!s
zContext.abscCs8t|
d
d�}
|
j
||d�}|tur0td|�
�
n|SdS)a�
Return the sum of the two operands. >>> ExtendedContext.add(Decimal('12'), Decimal('7.00')) Decimal('19.00') >>> ExtendedContext.add(Decimal('1E+2'), Decimal('1.01E+4')) Decimal('1.02E+4') >>> ExtendedContext.add(1, Decimal(2)) Decimal('3') >>> ExtendedContext.add(Decimal(8), 5) Decimal('13') >>> ExtendedContext.add(5, 5) Decimal('10') Tr�rL�Unable to convert %s to DecimalN)r�r�r�rx�r0r3
r{
r�r)r)r+�add6s 


zContext.addcCst|
�
|�
�
Sr()rfr�r�
r)r)r+�_applyKs
zContext._applycCst|
t
�std
�
�
|
��S)z�Returns the same Decimal object. As we do not have different encodings for the same number, the received object already is in its canonical form. >>> ExtendedContext.canonical(Decimal('2.50')) Decimal('2.50') z,canonical requires a Decimal as an argument.)rer
rxrU
r�
r)r)r+rU
Ns

zContext.canonicalcCst|
d
d�}
|
j
||d�S)a�Compares values numerically. If the signs of the operands differ, a value representing each operand ('-1' if the operand is less than zero, '0' if the operand is zero or negative zero, or '1' if the operand is greater than zero) is used in place of that operand for the comparison instead of the actual operand. The comparison is then effected by subtracting the second operand from the first and then returning a value according to the result of the subtraction: '-1' if the result is less than zero, '0' if the result is zero or negative zero, or '1' if the result is greater than zero. >>> ExtendedContext.compare(Decimal('2.1'), Decimal('3')) Decimal('-1') >>> ExtendedContext.compare(Decimal('2.1'), Decimal('2.1')) Decimal('0') >>> ExtendedContext.compare(Decimal('2.1'), Decimal('2.10')) Decimal('0') >>> ExtendedContext.compare(Decimal('3'), Decimal('2.1')) Decimal('1') >>> ExtendedContext.compare(Decimal('2.1'), Decimal('-3')) Decimal('1') >>> ExtendedContext.compare(Decimal('-3'), Decimal('2.1')) Decimal('-1') >>> ExtendedContext.compare(1, 2) Decimal('-1') >>> ExtendedContext.compare(Decimal(1), 2) Decimal('-1') >>> ExtendedContext.compare(1, Decimal(2)) Decimal('-1') Tr�rL)r�r��r0r3
r{
r)r)r+r�[s!
zContext.comparecCst|
d
d�}
|
j
||d�S)aCompares the values of the two operands numerically. It's pretty much like compare(), but all NaNs signal, with signaling NaNs taking precedence over quiet NaNs. >>> c = ExtendedContext >>> c.compare_signal(Decimal('2.1'), Decimal('3')) Decimal('-1') >>> c.compare_signal(Decimal('2.1'), Decimal('2.1')) Decimal('0') >>> c.flags[InvalidOperation] = 0 >>> print(c.flags[InvalidOperation]) 0 >>> c.compare_signal(Decimal('NaN'), Decimal('2.1')) Decimal('NaN') >>> print(c.flags[InvalidOperation]) 1 >>> c.flags[InvalidOperation] = 0 >>> print(c.flags[InvalidOperation]) 0 >>> c.compare_signal(Decimal('sNaN'), Decimal('2.1')) Decimal('NaN') >>> print(c.flags[InvalidOperation]) 1 >>> c.compare_signal(-1, 2) Decimal('-1') >>> c.compare_signal(Decimal(-1), 2) Decimal('-1') >>> c.compare_signal(-1, Decimal(2)) Decimal('-1') Tr�rL)r�rV
r�
r)r)r+rV
s 
zContext.compare_signalcCst|
d
d�}
|
�
|�
S)a+Compares two operands using their abstract representation. This is not like the standard compare, which use their numerical value. Note that a total ordering is defined for all possible abstract representations. >>> ExtendedContext.compare_total(Decimal('12.73'), Decimal('127.9')) Decimal('-1') >>> ExtendedContext.compare_total(Decimal('-127'), Decimal('12')) Decimal('-1') >>> ExtendedContext.compare_total(Decimal('12.30'), Decimal('12.3')) Decimal('-1') >>> ExtendedContext.compare_total(Decimal('12.30'), Decimal('12.30')) Decimal('0') >>> ExtendedContext.compare_total(Decimal('12.3'), Decimal('12.300')) Decimal('1') >>> ExtendedContext.compare_total(Decimal('12.3'), Decimal('NaN')) Decimal('-1') >>> ExtendedContext.compare_total(1, 2) Decimal('-1') >>> ExtendedContext.compare_total(Decimal(1), 2) Decimal('-1') >>> ExtendedContext.compare_total(1, Decimal(2)) Decimal('-1') Tr�)r�rR
r�
r)r)r+rR
�s
zContext.compare_totalcCst|
d
d�}
|
�
|�
S)z�Compares two operands using their abstract representation ignoring sign. Like compare_total, but with operand's sign ignored and assumed to be 0. Tr�)r�rZ
r�
r)r)r+rZ
�s
zContext.compare_total_magcCst|
d
d�}
|
�
�S)a
Returns a copy of the operand with the sign set to 0. >>> ExtendedContext.copy_abs(Decimal('2.1')) Decimal('2.1') >>> ExtendedContext.copy_abs(Decimal('-100')) Decimal('100') >>> ExtendedContext.copy_abs(-1) Decimal('1') Tr�)r�r�r�
r)r)r+r��s 
zContext.copy_abscCst|
d
d�}
t
|
�
S)a
Returns a copy of the decimal object. >>> ExtendedContext.copy_decimal(Decimal('2.1')) Decimal('2.1') >>> ExtendedContext.copy_decimal(Decimal('-1.00')) Decimal('-1.00') >>> ExtendedContext.copy_decimal(1) Decimal('1') Tr�)r�r
r�
r)r)r+�copy_decimal�s 
zContext.copy_decimalcCst|
d
d�}
|
�
�S)a(
Returns a copy of the operand with the sign inverted. >>> ExtendedContext.copy_negate(Decimal('101.5')) Decimal('-101.5') >>> ExtendedContext.copy_negate(Decimal('-101.5')) Decimal('101.5') >>> ExtendedContext.copy_negate(1) Decimal('-1') Tr�)r�r�r�
r)r)r+r��s 
zContext.copy_negatecCst|
d
d�}
|
�
|�
S)aCopies the second operand's sign to the first one. In detail, it returns a copy of the first operand with the sign equal to the sign of the second operand. >>> ExtendedContext.copy_sign(Decimal( '1.50'), Decimal('7.33')) Decimal('1.50') >>> ExtendedContext.copy_sign(Decimal('-1.50'), Decimal('7.33')) Decimal('1.50') >>> ExtendedContext.copy_sign(Decimal( '1.50'), Decimal('-7.33')) Decimal('-1.50') >>> ExtendedContext.copy_sign(Decimal('-1.50'), Decimal('-7.33')) Decimal('-1.50') >>> ExtendedContext.copy_sign(1, -2) Decimal('-1') >>> ExtendedContext.copy_sign(Decimal(1), -2) Decimal('-1') >>> ExtendedContext.copy_sign(1, Decimal(-2)) Decimal('-1') Tr�)r�r[
r�
r)r)r+r[
�s
zContext.copy_signcCs8t|
d
d�}
|
j
||d�}|tur0td|�
�
n|SdS)a�Decimal division in a specified context. >>> ExtendedContext.divide(Decimal('1'), Decimal('3')) Decimal('0.333333333') >>> ExtendedContext.divide(Decimal('2'), Decimal('3')) Decimal('0.666666667') >>> ExtendedContext.divide(Decimal('5'), Decimal('2')) Decimal('2.5') >>> ExtendedContext.divide(Decimal('1'), Decimal('10')) Decimal('0.1') >>> ExtendedContext.divide(Decimal('12'), Decimal('12')) Decimal('1') >>> ExtendedContext.divide(Decimal('8.00'), Decimal('2')) Decimal('4.00') >>> ExtendedContext.divide(Decimal('2.400'), Decimal('2.0')) Decimal('1.20') >>> ExtendedContext.divide(Decimal('1000'), Decimal('100')) Decimal('10') >>> ExtendedContext.divide(Decimal('1000'), Decimal('1')) Decimal('1000') >>> ExtendedContext.divide(Decimal('2.40E+6'), Decimal('2')) Decimal('1.20E+6') >>> ExtendedContext.divide(5, 5) Decimal('1') >>> ExtendedContext.divide(Decimal(5), 5) Decimal('1') >>> ExtendedContext.divide(5, Decimal(5)) Decimal('1') Tr�rLr�
N)r�r�r�rxr�
r)r)r+�divides 


zContext.dividecCs8t|
d
d�}
|
j
||d�}|tur0td|�
�
n|SdS)a/Divides two numbers and returns the integer part of the result. >>> ExtendedContext.divide_int(Decimal('2'), Decimal('3')) Decimal('0') >>> ExtendedContext.divide_int(Decimal('10'), Decimal('3')) Decimal('3') >>> ExtendedContext.divide_int(Decimal('1'), Decimal('0.3')) Decimal('3') >>> ExtendedContext.divide_int(10, 3) Decimal('3') >>> ExtendedContext.divide_int(Decimal(10), 3) Decimal('3') >>> ExtendedContext.divide_int(10, Decimal(3)) Decimal('3') Tr�rLr�
N)r�r�r�rxr�
r)r)r+� divide_int+s 


zContext.divide_intcCs8t|
d
d�}
|
j
||d�}|tur0td|�
�
n|SdS)a�
Return (a // b, a % b). >>> ExtendedContext.divmod(Decimal(8), Decimal(3)) (Decimal('2'), Decimal('2')) >>> ExtendedContext.divmod(Decimal(8), Decimal(4)) (Decimal('2'), Decimal('0')) >>> ExtendedContext.divmod(8, 4) (Decimal('2'), Decimal('0')) >>> ExtendedContext.divmod(Decimal(8), 4) (Decimal('2'), Decimal('0')) >>> ExtendedContext.divmod(8, Decimal(4)) (Decimal('2'), Decimal('0')) Tr�rLr�
N)r�r�r�rxr�
r)r)r+r�Bs 


zContext.divmodcCst|
d
d�}
|
j
|d�
S)a#Returns e ** a. >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> c.exp(Decimal('-Infinity')) Decimal('0') >>> c.exp(Decimal('-1')) Decimal('0.367879441') >>> c.exp(Decimal('0')) Decimal('1') >>> c.exp(Decimal('1')) Decimal('2.71828183') >>> c.exp(Decimal('0.693147181')) Decimal('2.00000000') >>> c.exp(Decimal('+Infinity')) Decimal('Infinity') >>> c.exp(10) Decimal('22026.4658') Tr�rL)r�rXr�
r)r)r+rXWs
zContext.expcCst|
d
d�}
|
j
|||d�S)aReturns a multiplied by b, plus c. The first two operands are multiplied together, using multiply, the third operand is then added to the result of that multiplication, using add, all with only one final rounding. >>> ExtendedContext.fma(Decimal('3'), Decimal('5'), Decimal('7')) Decimal('22') >>> ExtendedContext.fma(Decimal('3'), Decimal('-5'), Decimal('7')) Decimal('-8') >>> ExtendedContext.fma(Decimal('888565290'), Decimal('1557.96930'), Decimal('-86087.7578')) Decimal('1.38435736E+12') >>> ExtendedContext.fma(1, 3, 4) Decimal('7') >>> ExtendedContext.fma(1, Decimal(3), 4) Decimal('7') >>> ExtendedContext.fma(1, 3, Decimal(4)) Decimal('7') Tr�rL)r�r
)r0r3
r{
rN
r)r)r+r
os
zContext.fmacCst|
t
�std
�
�
|
��S)a
Return True if the operand is canonical; otherwise return False. Currently, the encoding of a Decimal instance is always canonical, so this method returns True for any Decimal. >>> ExtendedContext.is_canonical(Decimal('2.50')) True z/is_canonical requires a Decimal as an argument.)rer
rxr^
r�
r)r)r+r^
�s

zContext.is_canonicalcCst|
d
d�}
|
�
�S)a,Return True if the operand is finite; otherwise return False. A Decimal instance is considered finite if it is neither infinite nor a NaN. >>> ExtendedContext.is_finite(Decimal('2.50')) True >>> ExtendedContext.is_finite(Decimal('-0.3')) True >>> ExtendedContext.is_finite(Decimal('0')) True >>> ExtendedContext.is_finite(Decimal('Inf')) False >>> ExtendedContext.is_finite(Decimal('NaN')) False >>> ExtendedContext.is_finite(1) True Tr�)r�r_
r�
r)r)r+r_
�s
zContext.is_finitecCst|
d
d�}
|
�
�S)aU
Return True if the operand is infinite; otherwise return False. >>> ExtendedContext.is_infinite(Decimal('2.50')) False >>> ExtendedContext.is_infinite(Decimal('-Inf')) True >>> ExtendedContext.is_infinite(Decimal('NaN')) False >>> ExtendedContext.is_infinite(1) False Tr�)r�rE
r�
r)r)r+rE
�s
zContext.is_infinitecCst|
d
d�}
|
�
�S)aO
Return True if the operand is a qNaN or sNaN; otherwise return False. >>> ExtendedContext.is_nan(Decimal('2.50')) False >>> ExtendedContext.is_nan(Decimal('NaN')) True >>> ExtendedContext.is_nan(Decimal('-sNaN')) True >>> ExtendedContext.is_nan(1) False Tr�)r�r�r�
r)r)r+r��s 
zContext.is_nancCst|
d
d�}
|
j
|d�
S)a�
Return True if the operand is a normal number; otherwise return False. >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> c.is_normal(Decimal('2.50')) True >>> c.is_normal(Decimal('0.1E-999')) False >>> c.is_normal(Decimal('0.00')) False >>> c.is_normal(Decimal('-Inf')) False >>> c.is_normal(Decimal('NaN')) False >>> c.is_normal(1) True Tr�rL)r�ra
r�
r)r)r+ra
�s
zContext.is_normalcCst|
d
d�}
|
�
�S)aH
Return True if the operand is a quiet NaN; otherwise return False. >>> ExtendedContext.is_qnan(Decimal('2.50')) False >>> ExtendedContext.is_qnan(Decimal('NaN')) True >>> ExtendedContext.is_qnan(Decimal('sNaN')) False >>> ExtendedContext.is_qnan(1) False Tr�)r�r�r�
r)r)r+r��s
zContext.is_qnancCst|
d
d�}
|
�
�S)a�
Return True if the operand is negative; otherwise return False. >>> ExtendedContext.is_signed(Decimal('2.50')) False >>> ExtendedContext.is_signed(Decimal('-12')) True >>> ExtendedContext.is_signed(Decimal('-0')) True >>> ExtendedContext.is_signed(8) False >>> ExtendedContext.is_signed(-8) True Tr�)r�rb
r�
r)r)r+rb
�s
zContext.is_signedcCst|
d
d�}
|
�
�S)aT
Return True if the operand is a signaling NaN; otherwise return False. >>> ExtendedContext.is_snan(Decimal('2.50')) False >>> ExtendedContext.is_snan(Decimal('NaN')) False >>> ExtendedContext.is_snan(Decimal('sNaN')) True >>> ExtendedContext.is_snan(1) False Tr�)r�r�r�
r)r)r+r��s 
zContext.is_snancCst|
d
d�}
|
j
|d�
S)a�
Return True if the operand is subnormal; otherwise return False. >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> c.is_subnormal(Decimal('2.50')) False >>> c.is_subnormal(Decimal('0.1E-999')) True >>> c.is_subnormal(Decimal('0.00')) False >>> c.is_subnormal(Decimal('-Inf')) False >>> c.is_subnormal(Decimal('NaN')) False >>> c.is_subnormal(1) False Tr�rL)r�rc
r�
r)r)r+rc
s
zContext.is_subnormalcCst|
d
d�}
|
�
�S)au
Return True if the operand is a zero; otherwise return False. >>> ExtendedContext.is_zero(Decimal('0')) True >>> ExtendedContext.is_zero(Decimal('2.50')) False >>> ExtendedContext.is_zero(Decimal('-0E+2')) True >>> ExtendedContext.is_zero(1) False >>> ExtendedContext.is_zero(0) True Tr�)r�rd
r�
r)r)r+rd
%s
zContext.is_zerocCst|
d
d�}
|
j
|d�
S)a�
Returns the natural (base e) logarithm of the operand. >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> c.ln(Decimal('0')) Decimal('-Infinity') >>> c.ln(Decimal('1.000')) Decimal('0') >>> c.ln(Decimal('2.71828183')) Decimal('1.00000000') >>> c.ln(Decimal('10')) Decimal('2.30258509') >>> c.ln(Decimal('+Infinity')) Decimal('Infinity') >>> c.ln(1) Decimal('0') Tr�rL)r�rn
r�
r)r)r+rn
6s
z Context.lncCst|
d
d�}
|
j
|d�
S)a�Returns the base 10 logarithm of the operand. >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> c.log10(Decimal('0')) Decimal('-Infinity') >>> c.log10(Decimal('0.001')) Decimal('-3') >>> c.log10(Decimal('1.000')) Decimal('0') >>> c.log10(Decimal('2')) Decimal('0.301029996') >>> c.log10(Decimal('10')) Decimal('1') >>> c.log10(Decimal('70')) Decimal('1.84509804') >>> c.log10(Decimal('+Infinity')) Decimal('Infinity') >>> c.log10(0) Decimal('-Infinity') >>> c.log10(1) Decimal('0') Tr�rL)r�rq
r�
r)r)r+rq
Ls
z Context.log10cCst|
d
d�}
|
j
|d�
S)a4 Returns the exponent of the magnitude of the operand's MSD. The result is the integer which is the exponent of the magnitude of the most significant digit of the operand (as though the operand were truncated to a single digit while maintaining the value of that digit and without limiting the resulting exponent). >>> ExtendedContext.logb(Decimal('250')) Decimal('2') >>> ExtendedContext.logb(Decimal('2.50')) Decimal('0') >>> ExtendedContext.logb(Decimal('0.03')) Decimal('-2') >>> ExtendedContext.logb(Decimal('0')) Decimal('-Infinity') >>> ExtendedContext.logb(1) Decimal('0') >>> ExtendedContext.logb(10) Decimal('1') >>> ExtendedContext.logb(100) Decimal('2') Tr�rL)r�rr
r�
r)r)r+rr
hs
zContext.logbcCst|
d
d�}
|
j
||d�S)a�Applies the logical operation 'and' between each operand's digits. The operands must be both logical numbers. >>> ExtendedContext.logical_and(Decimal('0'), Decimal('0')) Decimal('0') >>> ExtendedContext.logical_and(Decimal('0'), Decimal('1')) Decimal('0') >>> ExtendedContext.logical_and(Decimal('1'), Decimal('0')) Decimal('0') >>> ExtendedContext.logical_and(Decimal('1'), Decimal('1')) Decimal('1') >>> ExtendedContext.logical_and(Decimal('1100'), Decimal('1010')) Decimal('1000') >>> ExtendedContext.logical_and(Decimal('1111'), Decimal('10')) Decimal('10') >>> ExtendedContext.logical_and(110, 1101) Decimal('100') >>> ExtendedContext.logical_and(Decimal(110), 1101) Decimal('100') >>> ExtendedContext.logical_and(110, Decimal(1101)) Decimal('100') Tr�rL)r�r�
r�
r)r)r+r�
�s
zContext.logical_andcCst|
d
d�}
|
j
|d�
S)aInvert all the digits in the operand. The operand must be a logical number. >>> ExtendedContext.logical_invert(Decimal('0')) Decimal('111111111') >>> ExtendedContext.logical_invert(Decimal('1')) Decimal('111111110') >>> ExtendedContext.logical_invert(Decimal('111111111')) Decimal('0') >>> ExtendedContext.logical_invert(Decimal('101010101')) Decimal('10101010') >>> ExtendedContext.logical_invert(1101) Decimal('111110010') Tr�rL)r�r�
r�
r)r)r+r�
�s
zContext.logical_invertcCst|
d
d�}
|
j
||d�S)a�Applies the logical operation 'or' between each operand's digits. The operands must be both logical numbers. >>> ExtendedContext.logical_or(Decimal('0'), Decimal('0')) Decimal('0') >>> ExtendedContext.logical_or(Decimal('0'), Decimal('1')) Decimal('1') >>> ExtendedContext.logical_or(Decimal('1'), Decimal('0')) Decimal('1') >>> ExtendedContext.logical_or(Decimal('1'), Decimal('1')) Decimal('1') >>> ExtendedContext.logical_or(Decimal('1100'), Decimal('1010')) Decimal('1110') >>> ExtendedContext.logical_or(Decimal('1110'), Decimal('10')) Decimal('1110') >>> ExtendedContext.logical_or(110, 1101) Decimal('1111') >>> ExtendedContext.logical_or(Decimal(110), 1101) Decimal('1111') >>> ExtendedContext.logical_or(110, Decimal(1101)) Decimal('1111') Tr�rL)r�r�
r�
r)r)r+r�
�s
zContext.logical_orcCst|
d
d�}
|
j
||d�S)a�Applies the logical operation 'xor' between each operand's digits. The operands must be both logical numbers. >>> ExtendedContext.logical_xor(Decimal('0'), Decimal('0')) Decimal('0') >>> ExtendedContext.logical_xor(Decimal('0'), Decimal('1')) Decimal('1') >>> ExtendedContext.logical_xor(Decimal('1'), Decimal('0')) Decimal('1') >>> ExtendedContext.logical_xor(Decimal('1'), Decimal('1')) Decimal('0') >>> ExtendedContext.logical_xor(Decimal('1100'), Decimal('1010')) Decimal('110') >>> ExtendedContext.logical_xor(Decimal('1111'), Decimal('10')) Decimal('1101') >>> ExtendedContext.logical_xor(110, 1101) Decimal('1011') >>> ExtendedContext.logical_xor(Decimal(110), 1101) Decimal('1011') >>> ExtendedContext.logical_xor(110, Decimal(1101)) Decimal('1011') Tr�rL)r�r�
r�
r)r)r+r�
�s
zContext.logical_xorcCst|
d
d�}
|
j
||d�S)a�max compares two values numerically and returns the maximum. If either operand is a NaN then the general rules apply. Otherwise, the operands are compared as though by the compare operation. If they are numerically equal then the left-hand operand is chosen as the result. Otherwise the maximum (closer to positive infinity) of the two operands is chosen as the result. >>> ExtendedContext.max(Decimal('3'), Decimal('2')) Decimal('3') >>> ExtendedContext.max(Decimal('-10'), Decimal('3')) Decimal('3') >>> ExtendedContext.max(Decimal('1.0'), Decimal('1')) Decimal('1') >>> ExtendedContext.max(Decimal('7'), Decimal('NaN')) Decimal('7') >>> ExtendedContext.max(1, 2) Decimal('2') >>> ExtendedContext.max(Decimal(1), 2) Decimal('2') >>> ExtendedContext.max(1, Decimal(2)) Decimal('2') Tr�rL)r�r�r�
r)r)r+r��s
zContext.maxcCst|
d
d�}
|
j
||d�S)a�
Compares the values numerically with their sign ignored. >>> ExtendedContext.max_mag(Decimal('7'), Decimal('NaN')) Decimal('7') >>> ExtendedContext.max_mag(Decimal('7'), Decimal('-10')) Decimal('-10') >>> ExtendedContext.max_mag(1, -2) Decimal('-2') >>> ExtendedContext.max_mag(Decimal(1), -2) Decimal('-2') >>> ExtendedContext.max_mag(1, Decimal(-2)) Decimal('-2') Tr�rL)r�r�
r�
r)r)r+r�

s
zContext.max_magcCst|
d
d�}
|
j
||d�S)a�min compares two values numerically and returns the minimum. If either operand is a NaN then the general rules apply. Otherwise, the operands are compared as though by the compare operation. If they are numerically equal then the left-hand operand is chosen as the result. Otherwise the minimum (closer to negative infinity) of the two operands is chosen as the result. >>> ExtendedContext.min(Decimal('3'), Decimal('2')) Decimal('2') >>> ExtendedContext.min(Decimal('-10'), Decimal('3')) Decimal('-10') >>> ExtendedContext.min(Decimal('1.0'), Decimal('1')) Decimal('1.0') >>> ExtendedContext.min(Decimal('7'), Decimal('NaN')) Decimal('7') >>> ExtendedContext.min(1, 2) Decimal('1') >>> ExtendedContext.min(Decimal(1), 2) Decimal('1') >>> ExtendedContext.min(1, Decimal(29)) Decimal('1') Tr�rL)r�r�r�
r)r)r+r�s
zContext.mincCst|
d
d�}
|
j
||d�S)a�
Compares the values numerically with their sign ignored. >>> ExtendedContext.min_mag(Decimal('3'), Decimal('-2')) Decimal('-2') >>> ExtendedContext.min_mag(Decimal('-3'), Decimal('NaN')) Decimal('-3') >>> ExtendedContext.min_mag(1, -2) Decimal('1') >>> ExtendedContext.min_mag(Decimal(1), -2) Decimal('1') >>> ExtendedContext.min_mag(1, Decimal(-2)) Decimal('1') Tr�rL)r�r�
r�
r)r)r+r�
-s
zContext.min_magcCst|
d
d�}
|
j
|d�
S)a�
Minus corresponds to unary prefix minus in Python. The operation is evaluated using the same rules as subtract; the operation minus(a) is calculated as subtract('0', a) where the '0' has the same exponent as the operand. >>> ExtendedContext.minus(Decimal('1.3')) Decimal('-1.3') >>> ExtendedContext.minus(Decimal('-1.3')) Decimal('1.3') >>> ExtendedContext.minus(1) Decimal('-1') Tr�rL)r�r�r�
r)r)r+�minus>s
z Context.minuscCs8t|
d
d�}
|
j
||d�}|tur0td|�
�
n|SdS)a�multiply multiplies two operands. If either operand is a special value then the general rules apply. Otherwise, the operands are multiplied together ('long multiplication'), resulting in a number which may be as long as the sum of the lengths of the two operands. >>> ExtendedContext.multiply(Decimal('1.20'), Decimal('3')) Decimal('3.60') >>> ExtendedContext.multiply(Decimal('7'), Decimal('3')) Decimal('21') >>> ExtendedContext.multiply(Decimal('0.9'), Decimal('0.8')) Decimal('0.72') >>> ExtendedContext.multiply(Decimal('0.9'), Decimal('-0')) Decimal('-0.0') >>> ExtendedContext.multiply(Decimal('654321'), Decimal('654321')) Decimal('4.28135971E+11') >>> ExtendedContext.multiply(7, 7) Decimal('49') >>> ExtendedContext.multiply(Decimal(7), 7) Decimal('49') >>> ExtendedContext.multiply(7, Decimal(7)) Decimal('49') Tr�rLr�
N)r�r�r�rxr�
r)r)r+�multiplyOs 


zContext.multiplycCst|
d
d�}
|
j
|d�
S)a"Returns the largest representable number smaller than a. >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> ExtendedContext.next_minus(Decimal('1')) Decimal('0.999999999') >>> c.next_minus(Decimal('1E-1007')) Decimal('0E-1007') >>> ExtendedContext.next_minus(Decimal('-1.00000003')) Decimal('-1.00000004') >>> c.next_minus(Decimal('Infinity')) Decimal('9.99999999E+999') >>> c.next_minus(1) Decimal('0.999999999') Tr�rL)r�r�
r�
r)r)r+r�
os
zContext.next_minuscCst|
d
d�}
|
j
|d�
S)aReturns the smallest representable number larger than a. >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> ExtendedContext.next_plus(Decimal('1')) Decimal('1.00000001') >>> c.next_plus(Decimal('-1E-1007')) Decimal('-0E-1007') >>> ExtendedContext.next_plus(Decimal('-1.00000003')) Decimal('-1.00000002') >>> c.next_plus(Decimal('-Infinity')) Decimal('-9.99999999E+999') >>> c.next_plus(1) Decimal('1.00000001') Tr�rL)r�r�
r�
r)r)r+r�
�s
zContext.next_pluscCst|
d
d�}
|
j
||d�S)a�Returns the number closest to a, in direction towards b. The result is the closest representable number from the first operand (but not the first operand) that is in the direction towards the second operand, unless the operands have the same value. >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> c.next_toward(Decimal('1'), Decimal('2')) Decimal('1.00000001') >>> c.next_toward(Decimal('-1E-1007'), Decimal('1')) Decimal('-0E-1007') >>> c.next_toward(Decimal('-1.00000003'), Decimal('0')) Decimal('-1.00000002') >>> c.next_toward(Decimal('1'), Decimal('0')) Decimal('0.999999999') >>> c.next_toward(Decimal('1E-1007'), Decimal('-100')) Decimal('0E-1007') >>> c.next_toward(Decimal('-1.00000003'), Decimal('-10')) Decimal('-1.00000004') >>> c.next_toward(Decimal('0.00'), Decimal('-0.0000')) Decimal('-0.00') >>> c.next_toward(0, 1) Decimal('1E-1007') >>> c.next_toward(Decimal(0), 1) Decimal('1E-1007') >>> c.next_toward(0, Decimal(1)) Decimal('1E-1007') Tr�rL)r�r�
r�
r)r)r+r�
�s 
zContext.next_towardcCst|
d
d�}
|
j
|d�
S)a�normalize reduces an operand to its simplest form. Essentially a plus operation with all trailing zeros removed from the result. >>> ExtendedContext.normalize(Decimal('2.1')) Decimal('2.1') >>> ExtendedContext.normalize(Decimal('-2.0')) Decimal('-2') >>> ExtendedContext.normalize(Decimal('1.200')) Decimal('1.2') >>> ExtendedContext.normalize(Decimal('-120')) Decimal('-1.2E+2') >>> ExtendedContext.normalize(Decimal('120.00')) Decimal('1.2E+2') >>> ExtendedContext.normalize(Decimal('0.00')) Decimal('0') >>> ExtendedContext.normalize(6) Decimal('6') Tr�rL)r�rC
r�
r)r)r+rC
�s
zContext.normalizecCst|
d
d�}
|
j
|d�
S)a�Returns an indication of the class of the operand. The class is one of the following strings: -sNaN -NaN -Infinity -Normal -Subnormal -Zero +Zero +Subnormal +Normal +Infinity >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> c.number_class(Decimal('Infinity')) '+Infinity' >>> c.number_class(Decimal('1E-10')) '+Normal' >>> c.number_class(Decimal('2.50')) '+Normal' >>> c.number_class(Decimal('0.1E-999')) '+Subnormal' >>> c.number_class(Decimal('0')) '+Zero' >>> c.number_class(Decimal('-0')) '-Zero' >>> c.number_class(Decimal('-0.1E-999')) '-Subnormal' >>> c.number_class(Decimal('-1E-10')) '-Normal' >>> c.number_class(Decimal('-2.50')) '-Normal' >>> c.number_class(Decimal('-Infinity')) '-Infinity' >>> c.number_class(Decimal('NaN')) 'NaN' >>> c.number_class(Decimal('-NaN')) 'NaN' >>> c.number_class(Decimal('sNaN')) 'sNaN' >>> c.number_class(123) '+Normal' Tr�rL)r�r�
r�
r)r)r+r�
�s/
zContext.number_classcCst|
d
d�}
|
j
|d�
S)a�
Plus corresponds to unary prefix plus in Python. The operation is evaluated using the same rules as add; the operation plus(a) is calculated as add('0', a) where the '0' has the same exponent as the operand. >>> ExtendedContext.plus(Decimal('1.3')) Decimal('1.3') >>> ExtendedContext.plus(Decimal('-1.3')) Decimal('-1.3') >>> ExtendedContext.plus(-1) Decimal('-1') Tr�rL)r�r�r�
r)r)r+�pluss
zContext.pluscCs:t|
d
d�}
|
j
|||d�}|tur2td|�
�
n|SdS)aRaises a to the power of b, to modulo if given. With two arguments, compute a**b. If a is negative then b must be integral. The result will be inexact unless b is integral and the result is finite and can be expressed exactly in 'precision' digits. With three arguments, compute (a**b) % modulo. For the three argument form, the following restrictions on the arguments hold: - all three arguments must be integral - b must be nonnegative - at least one of a or b must be nonzero - modulo must be nonzero and have at most 'precision' digits The result of pow(a, b, modulo) is identical to the result that would be obtained by computing (a**b) % modulo with unbounded precision, but is computed more efficiently. It is always exact. >>> c = ExtendedContext.copy() >>> c.Emin = -999 >>> c.Emax = 999 >>> c.power(Decimal('2'), Decimal('3')) Decimal('8') >>> c.power(Decimal('-2'), Decimal('3')) Decimal('-8') >>> c.power(Decimal('2'), Decimal('-3')) Decimal('0.125') >>> c.power(Decimal('1.7'), Decimal('8')) Decimal('69.7575744') >>> c.power(Decimal('10'), Decimal('0.301029996')) Decimal('2.00000000') >>> c.power(Decimal('Infinity'), Decimal('-1')) Decimal('0') >>> c.power(Decimal('Infinity'), Decimal('0')) Decimal('1') >>> c.power(Decimal('Infinity'), Decimal('1')) Decimal('Infinity') >>> c.power(Decimal('-Infinity'), Decimal('-1')) Decimal('-0') >>> c.power(Decimal('-Infinity'), Decimal('0')) Decimal('1') >>> c.power(Decimal('-Infinity'), Decimal('1')) Decimal('-Infinity') >>> c.power(Decimal('-Infinity'), Decimal('2')) Decimal('Infinity') >>> c.power(Decimal('0'), Decimal('0')) Decimal('NaN') >>> c.power(Decimal('3'), Decimal('7'), Decimal('16')) Decimal('11') >>> c.power(Decimal('-3'), Decimal('7'), Decimal('16')) Decimal('-11') >>> c.power(Decimal('-3'), Decimal('8'), Decimal('16')) Decimal('1') >>> c.power(Decimal('3'), Decimal('7'), Decimal('-16')) Decimal('11') >>> c.power(Decimal('23E12345'), Decimal('67E189'), Decimal('123456789')) Decimal('11729830') >>> c.power(Decimal('-0'), Decimal('17'), Decimal('1729')) Decimal('-0') >>> c.power(Decimal('-23'), Decimal('0'), Decimal('65537')) Decimal('1') >>> ExtendedContext.power(7, 7) Decimal('823543') >>> ExtendedContext.power(Decimal(7), 7) Decimal('823543') >>> ExtendedContext.power(7, Decimal(7), 2) Decimal('1') Tr�rLr�
N)r�r?
r�rx)r0r3
r{
r
r�r)r)r+�powers I


z Context.powercCst|
d
d�}
|
j
||d�S)a Returns a value equal to 'a' (rounded), having the exponent of 'b'. The coefficient of the result is derived from that of the left-hand operand. It may be rounded using the current rounding setting (if the exponent is being increased), multiplied by a positive power of ten (if the exponent is being decreased), or is unchanged (if the exponent is already equal to that of the right-hand operand). Unlike other operations, if the length of the coefficient after the quantize operation would be greater than precision then an Invalid operation condition is raised. This guarantees that, unless there is an error condition, the exponent of the result of a quantize is always equal to that of the right-hand operand. Also unlike other operations, quantize will never raise Underflow, even if the result is subnormal and inexact. >>> ExtendedContext.quantize(Decimal('2.17'), Decimal('0.001')) Decimal('2.170') >>> ExtendedContext.quantize(Decimal('2.17'), Decimal('0.01')) Decimal('2.17') >>> ExtendedContext.quantize(Decimal('2.17'), Decimal('0.1')) Decimal('2.2') >>> ExtendedContext.quantize(Decimal('2.17'), Decimal('1e+0')) Decimal('2') >>> ExtendedContext.quantize(Decimal('2.17'), Decimal('1e+1')) Decimal('0E+1') >>> ExtendedContext.quantize(Decimal('-Inf'), Decimal('Infinity')) Decimal('-Infinity') >>> ExtendedContext.quantize(Decimal('2'), Decimal('Infinity')) Decimal('NaN') >>> ExtendedContext.quantize(Decimal('-0.1'), Decimal('1')) Decimal('-0') >>> ExtendedContext.quantize(Decimal('-0'), Decimal('1e+5')) Decimal('-0E+5') >>> ExtendedContext.quantize(Decimal('+35236450.6'), Decimal('1e-2')) Decimal('NaN') >>> ExtendedContext.quantize(Decimal('-35236450.6'), Decimal('1e-2')) Decimal('NaN') >>> ExtendedContext.quantize(Decimal('217'), Decimal('1e-1')) Decimal('217.0') >>> ExtendedContext.quantize(Decimal('217'), Decimal('1e-0')) Decimal('217') >>> ExtendedContext.quantize(Decimal('217'), Decimal('1e+1')) Decimal('2.2E+2') >>> ExtendedContext.quantize(Decimal('217'), Decimal('1e+2')) Decimal('2E+2') >>> ExtendedContext.quantize(1, 2) Decimal('1') >>> ExtendedContext.quantize(Decimal(1), 2) Decimal('1') >>> ExtendedContext.quantize(1, Decimal(2)) Decimal('1') Tr�rL)r�r
r�
r)r)r+r
es7
zContext.quantizec

Cstd
�
S)zkJust returns 10, as this is Decimal, :) >>> ExtendedContext.radix() Decimal('10') r�r�r�r)r)r+r�
�sz Context.radixcCs8t|
d
d�}
|
j
||d�}|tur0td|�
�
n|SdS)aReturns the remainder from integer division. The result is the residue of the dividend after the operation of calculating integer division as described for divide-integer, rounded to precision digits if necessary. The sign of the result, if non-zero, is the same as that of the original dividend. This operation will fail under the same conditions as integer division (that is, if integer division on the same two operands would fail, the remainder cannot be calculated). >>> ExtendedContext.remainder(Decimal('2.1'), Decimal('3')) Decimal('2.1') >>> ExtendedContext.remainder(Decimal('10'), Decimal('3')) Decimal('1') >>> ExtendedContext.remainder(Decimal('-10'), Decimal('3')) Decimal('-1') >>> ExtendedContext.remainder(Decimal('10.2'), Decimal('1')) Decimal('0.2') >>> ExtendedContext.remainder(Decimal('10'), Decimal('0.3')) Decimal('0.1') >>> ExtendedContext.remainder(Decimal('3.6'), Decimal('1.3')) Decimal('1.0') >>> ExtendedContext.remainder(22, 6) Decimal('4') >>> ExtendedContext.remainder(Decimal(22), 6) Decimal('4') >>> ExtendedContext.remainder(22, Decimal(6)) Decimal('4') Tr�rLr�
N)r�r�r�rxr�
r)r)r+r��s 


zContext.remaindercCst|
d
d�}
|
j
||d�S)aGReturns to be "a - b * n", where n is the integer nearest the exact value of "x / b" (if two integers are equally near then the even one is chosen). If the result is equal to 0 then its sign will be the sign of a. This operation will fail under the same conditions as integer division (that is, if integer division on the same two operands would fail, the remainder cannot be calculated). >>> ExtendedContext.remainder_near(Decimal('2.1'), Decimal('3')) Decimal('-0.9') >>> ExtendedContext.remainder_near(Decimal('10'), Decimal('6')) Decimal('-2') >>> ExtendedContext.remainder_near(Decimal('10'), Decimal('3')) Decimal('1') >>> ExtendedContext.remainder_near(Decimal('-10'), Decimal('3')) Decimal('-1') >>> ExtendedContext.remainder_near(Decimal('10.2'), Decimal('1')) Decimal('0.2') >>> ExtendedContext.remainder_near(Decimal('10'), Decimal('0.3')) Decimal('0.1') >>> ExtendedContext.remainder_near(Decimal('3.6'), Decimal('1.3')) Decimal('-0.3') >>> ExtendedContext.remainder_near(3, 11) Decimal('3') >>> ExtendedContext.remainder_near(Decimal(3), 11) Decimal('3') >>> ExtendedContext.remainder_near(3, Decimal(11)) Decimal('3') Tr�rL)r�r�r�
r)r)r+r��s
zContext.remainder_nearcCst|
d
d�}
|
j
||d�S)aNReturns a rotated copy of a, b times. The coefficient of the result is a rotated copy of the digits in the coefficient of the first operand. The number of places of rotation is taken from the absolute value of the second operand, with the rotation being to the left if the second operand is positive or to the right otherwise. >>> ExtendedContext.rotate(Decimal('34'), Decimal('8')) Decimal('400000003') >>> ExtendedContext.rotate(Decimal('12'), Decimal('9')) Decimal('12') >>> ExtendedContext.rotate(Decimal('123456789'), Decimal('-2')) Decimal('891234567') >>> ExtendedContext.rotate(Decimal('123456789'), Decimal('0')) Decimal('123456789') >>> ExtendedContext.rotate(Decimal('123456789'), Decimal('+2')) Decimal('345678912') >>> ExtendedContext.rotate(1333333, 1) Decimal('13333330') >>> ExtendedContext.rotate(Decimal(1333333), 1) Decimal('13333330') >>> ExtendedContext.rotate(1333333, Decimal(1)) Decimal('13333330') Tr�rL)r�r�
r�
r)r)r+r�
�s
zContext.rotatecCst|
d
d�}
|
�
|�
S)a�Returns True if the two operands have the same exponent. The result is never affected by either the sign or the coefficient of either operand. >>> ExtendedContext.same_quantum(Decimal('2.17'), Decimal('0.001')) False >>> ExtendedContext.same_quantum(Decimal('2.17'), Decimal('0.01')) True >>> ExtendedContext.same_quantum(Decimal('2.17'), Decimal('1')) False >>> ExtendedContext.same_quantum(Decimal('Inf'), Decimal('-Inf')) True >>> ExtendedContext.same_quantum(10000, -1) True >>> ExtendedContext.same_quantum(Decimal(10000), -1) True >>> ExtendedContext.same_quantum(10000, Decimal(-1)) True Tr�)r�rF
r�
r)r)r+rF
s
zContext.same_quantumcCst|
d
d�}
|
j
||d�S)a3Returns the first operand after adding the second value its exp. >>> ExtendedContext.scaleb(Decimal('7.50'), Decimal('-2')) Decimal('0.0750') >>> ExtendedContext.scaleb(Decimal('7.50'), Decimal('0')) Decimal('7.50') >>> ExtendedContext.scaleb(Decimal('7.50'), Decimal('3')) Decimal('7.50E+3') >>> ExtendedContext.scaleb(1, 4) Decimal('1E+4') >>> ExtendedContext.scaleb(Decimal(1), 4) Decimal('1E+4') >>> ExtendedContext.scaleb(1, Decimal(4)) Decimal('1E+4') Tr�rL)r�r�
r�
r)r)r+r�
$s
zContext.scalebcCst|
d
d�}
|
j
||d�S)a{Returns a shifted copy of a, b times. The coefficient of the result is a shifted copy of the digits in the coefficient of the first operand. The number of places to shift is taken from the absolute value of the second operand, with the shift being to the left if the second operand is positive or to the right otherwise. Digits shifted into the coefficient are zeros. >>> ExtendedContext.shift(Decimal('34'), Decimal('8')) Decimal('400000000') >>> ExtendedContext.shift(Decimal('12'), Decimal('9')) Decimal('0') >>> ExtendedContext.shift(Decimal('123456789'), Decimal('-2')) Decimal('1234567') >>> ExtendedContext.shift(Decimal('123456789'), Decimal('0')) Decimal('123456789') >>> ExtendedContext.shift(Decimal('123456789'), Decimal('+2')) Decimal('345678900') >>> ExtendedContext.shift(88888888, 2) Decimal('888888800') >>> ExtendedContext.shift(Decimal(88888888), 2) Decimal('888888800') >>> ExtendedContext.shift(88888888, Decimal(2)) Decimal('888888800') Tr�rL)r�r�r�
r)r)r+r�7s
z Context.shiftcCst|
d
d�}
|
j
|d�
S)a�Square root of a non-negative number to context precision. If the result must be inexact, it is rounded using the round-half-even algorithm. >>> ExtendedContext.sqrt(Decimal('0')) Decimal('0') >>> ExtendedContext.sqrt(Decimal('-0')) Decimal('-0') >>> ExtendedContext.sqrt(Decimal('0.39')) Decimal('0.624499800') >>> ExtendedContext.sqrt(Decimal('100')) Decimal('10') >>> ExtendedContext.sqrt(Decimal('1')) Decimal('1') >>> ExtendedContext.sqrt(Decimal('1.0')) Decimal('1.0') >>> ExtendedContext.sqrt(Decimal('1.00')) Decimal('1.0') >>> ExtendedContext.sqrt(Decimal('7')) Decimal('2.64575131') >>> ExtendedContext.sqrt(Decimal('10')) Decimal('3.16227766') >>> ExtendedContext.sqrt(2) Decimal('1.41421356') >>> ExtendedContext.prec 9 Tr�rL)r�rP
r�
r)r)r+rP
Us
zContext.sqrtcCs8t|
d
d�}
|
j
||d�}|tur0td|�
�
n|SdS)a&Return the difference between the two operands. >>> ExtendedContext.subtract(Decimal('1.3'), Decimal('1.07')) Decimal('0.23') >>> ExtendedContext.subtract(Decimal('1.3'), Decimal('1.30')) Decimal('0.00') >>> ExtendedContext.subtract(Decimal('1.3'), Decimal('2.07')) Decimal('-0.77') >>> ExtendedContext.subtract(8, 5) Decimal('3') >>> ExtendedContext.subtract(Decimal(8), 5) Decimal('3') >>> ExtendedContext.subtract(8, Decimal(5)) Decimal('3') Tr�rLr�
N)r�r�r�rxr�
r)r)r+�subtractus 


zContext.subtractcCst|
d
d�}
|
j
|d�
S)a�Convert to a string, using engineering notation if an exponent is needed. Engineering notation has an exponent which is a multiple of 3. This can leave up to 3 digits to the left of the decimal place and may require the addition of either one or two trailing zeros. The operation is not affected by the context. >>> ExtendedContext.to_eng_string(Decimal('123E+1')) '1.23E+3' >>> ExtendedContext.to_eng_string(Decimal('123E+3')) '123E+3' >>> ExtendedContext.to_eng_string(Decimal('123E-10')) '12.3E-9' >>> ExtendedContext.to_eng_string(Decimal('-123E-12')) '-123E-12' >>> ExtendedContext.to_eng_string(Decimal('7E-7')) '700E-9' >>> ExtendedContext.to_eng_string(Decimal('7E+1')) '70' >>> ExtendedContext.to_eng_string(Decimal('0E+1')) '0.00E+3' Tr�rL)r�r�r�
r)r)r+r��s
zContext.to_eng_stringcCst|
d
d�}
|
j
|d�
S)zyConverts a number to a string, using scientific notation. The operation is not affected by the context. Tr�rL)r�r�r�
r)r)r+� to_sci_string�s
zContext.to_sci_stringcCst|
d
d�}
|
j
|d�
S)akRounds to an integer. When the operand has a negative exponent, the result is the same as using the quantize() operation using the given operand as the left-hand-operand, 1E+0 as the right-hand-operand, and the precision of the operand as the precision setting; Inexact and Rounded flags are allowed in this operation. The rounding mode is taken from the context. >>> ExtendedContext.to_integral_exact(Decimal('2.1')) Decimal('2') >>> ExtendedContext.to_integral_exact(Decimal('100')) Decimal('100') >>> ExtendedContext.to_integral_exact(Decimal('100.0')) Decimal('100') >>> ExtendedContext.to_integral_exact(Decimal('101.5')) Decimal('102') >>> ExtendedContext.to_integral_exact(Decimal('-101.5')) Decimal('-102') >>> ExtendedContext.to_integral_exact(Decimal('10E+5')) Decimal('1.0E+6') >>> ExtendedContext.to_integral_exact(Decimal('7.89E+77')) Decimal('7.89E+77') >>> ExtendedContext.to_integral_exact(Decimal('-Inf')) Decimal('-Infinity') Tr�rL)r�rJ
r�
r)r)r+rJ
�s
zContext.to_integral_exactcCst|
d
d�}
|
j
|d�
S)aLRounds to an integer. When the operand has a negative exponent, the result is the same as using the quantize() operation using the given operand as the left-hand-operand, 1E+0 as the right-hand-operand, and the precision of the operand as the precision setting, except that no flags will be set. The rounding mode is taken from the context. >>> ExtendedContext.to_integral_value(Decimal('2.1')) Decimal('2') >>> ExtendedContext.to_integral_value(Decimal('100')) Decimal('100') >>> ExtendedContext.to_integral_value(Decimal('100.0')) Decimal('100') >>> ExtendedContext.to_integral_value(Decimal('101.5')) Decimal('102') >>> ExtendedContext.to_integral_value(Decimal('-101.5')) Decimal('-102') >>> ExtendedContext.to_integral_value(Decimal('10E+5')) Decimal('1.0E+6') >>> ExtendedContext.to_integral_value(Decimal('7.89E+77')) Decimal('7.89E+77') >>> ExtendedContext.to_integral_value(Decimal('-Inf')) Decimal('-Infinity') Tr�rL)r�r
r�
r)r)r+r
�s
zContext.to_integral_value) NNNNNNNNN)
N)
rS)
N)Xr4r5r6r7r�
r�
r�
r�
r�
r�
r�rNr�
rK
rMr�
rjr�
r�
r�
r�r�r�rL
r�
r�
rnr�
r�
rU
r�rV
rR
rZ
r�r�
r�r[
r�
r�
r�rXr
r^
r_
rE
r�ra
r�rb
r�rc
rd
rn
rq
rr
r�
r�
r�
r�
r�r�
r�r�
r�
r�
r�
r�
r�
rC
r�
r�
r�
r
r�
r�r�r�
rF
r�
r�rP
r�
r�r�
rJ
r
r�
r)r)r)r+rs�


� $    $#   %  #2 P:&" rc@s"eZ
dZd
Zddd�
Zdd�ZdS)ro�rCrWrXNcCsf|
durd|_d
|_
d|_nFt|
t�rD|
j|_t
|
j�
|_
|
j|_n|
d
|_|
d|_
|
d|_dS)Nr&r.r_)rCrWrXrer
r;r<rQ)r0rzr)r)r+r�
�s









z_WorkRep.__init__c

Csd
|j|j
|jfS)Nz(%r, %r, %r)r�
r�r)r)r+r�s
z_WorkRep.__repr__)
N)r4r5r6r�
r�
r�r)r)r)r+ro�s
 rocCs�|j|
jkr|
}|}n|}|
}t
t|j�
�
}t
t|j�
�
}|jtd
||d�}||jd|krpd|_||_|jd|j|j9_|j|_||
fS)zcNormalizes op1, op2 to have the same exp and length of coefficient. Done during addition. r�r_r.r�)rXrlrfrWr�)r�r�rF�tmpr�Ztmp_lenZ other_lenrXr)r)r+r�s









r�cCsb|d
krd
S|
d
kr |d|
Stt
|�
�
}t|�
t|�d�
�
}||
krPdS|d|
SdS)a
Given integers n and e, return n * 10**e if it's an integer, else None. The computation is designed to avoid computing large powers of 10 unnecessarily. >>> _decimal_lshift_exact(3, 4) 30000 >>> _decimal_lshift_exact(300, -999999999) # returns None r&r�rSN)rfrnrl�rstrip)r9r�Zstr_nZval_nr)r)r+r)
(s




r)
cCsB|d
k
s|
d
k
rtd�
�
d
}|
|kr>|
|
||
d?}}
q|
S)z�Closest integer to the square root of the positive integer n. a is an initial approximation to the square root. Any positive integer will do for a, but the closer a is to the square root of n the faster convergence will be. r&z3Both arguments to _sqrt_nearest should be positive.r.)
rr)r9r3
r{
r)r)r+� _sqrt_nearest=s



r�
cCs2d
|
>||
?}}|d||d
@|d
@|kS)z�Given an integer x and a nonnegative integer shift, return closest integer to x / 2**shift; use round-to-even in case of a tie. r.r_r))r,
r�r{
r�r)r)r+�_rshift_nearestLs
r�
cCs&t||
�\}}|d
||d@|
kS)zaClosest integer to a/b, a and b positive integers; rounds to even in the case of a tie. r_r.)
r�)r3
r{
r�r�r)r)r+�_div_nearestTs
r�
r#
c Cs�||
}d
}||k
r(t|�
||>|
ksD||krxt|�
||?|
krxt
|
|d>|
t|
|
t||�|
��}|d7}qtdtt|
�
�
d|�
}t||�}t
|
|�}t|dd
d�D]}t
|
|�t
|||
�}q�t
|||
�S)a�
Integer approximation to M*log(x/M), with absolute error boundable in terms only of x/M. Given positive integers x and M, return an integer approximation to M * log(x/M). For L = 8 and 0.1 <= x/M <= 10 the difference between the approximation and the exact result is at most 22. For L = 8 and 1.0 <= x/M <= 10.0 the difference is at most 15. In both cases these are upper bounds on the error; it will usually be much smaller.r&r.�����r]r�)rnr�
r�
r�
rWrlrfr
) r,
�
M�
Lr/
�
R�
TZyshift�
wr�r)r)r+�_ilog\s"

�
�
� 



r�
c Cs�|d
7}tt
|�
�
}|
||
|dk}|dkr�d|}|
||}|dkrZ|d|9}nt|d|�}t||�}t|�
}t|||�}||} nd}t|d|�} t| |d�S)z�Given integers c, e and p with c > 0, p >= 0, compute an integer approximation to 10**p * log10(c*10**e), with an absolute error of at most 1. Assumes that c*10**e is not exactly 1.r_r.r&r�r'
)rlrfr�
r�
� _log10_digits) rN
r�r+
rO
r�r�
r��log_dZlog_10Zlog_tenpowerr)r)r+rp
�s 








rp
c Cs�|d
7}tt
|�
�
}|
||
|dk}|dkrr|
||}|dkrR|d|9}nt|d|�}t|d|�}nd}|r�tt
t|�
�
�
d}||dkr�t|t||�
d|�}q�d}nd}t||d�S)z�Given integers c, e and p with c > 0, compute an integer approximation to 10**p * log(c*10**e), with an absolute error of at most 1. Assumes that c*10**e is not exactly 1.r_r.r&r�r'
)rlrfr�
r�
rnr�
) rN
r�r+
rO
r�r�r�
r=
Z f_log_tenr)r)r+rl
�s"





rl
c@s eZ
dZd
Zdd�Zdd�ZdS)� _Log10Memoizez�Class to compute, store, and allow retrieval of, digits of the constant log(10) = 2.302585.... This constant is needed by Decimal.ln, Decimal.log10, Decimal.exp and Decimal.__pow__.c

Cs d
|_dS)NZ/23025850929940456840179914546843642076011014886)
r~r�r)r)r+r�
�s
z_Log10Memoize.__init__cCs�|
d
krtd�
�
|
t
|j�
kr�d}d|
|d}tttd||�d��
}||d�d|krbql|d7}q"|�d�
dd �|_t|jd|
d ��
S)ztGiven an integer p >= 0, return floor(10**p)*log(10). For example, self.getdigits(3) returns 2302. r&zp should be nonnegativer]r�r_r'
NrSr�r.)rrrlr~rfr�
r�
r�
rW)r0r+
r=
r�
r~r)r)r+� getdigits�s 





z_Log10Memoize.getdigitsN)r4r5r6r7r�
r�
r)r)r)r+r�
�s
r�
c Cs�t||>|
�
}t
d
tt|
�
�
d|�
}t||�}|
|>}t|ddd�D]}t|||||�}qPt|ddd�D]"}|
|d>}t||||�}q||
|S)z�Given integers x and M, M > 0, such that x/M is small in absolute value, compute an integer approximation to M*exp(x/M). For 0 <= x/M <= 2.4, the absolute error in the result is bounded by 60 (and is usually much smaller).r�
r]r.r&r�r_)r(
rWrlrfr�
r
) r,
r�
r�
r�
r�
r/
ZMshiftr
r�r)r)r+�_iexp�s





r�
c Cs�|d
7}td|
t
t|�
�
d�}||}|
|}|dkrH|d|}n|d|}t|t|�
�\}}t|d|�}tt|d|�d�||dfS)a�
Compute an approximation to exp(c*10**e), with p decimal places of precision. Returns integers d, f such that: 10**(p-1) <= d <= 10**p, and (d-1)*10**f < exp(c*10**e) < (d+1)*10**f In other words, d*10**f is an approximation to exp(c*10**e) with p digits of precision, and with an error in d of at most 1. This is almost, but not quite, the same as the error being < 1ulp: when d = 10**(p-1) the error could be up to 10 ulp.r_r&r.r�i�r])r�rlrfr�r�
r�
r�
) rN
r�r+
r=
r�r�ZcshiftZquotr2
r)r)r+r\
$s



r\
cCs�tt
t|�
�
�
|}t||
||d
�}||}|dkrJ||d|}nt||d|�}|dkr�tt
|�
�
|
d
k|dkkr�d|d
d
d
|} } q�d|d
|} } n,t||d
|d
�\} } t| d�} | d
7} | | fS)a5Given integers xc, xe, yc and ye representing Decimals x = xc*10**xe and y = yc*10**ye, compute x**y. Returns a pair of integers (c, e) such that: 10**(p-1) <= c <= 10**p, and (c-1)*10**e < x**y < (c+1)*10**e in other words, c*10**e is an approximation to x**y with p digits of precision, and with an error in c of at most 1. (This is almost, but not quite, the same as the error being < 1ulp: when c == 10**(p-1) we can only guarantee error < 10ulp.) We assume that: x is positive and not equal to 1, and y is nonzero. r.r&r�)rlrfrnrl
r�
r\
)r-
r.
r0
r1
r+
r{
Zlxcr�Zpcr�rXr)r)r+r7
Hs




r7
r'
�F�5�(�re
�r�r) r��
2�
3�
4�
5�
6�
7�
8rDcCs0|d
k
rtd�
�
t
|�
}dt|�
|
|d
S)z@Compute a lower bound for 100*log10(c) for a positive integer c.r&z0The argument to _log10_lb should be nonnegative.r'
)rrrfrl)rN
Z correctionZstr_cr)r)r+r*
rs


r*
cCsLt|t
�r|St|t�r t
|�
S|r8t|t�r8t
�|�
S|
rHtd
|�
�
tS)z�Convert other to Decimal. Verifies that it's ok to use in an implicit construction. If allow_float is true, allow conversion from float; this is used in the comparison methods (__eq__ and friends). r�
)rer
rWrvrwrxr�)r�r�Zallow_floatr)r)r+r�}s






r�cCs�t|
t
�r||
fSt|
tj�rR|jsDt|jtt|j �
|
j �
|j�}|t
|
j�
fS|rrt|
tj �rr|
jd
krr|
j}
t|
t�r�t�}|r�d|jt<n|�td�
|t
�|
�
fSttfS)z�Given a Decimal instance self and a Python object other, return a pair (s, o) of Decimal instances such that "s op o" is equivalent to "self op other" for any of the 6 comparison operators "op". r&r.rb)rer
�_numbersZRationalrRr:r;rfrWr<�denominatorrQ� numeratorZComplexr�r�rvrr:
rrjrwr�)r0r�r�r1r)r)r+r��s(




�





�
r�r&
i?Bi����)rFrEr9
r:
rGrD
r�r�r`)rFrEr9
r:
a� # A numeric string consists of: # \s* (?P[-+])? # an optional sign, followed by either... ( (?=\d|\.\d) # ...a number (with at least one digit) (?P\d*) # having a (possibly empty) integer part (\.(?P\d*))? # followed by an optional fractional part (E(?P[-+]?\d+))? # followed by an optional exponent, or... | Inf(inity)? # ...an infinity, or... | (?Ps)? # ...an (optionally signaling) NaN # NaN (?P\d*) # with (possibly empty) diagnostic info. ) # \s* \Z z0*$z50*$z�\A (?: (?P.)? (?P[<>=^]) )? (?P[-+ ])? (?P\#)? (?P0)? (?P(?!0)\d+)? (?P,)? (?:\.(?P0|(?!0)\d+))? (?P[eEfFgGn%])? \Z cCs�
t�
|�
}|d
urtd|�
�
|��}|d}|d}|dd
u
|d<|drv|d
u
rbtd|�
�
|d
u
rvtd|�
�
|p|d|d<|p�d |d<|d d
ur�d|d <t|dp�d �
|d<|dd
u
r�t|d�
|d<|ddkr�|dd
us�|ddvr�d|d<|ddk�
rfd|d<|
d
u�
r&t��}
|dd
u
�
r@td|�
�
|
d|d<|
d|d<|
d|d<n*|dd
u�
r|d|d<ddg|d<d|d<|S)a�Parse and validate a format specifier. Turns a standard numeric format specifier into a dict, with the following entries: fill: fill character to pad field to minimum width align: alignment type, either '<', '>', '=' or '^' sign: either '+', '-' or ' ' minimumwidth: nonnegative integer giving minimum width zeropad: boolean, indicating whether to pad with zeros thousands_sep: string to use as thousands separator, or '' grouping: grouping for thousands separators, in format used by localeconv decimal_point: string to use for decimal point precision: nonnegative integer giving precision, or None type: one of the characters 'eEfFgG%', or None NzInvalid format specifier: �fill�align�zeropadz7Fill character conflicts with '0' in format specifier: z2Alignment conflicts with '0' in format specifier: �
�
>rCrV�minimumwidthrSr�
r&r�
ZgGnr.r9r�
� thousands_sepzJExplicit thousands separator conflicts with 'n' type in format specifier: �grouping� decimal_pointrUr]r�)�_parse_format_specifier_regex�matchrr� groupdictrW�_locale� localeconv)�format_specr�
r{Zformat_dictrrr)r)r+r�
sT







�

�









�




r�
c Cs�|d
}|d}||t|�
t|
�
}|d}|dkrF||
|}nj|dkr\|||
}nT|dkrr|||
}n>|dkr�t|�
d}|d |�||
||d �}nt
d �
�
|S)z�Given an unpadded, non-aligned numeric string 'body' and sign string 'sign', add padding and alignment conforming to the given format specifier dictionary 'spec' (as produced by parse_format_specifier). rrr�
rX
r5
rW
rA� hash_info�modulusr�r�
r�r�r�r�r�r)r)r)r+�sb
c#





















 &
�


�
�  . ^  0",# %$+
�  *






�


�


�
 �
 �


 P % )