Name	Size	Mode	Actions
abc.cpython-36.opt-1.pyc	7474	0644	editdlrm
abc.cpython-36.opt-2.pyc	4110	0644	editdlrm
abc.cpython-36.pyc	7517	0644	editdlrm
aifc.cpython-36.opt-1.pyc	25945	0644	editdlrm
aifc.cpython-36.opt-2.pyc	20740	0644	editdlrm
aifc.cpython-36.pyc	25945	0644	editdlrm
antigravity.cpython-36.opt-1.pyc	781	0644	editdlrm
antigravity.cpython-36.opt-2.pyc	637	0644	editdlrm
antigravity.cpython-36.pyc	781	0644	editdlrm
argparse.cpython-36.opt-1.pyc	60058	0644	editdlrm
argparse.cpython-36.opt-2.pyc	50817	0644	editdlrm
argparse.cpython-36.pyc	60192	0644	editdlrm
ast.cpython-36.opt-1.pyc	11706	0644	editdlrm
ast.cpython-36.opt-2.pyc	6121	0644	editdlrm
ast.cpython-36.pyc	11706	0644	editdlrm
asynchat.cpython-36.opt-1.pyc	6817	0644	editdlrm
asynchat.cpython-36.opt-2.pyc	5441	0644	editdlrm
asynchat.cpython-36.pyc	6817	0644	editdlrm
asyncore.cpython-36.opt-1.pyc	15840	0644	editdlrm
asyncore.cpython-36.opt-2.pyc	14636	0644	editdlrm
asyncore.cpython-36.pyc	15840	0644	editdlrm
base64.cpython-36.opt-1.pyc	16903	0644	editdlrm
base64.cpython-36.opt-2.pyc	11305	0644	editdlrm
base64.cpython-36.pyc	17061	0644	editdlrm
bdb.cpython-36.opt-1.pyc	17035	0644	editdlrm
bdb.cpython-36.opt-2.pyc	15309	0644	editdlrm
bdb.cpython-36.pyc	17035	0644	editdlrm
binhex.cpython-36.opt-1.pyc	12088	0644	editdlrm
binhex.cpython-36.opt-2.pyc	11555	0644	editdlrm
binhex.cpython-36.pyc	12088	0644	editdlrm
bisect.cpython-36.opt-1.pyc	2678	0644	editdlrm
bisect.cpython-36.opt-2.pyc	1382	0644	editdlrm
bisect.cpython-36.pyc	2678	0644	editdlrm
bz2.cpython-36.opt-1.pyc	11284	0644	editdlrm
bz2.cpython-36.opt-2.pyc	6227	0644	editdlrm
bz2.cpython-36.pyc	11284	0644	editdlrm
calendar.cpython-36.opt-1.pyc	25884	0644	editdlrm
calendar.cpython-36.opt-2.pyc	21357	0644	editdlrm
calendar.cpython-36.pyc	25884	0644	editdlrm
cgi.cpython-36.opt-1.pyc	28624	0644	editdlrm
cgi.cpython-36.opt-2.pyc	19512	0644	editdlrm
cgi.cpython-36.pyc	28624	0644	editdlrm
cgitb.cpython-36.opt-1.pyc	10082	0644	editdlrm
cgitb.cpython-36.opt-2.pyc	8483	0644	editdlrm
cgitb.cpython-36.pyc	10082	0644	editdlrm
chunk.cpython-36.opt-1.pyc	4902	0644	editdlrm
chunk.cpython-36.opt-2.pyc	2756	0644	editdlrm
chunk.cpython-36.pyc	4902	0644	editdlrm
cmd.cpython-36.opt-1.pyc	12577	0644	editdlrm
cmd.cpython-36.opt-2.pyc	7138	0644	editdlrm
cmd.cpython-36.pyc	12577	0644	editdlrm
code.cpython-36.opt-1.pyc	9838	0644	editdlrm
code.cpython-36.opt-2.pyc	4562	0644	editdlrm
code.cpython-36.pyc	9838	0644	editdlrm
codecs.cpython-36.opt-1.pyc	33902	0644	editdlrm
codecs.cpython-36.opt-2.pyc	18054	0644	editdlrm
codecs.cpython-36.pyc	33902	0644	editdlrm
codeop.cpython-36.opt-1.pyc	6272	0644	editdlrm
codeop.cpython-36.opt-2.pyc	2225	0644	editdlrm
codeop.cpython-36.pyc	6272	0644	editdlrm
colorsys.cpython-36.opt-1.pyc	3313	0644	editdlrm
colorsys.cpython-36.opt-2.pyc	2707	0644	editdlrm
colorsys.cpython-36.pyc	3313	0644	editdlrm
compileall.cpython-36.opt-1.pyc	8280	0644	editdlrm
compileall.cpython-36.opt-2.pyc	6142	0644	editdlrm
compileall.cpython-36.pyc	8280	0644	editdlrm
configparser.cpython-36.opt-1.pyc	45246	0644	editdlrm
configparser.cpython-36.opt-2.pyc	30558	0644	editdlrm
configparser.cpython-36.pyc	45246	0644	editdlrm
contextlib.cpython-36.opt-1.pyc	11160	0644	editdlrm
contextlib.cpython-36.opt-2.pyc	7814	0644	editdlrm
contextlib.cpython-36.pyc	11160	0644	editdlrm
copy.cpython-36.opt-1.pyc	7081	0644	editdlrm
copy.cpython-36.opt-2.pyc	4765	0644	editdlrm
copy.cpython-36.pyc	7081	0644	editdlrm
copyreg.cpython-36.opt-1.pyc	4211	0644	editdlrm
copyreg.cpython-36.opt-2.pyc	3407	0644	editdlrm
copyreg.cpython-36.pyc	4246	0644	editdlrm
cProfile.cpython-36.opt-1.pyc	4296	0644	editdlrm
cProfile.cpython-36.opt-2.pyc	3835	0644	editdlrm
cProfile.cpython-36.pyc	4296	0644	editdlrm
crypt.cpython-36.opt-1.pyc	2244	0644	editdlrm
crypt.cpython-36.opt-2.pyc	1580	0644	editdlrm
crypt.cpython-36.pyc	2244	0644	editdlrm
csv.cpython-36.opt-1.pyc	11857	0644	editdlrm
csv.cpython-36.opt-2.pyc	9818	0644	editdlrm
csv.cpython-36.pyc	11857	0644	editdlrm
datetime.cpython-36.opt-1.pyc	53060	0644	editdlrm
datetime.cpython-36.opt-2.pyc	44210	0644	editdlrm
datetime.cpython-36.pyc	54513	0644	editdlrm
decimal.cpython-36.opt-1.pyc	353	0644	editdlrm
decimal.cpython-36.opt-2.pyc	353	0644	editdlrm
decimal.cpython-36.pyc	353	0644	editdlrm
difflib.cpython-36.opt-1.pyc	59606	0644	editdlrm
difflib.cpython-36.opt-2.pyc	25036	0644	editdlrm
difflib.cpython-36.pyc	59644	0644	editdlrm
dis.cpython-36.opt-1.pyc	14183	0644	editdlrm
dis.cpython-36.opt-2.pyc	10651	0644	editdlrm
dis.cpython-36.pyc	14183	0644	editdlrm
doctest.cpython-36.opt-1.pyc	75346	0644	editdlrm
doctest.cpython-36.opt-2.pyc	40019	0644	editdlrm
doctest.cpython-36.pyc	75591	0644	editdlrm
dummy_threading.cpython-36.opt-1.pyc	1104	0644	editdlrm
dummy_threading.cpython-36.opt-2.pyc	731	0644	editdlrm
dummy_threading.cpython-36.pyc	1104	0644	editdlrm
enum.cpython-36.opt-1.pyc	23455	0644	editdlrm
enum.cpython-36.opt-2.pyc	19162	0644	editdlrm
enum.cpython-36.pyc	23455	0644	editdlrm
filecmp.cpython-36.opt-1.pyc	8307	0644	editdlrm
filecmp.cpython-36.opt-2.pyc	5890	0644	editdlrm
filecmp.cpython-36.pyc	8307	0644	editdlrm
fileinput.cpython-36.opt-1.pyc	13154	0644	editdlrm
fileinput.cpython-36.opt-2.pyc	7615	0644	editdlrm
fileinput.cpython-36.pyc	13154	0644	editdlrm
fnmatch.cpython-36.opt-1.pyc	2876	0644	editdlrm
fnmatch.cpython-36.opt-2.pyc	1687	0644	editdlrm
fnmatch.cpython-36.pyc	2876	0644	editdlrm
formatter.cpython-36.opt-1.pyc	17581	0644	editdlrm
formatter.cpython-36.opt-2.pyc	15141	0644	editdlrm
formatter.cpython-36.pyc	17581	0644	editdlrm
fractions.cpython-36.opt-1.pyc	18428	0644	editdlrm
fractions.cpython-36.opt-2.pyc	11142	0644	editdlrm
fractions.cpython-36.pyc	18428	0644	editdlrm
ftplib.cpython-36.opt-1.pyc	28359	0644	editdlrm
ftplib.cpython-36.opt-2.pyc	18555	0644	editdlrm
ftplib.cpython-36.pyc	28359	0644	editdlrm
functools.cpython-36.opt-1.pyc	24064	0644	editdlrm
functools.cpython-36.opt-2.pyc	18093	0644	editdlrm
functools.cpython-36.pyc	24064	0644	editdlrm
genericpath.cpython-36.opt-1.pyc	4230	0644	editdlrm
genericpath.cpython-36.opt-2.pyc	3188	0644	editdlrm
genericpath.cpython-36.pyc	4230	0644	editdlrm
getopt.cpython-36.opt-1.pyc	6185	0644	editdlrm
getopt.cpython-36.opt-2.pyc	3631	0644	editdlrm
getopt.cpython-36.pyc	6219	0644	editdlrm
getpass.cpython-36.opt-1.pyc	4179	0644	editdlrm
getpass.cpython-36.opt-2.pyc	2994	0644	editdlrm
getpass.cpython-36.pyc	4179	0644	editdlrm
gettext.cpython-36.opt-1.pyc	14199	0644	editdlrm
gettext.cpython-36.opt-2.pyc	13508	0644	editdlrm
gettext.cpython-36.pyc	14199	0644	editdlrm
glob.cpython-36.opt-1.pyc	4192	0644	editdlrm
glob.cpython-36.opt-2.pyc	3332	0644	editdlrm
glob.cpython-36.pyc	4261	0644	editdlrm
gzip.cpython-36.opt-1.pyc	16228	0644	editdlrm
gzip.cpython-36.opt-2.pyc	12422	0644	editdlrm
gzip.cpython-36.pyc	16228	0644	editdlrm
hashlib.cpython-36.opt-1.pyc	5667	0644	editdlrm
hashlib.cpython-36.opt-2.pyc	5328	0644	editdlrm
hashlib.cpython-36.pyc	5667	0644	editdlrm
heapq.cpython-36.opt-1.pyc	14294	0644	editdlrm
heapq.cpython-36.opt-2.pyc	11304	0644	editdlrm
heapq.cpython-36.pyc	14294	0644	editdlrm
hmac.cpython-36.opt-1.pyc	6015	0644	editdlrm
hmac.cpython-36.opt-2.pyc	4204	0644	editdlrm
hmac.cpython-36.pyc	6015	0644	editdlrm
imaplib.cpython-36.opt-1.pyc	40043	0644	editdlrm
imaplib.cpython-36.opt-2.pyc	27955	0644	editdlrm
imaplib.cpython-36.pyc	42262	0644	editdlrm
imghdr.cpython-36.opt-1.pyc	4152	0644	editdlrm
imghdr.cpython-36.opt-2.pyc	3837	0644	editdlrm
imghdr.cpython-36.pyc	4152	0644	editdlrm
imp.cpython-36.opt-1.pyc	9698	0644	editdlrm
imp.cpython-36.opt-2.pyc	7295	0644	editdlrm
imp.cpython-36.pyc	9698	0644	editdlrm
inspect.cpython-36.opt-1.pyc	79441	0644	editdlrm
inspect.cpython-36.opt-2.pyc	54026	0644	editdlrm
inspect.cpython-36.pyc	79741	0644	editdlrm
io.cpython-36.opt-1.pyc	3389	0644	editdlrm
io.cpython-36.opt-2.pyc	1898	0644	editdlrm
io.cpython-36.pyc	3389	0644	editdlrm
ipaddress.cpython-36.opt-1.pyc	65064	0644	editdlrm
ipaddress.cpython-36.opt-2.pyc	37347	0644	editdlrm
ipaddress.cpython-36.pyc	65064	0644	editdlrm
keyword.cpython-36.opt-1.pyc	1767	0644	editdlrm
keyword.cpython-36.opt-2.pyc	1499	0644	editdlrm
keyword.cpython-36.pyc	1767	0644	editdlrm
linecache.cpython-36.opt-1.pyc	3780	0644	editdlrm
linecache.cpython-36.opt-2.pyc	2675	0644	editdlrm
linecache.cpython-36.pyc	3780	0644	editdlrm
locale.cpython-36.opt-1.pyc	34047	0644	editdlrm
locale.cpython-36.opt-2.pyc	29422	0644	editdlrm
locale.cpython-36.pyc	34047	0644	editdlrm
lzma.cpython-36.opt-1.pyc	11994	0644	editdlrm
lzma.cpython-36.opt-2.pyc	5803	0644	editdlrm
lzma.cpython-36.pyc	11994	0644	editdlrm
macpath.cpython-36.opt-1.pyc	5643	0644	editdlrm
macpath.cpython-36.opt-2.pyc	4377	0644	editdlrm
macpath.cpython-36.pyc	5643	0644	editdlrm
macurl2path.cpython-36.opt-1.pyc	1869	0644	editdlrm
macurl2path.cpython-36.opt-2.pyc	1489	0644	editdlrm
macurl2path.cpython-36.pyc	1869	0644	editdlrm
mailbox.cpython-36.opt-1.pyc	63672	0644	editdlrm
mailbox.cpython-36.opt-2.pyc	54525	0644	editdlrm
mailbox.cpython-36.pyc	63754	0644	editdlrm
mailcap.cpython-36.opt-1.pyc	7211	0644	editdlrm
mailcap.cpython-36.opt-2.pyc	5641	0644	editdlrm
mailcap.cpython-36.pyc	7211	0644	editdlrm
mimetypes.cpython-36.opt-1.pyc	15555	0644	editdlrm
mimetypes.cpython-36.opt-2.pyc	9557	0644	editdlrm
mimetypes.cpython-36.pyc	15555	0644	editdlrm
modulefinder.cpython-36.opt-1.pyc	15306	0644	editdlrm
modulefinder.cpython-36.opt-2.pyc	14465	0644	editdlrm
modulefinder.cpython-36.pyc	15368	0644	editdlrm
netrc.cpython-36.opt-1.pyc	3838	0644	editdlrm
netrc.cpython-36.opt-2.pyc	3600	0644	editdlrm
netrc.cpython-36.pyc	3838	0644	editdlrm
nntplib.cpython-36.opt-1.pyc	33782	0644	editdlrm
nntplib.cpython-36.opt-2.pyc	21241	0644	editdlrm
nntplib.cpython-36.pyc	33782	0644	editdlrm
ntpath.cpython-36.opt-1.pyc	13752	0644	editdlrm
ntpath.cpython-36.opt-2.pyc	11281	0644	editdlrm
ntpath.cpython-36.pyc	13752	0644	editdlrm
nturl2path.cpython-36.opt-1.pyc	1501	0644	editdlrm
nturl2path.cpython-36.opt-2.pyc	1183	0644	editdlrm
nturl2path.cpython-36.pyc	1501	0644	editdlrm
numbers.cpython-36.opt-1.pyc	12144	0644	editdlrm
numbers.cpython-36.opt-2.pyc	8183	0644	editdlrm
numbers.cpython-36.pyc	12144	0644	editdlrm
opcode.cpython-36.opt-1.pyc	5415	0644	editdlrm
opcode.cpython-36.opt-2.pyc	5275	0644	editdlrm
opcode.cpython-36.pyc	5415	0644	editdlrm
operator.cpython-36.opt-1.pyc	13915	0644	editdlrm
operator.cpython-36.opt-2.pyc	11456	0644	editdlrm
operator.cpython-36.pyc	13915	0644	editdlrm
optparse.cpython-36.opt-1.pyc	47988	0644	editdlrm
optparse.cpython-36.opt-2.pyc	35633	0644	editdlrm
optparse.cpython-36.pyc	48056	0644	editdlrm
os.cpython-36.opt-1.pyc	29630	0644	editdlrm
os.cpython-36.opt-2.pyc	17781	0644	editdlrm
os.cpython-36.pyc	29630	0644	editdlrm
pathlib.cpython-36.opt-1.pyc	40814	0644	editdlrm
pathlib.cpython-36.opt-2.pyc	33172	0644	editdlrm
pathlib.cpython-36.pyc	40814	0644	editdlrm
pdb.cpython-36.opt-1.pyc	46039	0644	editdlrm
pdb.cpython-36.opt-2.pyc	31972	0644	editdlrm
pdb.cpython-36.pyc	46096	0644	editdlrm
pickle.cpython-36.opt-1.pyc	42576	0644	editdlrm
pickle.cpython-36.opt-2.pyc	37788	0644	editdlrm
pickle.cpython-36.pyc	42693	0644	editdlrm
pickletools.cpython-36.opt-1.pyc	65171	0644	editdlrm
pickletools.cpython-36.opt-2.pyc	56430	0644	editdlrm
pickletools.cpython-36.pyc	66022	0644	editdlrm
pipes.cpython-36.opt-1.pyc	7810	0644	editdlrm
pipes.cpython-36.opt-2.pyc	4937	0644	editdlrm
pipes.cpython-36.pyc	7810	0644	editdlrm
pkgutil.cpython-36.opt-1.pyc	16263	0644	editdlrm
pkgutil.cpython-36.opt-2.pyc	11003	0644	editdlrm
pkgutil.cpython-36.pyc	16263	0644	editdlrm
platform.cpython-36.opt-1.pyc	28649	0644	editdlrm
platform.cpython-36.opt-2.pyc	19401	0644	editdlrm
platform.cpython-36.pyc	28649	0644	editdlrm
plistlib.cpython-36.opt-1.pyc	27665	0644	editdlrm
plistlib.cpython-36.opt-2.pyc	24411	0644	editdlrm
plistlib.cpython-36.pyc	27732	0644	editdlrm
poplib.cpython-36.opt-1.pyc	13428	0644	editdlrm
poplib.cpython-36.opt-2.pyc	8497	0644	editdlrm
poplib.cpython-36.pyc	13428	0644	editdlrm
posixpath.cpython-36.opt-1.pyc	10706	0644	editdlrm
posixpath.cpython-36.opt-2.pyc	8985	0644	editdlrm
posixpath.cpython-36.pyc	10706	0644	editdlrm
pprint.cpython-36.opt-1.pyc	15771	0644	editdlrm
pprint.cpython-36.opt-2.pyc	13707	0644	editdlrm
pprint.cpython-36.pyc	15826	0644	editdlrm
profile.cpython-36.opt-1.pyc	13697	0644	editdlrm
profile.cpython-36.opt-2.pyc	10715	0644	editdlrm
profile.cpython-36.pyc	13903	0644	editdlrm
pstats.cpython-36.opt-1.pyc	21859	0644	editdlrm
pstats.cpython-36.opt-2.pyc	19405	0644	editdlrm
pstats.cpython-36.pyc	21859	0644	editdlrm
pty.cpython-36.opt-1.pyc	3863	0644	editdlrm
pty.cpython-36.opt-2.pyc	3010	0644	editdlrm
pty.cpython-36.pyc	3863	0644	editdlrm
pyclbr.cpython-36.opt-1.pyc	8367	0644	editdlrm
pyclbr.cpython-36.opt-2.pyc	5571	0644	editdlrm
pyclbr.cpython-36.pyc	8367	0644	editdlrm
pydoc.cpython-36.opt-1.pyc	83445	0644	editdlrm
pydoc.cpython-36.opt-2.pyc	74244	0644	editdlrm
pydoc.cpython-36.pyc	83498	0644	editdlrm
py_compile.cpython-36.opt-1.pyc	6546	0644	editdlrm
py_compile.cpython-36.opt-2.pyc	2942	0644	editdlrm
py_compile.cpython-36.pyc	6546	0644	editdlrm
queue.cpython-36.opt-1.pyc	8757	0644	editdlrm
queue.cpython-36.opt-2.pyc	4967	0644	editdlrm
queue.cpython-36.pyc	8757	0644	editdlrm
quopri.cpython-36.opt-1.pyc	5600	0644	editdlrm
quopri.cpython-36.opt-2.pyc	4564	0644	editdlrm
quopri.cpython-36.pyc	5775	0644	editdlrm
random.cpython-36.opt-1.pyc	19332	0644	editdlrm
random.cpython-36.opt-2.pyc	12791	0644	editdlrm
random.cpython-36.pyc	19332	0644	editdlrm
re.cpython-36.opt-1.pyc	14060	0644	editdlrm
re.cpython-36.opt-2.pyc	5780	0644	editdlrm
re.cpython-36.pyc	14060	0644	editdlrm
reprlib.cpython-36.opt-1.pyc	5402	0644	editdlrm
reprlib.cpython-36.opt-2.pyc	5246	0644	editdlrm
reprlib.cpython-36.pyc	5402	0644	editdlrm
rlcompleter.cpython-36.opt-1.pyc	5782	0644	editdlrm
rlcompleter.cpython-36.opt-2.pyc	3119	0644	editdlrm
rlcompleter.cpython-36.pyc	5782	0644	editdlrm
runpy.cpython-36.opt-1.pyc	7984	0644	editdlrm
runpy.cpython-36.opt-2.pyc	6441	0644	editdlrm
runpy.cpython-36.pyc	7984	0644	editdlrm
sched.cpython-36.opt-1.pyc	6566	0644	editdlrm
sched.cpython-36.opt-2.pyc	3526	0644	editdlrm
sched.cpython-36.pyc	6566	0644	editdlrm
secrets.cpython-36.opt-1.pyc	2164	0644	editdlrm
secrets.cpython-36.opt-2.pyc	1106	0644	editdlrm
secrets.cpython-36.pyc	2164	0644	editdlrm
selectors.cpython-36.opt-1.pyc	17699	0644	editdlrm
selectors.cpython-36.opt-2.pyc	13723	0644	editdlrm
selectors.cpython-36.pyc	17699	0644	editdlrm
shelve.cpython-36.opt-1.pyc	9460	0644	editdlrm
shelve.cpython-36.opt-2.pyc	5307	0644	editdlrm
shelve.cpython-36.pyc	9460	0644	editdlrm
shlex.cpython-36.opt-1.pyc	6972	0644	editdlrm
shlex.cpython-36.opt-2.pyc	6460	0644	editdlrm
shlex.cpython-36.pyc	6972	0644	editdlrm
shutil.cpython-36.opt-1.pyc	30901	0644	editdlrm
shutil.cpython-36.opt-2.pyc	20045	0644	editdlrm
shutil.cpython-36.pyc	30901	0644	editdlrm
signal.cpython-36.opt-1.pyc	2517	0644	editdlrm
signal.cpython-36.opt-2.pyc	2289	0644	editdlrm
signal.cpython-36.pyc	2517	0644	editdlrm
site.cpython-36.opt-1.pyc	16361	0644	editdlrm
site.cpython-36.opt-2.pyc	10675	0644	editdlrm
site.cpython-36.pyc	16361	0644	editdlrm
smtpd.cpython-36.opt-1.pyc	26685	0644	editdlrm
smtpd.cpython-36.opt-2.pyc	24066	0644	editdlrm
smtpd.cpython-36.pyc	26685	0644	editdlrm
smtplib.cpython-36.opt-1.pyc	35281	0644	editdlrm
smtplib.cpython-36.opt-2.pyc	18869	0644	editdlrm
smtplib.cpython-36.pyc	35342	0644	editdlrm
sndhdr.cpython-36.opt-1.pyc	6915	0644	editdlrm
sndhdr.cpython-36.opt-2.pyc	5640	0644	editdlrm
sndhdr.cpython-36.pyc	6915	0644	editdlrm
socket.cpython-36.opt-1.pyc	21975	0644	editdlrm
socket.cpython-36.opt-2.pyc	14541	0644	editdlrm
socket.cpython-36.pyc	22015	0644	editdlrm
socketserver.cpython-36.opt-1.pyc	24252	0644	editdlrm
socketserver.cpython-36.opt-2.pyc	13327	0644	editdlrm
socketserver.cpython-36.pyc	24252	0644	editdlrm
sre_compile.cpython-36.opt-1.pyc	10140	0644	editdlrm
sre_compile.cpython-36.opt-2.pyc	9726	0644	editdlrm
sre_compile.cpython-36.pyc	10280	0644	editdlrm
sre_constants.cpython-36.opt-1.pyc	5974	0644	editdlrm
sre_constants.cpython-36.opt-2.pyc	5549	0644	editdlrm
sre_constants.cpython-36.pyc	5974	0644	editdlrm
sre_parse.cpython-36.opt-1.pyc	20313	0644	editdlrm
sre_parse.cpython-36.opt-2.pyc	20265	0644	editdlrm
sre_parse.cpython-36.pyc	20360	0644	editdlrm
ssl.cpython-36.opt-1.pyc	36432	0644	editdlrm
ssl.cpython-36.opt-2.pyc	26908	0644	editdlrm
ssl.cpython-36.pyc	36432	0644	editdlrm
stat.cpython-36.opt-1.pyc	3853	0644	editdlrm
stat.cpython-36.opt-2.pyc	3175	0644	editdlrm
stat.cpython-36.pyc	3853	0644	editdlrm
statistics.cpython-36.opt-1.pyc	17935	0644	editdlrm
statistics.cpython-36.opt-2.pyc	7248	0644	editdlrm
statistics.cpython-36.pyc	18176	0644	editdlrm
string.cpython-36.opt-1.pyc	7966	0644	editdlrm
string.cpython-36.opt-2.pyc	6860	0644	editdlrm
string.cpython-36.pyc	7966	0644	editdlrm
stringprep.cpython-36.opt-1.pyc	9974	0644	editdlrm
stringprep.cpython-36.opt-2.pyc	9754	0644	editdlrm
stringprep.cpython-36.pyc	10032	0644	editdlrm
struct.cpython-36.opt-1.pyc	314	0644	editdlrm
struct.cpython-36.opt-2.pyc	314	0644	editdlrm
struct.cpython-36.pyc	314	0644	editdlrm
subprocess.cpython-36.opt-1.pyc	35386	0644	editdlrm
subprocess.cpython-36.opt-2.pyc	24672	0644	editdlrm
subprocess.cpython-36.pyc	35487	0644	editdlrm
sunau.cpython-36.opt-1.pyc	16940	0644	editdlrm
sunau.cpython-36.opt-2.pyc	12350	0644	editdlrm
sunau.cpython-36.pyc	16940	0644	editdlrm
symbol.cpython-36.opt-1.pyc	2519	0644	editdlrm
symbol.cpython-36.opt-2.pyc	2443	0644	editdlrm
symbol.cpython-36.pyc	2519	0644	editdlrm
symtable.cpython-36.opt-1.pyc	10323	0644	editdlrm
symtable.cpython-36.opt-2.pyc	9626	0644	editdlrm
symtable.cpython-36.pyc	10430	0644	editdlrm
sysconfig.cpython-36.opt-1.pyc	15901	0644	editdlrm
sysconfig.cpython-36.opt-2.pyc	13334	0644	editdlrm
sysconfig.cpython-36.pyc	15901	0644	editdlrm
tabnanny.cpython-36.opt-1.pyc	6977	0644	editdlrm
tabnanny.cpython-36.opt-2.pyc	6044	0644	editdlrm
tabnanny.cpython-36.pyc	6977	0644	editdlrm
tarfile.cpython-36.opt-1.pyc	74837	0644	editdlrm
tarfile.cpython-36.opt-2.pyc	59843	0644	editdlrm
tarfile.cpython-36.pyc	74837	0644	editdlrm
telnetlib.cpython-36.opt-1.pyc	18099	0644	editdlrm
telnetlib.cpython-36.opt-2.pyc	10589	0644	editdlrm
telnetlib.cpython-36.pyc	18099	0644	editdlrm
tempfile.cpython-36.opt-1.pyc	23265	0644	editdlrm
tempfile.cpython-36.opt-2.pyc	16793	0644	editdlrm
tempfile.cpython-36.pyc	23265	0644	editdlrm
textwrap.cpython-36.opt-1.pyc	13612	0644	editdlrm
textwrap.cpython-36.opt-2.pyc	6315	0644	editdlrm
textwrap.cpython-36.pyc	13686	0644	editdlrm
this.cpython-36.opt-1.pyc	1267	0644	editdlrm
this.cpython-36.opt-2.pyc	1267	0644	editdlrm
this.cpython-36.pyc	1267	0644	editdlrm
threading.cpython-36.opt-1.pyc	36762	0644	editdlrm
threading.cpython-36.opt-2.pyc	20721	0644	editdlrm
threading.cpython-36.pyc	37415	0644	editdlrm
timeit.cpython-36.opt-1.pyc	11605	0644	editdlrm
timeit.cpython-36.opt-2.pyc	5624	0644	editdlrm
timeit.cpython-36.pyc	11605	0644	editdlrm
token.cpython-36.opt-1.pyc	3322	0644	editdlrm
token.cpython-36.opt-2.pyc	3272	0644	editdlrm
token.cpython-36.pyc	3322	0644	editdlrm
tokenize.cpython-36.opt-1.pyc	18603	0644	editdlrm
tokenize.cpython-36.opt-2.pyc	15003	0644	editdlrm
tokenize.cpython-36.pyc	18649	0644	editdlrm
trace.cpython-36.opt-1.pyc	19497	0644	editdlrm
trace.cpython-36.opt-2.pyc	16494	0644	editdlrm
trace.cpython-36.pyc	19497	0644	editdlrm
traceback.cpython-36.opt-1.pyc	19648	0644	editdlrm
traceback.cpython-36.opt-2.pyc	10747	0644	editdlrm
traceback.cpython-36.pyc	19648	0644	editdlrm
tracemalloc.cpython-36.opt-1.pyc	17231	0644	editdlrm
tracemalloc.cpython-36.opt-2.pyc	15815	0644	editdlrm
tracemalloc.cpython-36.pyc	17231	0644	editdlrm
tty.cpython-36.opt-1.pyc	1074	0644	editdlrm
tty.cpython-36.opt-2.pyc	973	0644	editdlrm
tty.cpython-36.pyc	1074	0644	editdlrm
types.cpython-36.opt-1.pyc	8203	0644	editdlrm
types.cpython-36.opt-2.pyc	7036	0644	editdlrm
types.cpython-36.pyc	8203	0644	editdlrm
typing.cpython-36.opt-1.pyc	72900	0644	editdlrm
typing.cpython-36.opt-2.pyc	56049	0644	editdlrm
typing.cpython-36.pyc	73308	0644	editdlrm
uu.cpython-36.opt-1.pyc	3500	0644	editdlrm
uu.cpython-36.opt-2.pyc	3282	0644	editdlrm
uu.cpython-36.pyc	3500	0644	editdlrm
uuid.cpython-36.opt-1.pyc	20812	0644	editdlrm
uuid.cpython-36.opt-2.pyc	14144	0644	editdlrm
uuid.cpython-36.pyc	20948	0644	editdlrm
warnings.cpython-36.opt-1.pyc	12668	0644	editdlrm
warnings.cpython-36.opt-2.pyc	10288	0644	editdlrm
warnings.cpython-36.pyc	13260	0644	editdlrm
wave.cpython-36.opt-1.pyc	17835	0644	editdlrm
wave.cpython-36.opt-2.pyc	11844	0644	editdlrm
wave.cpython-36.pyc	17887	0644	editdlrm
weakref.cpython-36.opt-1.pyc	19115	0644	editdlrm
weakref.cpython-36.opt-2.pyc	15815	0644	editdlrm
weakref.cpython-36.pyc	19145	0644	editdlrm
webbrowser.cpython-36.opt-1.pyc	15766	0644	editdlrm
webbrowser.cpython-36.opt-2.pyc	13897	0644	editdlrm
webbrowser.cpython-36.pyc	15799	0644	editdlrm
xdrlib.cpython-36.opt-1.pyc	8304	0644	editdlrm
xdrlib.cpython-36.opt-2.pyc	7819	0644	editdlrm
xdrlib.cpython-36.pyc	8304	0644	editdlrm
zipapp.cpython-36.opt-1.pyc	5536	0644	editdlrm
zipapp.cpython-36.opt-2.pyc	4360	0644	editdlrm
zipapp.cpython-36.pyc	5536	0644	editdlrm
zipfile.cpython-36.opt-1.pyc	50792	0644	editdlrm
zipfile.cpython-36.opt-2.pyc	44289	0644	editdlrm
zipfile.cpython-36.pyc	50860	0644	editdlrm
_bootlocale.cpython-36.opt-1.pyc	954	0644	editdlrm
_bootlocale.cpython-36.opt-2.pyc	729	0644	editdlrm
_bootlocale.cpython-36.pyc	982	0644	editdlrm
_collections_abc.cpython-36.opt-1.pyc	28799	0644	editdlrm
_collections_abc.cpython-36.opt-2.pyc	23647	0644	editdlrm
_collections_abc.cpython-36.pyc	28799	0644	editdlrm
_compat_pickle.cpython-36.opt-1.pyc	6510	0644	editdlrm
_compat_pickle.cpython-36.opt-2.pyc	6510	0644	editdlrm
_compat_pickle.cpython-36.pyc	6568	0644	editdlrm
_compression.cpython-36.opt-1.pyc	4106	0644	editdlrm
_compression.cpython-36.opt-2.pyc	3890	0644	editdlrm
_compression.cpython-36.pyc	4106	0644	editdlrm
_dummy_thread.cpython-36.opt-1.pyc	4853	0644	editdlrm
_dummy_thread.cpython-36.opt-2.pyc	2645	0644	editdlrm
_dummy_thread.cpython-36.pyc	4853	0644	editdlrm
_markupbase.cpython-36.opt-1.pyc	7824	0644	editdlrm
_markupbase.cpython-36.opt-2.pyc	7444	0644	editdlrm
_markupbase.cpython-36.pyc	7993	0644	editdlrm
_osx_support.cpython-36.opt-1.pyc	9708	0644	editdlrm
_osx_support.cpython-36.opt-2.pyc	7259	0644	editdlrm
_osx_support.cpython-36.pyc	9708	0644	editdlrm
_pydecimal.cpython-36.opt-1.pyc	163404	0644	editdlrm
_pydecimal.cpython-36.opt-2.pyc	81997	0644	editdlrm
_pydecimal.cpython-36.pyc	163404	0644	editdlrm
_pyio.cpython-36.opt-1.pyc	71370	0644	editdlrm
_pyio.cpython-36.opt-2.pyc	48975	0644	editdlrm
_pyio.cpython-36.pyc	71388	0644	editdlrm
_sitebuiltins.cpython-36.opt-1.pyc	3437	0644	editdlrm
_sitebuiltins.cpython-36.opt-2.pyc	2913	0644	editdlrm
_sitebuiltins.cpython-36.pyc	3437	0644	editdlrm
_strptime.cpython-36.opt-1.pyc	15965	0644	editdlrm
_strptime.cpython-36.opt-2.pyc	12235	0644	editdlrm
_strptime.cpython-36.pyc	15965	0644	editdlrm
_sysconfigdata_dm_linux_x86_64-linux-gnu.cpython-36.opt-1.pyc	23819	0644	editdlrm
_sysconfigdata_dm_linux_x86_64-linux-gnu.cpython-36.opt-2.pyc	23819	0644	editdlrm
_sysconfigdata_dm_linux_x86_64-linux-gnu.cpython-36.pyc	23819	0644	editdlrm
_sysconfigdata_m_linux_x86_64-linux-gnu.cpython-36.opt-1.pyc	23950	0644	editdlrm
_sysconfigdata_m_linux_x86_64-linux-gnu.cpython-36.opt-2.pyc	23950	0644	editdlrm
_sysconfigdata_m_linux_x86_64-linux-gnu.cpython-36.pyc	23950	0644	editdlrm
_threading_local.cpython-36.opt-1.pyc	6427	0644	editdlrm
_threading_local.cpython-36.opt-2.pyc	3112	0644	editdlrm
_threading_local.cpython-36.pyc	6427	0644	editdlrm
_weakrefset.cpython-36.opt-1.pyc	7830	0644	editdlrm
_weakrefset.cpython-36.opt-2.pyc	7830	0644	editdlrm
_weakrefset.cpython-36.pyc	7830	0644	editdlrm
__future__.cpython-36.opt-1.pyc	4169	0644	editdlrm
__future__.cpython-36.opt-2.pyc	2193	0644	editdlrm
__future__.cpython-36.pyc	4169	0644	editdlrm
__phello__.foo.cpython-36.opt-1.pyc	121	0644	editdlrm
__phello__.foo.cpython-36.opt-2.pyc	121	0644	editdlrm
__phello__.foo.cpython-36.pyc	121	0644	editdlrm

