| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2015-10-31 | tests/base/struct1.py: Add test for repetition counters. | Paul Sokolovsky | |
| 2015-10-01 | tests: Add further tests for mpz code. | Damien George | |
| 2015-09-03 | tests: Add tests to improve coverage of objstr.c. | Damien George | |
| 2015-05-04 | modstruct: Rename module to "ustruct", to allow full Python-level impl. | Paul Sokolovsky | |
| 2015-04-25 | py: Support conversion of bignum to bytes. | Damien George | |
| This gets int.to_bytes working for bignum, and also struct.pack with 'q' and 'Q' args on 32-bit machines. Addresses issue #1155. | |||
| 2015-04-05 | tests: Add some more tests to improve code coverage of corner cases. | Damien George | |
| 2014-12-05 | py: Rename mp_obj_int_get to mp_obj_int_get_truncated; fix struct.pack. | Damien George | |
| mp_obj_int_get_truncated is used as a "fast path" int accessor that doesn't check for overflow and returns the int truncated to the machine word size, ie mp_int_t. Use mp_obj_int_get_truncated to fix struct.pack when packing maximum word sized values. Addresses issues #779 and #998. | |||
| 2014-06-25 | modstruct: Fix alignment handling issues. | Paul Sokolovsky | |
| Also, factor out mp_binary_get_int() function. | |||
| 2014-05-12 | modstruct: Implement count specifier for strings (e.g. "100s"). | Paul Sokolovsky | |
| Infra for counts of other types is there, need last mile to be implemented. | |||
| 2014-04-19 | modstruct: Initial implementation of struct.pack(). | Paul Sokolovsky | |
| 2014-04-11 | modstruct: Basic implementation of native struct alignment and types. | Paul Sokolovsky | |
| 2014-04-11 | modstruct: Refactor to support both LE and BE packed structs. | Paul Sokolovsky | |
| 2014-04-10 | py: Start implementing "struct" module. | Paul Sokolovsky | |
| 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. | |||
