builtins.py 3.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152
  1. import sys as _sys
  2. def print(*args, sep=' ', end='\n'):
  3. s = sep.join([str(i) for i in args])
  4. _sys.stdout.write(s + end)
  5. def round(x, ndigits=0):
  6. assert ndigits >= 0
  7. if ndigits == 0:
  8. return int(x + 0.5) if x >= 0 else int(x - 0.5)
  9. if x >= 0:
  10. return int(x * 10**ndigits + 0.5) / 10**ndigits
  11. else:
  12. return int(x * 10**ndigits - 0.5) / 10**ndigits
  13. def abs(x):
  14. return -x if x < 0 else x
  15. def max(a, b):
  16. return a if a > b else b
  17. def min(a, b):
  18. return a if a < b else b
  19. def all(iterable):
  20. for i in iterable:
  21. if not i:
  22. return False
  23. return True
  24. def any(iterable):
  25. for i in iterable:
  26. if i:
  27. return True
  28. return False
  29. def enumerate(iterable, start=0):
  30. n = start
  31. for elem in iterable:
  32. yield n, elem
  33. ++n
  34. def sum(iterable):
  35. res = 0
  36. for i in iterable:
  37. res += i
  38. return res
  39. def map(f, iterable):
  40. for i in iterable:
  41. yield f(i)
  42. def filter(f, iterable):
  43. for i in iterable:
  44. if f(i):
  45. yield i
  46. def zip(a, b):
  47. a = iter(a)
  48. b = iter(b)
  49. while True:
  50. ai = next(a)
  51. bi = next(b)
  52. if ai is StopIteration or bi is StopIteration:
  53. break
  54. yield ai, bi
  55. def reversed(iterable):
  56. a = list(iterable)
  57. a.reverse()
  58. return a
  59. def sorted(iterable, reverse=False, key=None):
  60. a = list(iterable)
  61. a.sort(reverse=reverse, key=key)
  62. return a
  63. ##### str #####
  64. def str@split(self, sep):
  65. if sep == "":
  66. return list(self)
  67. res = []
  68. i = 0
  69. while i < len(self):
  70. if self[i:i+len(sep)] == sep:
  71. res.append(self[:i])
  72. self = self[i+len(sep):]
  73. i = 0
  74. else:
  75. ++i
  76. res.append(self)
  77. return res
  78. def str@format(self, *args):
  79. if '{}' in self:
  80. for i in range(len(args)):
  81. self = self.replace('{}', str(args[i]), 1)
  82. else:
  83. for i in range(len(args)):
  84. self = self.replace('{'+str(i)+'}', str(args[i]))
  85. return self
  86. def str@strip(self, chars=None):
  87. chars = chars or ' \t\n\r'
  88. i = 0
  89. while i < len(self) and self[i] in chars:
  90. ++i
  91. j = len(self) - 1
  92. while j >= 0 and self[j] in chars:
  93. --j
  94. return self[i:j+1]
  95. ##### list #####
  96. list.__repr__ = lambda self: '[' + ', '.join([repr(i) for i in self]) + ']'
  97. tuple.__repr__ = lambda self: '(' + ', '.join([repr(i) for i in self]) + ')'
  98. list.__json__ = lambda self: '[' + ', '.join([i.__json__() for i in self]) + ']'
  99. tuple.__json__ = lambda self: '[' + ', '.join([i.__json__() for i in self]) + ']'
  100. def __qsort(a: list, L: int, R: int, key):
  101. if L >= R: return;
  102. mid = a[(R+L)//2];
  103. mid = key(mid)
  104. i, j = L, R
  105. while i<=j:
  106. while key(a[i])<mid: ++i;
  107. while key(a[j])>mid: --j;
  108. if i<=j:
  109. a[i], a[j] = a[j], a[i]
  110. ++i; --j;
  111. __qsort(a, L, j, key)
  112. __qsort(a, i, R, key)
  113. def list@sort(self, reverse=False, key=None):
  114. if key is None:
  115. key = lambda x:x
  116. __qsort(self, 0, len(self)-1, key)
  117. if reverse:
  118. self.reverse()
  119. def staticmethod(f):
  120. return f # no effect
  121. def type@__repr__(self):
  122. return "<class '" + self.__name__ + "'>"
  123. def help(obj):
  124. if hasattr(obj, '__func__'):
  125. obj = obj.__func__
  126. if hasattr(obj, '__doc__'):
  127. print(obj.__doc__)
  128. else:
  129. print("No docstring found")