Zxc200611/pocketpy
1
0
Fork 0
mirror of https://github.com/pocketpy/pocketpy synced 2025-10-23 21:10:19 +00:00
Code Issues Packages Projects Releases Wiki Activity

...

Browse Source
This commit is contained in:
blueloveTH 2024-11-23 02:16:52 +08:00
parent 8d41987eb8
commit 1634defbb2
4 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
src/modules/dis.c
View File

@ -57,6 +57,7 @@ static bool disassemble(CodeObject* co) {
c11_sbuf__write_int(&ss, byte.arg); c11_sbuf__write_int(&ss, byte.arg);
switch(byte.op) { switch(byte.op) {
// TODO: see `dis.py` there is a memory issue
case OP_LOAD_CONST: { case OP_LOAD_CONST: {
py_Ref value = c11__at(py_TValue, &co->consts, byte.arg); py_Ref value = c11__at(py_TValue, &co->consts, byte.arg);
if(py_repr(value)) { if(py_repr(value)) {

2
src/modules/linalg.c
View File

@ -305,7 +305,7 @@ DEF_VECTOR_OPS(3)
c11_vec##D##i v = py_tovec##D##i(argv); \ c11_vec##D##i v = py_tovec##D##i(argv); \
uint64_t hash = 0; \ uint64_t hash = 0; \
for(int i = 0; i < D; i++) \ for(int i = 0; i < D; i++) \
hash = hash * 131071 + (uint32_t)v.data[i] * C; \ hash = hash * 31 + (uint32_t)v.data[i] * C; \
py_newint(py_retval(), (py_i64)hash); \ py_newint(py_retval(), (py_i64)hash); \
return true; \ return true; \
} }

2
src/public/py_dict.c
View File

@ -158,7 +158,7 @@ static bool Dict__set(Dict* self, py_TValue* key, py_TValue* val) {
if(res == -1) return false; // error if(res == -1) return false; // error
} }
// no empty slot found // no empty slot found
if(self->capacity >= self->entries.length * 8) { if(self->capacity >= self->entries.length * 10) {
return RuntimeError("dict has too much collision: %d/%d", self->entries.length, self->capacity); return RuntimeError("dict has too much collision: %d/%d", self->entries.length, self->capacity);
} }
Dict__rehash_2x(self); Dict__rehash_2x(self);

9
tests/80_linalg.py
View File

@ -409,8 +409,7 @@ x, y, z = vec3(1.0, 2.0, 3.0)
assert x == 1.0 and y == 2.0 and z == 3.0 assert x == 1.0 and y == 2.0 and z == 3.0
d = {} d = {vec2i(12, 12): 1035.313708305359, vec2i(12, 11): 2059.313708305359, vec2i(12, 13): 2059.313708305359, vec2i(11, 12): 2059.313708305359, vec2i(13, 12): 2059.313708305359, vec2i(13, 11): 3083.313708305359, vec2i(13, 13): 3083.313708305359, vec2i(14, 12): 3083.313708305359, vec2i(12, 14): 3083.313708305359, vec2i(11, 13): 3083.313708305359, vec2i(12, 10): 3083.313708305359, vec2i(11, 11): 3083.313708305359, vec2i(10, 12): 3083.313708305359, vec2i(13, 14): 4107.313708305359, vec2i(14, 13): 4107.313708305359, vec2i(14, 11): 4107.313708305359, vec2i(15, 12): 4107.313708305359, vec2i(12, 15): 4107.313708305359, vec2i(11, 14): 4107.313708305359, vec2i(13, 10): 4107.313708305359, vec2i(10, 13): 4107.313708305359, vec2i(11, 10): 4107.313708305359, vec2i(10, 11): 4107.313708305359, vec2i(12, 9): 4107.313708305359, vec2i(9, 12): 4107.313708305359, vec2i(14, 14): 5131.313708305359, vec2i(15, 13): 5131.313708305359, vec2i(13, 15): 5131.313708305359, vec2i(15, 11): 5131.313708305359, vec2i(16, 12): 5131.313708305359, vec2i(12, 16): 5131.313708305359, vec2i(11, 15): 5131.313708305359, vec2i(14, 10): 5131.313708305359, vec2i(10, 14): 5131.313708305359, vec2i(13, 9): 5131.313708305359, vec2i(9, 13): 5131.313708305359}
e = {} d[vec2i(11, 9)] = 1
for i in range(10000):
d[vec2i(i, 0)] = i print(d)
e[vec3i(i, 0, 0)] = i