13:05:18shka_heisig: where should i start reading petalisp source code to understand how code generation works?
13:05:51shka_I am trying to figure out your technics
13:09:14heisigshka_: Thank you for your interest! The recommended reading order is just the order that ASDF uses. Another way is to use (break) and M-. to dive into the code.
14:59:34pfdietzaeth: oni-on-ion: Waters' old COVER package will be going into quicklisp soonish. I tidied it up a bit and wrote an asd file. https://github.com/pfdietz/cover
15:56:36jasompfdietz: interesting; I wonder if that could be used to write something like AFL (a tool for generating inputs to take each possible branch).
15:58:33jasompfdietz: thanks! it's people like you that allow me to sit on the couch eating bon-bons all day :)
15:59:51pfdietzThe plan is to generalize the "point" data structure there to allow subclassing and custom behaviors. For that use case, it needs checkpointing and rollback, so tests can be tracked if they increase coverage, and then the test minimized to the smallest input(s) that still increase coverage.
16:00:26pfdietzCurrent issue I have with COVER is that it doesn't play well with certain macro packages, particularly ITERATE.
16:00:41didiCan I use function EQ to compare two instances of a class?
16:01:57pfdietzThe only place you need to beware of EQ is with numbers and characters. Use EQL for those. Or, in general, use EQL instead of EQ unless you want to microoptimize.