ithon/test.py
2024-10-09 15:37:26 -04:00

233 lines
No EOL
7.9 KiB
Python

# ITHON START
import typing as _INTERNAL_typing
import types as _INTERNAL_types
import inspect as _INTERNAL_inspect
import sys as _INTERNAL_sys
class _INTERNAL_Token :
__slots__ =('action',)
def __init__ (self ,action ):
self .action =action
def __rrshift__ (self ,lhs ):
return _INTERNAL_Operation (self .action ,lhs )
class _INTERNAL_Operation :
__slots__ =('action','lhs')
def __init__ (self ,action ,lhs ):
self .action =action
self .lhs =lhs
def __lshift__ (self ,rhs ):
return self .action (self .lhs ,rhs )
class _INTERNAL_LazyIterable :
__slots__ =('x','y')
def __init__ (self ,x ,y )->None :
self .x =iter (x )
self .y =iter (y )
def __iter__ (self ):
yield from self .x
yield from self .y
def curry (f ):
def wrapper (*args ,**kwds )->_INTERNAL_typing .Any |_INTERNAL_typing .Callable :
signature =_INTERNAL_inspect .signature (f )
ba =signature .bind_partial (*args ,**kwds )
if len (ba .arguments )==len (signature .parameters ):
return f (*args ,**kwds )
else :
def _partial (*other_args ,**other_kwds ):
combined_args =args +other_args
combined_kwargs =dict (**kwds ,**other_kwds )
return curry (f )(*combined_args ,**combined_kwargs )
return _partial
return wrapper
def _INTERNAL_add_fakeimport (name :str ,code :str ):# TODO: make this use sys.meta_path
module =_INTERNAL_types .ModuleType (name )
parent ='.'.join (name .split ('.')[:-1 ])if '.'.join (name .split ('.')[:-1 ])else name
if not parent ==name and parent not in _INTERNAL_sys .modules :
_INTERNAL_sys .modules [parent ]=_INTERNAL_types .ModuleType (parent )
globals ={'__package__':parent }
module .__dict__ .update (globals )
exec (code ,module .__dict__ )
_INTERNAL_sys .modules [name ]=module
_INTERNAL_add_fakeimport ('sentinels','''import sys as _sys
from threading import Lock as _Lock
__all__ = ['Sentinel']
# Design and implementation decisions:
#
# The first implementations created a dedicated class for each instance.
# However, once it was decided to use Sentinel for type signatures, there
# was no longer a need for a dedicated class for each sentinel value on order
# to enable strict type signatures. Since class objects consume a relatively
# large amount of memory, the implementation was changed to avoid this.
#
# With this change, the mechanism used for unpickling/copying objects needed
# to be changed too, since we could no longer count on each dedicated class
# simply returning its singleton instance as before. __reduce__ can return
# a string, upon which an attribute with that name is looked up in the module
# and returned. However, that would have meant that pickling/copying support
# would depend on the "name" argument being exactly the name of the variable
# used in the module, and simply wouldn't work for sentinels created in
# functions/methods. Instead, a registry for sentinels was added, where all
# sentinel objects are stored keyed by their name + module name. This is used
# to look up existing sentinels both during normal object creation and during
# copying/unpickling.
class Sentinel:
"""Create a unique sentinel object.
*name* should be the fully-qualified name of the variable to which the
return value shall be assigned.
*repr*, if supplied, will be used for the repr of the sentinel object.
If not provided, "<name>" will be used (with any leading class names
removed).
*module_name*, if supplied, will be used instead of inspecting the call
stack to find the name of the module from which
"""
_name: str
_repr: str
_module_name: str
def __new__(
cls,
name: str,
repr: str | None = None,
module_name: str | None = None,
):
name = str(name)
repr = str(repr) if repr else f'<{name.split(".")[-1]}>'
if not module_name:
parent_frame = _get_parent_frame()
module_name = (
parent_frame.f_globals.get('__name__', '__main__')
if parent_frame is not None
else __name__
)
# Include the class's module and fully qualified name in the
# registry key to support sub-classing.
registry_key = _sys.intern(
f'{cls.__module__}-{cls.__qualname__}-{module_name}-{name}'
)
sentinel = _registry.get(registry_key, None)
if sentinel is not None:
return sentinel
sentinel = super().__new__(cls)
sentinel._name = name
sentinel._repr = repr
sentinel._module_name = module_name
with _lock:
return _registry.setdefault(registry_key, sentinel)
def __repr__(self):
return self._repr
def __reduce__(self):
return (
self.__class__,
(
self._name,
self._repr,
self._module_name,
),
)
_lock = _Lock()
_registry: dict[str, Sentinel] = {}
# The following implementation attempts to support Python
# implementations which don't support sys._getframe(2), such as
# Jython and IronPython.
#
# The version added to the stdlib may simply return sys._getframe(2),
# without the fallbacks.
#
# For reference, see the implementation of namedtuple:
# https://github.com/python/cpython/blob/67444902a0f10419a557d0a2d3b8675c31b075a9/Lib/collections/__init__.py#L503
def _get_parent_frame():
"""Return the frame object for the caller's parent stack frame."""
try:
# Two frames up = the parent of the function which called this.
return _sys._getframe(2)
except (AttributeError, ValueError):
global _get_parent_frame
def _get_parent_frame():
"""Return the frame object for the caller's parent stack frame."""
try:
raise Exception
except Exception:
try:
return _sys.exc_info()[2].tb_frame.f_back.f_back
except Exception:
global _get_parent_frame
def _get_parent_frame():
"""Return the frame object for the caller's parent stack frame."""
return None
return _get_parent_frame()
return _get_parent_frame()''')
_INTERNAL_lazymerge =_INTERNAL_Token (lambda lhs ,rhs :_INTERNAL_LazyIterable (lhs ,rhs ))
_INTERNAL_lpipe =_INTERNAL_Token (lambda lhs ,rhs :rhs (lhs ))
_INTERNAL_rpipe =_INTERNAL_Token (lambda lhs ,rhs :lhs (rhs ))
_INTERNAL_lspipe =_INTERNAL_Token (lambda lhs ,rhs :rhs (*lhs ))
_INTERNAL_rspipe =_INTERNAL_Token (lambda lhs ,rhs :lhs (*rhs ))
_INTERNAL_nonereplace =_INTERNAL_Token (lambda lhs ,rhs :lhs if lhs !=None else rhs )
_INTERNAL_lto =_INTERNAL_Token (lambda lhs ,rhs :lhs (*rhs ))
# If you write in other programming languages, this is very, very useful.
null =None
nil =None
void =None
# ITHON END
def fibonacci (x :int )->list [int ]:
start =[0 ,1 ]
for i in range (1 ,x ):
start .append >>_INTERNAL_rpipe <<start [i ]+start [i -1 ]
return start
a =12 >>_INTERNAL_lpipe <<fibonacci
b =a >>_INTERNAL_lazymerge <<a >>_INTERNAL_lazymerge <<a >>_INTERNAL_lazymerge <<a
c =b >>_INTERNAL_lazymerge <<b >>_INTERNAL_lazymerge <<b >>_INTERNAL_lazymerge <<b
print >>_INTERNAL_rpipe <<[i for i in c ]
print >>_INTERNAL_rspipe <<('a','b','c')
d =lambda x :x *2
#d2 = λ x: x * 2
d3d =curry >>_INTERNAL_rpipe <<(lambda x ,y :x **2 +y **2 )
print (d3d (2 ,4 ))
print (d3d (2 )(4 ))
print (d3d (x =2 )(y =4 ))
@curry
def d3d2 (x ,y ):return x **2 +y **2
print (d3d2 (2 ,4 ))
print (d3d2 (2 )(4 ))
print (d3d2 (x =2 )(y =4 ))
a =1
a +=1
a >>_INTERNAL_lpipe <<print >>_INTERNAL_nonereplace <<11 >>_INTERNAL_lpipe <<print
'''a'''
'''
very bad code that is
commented out for a very
good reason
'''
a +=1
'''something '''# something