3 \T��$@sJdZd
dddddddd d ddd ddddddddddddddddddd d!d"d#d$g$Z
eZd%Zd&Zd'Zd(d)lZd(d)lZ d(d)l Z yd(d*lmZ
e dd+�ZWnek r�


d,d-�ZYnXdZdZdZdZdZdZdZdZd.Ze jd�kr�d2Zd2Zd�Znd3Zd3Zd�Zeed1ZGd4d�de�ZGd5d�de�Z Gd6d �d e�Z!Gd7d�de!�Z"Gd8d �d ee#�Z$Gd9d�de!�Z%Gd:d�de!e#�Z&Gd;d�de�Z'Gdd �d e�Z*Gd?d�de'e)�Z+Gd@d�de'e)e*�Z,GdAd�dee-�Z.e e$e'e+e)e,e!e*e.g Z/e"e!e%e!e&e!e(e!iZ0eeeeeeeefZ1yd(d)l2Z2Wn.ek �rh


GdBdC�dCe3�Z4e4�Z2[4YnXy e2j5
Wn>e6k �r�


e7e2j8�dD��r�e2j8�`9dEd�Z:dFd�Z;Yn6Xe2j5�Z5e7e5dD��r�e5`9e5f
dGd�
Z;e5f
dHd�
Z:[2[5d�dId�
Ze j?j@e=�

GdNdO�dOe3�ZAGdPd�de3�ZBGdQdR�dRe3�ZCd�dSdT�
ZDeEjFZGdUdV�ZHdWdX�ZIdYdZ�ZJd[d\�ZKd�d^d_�
ZLd`da�ZMdbdc�ZNGddde�dee3�ZOeO�jPZQd�dfdg�
ZRdhdi�ZSdjdk�ZTdldmdndodpdqdrdsdtdu� f
dvdw�
ZUd�dxdy�
ZVd�dzd{�
ZWeBd|ee$e+e!ggd}d�d1d(d~�ZXeBdee$e+e!e e,ggd��ZYeBdeggd��ZZd(d)l[Z[e[j\d�e[j]e[j^B�j_Z`e[j\d��
j_Zae[j\d��
j_Zbe[j\d�e[j]e[jcB�Zd[[yd(d)leZfWnek �r�


YnXd�d�d��
Zgd�d��Zhd�d��Zid�d�d��
Zjd�d��Zkd�d��Zle=d��
Zme=d��
Zne=d��
Zoe=d(�
Zpe=d1�
Zqe=d��
ZremenfZse jtjuZve jtjwZxe jtjyZze{dsevd/ev�Z|[ d)S)�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_THREADSZdecimalz1.70z2.4.2�N)
� namedtuplezsign digits exponentc

Gs|S)
N�)
�argsr'r'�"/usr/lib64/python3.6/_pydecimal.py��sr*T��?�
l��N�Zoi@�Tc@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
GsdS)
Nr')�self�contextr(r'r'r)�handle�s
zDecimalException.handleN)�__name__� __module__�__qualname__�__doc__r0r'r'r'r)r�s
c
@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)r1r2r3r4r'r'r'r)r�s c@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�}|j|
�
StS)Nr%�
nT)�_dec_from_triple�_sign�_int�_fix_nan�_NaN)r.r/r(�ansr'r'r)r0�s



zInvalidOperation.handleN)r1r2r3r4r0r'r'r'r)r �s
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
GstS)
N)
r:)r.r/r(r'r'r)r0
s
zConversionSyntax.handleN)r1r2r3r4r0r'r'r'r)r�s
c@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|S)
N)
�_SignedInfinity)r.r/�signr(r'r'r)r0
s
zDivisionByZero.handleN)r1r2r3r4r0r'r'r'r)r 
sc@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
GstS)
N)
r:)r.r/r(r'r'r)r0
s
zDivisionImpossible.handleN)r1r2r3r4r0r'r'r'r)r
sc@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
GstS)
N)
r:)r.r/r(r'r'r)r0)
s
zDivisionUndefined.handleN)r1r2r3r4r0r'r'r'r)r!
sc
@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. N)r1r2r3r4r'r'r'r)r,
s c@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
GstS)
N)
r:)r.r/r(r'r'r)r0C
s
zInvalidContext.handleN)r1r2r3r4r0r'r'r'r)r8
s c
@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. N)r1r2r3r4r'r'r'r)rF
s 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. N)r1r2r3r4r'r'r'r)r R
s 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
tttfkrt|S|d
krR|
jtkr4t|St|d|
j|
j |
jd�S|dkr�|
jt krlt|St|d|
j|
j |
jd�SdS)Nr%�
9r-)�roundingrrrrr<rr6�prec�Emaxr)r.r/r=r(r'r'r)r0s
s












