mirror of
https://github.com/pocketpy/pocketpy
synced 2026-06-20 23:47:10 +08:00
Compare commits
4 Commits
b2961ae5df
...
230bee72c2
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
230bee72c2 | ||
|
|
894ace2963 | ||
|
|
338547dc8d | ||
|
|
c048ec9faf |
@ -11,5 +11,6 @@ extern const char kPythonLibs_dataclasses[];
|
||||
extern const char kPythonLibs_datetime[];
|
||||
extern const char kPythonLibs_functools[];
|
||||
extern const char kPythonLibs_heapq[];
|
||||
extern const char kPythonLibs_long_v1[];
|
||||
extern const char kPythonLibs_operator[];
|
||||
extern const char kPythonLibs_typing[];
|
||||
|
||||
354
python/long_v1.py
Normal file
354
python/long_v1.py
Normal file
@ -0,0 +1,354 @@
|
||||
# after v1.2.2, int is always 64-bit
|
||||
PyLong_SHIFT = 60//2 - 1
|
||||
|
||||
PyLong_BASE = 2 ** PyLong_SHIFT
|
||||
PyLong_MASK = PyLong_BASE - 1
|
||||
PyLong_DECIMAL_SHIFT = 4
|
||||
PyLong_DECIMAL_BASE = 10 ** PyLong_DECIMAL_SHIFT
|
||||
|
||||
##############################################################
|
||||
|
||||
def ulong_fromint(x: int):
|
||||
# return a list of digits and sign
|
||||
if x == 0: return [0], 1
|
||||
sign = 1 if x > 0 else -1
|
||||
if sign < 0: x = -x
|
||||
res = []
|
||||
while x:
|
||||
res.append(x & PyLong_MASK)
|
||||
x >>= PyLong_SHIFT
|
||||
return res, sign
|
||||
|
||||
def ulong_cmp(a: list, b: list) -> int:
|
||||
# return 1 if a>b, -1 if a<b, 0 if a==b
|
||||
if len(a) > len(b): return 1
|
||||
if len(a) < len(b): return -1
|
||||
for i in range(len(a)-1, -1, -1):
|
||||
if a[i] > b[i]: return 1
|
||||
if a[i] < b[i]: return -1
|
||||
return 0
|
||||
|
||||
def ulong_pad_(a: list, size: int):
|
||||
# pad leading zeros to have `size` digits
|
||||
delta = size - len(a)
|
||||
if delta > 0:
|
||||
a.extend([0] * delta)
|
||||
|
||||
def ulong_unpad_(a: list):
|
||||
# remove leading zeros
|
||||
while len(a)>1 and a[-1]==0:
|
||||
a.pop()
|
||||
|
||||
def ulong_add(a: list, b: list) -> list:
|
||||
res = [0] * max(len(a), len(b))
|
||||
ulong_pad_(a, len(res))
|
||||
ulong_pad_(b, len(res))
|
||||
carry = 0
|
||||
for i in range(len(res)):
|
||||
carry += a[i] + b[i]
|
||||
res[i] = carry & PyLong_MASK
|
||||
carry >>= PyLong_SHIFT
|
||||
if carry > 0:
|
||||
res.append(carry)
|
||||
return res
|
||||
|
||||
def ulong_inc_(a: list):
|
||||
a[0] += 1
|
||||
for i in range(len(a)):
|
||||
if a[i] < PyLong_BASE: break
|
||||
a[i] -= PyLong_BASE
|
||||
if i+1 == len(a):
|
||||
a.append(1)
|
||||
else:
|
||||
a[i+1] += 1
|
||||
|
||||
|
||||
def ulong_sub(a: list, b: list) -> list:
|
||||
# a >= b
|
||||
res = []
|
||||
borrow = 0
|
||||
for i in range(len(b)):
|
||||
tmp = a[i] - b[i] - borrow
|
||||
if tmp < 0:
|
||||
tmp += PyLong_BASE
|
||||
borrow = 1
|
||||
else:
|
||||
borrow = 0
|
||||
res.append(tmp)
|
||||
for i in range(len(b), len(a)):
|
||||
tmp = a[i] - borrow
|
||||
if tmp < 0:
|
||||
tmp += PyLong_BASE
|
||||
borrow = 1
|
||||
else:
|
||||
borrow = 0
|
||||
res.append(tmp)
|
||||
ulong_unpad_(res)
|
||||
return res
|
||||
|
||||
def ulong_divmodi(a: list, b: int):
|
||||
# b > 0
|
||||
res = []
|
||||
carry = 0
|
||||
for i in range(len(a)-1, -1, -1):
|
||||
carry <<= PyLong_SHIFT
|
||||
carry += a[i]
|
||||
res.append(carry // b)
|
||||
carry %= b
|
||||
res.reverse()
|
||||
ulong_unpad_(res)
|
||||
return res, carry
|
||||
|
||||
|
||||
def ulong_divmod(a: list, b: list):
|
||||
|
||||
if ulong_cmp(a, b) < 0:
|
||||
return [0], a
|
||||
|
||||
if len(b) == 1:
|
||||
q, r = ulong_divmodi(a, b[0])
|
||||
r, _ = ulong_fromint(r)
|
||||
return q, r
|
||||
|
||||
max = (len(a) - len(b)) * PyLong_SHIFT + \
|
||||
(a[-1].bit_length() - b[-1].bit_length())
|
||||
|
||||
low = [0]
|
||||
|
||||
high = (max // PyLong_SHIFT) * [0] + \
|
||||
[(2**(max % PyLong_SHIFT)) & PyLong_MASK]
|
||||
|
||||
while ulong_cmp(low, high) < 0:
|
||||
ulong_inc_(high)
|
||||
mid, r = ulong_divmodi(ulong_add(low, high), 2)
|
||||
if ulong_cmp(a, ulong_mul(b, mid)) >= 0:
|
||||
low = mid
|
||||
else:
|
||||
high = ulong_sub(mid, [1])
|
||||
|
||||
q = [0] * (len(a) - len(b) + 1)
|
||||
while ulong_cmp(a, ulong_mul(b, low)) >= 0:
|
||||
q = ulong_add(q, low)
|
||||
a = ulong_sub(a, ulong_mul(b, low))
|
||||
ulong_unpad_(q)
|
||||
return q, a
|
||||
|
||||
def ulong_floordivi(a: list, b: int):
|
||||
# b > 0
|
||||
return ulong_divmodi(a, b)[0]
|
||||
|
||||
def ulong_muli(a: list, b: int):
|
||||
# b >= 0
|
||||
res = [0] * len(a)
|
||||
carry = 0
|
||||
for i in range(len(a)):
|
||||
carry += a[i] * b
|
||||
res[i] = carry & PyLong_MASK
|
||||
carry >>= PyLong_SHIFT
|
||||
if carry > 0:
|
||||
res.append(carry)
|
||||
return res
|
||||
|
||||
def ulong_mul(a: list, b: list):
|
||||
N = len(a) + len(b)
|
||||
# use grade-school multiplication
|
||||
res = [0] * N
|
||||
for i in range(len(a)):
|
||||
carry = 0
|
||||
for j in range(len(b)):
|
||||
carry += res[i+j] + a[i] * b[j]
|
||||
res[i+j] = carry & PyLong_MASK
|
||||
carry >>= PyLong_SHIFT
|
||||
res[i+len(b)] = carry
|
||||
ulong_unpad_(res)
|
||||
return res
|
||||
|
||||
def ulong_powi(a: list, b: int):
|
||||
# b >= 0
|
||||
if b == 0: return [1]
|
||||
res = [1]
|
||||
while b:
|
||||
if b & 1:
|
||||
res = ulong_mul(res, a)
|
||||
a = ulong_mul(a, a)
|
||||
b >>= 1
|
||||
return res
|
||||
|
||||
def ulong_repr(x: list) -> str:
|
||||
res = []
|
||||
while len(x)>1 or x[0]>0: # non-zero
|
||||
x, r = ulong_divmodi(x, PyLong_DECIMAL_BASE)
|
||||
res.append(str(r).zfill(PyLong_DECIMAL_SHIFT))
|
||||
res.reverse()
|
||||
s = ''.join(res)
|
||||
if len(s) == 0: return '0'
|
||||
if len(s) > 1: s = s.lstrip('0')
|
||||
return s
|
||||
|
||||
def ulong_fromstr(s: str):
|
||||
if s[-1] == 'L':
|
||||
s = s[:-1]
|
||||
res, base = [0], [1]
|
||||
if s[0] == '-':
|
||||
sign = -1
|
||||
s = s[1:]
|
||||
else:
|
||||
sign = 1
|
||||
s = s[::-1]
|
||||
for c in s:
|
||||
c = ord(c) - 48
|
||||
assert 0 <= c <= 9
|
||||
res = ulong_add(res, ulong_muli(base, c))
|
||||
base = ulong_muli(base, 10)
|
||||
return res, sign
|
||||
|
||||
class long:
|
||||
def __init__(self, x):
|
||||
if type(x) is tuple:
|
||||
self.digits, self.sign = x
|
||||
elif type(x) is int:
|
||||
self.digits, self.sign = ulong_fromint(x)
|
||||
elif type(x) is float:
|
||||
self.digits, self.sign = ulong_fromint(int(x))
|
||||
elif type(x) is str:
|
||||
self.digits, self.sign = ulong_fromstr(x)
|
||||
elif type(x) is long:
|
||||
self.digits, self.sign = x.digits.copy(), x.sign
|
||||
else:
|
||||
raise TypeError('expected int or str')
|
||||
|
||||
def __len__(self):
|
||||
return len(self.digits)
|
||||
|
||||
def __add__(self, other):
|
||||
if type(other) is int:
|
||||
other = long(other)
|
||||
elif type(other) is not long:
|
||||
return NotImplemented
|
||||
if self.sign == other.sign:
|
||||
return long((ulong_add(self.digits, other.digits), self.sign))
|
||||
else:
|
||||
cmp = ulong_cmp(self.digits, other.digits)
|
||||
if cmp == 0:
|
||||
return long(0)
|
||||
if cmp > 0:
|
||||
return long((ulong_sub(self.digits, other.digits), self.sign))
|
||||
else:
|
||||
return long((ulong_sub(other.digits, self.digits), other.sign))
|
||||
|
||||
def __radd__(self, other):
|
||||
return self.__add__(other)
|
||||
|
||||
def __sub__(self, other):
|
||||
if type(other) is int:
|
||||
other = long(other)
|
||||
elif type(other) is not long:
|
||||
return NotImplemented
|
||||
if self.sign != other.sign:
|
||||
return long((ulong_add(self.digits, other.digits), self.sign))
|
||||
cmp = ulong_cmp(self.digits, other.digits)
|
||||
if cmp == 0:
|
||||
return long(0)
|
||||
if cmp > 0:
|
||||
return long((ulong_sub(self.digits, other.digits), self.sign))
|
||||
else:
|
||||
return long((ulong_sub(other.digits, self.digits), -other.sign))
|
||||
|
||||
def __rsub__(self, other):
|
||||
if type(other) is int:
|
||||
other = long(other)
|
||||
elif type(other) is not long:
|
||||
return NotImplemented
|
||||
return other.__sub__(self)
|
||||
|
||||
def __mul__(self, other):
|
||||
if type(other) is int:
|
||||
return long((
|
||||
ulong_muli(self.digits, abs(other)),
|
||||
self.sign * (1 if other >= 0 else -1)
|
||||
))
|
||||
elif type(other) is long:
|
||||
return long((
|
||||
ulong_mul(self.digits, other.digits),
|
||||
self.sign * other.sign
|
||||
))
|
||||
return NotImplemented
|
||||
|
||||
def __rmul__(self, other):
|
||||
return self.__mul__(other)
|
||||
|
||||
#######################################################
|
||||
def __divmod__(self, other):
|
||||
if type(other) is int:
|
||||
assert self.sign == 1 and other > 0
|
||||
q, r = ulong_divmodi(self.digits, other)
|
||||
return long((q, 1)), r
|
||||
if type(other) is long:
|
||||
assert self.sign == 1 and other.sign == 1
|
||||
q, r = ulong_divmod(self.digits, other.digits)
|
||||
assert len(other)>1 or other.digits[0]>0
|
||||
return long((q, 1)), long((r, 1))
|
||||
raise NotImplementedError
|
||||
|
||||
def __floordiv__(self, other):
|
||||
return self.__divmod__(other)[0]
|
||||
|
||||
def __mod__(self, other):
|
||||
return self.__divmod__(other)[1]
|
||||
|
||||
def __pow__(self, other: int):
|
||||
assert type(other) is int and other >= 0
|
||||
if self.sign == -1 and other & 1:
|
||||
sign = -1
|
||||
else:
|
||||
sign = 1
|
||||
return long((ulong_powi(self.digits, other), sign))
|
||||
|
||||
def __lshift__(self, other: int):
|
||||
assert type(other) is int and other >= 0
|
||||
x = self.digits.copy()
|
||||
q, r = divmod(other, PyLong_SHIFT)
|
||||
x = [0]*q + x
|
||||
for _ in range(r): x = ulong_muli(x, 2)
|
||||
return long((x, self.sign))
|
||||
|
||||
def __rshift__(self, other: int):
|
||||
assert type(other) is int and other >= 0
|
||||
x = self.digits.copy()
|
||||
q, r = divmod(other, PyLong_SHIFT)
|
||||
x = x[q:]
|
||||
if not x: return long(0)
|
||||
for _ in range(r): x = ulong_floordivi(x, 2)
|
||||
return long((x, self.sign))
|
||||
|
||||
def __neg__(self):
|
||||
return long((self.digits, -self.sign))
|
||||
|
||||
def __cmp__(self, other):
|
||||
if type(other) is int:
|
||||
other = long(other)
|
||||
elif type(other) is not long:
|
||||
return NotImplemented
|
||||
if self.sign > other.sign:
|
||||
return 1
|
||||
elif self.sign < other.sign:
|
||||
return -1
|
||||
else:
|
||||
return ulong_cmp(self.digits, other.digits)
|
||||
|
||||
def __eq__(self, other):
|
||||
return self.__cmp__(other) == 0
|
||||
def __ne__(self, other):
|
||||
return self.__cmp__(other) != 0
|
||||
def __lt__(self, other):
|
||||
return self.__cmp__(other) < 0
|
||||
def __le__(self, other):
|
||||
return self.__cmp__(other) <= 0
|
||||
def __gt__(self, other):
|
||||
return self.__cmp__(other) > 0
|
||||
def __ge__(self, other):
|
||||
return self.__cmp__(other) >= 0
|
||||
|
||||
def __repr__(self):
|
||||
prefix = '-' if self.sign < 0 else ''
|
||||
return prefix + ulong_repr(self.digits) + 'L'
|
||||
File diff suppressed because one or more lines are too long
@ -7,6 +7,7 @@
|
||||
#include <stdarg.h>
|
||||
#include <assert.h>
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <ctype.h>
|
||||
|
||||
void c11_sbuf__ctor(c11_sbuf* self) {
|
||||
@ -53,21 +54,23 @@ void c11_sbuf__write_f64(c11_sbuf* self, double val, int precision) {
|
||||
char b[32];
|
||||
int size;
|
||||
if(precision < 0) {
|
||||
int prec = 17 - 1; // std::numeric_limits<double>::max_digits10 == 17
|
||||
size = snprintf(b, sizeof(b), "%.*g", prec, val);
|
||||
} else {
|
||||
int prec = precision;
|
||||
size = snprintf(b, sizeof(b), "%.*f", prec, val);
|
||||
}
|
||||
c11_sbuf__write_cstr(self, b);
|
||||
bool all_is_digit = true;
|
||||
for(int i = 1; i < size; i++) {
|
||||
if(!isdigit(b[i])) {
|
||||
all_is_digit = false;
|
||||
break;
|
||||
for(int g = 15; g <= 17; g++) {
|
||||
size = snprintf(b, sizeof(b), "%.*g", g, val);
|
||||
if(strtod(b, NULL) == val) break;
|
||||
}
|
||||
c11_sbuf__write_cstr(self, b);
|
||||
bool all_is_digit = true;
|
||||
for(int i = 1; i < size; i++) {
|
||||
if(!isdigit(b[i])) {
|
||||
all_is_digit = false;
|
||||
break;
|
||||
}
|
||||
}
|
||||
if(all_is_digit) c11_sbuf__write_cstr(self, ".0");
|
||||
} else {
|
||||
size = snprintf(b, sizeof(b), "%.*f", precision, val);
|
||||
c11_sbuf__write_cstr(self, b);
|
||||
}
|
||||
if(all_is_digit) c11_sbuf__write_cstr(self, ".0");
|
||||
}
|
||||
|
||||
void c11_sbuf__write_sv(c11_sbuf* self, c11_sv sv) {
|
||||
|
||||
@ -2847,6 +2847,8 @@ static Error* compile_stmt(Compiler* self) {
|
||||
case TK_WITH: {
|
||||
check(EXPR(self)); // [ <expr> ]
|
||||
Ctx__s_emit_top(ctx());
|
||||
// Save context manager for later __exit__ call
|
||||
Ctx__emit_(ctx(), OP_DUP_TOP, BC_NOARG, prev()->line);
|
||||
Ctx__enter_block(ctx(), CodeBlockType_WITH);
|
||||
NameExpr* as_name = NULL;
|
||||
if(match(TK_AS)) {
|
||||
@ -2855,17 +2857,33 @@ static Error* compile_stmt(Compiler* self) {
|
||||
as_name = NameExpr__new(prev()->line, name, name_scope(self));
|
||||
}
|
||||
Ctx__emit_(ctx(), OP_WITH_ENTER, BC_NOARG, prev()->line);
|
||||
// [ <expr> <expr>.__enter__() ]
|
||||
if(as_name) {
|
||||
bool ok = vtemit_store((Expr*)as_name, ctx());
|
||||
vtdelete((Expr*)as_name);
|
||||
if(!ok) return SyntaxError(self, "invalid syntax");
|
||||
} else {
|
||||
// discard `__enter__()`'s return value
|
||||
Ctx__emit_(ctx(), OP_POP_TOP, BC_NOARG, BC_KEEPLINE);
|
||||
}
|
||||
// Wrap body in try-except to ensure __exit__ is called even on exception
|
||||
Ctx__enter_block(ctx(), CodeBlockType_TRY);
|
||||
Ctx__emit_(ctx(), OP_BEGIN_TRY, BC_NOARG, prev()->line);
|
||||
check(compile_block_body(self));
|
||||
Ctx__emit_(ctx(), OP_END_TRY, BC_NOARG, BC_KEEPLINE);
|
||||
// Normal exit: call __exit__(None, None, None)
|
||||
Ctx__emit_(ctx(), OP_LOAD_NONE, BC_NOARG, prev()->line);
|
||||
Ctx__emit_(ctx(), OP_LOAD_NONE, BC_NOARG, prev()->line);
|
||||
Ctx__emit_(ctx(), OP_LOAD_NONE, BC_NOARG, prev()->line);
|
||||
Ctx__emit_(ctx(), OP_WITH_EXIT, BC_NOARG, prev()->line);
|
||||
int jump_patch = Ctx__emit_(ctx(), OP_JUMP_FORWARD, BC_NOARG, BC_KEEPLINE);
|
||||
Ctx__exit_block(ctx());
|
||||
// Exception handler: call __exit__ with exception info, then re-raise
|
||||
Ctx__emit_(ctx(), OP_PUSH_EXCEPTION, BC_NOARG, BC_KEEPLINE);
|
||||
Ctx__emit_(ctx(), OP_LOAD_NONE, BC_NOARG, BC_KEEPLINE); // exc_type
|
||||
Ctx__emit_(ctx(), OP_ROT_TWO, BC_NOARG, BC_KEEPLINE); // reorder: [cm, None, exc]
|
||||
Ctx__emit_(ctx(), OP_LOAD_NONE, BC_NOARG, BC_KEEPLINE); // exc_tb
|
||||
Ctx__emit_(ctx(), OP_WITH_EXIT, BC_NOARG, prev()->line);
|
||||
Ctx__emit_(ctx(), OP_RE_RAISE, BC_NOARG, BC_KEEPLINE);
|
||||
Ctx__patch_jump(ctx(), jump_patch);
|
||||
Ctx__exit_block(ctx());
|
||||
} break;
|
||||
/*************************************************/
|
||||
|
||||
@ -189,7 +189,8 @@ static Error* LexerError(Lexer* self, const char* fmt, ...) {
|
||||
err->src = self->src;
|
||||
PK_INCREF(self->src);
|
||||
err->lineno = self->current_line;
|
||||
if(*self->curr_char == '\n') { err->lineno--; }
|
||||
const char* end = self->src->source->data + self->src->source->size;
|
||||
if(self->curr_char <= end && *self->curr_char == '\n') { err->lineno--; }
|
||||
va_list args;
|
||||
va_start(args, fmt);
|
||||
vsnprintf(err->msg, sizeof(err->msg), fmt, args);
|
||||
|
||||
@ -1126,14 +1126,35 @@ __NEXT_STEP:
|
||||
DISPATCH();
|
||||
}
|
||||
case OP_WITH_EXIT: {
|
||||
// [expr]
|
||||
py_push(TOP());
|
||||
// Stack: [cm, exc_type, exc_val, exc_tb]
|
||||
// Call cm.__exit__(exc_type, exc_val, exc_tb)
|
||||
py_Ref exc_tb = TOP();
|
||||
py_Ref exc_val = SECOND();
|
||||
py_Ref exc_type = THIRD();
|
||||
py_Ref cm = FOURTH();
|
||||
|
||||
// Save all values from stack
|
||||
py_TValue saved_cm = *cm;
|
||||
py_TValue saved_exc_type = *exc_type;
|
||||
py_TValue saved_exc_val = *exc_val;
|
||||
py_TValue saved_exc_tb = *exc_tb;
|
||||
self->stack.sp -= 4;
|
||||
|
||||
// Push cm and get __exit__ method
|
||||
py_push(&saved_cm);
|
||||
if(!py_pushmethod(__exit__)) {
|
||||
TypeError("'%t' object does not support the context manager protocol", TOP()->type);
|
||||
TypeError("'%t' object does not support the context manager protocol", saved_cm.type);
|
||||
goto __ERROR;
|
||||
}
|
||||
if(!py_vectorcall(0, 0)) goto __ERROR;
|
||||
POP();
|
||||
|
||||
// Push arguments: exc_type, exc_val, exc_tb
|
||||
PUSH(&saved_exc_type);
|
||||
PUSH(&saved_exc_val);
|
||||
PUSH(&saved_exc_tb);
|
||||
|
||||
// Call __exit__(exc_type, exc_val, exc_tb)
|
||||
if(!py_vectorcall(3, 0)) goto __ERROR;
|
||||
py_pop(); // discard return value
|
||||
DISPATCH();
|
||||
}
|
||||
///////////
|
||||
|
||||
@ -102,7 +102,7 @@ static bool json__write_namedict_kv(py_Name k, py_Ref v, void* ctx_) {
|
||||
static bool json__write_object(c11_sbuf* buf, py_TValue* obj, int indent, int depth) {
|
||||
switch(obj->type) {
|
||||
case tp_NoneType: c11_sbuf__write_cstr(buf, "null"); return true;
|
||||
case tp_int: c11_sbuf__write_int(buf, obj->_i64); return true;
|
||||
case tp_int: c11_sbuf__write_i64(buf, obj->_i64); return true;
|
||||
case tp_float: {
|
||||
if(dmath_isnan(obj->_f64)) {
|
||||
c11_sbuf__write_cstr(buf, "NaN");
|
||||
|
||||
@ -235,8 +235,8 @@ static bool io_FileIO_flush(int argc, py_Ref argv) {
|
||||
|
||||
void pk__add_module_io() {
|
||||
py_Ref mod = py_newmodule("io");
|
||||
|
||||
py_Type FileIO = pk_newtype("FileIO", tp_object, mod, NULL, false, true);
|
||||
py_Type FileIO = py_newtype("FileIO", tp_object, mod, NULL);
|
||||
py_tpsetfinal(FileIO);
|
||||
|
||||
py_bindmagic(FileIO, __new__, io_FileIO__new__);
|
||||
py_bindmagic(FileIO, __enter__, io_FileIO__enter__);
|
||||
|
||||
@ -384,7 +384,10 @@ static bool list_insert(int argc, py_Ref argv) {
|
||||
return true;
|
||||
}
|
||||
|
||||
static int lt_with_key(py_TValue* a, py_TValue* b, py_TValue* key) {
|
||||
static int lt_with_key(const void* a_, const void* b_, void* extra) {
|
||||
py_TValue* a = (py_TValue*)a_;
|
||||
py_TValue* b = (py_TValue*)b_;
|
||||
py_TValue* key = (py_TValue*)extra;
|
||||
if(!key) return py_less(a, b);
|
||||
VM* vm = pk_current_vm;
|
||||
// project a
|
||||
@ -416,7 +419,7 @@ static bool list_sort(int argc, py_Ref argv) {
|
||||
bool ok = c11__stable_sort(self->data,
|
||||
self->length,
|
||||
sizeof(py_TValue),
|
||||
(int (*)(const void*, const void*, void*))lt_with_key,
|
||||
lt_with_key,
|
||||
key);
|
||||
if(!ok) return false;
|
||||
|
||||
|
||||
@ -64,6 +64,8 @@ assert f'{a:010f}' == '010.000000'
|
||||
assert f'{a:010.2f}' == '0000010.00'
|
||||
assert f'{a:.2f}' == '10.00'
|
||||
assert f'{a:.5f}' == '10.00000'
|
||||
assert f'{2.5:.0f}' == '2'
|
||||
assert '{:.0f}'.format(2.5) == '2'
|
||||
|
||||
b = '123'
|
||||
assert f'{b:10}' == '123 '
|
||||
@ -139,4 +141,10 @@ assert f'{A():10}' == 'A '
|
||||
assert f'{A():10}' == 'A '
|
||||
|
||||
a = ['1', '2', '3']
|
||||
assert f'a = {'\n'.join(a)}' == 'a = 1\n2\n3'
|
||||
assert f'a = {'\n'.join(a)}' == 'a = 1\n2\n3'
|
||||
|
||||
assert str(0.1+0.2) == '0.30000000000000004'
|
||||
assert str(1/2) == '0.5'
|
||||
assert str(1/3) == '0.3333333333333333'
|
||||
assert str(1/4) == '0.25'
|
||||
assert str(1/7) == '0.14285714285714285'
|
||||
|
||||
@ -27,4 +27,29 @@ assert path == ['enter', 'in', 'exit']
|
||||
|
||||
path.clear()
|
||||
|
||||
# Test that __exit__ is called even when an exception occurs
|
||||
class B:
|
||||
def __init__(self):
|
||||
self.path = []
|
||||
|
||||
def __enter__(self):
|
||||
path.append('enter')
|
||||
return self
|
||||
|
||||
def __exit__(self, exc_type, exc_val, exc_tb):
|
||||
path.append('exit')
|
||||
if exc_type is not None:
|
||||
path.append('exception')
|
||||
return False # propagate exception
|
||||
|
||||
try:
|
||||
with B():
|
||||
path.append('before_raise')
|
||||
raise ValueError('test')
|
||||
path.append('after_raise') # should not be reached
|
||||
except ValueError:
|
||||
pass
|
||||
|
||||
assert path == ['enter', 'before_raise', 'exit', 'exception'], f"Expected ['enter', 'before_raise', 'exit', 'exception'], got {path}"
|
||||
|
||||
|
||||
|
||||
@ -75,4 +75,11 @@ assert res == [42, 42]
|
||||
assert x == 33
|
||||
|
||||
# test removing trailing newlines
|
||||
assert eval('[1, 2, 3]\n \n') == [1, 2, 3]
|
||||
assert eval('[1, 2, 3]\n \n') == [1, 2, 3]
|
||||
|
||||
# lexer doesn't read past NUL on error at end of input
|
||||
try:
|
||||
eval('"\\x4')
|
||||
exit(1)
|
||||
except SyntaxError:
|
||||
pass
|
||||
@ -48,6 +48,9 @@ _j = json.dumps(c)
|
||||
_c = json.loads(_j)
|
||||
assert c == _c
|
||||
|
||||
assert json.dumps(9223372036854775807) == '9223372036854775807'
|
||||
assert json.loads(json.dumps(0.1 + 0.2)) == 0.1 + 0.2
|
||||
|
||||
d = True
|
||||
_j = json.dumps(d)
|
||||
_d = json.loads(_j)
|
||||
|
||||
@ -65,11 +65,8 @@ assert msgpack.dumps([]) == b'\x90'
|
||||
assert msgpack.dumps([1, 2, 3]) == b'\x93\x01\x02\x03'
|
||||
assert msgpack.dumps([1]) == b'\x91\x01'
|
||||
|
||||
try:
|
||||
msgpack.dumps({1: 2})
|
||||
assert False
|
||||
except TypeError:
|
||||
assert True
|
||||
_o = msgpack.dumps({1: 2})
|
||||
assert msgpack.loads(_o) == {1: 2}
|
||||
|
||||
try:
|
||||
msgpack.dumps(type)
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user