summaryrefslogtreecommitdiffstatshomepage
path: root/tests/basics/struct1.py
diff options
context:
space:
mode:
authorPaul Sokolovsky <pfalcon@users.sourceforge.net>2014-04-10 03:45:38 +0300
committerPaul Sokolovsky <pfalcon@users.sourceforge.net>2014-04-10 03:58:03 +0300
commite9db8404804f2eed07eb0a6190f73ae21e0dc43c (patch)
tree29aa05cc8892116fa6ff008d0407b0e4108a8e5b /tests/basics/struct1.py
parentacb133d1b1a68847bd85c545312c3e221a6f7c0b (diff)
downloadmicropython-e9db8404804f2eed07eb0a6190f73ae21e0dc43c.tar.gz
micropython-e9db8404804f2eed07eb0a6190f73ae21e0dc43c.zip
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 'tests/basics/struct1.py')
-rw-r--r--tests/basics/struct1.py3
1 files changed, 3 insertions, 0 deletions
diff --git a/tests/basics/struct1.py b/tests/basics/struct1.py
new file mode 100644
index 0000000000..6feaca3849
--- /dev/null
+++ b/tests/basics/struct1.py
@@ -0,0 +1,3 @@
+import struct
+print(struct.calcsize("<bI"))
+print(struct.unpack("<bI", b"\x80\0\0\x01\0"))