zOverflow.handleN)r1r2r3r4r0r'r'r'r)r]
sc
@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. N)r1r2r3r4r'r'r'r)r�
s c
@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. N)r1r2r3r4r'r'r'r)r�
s c@seZ
dZef
d
d�
ZdS)� MockThreadingcCs |
jt
S)
N)�modules� __xname__)r.�sysr'r'r)�local�
s
zMockThreading.localN)r1r2r3rErFr'r'r'r)rB�
s
rB�__decimal_context__c

Cs,|tt
tfkr|j�}|j�
|tj�_d
S)z%Set this thread's context to context.N)rrr�copy�clear_flags� threading�current_threadrG)
r/r'r'r)r�
s


c
Cs4y tj
�jStk r.


t�}|tj
�_|SXd
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)rJrKrG�AttributeErrorr)
r/r'r'r)r�
s




c
Cs,y|jSt
k r&


t�}
|
|_|
SXd
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)rGrLr)�_localr/r'r'r)r�
s




cCs(|tt
tfkr|j�}|j�
||
_d
S)z%Set this thread's context to context.N)rrrrHrIrG)r/rMr'r'r)r�
s


c

Cs|d
krt�}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)
Zctxr'r'r)r�
s$
c @s�eZ
dZd
Zd�Zd�dd �
Zed d��
Zdd �Zdd�Z d�dd�
Z dd�Zdd�Zdd�Z d�dd�
Zd�dd�
Zd�dd�
Zd�dd�
Zd�d d!�
Zd�d"d#�
Zd$d%�Zd&d'�Zd(d)�Zd*d+�Zd�d-d.�
Zd�d/d0�
Z�
dd1d2�
Z�
d
d3d4�
Z�
dd6d7�
Z�
dd8d9�
ZeZ�
dd:d;�
Z�
ddd?�
Z!e!Z"�
dd@dA�
Z#dBdC�Z$�
ddDdE�
Z%�
d dFdG�
Z&�
d dHdI�
Z'�
ddJdK�
Z(�
ddLdM�
Z)�
d dNdO�
Z*�
ddPdQ�
Z+�
ddRdS�
Z,dTdU�Z-dVdW�Z.e.Z/dXdY�Z0e1e0�
Z0dZd[�Z2e1e2�
Z2d\d]�Z3d^d_�Z4d`da�Z5dbdc�Z6ddde�Z7dfdg�Z8dhdi�Z9djdk�Z:dldm�Z;dndo�Ze?e7e8e9e:e;edt�Z@�
ddudv�
ZAdwdx�ZBdydz�ZC�
dd{d|�
ZD�
dd}d~�
ZEdd��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\�
d d�d��
Z]�
d!d�d��
Z^d�d��Z_d�d��Z`d�d��Zad�d��Zb�
d"d�d��
Zcd�d��Zdd�d��Zed�d��Zf�
d#d�d��
Zgd�d„Zhd�dĄZi�
d$d�dƄ
Zjd�dȄZk�
d%d�dʄ
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�
d0d�d�
Zyd�d�Zz�
d1d�d�
Z{�
d2d�d�
Z|�
d3d�d�
Z}d�d�Z~d�d��Zd�d�Z��
d4d�d�
Z�dS(5
r
z,Floating point class for decimal arithmetic.�_expr8r7�_is_special�
0NcCs�tj
|�
}t|
t��
r$t|
j�jd
d��
}|dkrP|dkr@t�}|jt d|
�S|j d�
dkrfd|_nd|_|j d �
}|dk r�|j d �
p�d}t|j d�
p�d�
}tt||�
�
|_ |t|�
|_d |_nZ|j d�
}|dk �
rtt|p�d�
�
jd�
|_ |j 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��o|
ddk�std�
�
|
d|_|
ddk�rHd|_ |
d|_d|_n�g} x^|
dD]R} t| t��r�d| k
�ozdk
n
�r�| �s�| dk�r�| j| �

