Thanks for those complementary informations.
Also, while i'm learning it, maybe that the sam traduction for the first file would be simpler, like:
,x/\n +/ c/ /
Also, while i'm learning it, maybe that the sam traduction for the first file would be simpler, like:
,x/\n +/ c/ /
Which taught me a lot, because at first, i did not understand why we would stop at last line - 2 ($ - 2), but in fact yeah last line is the very last "\n", that is why we stop at $ - 2 to not do E->weird.
I'm starting to truly love sam
based on what you wrote:
i just add trailing \n normalization at the end
, x/(.+\n)+|\n+/ { g/./ x/\n/ c/ / v/./ c/\n/ } $ a/\n/ , x/\n+$/ c/\n/ w file_out.txt q
, x/(.+\n)+/ .,+#0-#1 x/\n/ c/ /
, x/\n+/ c/\n/
I’m glad that sam worked out for you. You can learn more from [1] and [2]. If you need any help, you’re always welcome to ask me.
[1]: https://ratfactor.com/papers/sam_tut.pdf
[2]: https://9p.io/sources/contrib/steve/other-docs/struct-regex....
Do not hesitate to pin point improvements.