diff options
author | Paul Sokolovsky <pfalcon@users.sourceforge.net> | 2014-04-10 03:45:38 +0300 |
---|---|---|
committer | Paul Sokolovsky <pfalcon@users.sourceforge.net> | 2014-04-10 03:58:03 +0300 |
commit | e9db8404804f2eed07eb0a6190f73ae21e0dc43c (patch) | |
tree | 29aa05cc8892116fa6ff008d0407b0e4108a8e5b /py/qstrdefs.h | |
parent | acb133d1b1a68847bd85c545312c3e221a6f7c0b (diff) |
py: Start implementing "struct" module.
Only calcsize() and unpack() functions provided so far, for little-endian
byte order. Format strings don't support repition spec (like "2b3i").
Unfortunately, dealing with all the various binary type sizes and alignments
will lead to quite a bloated "binary" helper functions - if optimizing for
speed. Need to think if using dynamic parametrized algos makes more sense.
Diffstat (limited to 'py/qstrdefs.h')
-rw-r--r-- | py/qstrdefs.h | 9 |
1 files changed, 9 insertions, 0 deletions
diff --git a/py/qstrdefs.h b/py/qstrdefs.h index 342160bbc..17948434b 100644 --- a/py/qstrdefs.h +++ b/py/qstrdefs.h @@ -84,6 +84,9 @@ Q(bool) Q(bytearray) Q(bytes) Q(callable) +#if MICROPY_ENABLE_MOD_STRUCT +Q(calcsize) +#endif Q(chr) Q(classmethod) Q(collections) @@ -127,10 +130,16 @@ Q(staticmethod) Q(sum) Q(super) Q(str) +#if MICROPY_ENABLE_MOD_STRUCT +Q(struct) +#endif Q(sys) Q(to_bytes) Q(tuple) Q(type) +#if MICROPY_ENABLE_MOD_STRUCT +Q(unpack) +#endif Q(value) Q(zip) |