ntd�
�
�qVW|
ddk�r�djtt| ��
|_ |
d|_d|_nDt|
dt��rdjtt| �pdg
��
|_ |
d|_d |_ntd�
�
|St|
t��r||dk�rBt�}|jtd�
tj|
�
}
|
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: %rr=�
-r-r%�intZfrac�exprQF�diag�signal�
Nr5�
FT�ztInvalid tuple size in creation of Decimal from list or tuple. The list or tuple should have exactly three elements.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.r+� zTThe second value in the tuple must be composed of integers in the range 0 through 9.zUThe third value in the tuple must be an integer, or one of the strings 'F', 'n', 'N'.z;strict semantics for mixing floats and Decimals are enabledzCannot convert %r to Decimal)r%r-)r5rY)!�object�__new__� isinstance�str�_parser�strip�replacer�_raise_errorr�groupr7rUr8�lenrOrP�lstrip�absr
�_WorkRepr=rV�list�tuple� ValueError�append�join�map�floatr� from_float� TypeError)�cls�valuer/r.�
m�intpart�fracpartrVrW�digitsZdigitr'r'r)r^4s� 










































(














zDecimal.__new__cCs�t|
t
�r||
�
St|
t�s$td
�
�
tj|
�
s8tj|
�
rD|t|
�
�
Stjd|
�dkrZd}nd}t |
�
j �\}}|j�d}t|t |d|�
|�}|tkr�|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') zargument must be int or float.g�?r%r-�N)r_rUrprr�_mathZisinfZisnan�reprZcopysignrh�as_integer_ratio� bit_lengthr6r`r
)rs�
fr=r5�
d�
k�resultr'r'r)rq�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 r5r-rYr+r%)rPrO)r.rVr'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 rZr-r%�����)rOr7)
r.r'r'r)�_isinfinity
s 



zDecimal._isinfinitycCs||j�}|
d
krd}n|
j�}|s&|rx|d
kr4t
�}|dkrJ|jtd|�S|dkr`|jtd|
�S|rn|j|�
S|
j|�
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�rrdr r9)r.�otherr/�self_is_nan�other_is_nanr'r'r)�_check_nanss" 











zDecimal._check_nanscCsv|d
krt�}|j
s|
j
rr|j�r0|jtd|�S|
j�rF|jtd|
�S|j�r\|jtd|�S|
j�rr|jtd|
�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%)rrP�is_snanrdr �is_qnan)r.r�r/r'r'r)�_compare_check_nans.s(

















zDecimal._compare_check_nansc

Cs|jp|j
d
kS)zuReturn True if self is nonzero; otherwise return False. NaNs and infinities are considered nonzero. rQ)rPr8)
r.r'r'r)�__bool__OszDecimal.__bool__cCs
|js|
jr8|j
�}|
j
�}||kr(d
S||kr4dSdS|sP|
sDd
Sd|
jS|
s^d|jS|
j|jkrndS|j|
jkr~dS|j�}|
j�}||k�r�|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-rQNr�r�r�r�r�r�r�r�)rPr�r7�adjustedr8rO)r.r�Zself_infZ other_inf� self_adjustedZother_adjusted�self_paddedZother_paddedr'r'r)�_cmpVs>






















zDecimal._cmpcCs<t||
d
d�\}}
|
t
kr|
S|j|
|�r.dS|j|
�
dkS)NT)
�equality_opFr%)�_convert_for_comparison�NotImplementedr�r�)r.r�r/r'r'r)�__eq__�s





zDecimal.__eq__cCs<t||
�\}}
|
t
kr|
S|j|
|�}|r.d
S|j|
�
dkS)NFr%)r�r�r�r�)r.r�r/r;r'r'r)�__lt__�s






zDecimal.__lt__cCs<t||
�\}}
|
t
kr|
S|j|
|�}|r.d
S|j|
�
dk
S)NFr%)r�r�r�r�)r.r�r/r;r'r'r)�__le__�s






zDecimal.__le__cCs<t||
�\}}
|
t
kr|
S|j|
|�}|r.d
S|j|
�
dkS)NFr%)r�r�r�r�)r.r�r/r;r'r'r)�__gt__�s






zDecimal.__gt__cCs<t||
�\}}
|
t
kr|
S|j|
|�}|r.d
S|j|
�
dkS)NFr%)r�r�r�r�)r.r�r/r;r'r'r)�__ge__�s






zDecimal.__ge__cCs>t|
d
d�}
|j
s|
r0|
j
r0|j|
|�}|r0|St|j|
�
�
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_otherrPr�r
r�)r.r�r/r;r'r'r)�compare�s


zDecimal.comparec
Cs�|jr4|j
�rtd
�
�
n|j�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-r+r������) rPr�rr�is_nan�_PyHASH_NANr7�_PyHASH_INFrO�pow�_PyHASH_MODULUS� _PyHASH_10INVrUr8)r.Zexp_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. )rr7rkrorUr8rO)
r.r'r'r)�as_tuple�szDecimal.as_tuplec
Cs�|jr |j
�rtd
�
�
ntd�
�
|s(dSt|j�
}
|jdkrR|
d|jd}
}nr|j}x(|dkr�|
ddkr�|
d}
|d8}q\W|j}t|
|
@j�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�ry)r%r-) rPr�rl� OverflowErrorrUr8rO�minr}r7)r.r5rZd5Zd2Zshift2r'r'r)r|�s,












zDecimal.as_integer_ratioc

Csd
t|�
S)z0Represents the number as an instance of Decimal.z Decimal('%s'))
r`)
r.r'r'r)�__repr__'szDecimal.__repr__Fc Csd
d
dg|j}|j
rL|jdkr&|dS|jdkr>|d|jS|d|jS|jt|j�
}|jdk
rt|dkrt|}n6|
s~d }n,|jdkr�|d dd }n|d dd }|dk
r�d}d d||j}nN|t|j�
k�r�|jd|t|j�
}d
}n |jd|�}d |j|d�}||k�
r*d
}n*|dk�
r:t�}ddg|jd||}||||S)z�Return string representation of the number in scientific notation. Captures all of the information in the underlying representation. rSrTrZZInfinityr5�NaNr�r%�r-rQr[�
.N�
e�
Ez%+di����)r7rPrOr8rfr�capitals) r.�engr/r=� leftdigits�dotplacervrwrVr'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�r/)
r�)r.r/r'r'r)� to_eng_string`szDecimal.to_eng_stringcCsT|jr|j
|
d
�
}|r|S|
dkr(t�}
|rB|
jtkrB|j�}n|j�}|j|
�
S)zRReturns a copy with the sign switched. Rounds, if it has reason. )
r/N)rPr�rr?r�copy_abs�copy_negate�_fix)r.r/r;r'r'r)�__neg__is



 zDecimal.__neg__cCsT|jr|j
|
d
�
}|r|S|
dkr(t�}
|rB|
jtkrB|j�}nt|�
}|j|
�
S)zhReturns a copy, unless it is a sNaN. Rounds the number (if more than precision digits) )
r/N)rPr�rr?rr�r
r�)r.r/r;r'r'r)�__pos__s



 zDecimal.__pos__TcCsJ|
s|j�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(). )
r/)r�rPr�r7r�r�)r.�roundr/r;r'r'r)�__abs__�s




zDecimal.__abs__c Cslt|
�
}
|
t
kr|
S|d
kr"t�}|js.|
jr�|j|
|�}|rB|S|j�rr|j|
jkrj|
j�rj|jtd�St |�
S|
j�r�t |
�
St |j|
j�}d}|jt kr�|j|
jkr�d}|r�|
r�t |j|
j�}|r�d}t|d|�}|j|�
}|S|�
s"t||
j|jd�}|
j||j�}|j|�
}|S|
�
sZt||j|jd�}|j||j�}|j|�
}|St|�
}t|
�
}t|||j�\}}t�} |j|jk�
r�|j|jk�
r�t|d|�}|j|�
}|S|j|jk�
r�||}}|jdk�
r�d| _|j|j|_|_nd| _n&|jdk�rd| _d\|_|_nd| _|jdk�r@|j|j| _n|j|j| _|j| _t | �
}|j|�
}|S)zbReturns self + other. -INF + INF (or the reverse) cause InvalidOperation errors. Nz -INF + INFr%r-rQ)r%r%)r�r�rrPr�r�r7rdr r
r�rOr?rr6r��maxr@�_rescaleri� _normalizer=rUrV) r.r�r/r;rVZnegativezeror=�op1�op2r�r'r'r)�__add__�s|











































zDecimal.__add__cCsHt|
�
}
|
t
kr|
S|js |
jr6|j|
|d
�}|r6|S|j|
j�|d
�S)zReturn self - other)
r/)r�r�rPr�r�r�)r.r�r/r;r'r'r)�__sub__s




zDecimal.__sub__cCs"t|
�
}
|
t
kr|
S|
j||d
�S)zReturn other - self)
r/)r�r�r�)r.r�r/r'r'r)�__rsub__s

zDecimal.__rsub__cCsD
t|
�
}
|
t
kr|
S|d
kr"t�}|j|
jA}|js:|
jr�|j|
|�}|rN|S|j�rn|
sf|jtd�St |S|
j�r�|s�|jtd�St |S|j |
j }|s�|
r�t|d|�}|j|�
}|S|j dkr�t||
j |�}|j|�
}|S|
j dk�
rt||j |�}|j|�
}|St|�
}t|
�
}t|t|j|j�
|�}|j|�
}|S)z\Return self * other. (+-) INF * 0 (or its reverse) raise InvalidOperation. Nz(+-)INF * 0z0 * (+-)INFrQ�
1)r�r�rr7rPr�r�rdr r<rOr6r�r8rir`rU)r.r�r/Z resultsignr;Z resultexpr�r�r'r'r)�__mul__sH






















