TUI-apps VS Advent_of_Code_in_Pascal

Hello!

I am pleased to announce a new version of my "CLI text processing with GNU sed" ebook. This book heavily leans on examples to present features one by one. In addition to sed commands and options, regular expressions are also discussed in detail.

Links:

* PDF/EPUB versions: https://learnbyexample.gumroad.com/l/gnu_sed (free for a few days)

* Web version: https://learnbyexample.github.io/learn_gnused/ (always free)

* Markdown source, example files, etc: https://github.com/learnbyexample/learn_gnused

* Interactive TUI app for exercises: https://github.com/learnbyexample/TUI-apps/blob/main/SedExercises

I would highly appreciate it if you'd let me know how you felt about this book. It could be anything from a simple thank you, pointing out a typo, mistakes in code snippets, which aspects of the book worked for you (or didn't!) and so on. Reader feedback is essential and especially so for self-published authors.

Happy learning :)

I also wrote an interactive TUI app based on some of the exercises from the ebook. Reference solutions are provided for both GNU grep and ripgrep.

These days I prefer coding TUI apps using Textual (see my repo https://github.com/learnbyexample/TUI-apps for examples) since I find this framework easier to work with and I don't need full GUI features for my projects.

This year I started updating my existing books and I'm also creating interactive apps. Here's one for Python regex: https://github.com/learnbyexample/TUI-apps/blob/main/PyRegexExercises. Next is grep.

Having an interactive program that automatically loads questions and checks the solution is wonderful to have while learning a topic. I wrote a TUI app that has beginner to advanced level exercises for Python regular expressions. There are more than 100 exercises covering both the builtin re and third-party regex modules.

I'm doing it in Lazarus/Free Pascal again.

https://github.com/mikewarot/Advent_of_Code_in_Pascal

Free Pascal - 2251/1744 34.5 seconds runtime No objects, no recursion After brute forcing part 1, I stared at part 2 until I though only handling the different values of X,Y,Z and letting the grid represent variable size cubes.. only to hit memory size limits anyway... and then I learned how to use BITPACKED array, and was able to eventually brute force part 2. Whew!

Pascal 2235/4609

Pascal - Github

Pascal 7079/6330 - github

Github - https://github.com/mikewarot/Advent_of_Code_in_Pascal/blob/master/2021/advent2021_15b.lpr

My pascal based solver eventually got valid text out of your input.

Pascal 2437/6187

Pascal 3590/5744