v1.2.1 stable

[tomhea]

Version 1.2.1 changes:

• Improved pointers implementation - Memory access is now faster.
  • You can now store a whole byte inside one pointed op.
  • new read/write hex/byte macros. push/pop now use the byte accessing.
• Improved debugger, Read Memory option: read flipjump variables (nicely formatted), and memory words.
• now supports running from python 3.6 to python 3.12
• added real life examples: prime_sieve & and bubble_sort programs.
• fix some small bugs, update documentation.

It is all tested, and ready to be used on windows or linux (and mac shouldn't be a problem), with python 3.6+.
The only exception is hex.div which still doesn't work (its tests are xfailed), so you can use the slower-but-stable bit.div+casts for division.

---

This discussion was created from the release v1.2.1 stable.

[tomhea]

Faster Pointers, Improved Debugger

The idea of faster pointers came from developing my brainfuck to flipjump compiler. Naturally, the memory access became the bottleneck.
The improved debugger came from necessity 😉

If previous code don't work now

If your code uses pointers, they went through a huge refactor (now faster), and thus the hex.pointers.ptr_init macro is no longer available.
Now you must use the stl.startup_and_init_pointers / stl.startup_and_init_all as your first line of code, to use pointers in your program (this line contains the functionality of the ptr_init as you know it).

Also, the xor_to_ptr is now xor_hex_to_ptr, and the xor_from_ptr is now xor_hex_from_ptr.