zDecimal.__mul__cCs�
t|
�
}
|
t
krt
S|d
kr"t�}|j|
jA}|js:|
jr�|j|
|�}|rN|S|j�rj|
j�rj|jtd�S|j�rzt |S|
j�r�|jt d�
t|d|j��S|
s�|s�|jt d�S|jtd|�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}n<|j|
j}x.||k�
r�|d dk�
r�|d }|d7}�
q�Wt|t|�
|�}|j|�
S)zReturn self / other.Nz(+-)INF/(+-)INFzDivision by infinityrQz0 / 0zx / 0r%r-r�ry)r�r�rr7rPr�r�rdr r<rr6�Etinyrr rOrfr8r@ri�divmodrUr`r�)r.r�r/r=r;rV�coeff�shiftr�r�� remainder� ideal_expr'r'r)�__truediv__QsP

























zDecimal.__truediv__cCs
|j|
jA}|
j
�r|j}nt|j|
j�}|j�|
j�}|sP|
j
�sP|dk
rjt|dd�|j||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|jtd�} | | 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+rQr%r�z%quotient too large in //, % or divmodr�)r7r�rOr�r�r6r�r?r@rirVrUr�r`rdr)r.r�r/r=r��expdiffr�r��
q�
rr;r'r'r)�_divide�s*















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


zDecimal.__rtruediv__cCs�t|
�
}
|
t
kr|
S|d
kr"t�}|j|
|�}|r:||fS|j|
jA}|j�r~|
j�rj|jtd�}||fSt||jtd�fS|
s�|s�|jt d�}||fS|jt d|�|jtd�fS|j|
|�\}}|j|�
}||fS)z6 Return (self // other, self % other) Nzdivmod(INF, INF)zINF % xzdivmod(0, 0)zx // 0zx % 0) r�r�rr�r7r�rdr r<rr r�r�)r.r�r/r;r=Zquotientr�r'r'r)� __divmod__�s0















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


zDecimal.__rdivmod__cCs�t|
�
}
|
t
kr|
S|d
kr"t�}|j|
|�}|r6|S|j�rJ|jtd�S|
sj|r^|jtd�S|jtd�S|j|
|�d}|j |�
}|S)z self % other NzINF % xzx % 0z0 % 0r-) r�r�rr�r�rdr rr�r�)r.r�r/r;r�r'r'r)�__mod__�s"










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


zDecimal.__rmod__cCs�
|d
krt�}t
|
dd�}
|j|
|�}|r.|S|j�rB|jtd�S|
sb|rV|jtd�S|jtd�S|
j�r|t|�
}|j|�
St |j |
j �}|s�t|jd|�}|j|�
S|j �|
j �}||jdkr�|jt�
S|dk
r�|j||j�}|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�|jt�
S|j} | dk�
r�d| } | } t| t| �
|�}|j|�
S) zI Remainder nearest to 0- abs(remainder-near) <= other/2 NT)
r�zremainder_near(infinity, x)zremainder_near(x, 0)zremainder_near(0, 0)rQr-r+r�r%r�)rr�r�r�rdr rr
r�r�rOr6r7r�r@rr�r?rirVrUr�r`)r.r�r/r;�ideal_exponentr�r�r�r�r�r=r'r'r)�remainder_near
sZ



























zDecimal.remainder_nearcCs�t|
�
}
|
t
kr|
S|d
kr"t�}|j|
|�}|r6|S|j�rb|
j�rR|jtd�St|j|
jAS|
s�|r�|jt d|j|
jA�S|jt d�S|j|
|�dS)z self // otherNz INF // INFzx // 0z0 // 0r%)r�r�rr�r�rdr r<r7r rr�)r.r�r/r;r'r'r)�__floordiv__Ls$









zDecimal.__floordiv__cCs"t|
�
}
|
t
kr|
S|
j||d
�S)z*Swaps self/other and returns __floordiv__.)
r/)r�r�r�)r.r�r/r'r'r)� __rfloordiv__hs


zDecimal.__rfloordiv__c
Cs8|j�r(|j
�rtd
�
�
|jr"dnd}
nt|�
}
t|
�
S)zFloat representation.z%Cannot convert signaling NaN to floatz-nan�nan)r�r�rlr7r`rp)r.�
sr'r'r)� __float__os



zDecimal.__float__c
Cst|jr(|j
�rtd
�
�
n|j�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�NrQr�) rPr�rlr�r�r7rOrUr8)r.r�r'r'r)�__int__ys






zDecimal.__int__c


Cs|S)
Nr')
r.r'r'r)�real�s
zDecimal.realc

Cstd
�
S)Nr%)
r
)
r.r'r'r)�imag�s
zDecimal.imagc


Cs|S)
Nr')
r.r'r'r)� conjugate�s
zDecimal.conjugatec

Cstt
|�
�
S)
N)�complexrp)
r.r'r'r)�__complex__�s
zDecimal.__complex__cCsR|j}|
j
|
j}t|�
|krJ|t|�
|d
�jd�
}t|j||jd�St|�
S)z2Decapitate the payload of a NaN to fit the contextNrQT) r8r@�clamprfrgr6r7rOr
)r.r/ZpayloadZmax_payload_lenr'r'r)r9�s



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

t |jd
|�St|�
St|j�
|j |
j}||kr�|
jtd|j�}|
jt�

|
jt�

|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�|
jtd|j�}nt |j||�}|�
r�|�
r�|
jt�

|�
r�|
jt�

|�
r�|
jt�

|
jt�

|�
s�|
jt�

|S|�r|
jt�

|
jdk�rP|j |k�rP|
jt�

|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. rQz above Emaxr%r�r-Nr�)rPr�r9r
r��EtoprAr�r�r�rOrdrr6r7rfr8r@rrr�_pick_rounding_functionr?r`rUrr )r.r/r�r��exp_maxZnew_expZexp_minr;Zself_is_subnormalrxZrounding_method�changedr�r�r'r'r)r��sn 
 





































zDecimal._fixcCst|j
|
�rd
SdSdS)z(Also known as round-towards-0, truncate.r%r-Nr�)� _all_zerosr8)r.r@r'r'r)�_round_downs
zDecimal._round_downcCs|j|
�
S)
zRounds away from 0.)
r�)r.r@r'r'r)� _round_upszDecimal._round_upcCs*|j|
d
krdSt
|j|
�r"dSdSdS)zRounds 5 up (away from 0)Z56789r-r%Nr�)r8r�)r.r@r'r'r)�_round_half_ups 


zDecimal._round_half_upcCst|j
|
�rdS|j|
�
SdS)zRound 5 downr-Nr�)�_exact_halfr8r�)r.r@r'r'r)�_round_half_downs
zDecimal._round_half_downcCs8t|j
|
�r*|
d
ks&|j
|
ddkr*dS|j|
�
SdS)z!Round 5 to even, rest to nearest.r%r-�02468Nr�)r�r8r�)r.r@r'r'r)�_round_half_even#s

zDecimal._round_half_evencCs |jr|j
|
�
S|j
|
�
Sd
S)z(Rounds up (not away from 0 if negative.)N)r7r�)r.r@r'r'r)�_round_ceiling+s
zDecimal._round_ceilingcCs |js|j
|
�
S|j
|
�
Sd
S)z'Rounds down (not towards 0 if negative)N)r7r�)r.r@r'r'r)�_round_floor2s
zDecimal._round_floorcCs0|
r |j|
d
dkr |j
|
�
S|j
|
�
SdS)z)Round down unless digit prec-1 is 0 or 5.r-Z05N)r8r�)r.r@r'r'r)�_round_05up9s
zDecimal._round_05up)rrrrrrrrcCsb|
d
k r2t|
t
�std�
�
tdd|
�}|j|�
S|jrR|j�rJtd�
�
ntd�
�
t
|j 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�zcannot round a NaNzcannot round an infinity)r_rUrrr6�quantizerPr�rlr�r�r)r.r5rVr'r'r)� __round__Ks/





zDecimal.__round__c

Cs0|jr |j
�rtd
�
�
ntd�
�
t|jdt��
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. zcannot round a NaNzcannot round an infinityr%)rPr�rlr�rUr�r)
r.r'r'r)� __floor__�s 


zDecimal.__floor__c

Cs0|jr |j
�rtd
�
�
ntd�
�
t|jdt��
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. zcannot round a NaNzcannot round an infinityr%)rPr�rlr�rUr�r)
r.r'r'r)�__ceil__�s 


zDecimal.__ceil__cCs
t|
d
d�}
t|d
d�}|j
s$|
j
r�|dkr2t�}|jdkrJ|jtd|�S|
jdkrb|jtd|
�S|jdkrr|}nf|
jdkr�|
}nV|jdkr�|
s�|jtd�St|j|
jA}n*|
jdkr�|s�|jtd �St|j|
jA}n0t|j|
jAt t |j�
t |
j�
�
|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. T)
r�NrYr�r5rZzINF * 0 in fmaz0 * INF in fma) r�rPrrOrdr r<r7r6r`rUr8r�)r.r�Zthirdr/�productr'r'r)�fma�s6






















zDecimal.fmacCs�
t|
�
}
|
t
kr|
St|�
}|t
kr(|S|d
kr6t�}|j�}|
j�}|j�}|sZ|sZ|r�|dkrp|jtd|�S|dkr�|jtd|
�S|dkr�|jtd|�S|r�|j|�
S|r�|
j|�
S|j|�
S|j�o�|
j�o�|j�s�|jtd�S|
dkr�|jtd�S|�
s|jtd�S|j�|j k�
r(|jtd�S|
�
rD|�
rD|jtd �S|
j ��
rTd}n|j}tt |�
�
}t|j��
}t|
j��
} |j |td |j|�|}x t| j�
D]} t|d |�}�
q�Wt|| 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�rdr r9� _isintegerr�r@�_isevenr7rhrUri�to_integral_valuer�rV�ranger6r`)r.r��modulor/r�r�Z modulo_is_nanr=�base�exponent�
ir'r'r)� _power_modulo�sl








































zDecimal._power_modulocCst|�
}|j
|j}}x |d
dkr6|d
}|d7}qWt|
�
}|j
|j}}x |d
dkrn|d
}|d7}qPW|dk�
r||9}x |d
dkr�|d
}|d7}q�W|dkr�dS|d
|} |jdkr�| } |
j�o�|
jdk�
r|jt
|
�
} t| | |d�}nd}tddd|| |�S|jdk�r�|d
}|dk�
r�||@|k�
rPdSt |�
d} |dd}|t t|�
�
k�
r~dSt| ||�} t|||�}| dk�
s�|dk�
r�dS| |k�
r�dSd | }n�|d k�r�t |�
dd} t d | |�\}}|�rdSx$|d dk�r$|d }| d8} �qW|d
d}|t t|�
�
k�rHdSt| ||�} t|||�}| dk�sx|dk�r|dS| |k�r�dSd| }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
|}}x:|d|dk�oldkn
�r�|d}|d}�qPWx:|d |d k�o�dkn
�r�|d }|d }�q�W|dk�rt|dk�r�||k
�r�dSt ||�\}}|dk�rdSdt |�
|>}x>t |||d�\}}||k
�r>Pn||d||}�qW||k�oh|dk�spdS|}|dk�r�||dt|�
k�r�dS||}||9}|d
|k�r�dSt|�
}|
j��r�|
jdk�r�|jt
|
�
} t|| |t |�
�}nd}td|d|||�S)ahAttempt to compute self**other exactly. Given Decimals self and other and an integer p, attempt to compute an exact result for the power self**other, with p digits of precision. Return None if self**other is not exactly representable in p digits. Assumes that elimination of special cases has already been performed: self and other must both be nonspecial; self must be positive and not numerically equal to 1; other must be nonzero. For efficiency, other._exp should not be too large, so that 10**abs(other._exp) is a feasible calculation.r�r%r-Nr�rQr+�r���]�Ary�r[�d)r+r
r�r
)rirUrVr=r�r7rOr�r6�_nbitsrfr`�_decimal_lshift_exactr�rh� _log10_lb)r.r��
p�
x�xc�xe�
y�yc�yer�r�ZzerosZ last_digitr�Zemaxr�rur5Zxc_bits�rem�
ar�r�Zstr_xcr'r'r)�_power_exact(s�:




























 
















&


&


&


&

 


















zDecimal._power_exactcCs@|d
k r|j|
||�St
|
�
}
|
tkr*|
S|d
kr8t�}|j|
|�}|rL|S|
sd|s`|jtd�StSd}|jdkr�|
j �r�|
j �s�d}n|r�|jtd�S|j�}|s�|
jdkr�t|dd�St |S|j�r�|
jdkr�t |St|dd�S|tk�
r�|
j ��
rZ|
jdk�
rd}n|
|jk�
r"|j}nt|
�
}|j|}|d|jk�
rxd|j}|jt�

n|jt�

|jt�

d|j}t|dd||�S|j�}|
j��
r�|
jdk|dkk�
r�t|dd�St |Sd
}d} |j�|
j�} |dk|
jdkk�r| tt|j�
�
k�rHt|d|jd�}n,|j�}| tt|�
�
k�rHt|d|d�}|d
k�r�|j|
|jd�}|d
k �r�|dk�r�td|j|j�}d } |d
k�r:|j}t|�
} | j| j}}t|
�
}|j|j}}|jdk�r�|}d }xJt||||||�\}}|ddtt|�
�
|d�rP|d 7}�q�Wt|t|�
|�}| �r2|
j ��r2t|j�
|jk
�r�|jdt|j�
}t|j|jd||j|�}|j �}|j!�
xt"D]}d|j#|<�q�W|j$|�
}|jt�

|j%t&�r�|jt'�

|j%t(�r|jt(d |j�
x:t't&ttt)fD]}|j%|�r|j|�

�qWn |j$|�
}|S)aHReturn self ** other [ % modulo]. With two arguments, compute self**other. With three arguments, compute (self**other) % modulo. For the three argument form, the following restrictions on the arguments hold: - all three arguments must be integral - other must be nonnegative - either self or other (or both) must be nonzero - modulo must be nonzero and must have at most p digits, where p is the context precision. If any of these restrictions is violated the InvalidOperation flag is raised. The result of pow(self, other, modulo) is identical to the result that would be obtained by computing (self**other) % modulo with unbounded precision, but is computed more efficiently. It is always exact. Nz0 ** 0r%r-z+x ** y with x negative and y not an integerrQr�FTr[ryr�z above Emax)*r

r�r�rr�rdr �_Oner7r�r�r�r6r<r�r@rUrOrrr��_log10_exp_boundrfr`rAr�r
r8rirVr=�_dpowerrHrI�_signals�trapsr��flagsr rrr)r.r�r�r/r;Zresult_signZ multiplierrVZself_adj�exactZboundr�r
r
r
r
r
r
r
�extrar�r�Z newcontextZ exceptionr'r'r)�__pow__ s�
















































"







 





 zDecimal.__pow__cCs"t|
�
}
|
t
kr|
S|
j||d
�S)z%Swaps self/other and returns __pow__.)
r/)r�r�r
)r.r�r/r'r'r)�__rpow__� s


zDecimal.__rpow__cCs�|
d
krt�}
|j
r(|j|
d�
}|r(|S|j|
�
}|j�r>|S|sPt|jdd�S|
j|
j�g|
j }t |j�
}|j}x.|j|ddkr�||kr�|d7}|d8}qvWt|j|jd
|�|�S)z?Normalize- strip trailing 0s, change anything equal to 0 to 0e0N)
r/rQr%r-) rrPr�r�r�r6r7rAr�r�rfr8rO)r.r/r;�dupr��endrVr'r'r)� normalize� s$













zDecimal.normalizecCs�
t|
d
d�}
|dkrt
�}|dkr(|j}|js4|
jr||j|
|�}|rH|S|
j�sX|j�r||
j�rp|j�rpt|�
S|jtd�S|j �|
j k
o�|jk
n
s�|jtd�S|s�t|j d|
j �}|j|�
S|j�}||jkr�|jtd�S||
j d|jk�
r|jtd �S|j|
j |�}|j�|jk�
r0|jtd�St|j�
|jk�
rN|jtd �S|�
rn|j�|jk�
rn|jt�

|j |j k�
r�||k�
r�|jt�

|jt�

|j|�
}|S) z�Quantize self so its exponent is the same as that of exp. Similar to self._rescale(exp._exp) but with error checking. T)
r�Nzquantize with one INFz)target exponent out of bounds in quantizerQz9exponent of quantize result too large for current contextr-z7quantize result has too many digits for current context)r�rr?rPr�r�r
rdr r�rOrAr6r7r�r�r@r�rfr8�Eminr rr)r.rVr?r/r;r�r'r'r)r� sT































zDecimal.quantizecCsDt|
d
d�}
|j
s|
j
r8|j�r(|
j�p6|j�o6|
j�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. T)
r�)r�rPr��is_infiniterO)r.r�r/r'r'r)�same_quantumJ 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 rQr%r�r-N) rPr
r6r7rOr8rfr�r`rU)r.rVr?rxZ this_functionr�r�r'r'r)r�Y s"


 









zDecimal._rescalecCsh|
d
k
rtd�
�
|j
s|r$t|�
S|j|j�d|
|�}|j�|j�krd|j|j�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-)rlrPr
r�r�)r.�placesr?r;r'r'r)�_round{ s 





zDecimal._roundcCs�|jr"|j
|d
�
}|r|St|�
S|jdkr4t|�
S|sFt|jdd�S|dkrTt�}|
dkrb|j}
|jd|
�}||kr�|j t �

|j 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. )
r/r%rQN)rPr�r
rOr6r7rr?r�rdrr)r.r?r/r;r'r'r)�to_integral_exact� s$ 
















zDecimal.to_integral_exactcCs`|d
krt�}|
d
kr|j
}
|jr>|j|d�
}|r6|St|�
S|jdkrPt|�
S|jd|
�Sd
S)z@Rounds to the nearest integer, without raising inexact, rounded.N)
r/r%)rr?rPr�r
rOr�)r.r?r/r;r'r'r)r�� s









zDecimal.to_integral_valuecCs�
|
d
krt�}
|j
rB|j|
d�
}|r(|S|j�rB|jdkrBt|�
S|sdt|jd|jd�}|j|
�
S|jdkrz|
j 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|}x(||}||k
�
r:Pn||d?}�
q$W| �
o\|||k} | �
r�|dk�
r||d|}n|d|9}||7}n|ddk�
r�|d7}tdt|�
|�}|
j�}
|
jt�
} |j|
�
}| |
_|S)zReturn the square root of self.N)
r/r%rQr+r-zsqrt(-x), x > 0r�r
Try)rrPr�r�r7r
r6rOr�rdr r@rirVrUrfr8r�r`� _shallow_copy� _set_roundingrr?)r.r/r;r@�opr��
c�
lr�r
r�r5r�r?r'r'r)�sqrt� s`






 














 




zDecimal.sqrtcCs�t|
d
d�}
|dkrt
�}|js&|
jr~|j�}|
j�}|s>|r~|dkrX|dkrX|j|�
S|dkrr|dkrr|
j|�
S|j|
|�S|j|
�
}|dkr�|j|
�
}|dkr�|
}n|}|j|�
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. T)
r�Nr-r%r�)r�rrPr�r�r�r�� compare_total)r.r�r/�sn�onr+
r;r'r'r)r�%s&








 
zDecimal.maxcCs�t|
d
d�}
|dkrt
�}|js&|
jr~|j�}|
j�}|s>|r~|dkrX|dkrX|j|�
S|dkrr|dkrr|
j|�
S|j|
|�S|j|
�
}|dkr�|j|
�
}|dkr�|}n|
}|j|�
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. T)
r�Nr-r%r�)r�rrPr�r�r�r�r.
)r.r�r/r/
r0
r+
r;r'r'r)r�Os&










zDecimal.minc
Cs8|jr d
S|j
dkrdS|j|j
d�}
|
dt|
�
kS)z"Returns whether self is an integerFr%TNrQ)rPrOr8rf)r.�restr'r'r)r�qs




zDecimal._isintegerc

Cs(|s|jd
krdS|j
d|jdkS)z:Returns True if self is even. Assumes self is an integer.r%Tr-r�r�)rOr8)
r.r'r'r)r�zs

zDecimal._isevenc

Cs.y|jt
|j�
d
Stk r(


dSXdS)z$Return the adjusted exponent of selfr-r%N)rOrfr8rr)
r.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)� canonical�szDecimal.canonicalcCs.t|
d
d�}
|j
|
|�}|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. T)
r�)
r/)r�r�r�)r.r�r/r;r'r'r)�compare_signal�s 



zDecimal.compare_signalcCsf
t|
d
d�}
|j
r|
j
rtS|j
r0|
j
r0tS|j
}|j�}|
j�}|sP|�
r||kr�t|j�
|jf}t|
j�
|
jf}||kr�|r�tStS||kr�|r�tStStS|r�|dkr�tS|dkr�tS|dkr�tS|dkr�tSn4|dkr�tS|dkr�tS|dk�
rtS|dk�
rtS||
k�
rtS||
k�
r*tS|j|
jk�
rF|�
rBtStS|j|
jk�
rb|�
r^tStStS)z�Compares self to other using the abstract representations. This is not like the standard compare, which use their numerical value. Note that a total ordering is defined for all possible abstract representations. T)
r�r-r+) r�r7�_NegativeOner
r�rfr8�_ZerorO)r.r�r/r=Zself_nanZ other_nanZself_keyZ other_keyr'r'r)r.
�sf






































zDecimal.compare_totalcCs&t|
d
d�}
|j
�}|
j
�}|j|�
S)z�Compares self to other using abstract repr., ignoring sign. Like compare_total, but with operand's sign ignored and assumed to be 0. T)
r�)r�r�r.
)r.r�r/r��
or'r'r)�compare_total_mag�s

zDecimal.compare_total_magc

Cstd
|j
|j|j�S)z'Returns a copy with the sign set to 0. r%)r6r8rOrP)
r.r'r'r)r��szDecimal.copy_absc

Cs2|jrt
d
|j|j|j�St
d|j|j|j�SdS)z&Returns a copy with the sign inverted.r%r-N)r7r6r8rOrP)
r.r'r'r)r��s
zDecimal.copy_negatecCs"t|
d
d�}
t
|
j|j|j|j�S)z$Returns self with the sign of other.T)
r�)r�r6r7r8rOrP)r.r�r/r'r'r)� copy_sign�s

zDecimal.copy_signcCs�
|
d
krt�}
|j
|
d�
}|r"|S|j�dkr2tS|s:tS|j�dkrNt|�
S|
j}|j�}|jdkr�|t t |
jdd�
�
kr�tdd|
jd�}�
n0|jdkr�|t t |
j �dd�
�
kr�tdd|
j �d�}n�|jdko�||k�
r tddd|dd|�}n�|jdk�
rB||dk�
rBtdd|d|d�}n�t|�
}|j|j}}|jdk�
rj|}d}xFt||||�\} } | d d t t | �
�
|d�
r�P|d7}�
qpWtdt | �
| �}|
j�}
|
jt�
}|j|
�
}||
_|S)zReturns e ** self.N)
r/r-r%r[r�rQr>ryr�r�)rr�r�r5
r
r
r@r�r7rfr`rAr6r�rirUrVr=�_dexpr(
r)
rr�r?)r.r/r;r
�adjr*
r+
r�r
r�rVr?r'r'r)rV
sJ






$
(







"




zDecimal.expc


Csd
S)z�Return True if self is canonical; otherwise return False. Currently, the encoding of a Decimal instance is always canonical, so this method returns True for any Decimal. Tr')
r.r'r'r)�is_canonicalLszDecimal.is_canonicalc


Cs|jS)
z�Return True if self is finite; otherwise return False. A Decimal instance is considered finite if it is neither infinite nor a NaN. )
rP)
r.r'r'r)� is_finiteTszDecimal.is_finitec

Cs |jd
kS)z8Return True if self is infinite; otherwise return False.rZ)
rO)
r.r'r'r)r#
\szDecimal.is_infinitec

Cs |jdkS)z>Return True if self is a qNaN or sNaN; otherwise return False.r5rY)r5rY)
rO)
r.r'r'r)r�`szDecimal.is_nancCs,|js|rd
S|
dkrt
�}
|
j|j�k
S)z?Return True if self is a normal number; otherwise return False.FN)rPrr"
r�)r.r/r'r'r)� is_normalds 



zDecimal.is_normalc

Cs |jd
kS)z;Return True if self is a quiet NaN; otherwise return False.r5)
rO)
r.r'r'r)r�lszDecimal.is_qnanc

Cs |jd
kS)z8Return True if self is negative; otherwise return False.r-)
r7)
r.r'r'r)� is_signedpszDecimal.is_signedc

Cs |jd
kS)z?Return True if self is a signaling NaN; otherwise return False.rY)
rO)
r.r'r'r)r�tszDecimal.is_snancCs,|js|rd
S|
dkrt
�}
|j�|
jkS)z9Return True if self is subnormal; otherwise return False.FN)rPrr�r"
)r.r/r'r'r)�is_subnormalxs 



zDecimal.is_subnormalc

Cs|jo|j
d
kS)z6Return True if self is a zero; otherwise return False.rQ)rPr8)
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�r�)rOrfr8r`rirUrV)r.r:
r*
r+
r��num�denr'r'r)� _ln_exp_bound�s






zDecimal._ln_exp_boundc Cs
|
d
krt�}
|j
|
d�
}|r"|S|s*tS|j�dkr:tS|tkrFtS|jdkr\|
jt d�St |�
}|j|j}}|
j }||j�d}x>t|||�}|ddttt|�
�
�
|dr�P|d7}q�Wtt|d k�
tt|�
�
|�}|
j�}
|
jt�
} |j|
�
}| |
_|S) z/Returns the natural (base e) logarithm of self.N)
r/r-zln of a negative valuer+ryr�r[r%)rr��_NegativeInfinityr�� _Infinityr
r5
r7rdr rirUrVr@rD
�_dlogrfr`rhr6r(
r)
rr�r?) r.r/r;r*
r+
r�r
r%
r�r?r'r'r)�ln�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���Z231r�r�)rOrfr8r`rirUrV)r.r:
r*
r+
r�rB
rC
r'r'r)r
�s







zDecimal._log10_exp_boundc CsH
|
d
krt�}
|j
|
d�
}|r"|S|s*tS|j�dkr:tS|jdkrP|
jtd�S|jddkr�|jdd
�dt |j�
dkr�t |jt |j�
d�
}n�t|�
}|j |j}}|
j}||j�d}x>t|||�}|d d t tt|�
�
�
|dr�P|d7}q�Wtt |dk�
tt|�
�
|�}|
j�}
|
jt�
} |j|
�
}| |
_|S)z&Returns the base 10 logarithm of self.N)
r/r-zlog10 of a negative valuer%r�rQr+ryr�r[)rr�rE
r�rF
r7rdr r8rfr
rOrirUrVr@r
�_dlog10r`rhr6r(
r)
rr�r?) r.r/r;r*
r+
r�r
r%
r�r?r'r'r)�log10�s:






.



$






z Decimal.log10cCsV|j|
d
�
}|r|S|
dkr"t
�}
|j�r.tS|s@|
jtdd�St|j��
}|j|
�
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). )
r/Nzlogb(0)r-) r�rr�rF
rdr r
r�r�)r.r/r;r'r'r)�logb s 





zDecimal.logbc
Cs8|jd
ks|j
d
krdSx|jD]}
|
dkr dSq WdS)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)r7rOr8)r.�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%rQ)r@rf)r.r/�opa�opbZdifr'r'r)� _fill_logicalL s










zDecimal._fill_logicalcCs~|d
krt�}t
|
dd�}
|j�s.|
j�r8|jt�
S|j||j|
j�\}}djdd�t||�D�
�
}t d|j d�
pxdd�S) z;Applies an 'and' operation between self and other's digits.NT)
r�rSc
Ss$g|]\}
}tt
|
�
t
|�
@�
�qSr')r`rU)�.0r
�
br'r'r)� g sz'Decimal.logical_and..r%rQ)rr�rN
rdr rQ
r8rn�zipr6rg)r.r�r/rO
rP
r�r'r'r)�logical_andY s


zDecimal.logical_andcCs(|
d
krt�}
|j
tdd|
jd�|
�S)zInvert all its digits.Nr%r�)r�logical_xorr6r@)r.r/r'r'r)�logical_invertj s


zDecimal.logical_invertcCs~|d
krt�}t
|
dd�}
|j�s.|
j�r8|jt�
S|j||j|
j�\}}djdd�t||�D�
�
}t d|j d�
pxdd�S) z:Applies an 'or' operation between self and other's digits.NT)
r�rSc
Ss$g|]\}
}tt
|
�
t
|�
B�
�qSr')r`rU)rR
r
rS
r'r'r)rT
 sz&Decimal.logical_or..r%rQ)rr�rN
rdr rQ
r8rnrU
r6rg)r.r�r/rO
rP
r�r'r'r)� logical_orq s


zDecimal.logical_orcCs~|d
krt�}t
|
dd�}
|j�s.|
j�r8|jt�
S|j||j|
j�\}}djdd�t||�D�
�
}t d|j d�
pxdd�S) z;Applies an 'xor' operation between self and other's digits.NT)
r�rSc
Ss$g|]\}
}tt
|
�
t
|�
A�
�qSr')r`rU)rR
r
rS
r'r'r)rT
� sz'Decimal.logical_xor..r%rQ)rr�rN
rdr rQ
r8rnrU
r6rg)r.r�r/rO
rP
r�r'r'r)rW
� s


zDecimal.logical_xorcCs�t|
d
d�}
|dkrt
�}|js&|
jr~|j�}|
j�}|s>|r~|dkrX|dkrX|j|�
S|dkrr|dkrr|
j|�
S|j|
|�S|j�j|
j��
}|dkr�|j|
�
}|dkr�|
}n|}|j|�
S)z8Compares the values numerically with their sign ignored.T)
r�Nr-r%r�) r�rrPr�r�r�r�r�r.
)r.r�r/r/
r0
r+
r;r'r'r)�max_mag� s&










zDecimal.max_magcCs�t|
d
d�}
|dkrt
�}|js&|
jr~|j�}|
j�}|s>|r~|dkrX|dkrX|j|�
S|dkrr|dkrr|
j|�
S|j|
|�S|j�j|
j��
}|dkr�|j|
�
}|dkr�|}n|
}|j|�
S)z8Compares the values numerically with their sign ignored.T)
r�Nr-r%r�) r�rrPr�r�r�r�r�r.
)r.r�r/r/
r0
r+
r;r'r'r)�min_mag� s&










zDecimal.min_magcCs�|
d
krt�}
|j
|
d�
}|r"|S|j�dkr2tS|j�dkrTtdd|
j|
j��S|
j�}
|
jt �

|
j �
|j|
�
}||kr�|S|jtdd|
j �d�|
�S)z=Returns the largest representable number smaller than itself.N)
r/r-r%r>r�r�)rr�r�rE
r6r@r�rHr)
r�_ignore_all_flagsr�r�r�)r.r/r;�new_selfr'r'r)� next_minus� s"












zDecimal.next_minuscCs�|
d
krt�}
|j
|
d�
}|r"|S|j�dkr2tS|j�dkrTtdd|
j|
j��S|
j�}
|
jt �

|
j �
|j|
�
}||kr�|S|jtdd|
j �d�|
�S)z=Returns the smallest representable number larger than itself.N)
r/r-r>r%r�r�)rr�r�rF
r6r@r�rHr)
rr\
r�r�r�)r.r/r;r]
r'r'r)� next_plus� s"












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

|jt�

nD|j �|jkr�|jt�

|jt�

|jt�

|jt�

|s�|jt�

|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. T)
r�Nr%r-z Infinite result from next_towardr�)r�rr�r�r8
r_
r^
r�rdrr7rrr�r"
rr r)r.r�r/r;Z comparisonr'r'r)�next_toward� s4 





 










zDecimal.next_towardcCs�|j�rd
S|j
�rdS|j�}|dkr,dS|dkr8dS|j�rN|jrJdSdS|
dkr\t�}
|j|
d �
rv|jrrd SdS|jr�dSd SdS)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 +Infinityz -Infinityz-Zeroz+ZeroN)
r/z -Subnormalz +Subnormalz-Normalz+Normalr�)r�r�r�r@
r7rr?
)r.r/�infr'r'r)�number_class+s,
















zDecimal.number_classc

Cstd
�
S)z'Just returns 10, as this is Decimal, :)r�)
r
)
r.r'r'r)�radixUsz Decimal.radixcCs�|d
krt�}t
|
dd�}
|j|
|�}|r.|S|
jdkrB|jt�
S|jt|
�
k
o^|jk
n
sn|jt�
S|j�r~t |�
St|
�
}|j }|jt|�
}|dkr�d||}n|dkr�||d
�}||d
�|d
|�}t|j |jd�
p�d|j�S)z5Returns a rotated copy of self, value-of-other times.NT)
r�r%rQ)rr�r�rOrdr r@rUr�r
r8rfr6r7rg)r.r�r/r;�torot�rotdig�topadZrotatedr'r'r)�rotateYs,




"









zDecimal.rotatecCs�|d
krt�}t
|
dd�}
|j|
|�}|r.|S|
jdkrB|jt�
Sd|j|j}d|j|j}|t|
�
k
ox|k
n
s�|jt�
S|j �r�t |�
St|j|j |jt|
�
�}|j|�
}|S)z>Returns self operand after adding the second value to its exp.NT)
r�r%r+r�)rr�r�rOrdr rAr@rUr�r
r6r7r8r�)r.r�r/r;ZliminfZlimsuprr'r'r)�scalebzs"










zDecimal.scalebcCs
|d
krt�}t
|
dd�}
|j|
|�}|r.|S|
jdkrB|jt�
S|jt|
�
k
o^|jk
n
sn|jt�
S|j�r~t |�
St|
�
}|j }|jt|�
}|dkr�d||}n|dkr�||d
�}|dkr�|d
|�}n|d|}||jd
�}t|j |jd�
�
pd|j�S)z5Returns a shifted copy of self, value-of-other times.NT)
r�r%rQ)rr�r�rOrdr r@rUr�r
r8rfr6r7rg)r.r�r/r;rd
re
rf
Zshiftedr'r'r)r��s2




"










z Decimal.shiftc

Cs|jt
|�
f
fS)
N)� __class__r`)
r.r'r'r)� __reduce__�s
zDecimal.__reduce__c

Cst|�
t
kr|S|jt|�
�
S)
N)�typer
ri
r`)
r.r'r'r)�__copy__�s


zDecimal.__copy__cCst|�
t
kr|S|jt|�
�
S)
N)rk
r
ri
r`)r.�memor'r'r)�__deepcopy__�s


zDecimal.__deepcopy__cCsN|d
krt�}t
|
|d�}|jrXt|j|�}t|j��
}|ddkrL|d7}t|||�S|dd
krvddg|j|d<|ddkr�t |j|j |jd�}|j}|d}|d
k �
r|dd kr�|j |d |�}nF|ddkr�|j||�}n*|ddk�
rt|j �
|k�
r|j ||�}|�
rB|jd k�
rB|ddk�
rB|jd |�}|jt|j �
} |dd k�
r�|�
r||d
k �
r|d |} nd } nB|ddk�
r�| } n.|ddk�
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)
�_localeconvrk
�
%�
g�
Gr+� precision�eEr-zfF%ZgGr%r�rQrSi����)r�_parse_format_specifierrP�_format_signr7r`r�� _format_alignr�r6r8rOr?r&
r�rf�_format_number)r.Z specifierr/ro
�specr=�bodyr?rs
r�r�rvrwrVr'r'r)� __format__�sZ















"















zDecimal.__format__)rOr8r7rP)rQN)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)�r1r2r3r4� __slots__r^�classmethodrqr�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__r��propertyr�r�r�r9r�r�r�r�r�r�r�r�r��dictr�r�r�r�r�r

r
r
r
r!
r�r$
r�r&
r'
r��to_integralr-
r�r�r�r�r�r2
r3
r.
r7
r�r�r8
rVr;
r<
r#
r�r=
r�r>
r�r?
r@
rD
rH
r
rK
rL
rN
rQ
rV
rX
rY
rW
rZ
r[
r^
r_
r`
rb
rc
rg
rh
r�rj
rl
rn
r{
r'r'r'r)r
+s

 ( !@  2 4 V7;!$K  f 







>,UnY="c*" IK23 .*!'FcCs&tj
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*. )r]r^r
r7r8rOrP)r=Zcoefficientr�Zspecialr.r'r'r)r6s



r6c@s(eZ
dZd
Zdd�Zdd�Zdd�ZdS) rNz�Context manager class to support localcontext(). Sets a copy of the supplied context in __enter__() and restores the previous decimal context in __exit__() cCs|
j�|_
dS)
N)rH�new_context)r.r�
r'r'r)�__init__9s
z_ContextManager.__init__c

Cst�|_
t|j�

|jS)
N)r� saved_contextrr�
)
r.r'r'r)� __enter__;s


z_ContextManager.__enter__cCst|j
�

dS)
N)rr�
)r.�
t�
v�tbr'r'r)�__exit__?s
z_ContextManager.__exit__N)r1r2r3r4r�
r�
r�
r'r'r'r)rN3s
rNc @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>
yt} Wnt
k r


YnX|
dk r*|
n| j|_|dk r>|n| j|_|dk rR|n| j|_|dk rf|n| j|_|dk rz|n| j|_|dk r�|n| j|_| dkr�g|_n| |_�
dkr�| j j �|_ n.t�
t�s�t�
f
d
d�t �
D�
�
|_ n�
|_ �dk�
r tjt d�|_n0t�t��
s4t�f
dd�t �D�
�
|_n�|_dS)Nc
3s|]}
|
t|
�k�
fV
qdS)
N)
rU)rR
r�)
r
r'r)� nsz#Context.__init__..r%c
3s|]}
|
t|
�k�
fV
qdS)
N)
rU)rR
r�)
r
r'r)r�
us)r� NameErrorr@r?r"
rAr�r��_ignored_flagsr
rHr_r�
r
�fromkeysr
)r.r@r?r"
rAr�r�r
r
r�
Zdcr')r
r
r)r�
Us.














zContext.__init__cCs�t|t
�std
|
�
�
|dkr<||kr�td|
|||f�
�
nJ|dkrb||kr�td|
|||f�
�
n$||ksr||kr�td|
|||f�
�
tj||
|�S)Nz%s must be an integerz-infz%s must be in [%s, %d]. got: %sra
z%s must be in [%d, %s]. got: %sz%s must be in [%d, %d]. got %s)r_rUrrrlr]�__setattr__)r.�namertZvminZvmaxr'r'r)�_set_integer_checkys









zContext._set_integer_checkcCsht|t
�std
|�
�
x |D]}|tkrtd|�
�
qWx tD]}||kr>td|�
�
q>Wtj||
|�S)Nz%s must be a signal dictz%s is not a valid signal dict)r_r�
rrr
�KeyErrorr]r�
)r.r�
r�keyr'r'r)�_set_signal_dict�s








zContext._set_signal_dictcCs�|
d
kr|j|
|dd�S|
dkr0|j|
|dd�S|
dkrH|j|
|dd�S|
dkr`|j|
|dd�S|
d krx|j|
|dd�S|
d kr�|t
kr�td|�
�
tj||
|�S|
dks�|
d kr�|j|
|�S|
dkr�tj||
|�Std|
�
�
dS)Nr@r-ra
r"
z-infr%rAr�r�r?z%s: invalid rounding moder
r
r�
z.'decimal.Context' object has no attribute '%s')r�
�_rounding_modesrrr]r�
r�
rL)r.r�
rtr'r'r)r�
�s(

















zContext.__setattr__cCstd
|
�
�
dS)Nz%s cannot be deleted)
rL)r.r�
r'r'r)�__delattr__�s
zContext.__delattr__c
 CsNd
d�|jj
�D�
}
dd�|jj
�D�
}|j|j|j|j|j|j|j |
|ffS)Nc
Ssg|]\}
}|r|
�qSr'r')rR
�sigr�
r'r'r)rT
�sz&Context.__reduce__..c
Ssg|]\}
}|r|
�qSr'r')rR
r�
r�
r'r'r)rT
�s) r
�itemsr
ri
r@r?r"
rAr�r�)r.r
r
r'r'r)rj
�s




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

dd�|jj�D�
}|
jddj|�
d�

dd�|jj�D�
}|
jddj|�
d�

dj|
�
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')
r1)rR
r~r�
r'r'r)rT
�sz$Context.__repr__..zflags=[z, �
]c
Ssg|]\}
}|r|
j�qSr')
r1)rR
r�
r�
r'r'r)rT
�sztraps=[�
))rm�varsr
r�
rnr
)r.r��namesr'r'r)r��s





zContext.__repr__c
Csx|jD]}
d
|j|
<qWdS)zReset all flags to zeror%N)
r
)r.�flagr'r'r)rI�s
zContext.clear_flagsc
Csx|jD]}
d
|j|
<qWdS)zReset all traps to zeror%N)
r
)r.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.) rr@r?r"
rAr�r�r
r
r�
)r.�ncr'r'r)r(
�s


zContext._shallow_copyc
 Cs6t|j
|j|j|j|j|j|jj�|j j�|j � }
|
S)
zReturns a deep copy from self.)rr@r?r"
rAr�r�r
rHr
r�
)r.r�
r'r'r)rH�s 



zContext.copycGsZtj
|
|
�}||jkr(|�j|f
|��Sd
|j|<|j|sN|
�j|f
|��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_map�getr�
r0r
r
)r.Z conditionZexplanationr(�errorr'r'r)rd�s

zContext._raise_errorc

Cs |jt
�S)
z$Ignore all flags, if they are raised)� _ignore_flagsr
)
r.r'r'r)r\
�szContext._ignore_all_flagsc
Gs|jt
|
�
|_t
|
�
S)
z$Ignore the flags, if they are raised)r�
rj)r.r
r'r'r)r�
�s
zContext._ignore_flagsc
Gs<|
rt|
d
t
tf�r|
d
}
x|
D]}|jj|�

q$WdS)z+Stop ignoring the flags, if they are raisedr%N)r_rkrjr�
�remove)r.r
r�
r'r'r)� _regard_flags�s


zContext._regard_flagsc

Cst|j
|jd
�
S)z!Returns Etiny (= Emin - prec + 1)r-)rUr"
r@)
r.r'r'r)r�sz Context.Etinyc

Cst|j
|jd
�
S)z,Returns maximum exponent (= Emax - prec + 1)r-)rUrAr@)
r.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. )
r?)r.rk
r?r'r'r)r)
s

zContext._set_roundingrQcCsjt|
t
�r*|
|
j�ksd
|
kr*|jtd�St|
|d�}|j�r`t|j�
|j |j kr`|jtd�S|j|�
S)z�Creates a new Decimal instance but using self as context. This method implements the to-number operation of the IBM Decimal specification.rRzAtrailing or leading whitespace and underscores are not permitted.)
r/zdiagnostic info too long in NaN)r_r`rbrdrr
r�rfr8r@r�r�)r.rB
rr'r'r)�create_decimal#s





zContext.create_decimalcCstj
|
�
}|j|�
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
rqr�)r.r~rr'r'r)�create_decimal_from_float4s
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') T)
r�)
r/)r�r�)r.r
r'r'r)rhFs
zContext.abscCs8t|
d
d�}
|
j
||d�}|tkr0td|�
�
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') T)
r�)
r/zUnable to convert %s to DecimalN)r�r�r�rr)r.r
rS
r�r'r'r)�add[s 


zContext.addcCst|
j
|�
�
S)
N)r`r�)r.r
r'r'r)�_applyps
zContext._applycCst|
t
�std
�
�
|
j�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.)r_r
rrr2
)r.r
r'r'r)r2
ss

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') T)
r�)
r/)r�r�)r.r
rS
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') T)
r�)
r/)r�r3
)r.r
rS
r'r'r)r3
�s 
zContext.compare_signalcCst|
d
d�}
|
j
|�
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') T)
r�)r�r.
)r.r
rS
r'r'r)r.
�s
zContext.compare_totalcCst|
d
d�}
|
j
|�
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. T)
r�)r�r7
)r.r
rS
r'r'r)r7
�s
zContext.compare_total_magcCst|
d
d�}
|
j
�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') T)
r�)r�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') T)
r�)r�r
)r.r
r'r'r)�copy_decimal�s 
zContext.copy_decimalcCst|
d
d�}
|
j
�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') T)
r�)r�r�)r.r
r'r'r)r�s 
zContext.copy_negatecCst|
d
d�}
|
j
|�
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') T)
r�)r�r8
)r.r
rS
r'r'r)r8
s
zContext.copy_signcCs8t|
d
d�}
|
j
||d�}|tkr0td|�
�
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') T)
r�)
r/zUnable to convert %s to DecimalN)r�r�r�rr)r.r
rS
r�r'r'r)�divide+s 


zContext.dividecCs8t|
d
d�}
|
j
||d�}|tkr0td|�
�
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') T)
r�)
r/zUnable to convert %s to DecimalN)r�r�r�rr)r.r
rS
r�r'r'r)� divide_intPs 


zContext.divide_intcCs8t|
d
d�}
|
j
||d�}|tkr0td|�
�
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')) T)
r�)
r/zUnable to convert %s to DecimalN)r�r�r�rr)r.r
rS
r�r'r'r)r�gs 


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') T)
r�)
r/)r�rV)r.r
r'r'r)rV|s
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') T)
r�)
r/)r�r�)r.r
rS
r+
r'r'r)r��s
zContext.fmacCst|
t
�std
�
�
|
j�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.)r_r
rrr;
)r.r
r'r'r)r;
�s

zContext.is_canonicalcCst|
d
d�}
|
j
�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 T)
r�)r�r<
)r.r
r'r'r)r<
�s
zContext.is_finitecCst|
d
d�}
|
j
�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 T)
r�)r�r#
)r.r
r'r'r)r#
�s
zContext.is_infinitecCst|
d
d�}
|
j
�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 T)
r�)r�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 T)
r�)
r/)r�r=
)r.r
r'r'r)r=
�s
zContext.is_normalcCst|
d
d�}
|
j
�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 T)
r�)r�r�)r.r
r'r'r)r�s
zContext.is_qnancCst|
d
d�}
|
j
�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 T)
r�)r�r>
)r.r
r'r'r)r>
s
zContext.is_signedcCst|
d
d�}
|
j
�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 T)
r�)r�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 T)
r�)
r/)r�r?
)r.r
r'r'r)r?
4s
zContext.is_subnormalcCst|
d
d�}
|
j
�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 T)
r�)r�r@
)r.r
r'r'r)r@
Js
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') T)
r�)
r/)r�rH
)r.r
r'r'r)rH
[s
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') T)
r�)
r/)r�rK
)r.r
r'r'r)rK
qs
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') T)
r�)
r/)r�rL
)r.r
r'r'r)rL
�s
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') T)
r�)
r/)r�rV
)r.r
rS
r'r'r)rV
�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') T)
r�)
r/)r�rX
)r.r
r'r'r)rX
�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') T)
r�)
r/)r�rY
)r.r
rS
r'r'r)rY
�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') T)
r�)
r/)r�rW
)r.r
rS
r'r'r)rW
�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') T)
r�)
r/)r�r�)r.r
rS
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') T)
r�)
r/)r�rZ
)r.r
rS
r'r'r)rZ
&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') T)
r�)
r/)r�r�)r.r
rS
r'r'r)r�7s
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') T)
r�)
r/)r�r[
)r.r
rS
r'r'r)r[
Rs
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') T)
r�)
r/)r�r�)r.r
r'r'r)�minuscs
z Context.minuscCs8t|
d
d�}
|
j
||d�}|tkr0td|�
�
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') T)
r�)
r/zUnable to convert %s to DecimalN)r�r�r�rr)r.r
rS
r�r'r'r)�multiplyts 


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') T)
r�)
r/)r�r^
)r.r
r'r'r)r^
�s
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') T)
r�)
r/)r�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') T)
r�)
r/)r�r`
)r.r
rS
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') T)
r�)
r/)r�r!
)r.r
r'r'r)r!
�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' T)
r�)
r/)r�rb
)r.r
r'r'r)rb
�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') T)
r�)
r/)r�r�)r.r
r'r'r)�plus)s
zContext.pluscCs:t|
d
d�}
|
j
|||d�}|tkr2td|�
�
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') T)
r�)
r/zUnable to convert %s to DecimalN)r�r
r�rr)r.r
rS
r�r�r'r'r)�power:s 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') T)
r�)
r/)r�r�)r.r
rS
r'r'r)r��s7
zContext.quantizec

Cstd
�
S)zkJust returns 10, as this is Decimal, :) >>> ExtendedContext.radix() Decimal('10') r�)
r
)
r.r'r'r)rc
�sz Context.radixcCs8t|
d
d�}
|
j
||d�}|tkr0td|�
�
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') T)
r�)
r/zUnable to convert %s to DecimalN)r�r�r�rr)r.r
rS
r�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') T)
r�)
r/)r�r�)r.r
rS
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') T)
r�)
r/)r�rg
)r.r
rS
r'r'r)rg
s
zContext.rotatecCst|
d
d�}
|
j
|�
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 T)
r�)r�r$
)r.r
rS
r'r'r)r$
1s
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') T)
r�)
r/)r�rh
)r.r
rS
r'r'r)rh
Is
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') T)
r�)
r/)r�r�)r.r
rS
r'r'r)r�\s
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 T)
r�)
r/)r�r-
)r.r
r'r'r)r-
zs
zContext.sqrtcCs8t|
d
d�}
|
j
||d�}|tkr0td|�
�
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') T)
r�)
r/zUnable to convert %s to DecimalN)r�r�r�rr)r.r
rS
r�r'r'r)�subtract�s 


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' T)
r�)
r/)r�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. T)
r�)
r/)r�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') T)
r�)
r/)r�r'
)r.r
r'r'r)r'
�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') T)
r�)
r/)r�r�)r.r
r'r'r)r��s
zContext.to_integral_value) NNNNNNNNN)
N)
rQ)
N)Xr1r2r3r4r�
r�
r�
r�
r�
rj
r�rIr�
r(
rHrl
rdr\
r�
r�
r�r�r�r)
r�
r�
rhr�
r�
r2
r�r3
r.
r7
r�r�
r�r8
r�
r�
r�rVr�r;
r<
r#
r�r=
r�r>
r�r?
r@
rH
rK
rL
rV
rX
rY
rW
r�rZ
r�r[
r�
r�
r^
r_
r`
r!
rb
r�
r�
r�rc
r�r�rg
r$
rh
r�r-
r�
r�r�
r'
r�r�
r'r'r'r)rBs�

"    $#   %  #2 P:&" c@s&eZ
dZd Zd dd�
Zdd�ZeZdS)rir=rUrVNcCsf|
dkrd|_d
|_
d|_nFt|
t�rD|
j|_t
|
j�
|_
|
j|_n|
d
|_|
d|_
|
d|_dS)Nr%r-r+)r=rUrVr_r
r7r8rO)r.rtr'r'r)r�
s









z_WorkRep.__init__c

Csd
|j|j
|jfS)Nz(%r, %r, %r))r=rUrV)
r.r'r'r)r�(s
z_WorkRep.__repr__)r=rUrV)
N)r1r2r3r|
r�
r�r�r'r'r'r)ris
 ricCs�|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�)rVrfr`rUr�)r�r�r@Ztmpr�Ztmp_lenZ other_lenrVr'r'r)r�/s









r�cCsb|d
krd
S|
d
kr |d|
Stt
|�
�
}t|�
t|jd�
�
}||
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�rQN)r`rhrf�rstrip)r5r�Zstr_nZval_nr'r'r)r
Os




r
cCsF|d
k
s|
d
k
rtd�
�
d
}x$|
|kr@|
|
||
d?}}
qW|
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-)
rl)r5r
rS
r'r'r)� _sqrt_nearestds



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�rS
r�r'r'r)�_rshift_nearestss
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�)r
rS
r�r�r'r'r)�_div_nearest{s
r�
r
c Cs�||
}d
}xn||k
r*t|�
||>|
ksF||krzt|�
||?|
krzt
|
|d>|
t|
|
t||�|
��}|d7}qWtdtt|
�
�
d|�
}t||�}t
|
|�}x0t|dd
d�D]}t
|
|�t
|||
�}q�Wt
|||
�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[i����r�)rhr�
r�
r�
rUrfr`r�) 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
)rfr`r�
r�
� _log10_digits) r+
r�r
r,
r~r�
r��log_dZlog_10Zlog_tenpowerr'r'r)rJ
�s 








rJ
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
)rfr`r�
r�
rhr�
) r+
r�r
r,
r~r�r�
r
Z f_log_tenr'r'r)rG
�s"





rG
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)
rx)
r.r'r'r)r�
s
z_Log10Memoize.__init__cCs�|
d
krtd�
�
|
t
|j�
kr�d}xLd|
|d}tttd||�d��
}||d�d|krdP|d7}q$W|jd�
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
NrQr-r�)rlrfrxr`r�
r�
r�
rU)r.r
r
r�
rxr'r'r)� getdigitss 






z_Log10Memoize.getdigitsN)r1r2r3r4r�
r�
r'r'r'r)r�

s
r�
c Cs�t||>|
�
}t
dtt|
�
�
d|�
}t||�}|
|>}x.t|ddd�D]}t|||||�}qRWx6t|ddd �D]"}|
|d>}t||||�}q�W|
|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+i����r�r�r�)r
rUrfr`r�
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�rfr`r�r�
r�
r�
) r+
r�r
r
r�r�ZcshiftZquotr
r'r'r)r9
Ks



r9
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�)rfr`rhrG
r�
r9
)r
r
r
r
r
rS
Zlxcr�Zpcr�rVr'r'r)r
os




r
r
�F�5�(�rA
�r�ry) r��
2�
3�
4�
5�
6�
7�
8r>cCs0|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
)rlr`rf)r+
Z correctionZstr_cr'r'r)r
�s


r
cCsLt|t
�r|St|t�r t
|�
S|r8t|t�r8t
j|�
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). zUnable to convert %s to Decimal)r_r
rUrprqrrr�)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|jtd�
|t
j|
�
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-z;strict semantics for mixing floats and Decimals are enabled)r_r
�_numbersZRationalrPr6r7r`rUr8�denominatorrO� numeratorZComplexr�r�rprr
rrdrqr�)r.r�r�r/r'r'r)r��s$













r�r
i?B)r@r?r
r
rAr"
r�r�r\)r@r?r
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�
tj
|�
}|d
krtd|�
�
|j�}|d}|d}|dd
k |d<|drv|d
k rbtd|�
�
|d
k rvtd|�
�
|p|d|d<|p�d |d<|d d
kr�d|d <t|dp�d �
|d<|dd
k r�t|d�
|d<|ddkr�|dd
ks�|ddkr�d|d<|ddk�
rfd|d<|
d
k�
r&tj�}
|dd
k �
r@td|�
�
|
d|d<|
d|d<|
d|d<n*|dd
k�
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: �
�
>r=rT�minimumwidthrQrs
r%rk
ZgGnr-r5rq
� thousands_sepzJExplicit thousands separator conflicts with 'n' type in format specifier: �grouping� decimal_pointrSr[r�)�_parse_format_specifier_regex�matchrl� groupdictrU�_locale� localeconv)�format_specro
ruZformat_dictr�
r�
r'r'r)ru
DsN



























ru
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). r�
r�
r�
�
qs�
























 &




 






 . ^  0",# %$+
  *














 


 P % )