libera/#clim - IRC Chatlog
Search
10:23:16
polygon-op
now triangulation is just a matter of adding diagonals (and that will be fed to xrender for polygonized figures)
10:26:12
polygon-op
and for lurkers who may be tempted to say: that's another time sunk on working on clx backend, I would have a reply: but this will be also useful for possible opengl backend (and others)
15:36:02
lukego
Good news is that I rewrote the minimum spanning tree algorithm to be an order of magnitude faster (starting from randomly copy-pasted code.) Bad news is that now I'm bottlenecked in (SETF OUTPUT-RECORD-POSITION) and maybe need to think about a separate geometry.
15:39:00
polygon-op
lukego: if you feel adventurous you may try to implement a suggestion in recording - namely that (setf output-record-position) doesn't call recompute-extent on its own (instead - it is the responsibility of the layout algorithm)
15:39:21
polygon-op
but this will require looking where this function is used and appropriately updating the code
15:40:13
lukego
I depend on the child output records to be moved too, is that compatible with this idea?
15:40:38
polygon-op
yes, the key point is that you call tree-recompute-extend after all manipulations are complete
15:41:53
lukego
okay thanks, I'll definitely spend some time reading the code, it's really worth something to be able to work directly on the output records
15:47:05
polygon-op
scymtym wrote a flamegraph tool for clim but if I understand correctly sbcl shifted its internals so it is not very usable in new versions
15:48:24
scymtym
https://techfak.de/~jmoringe/clim.flamegraph-kandria.ogv (the game is not mine but Shinmera's)
15:55:45
lukego
also the video made me remember slime-sprof, which is an improvement over the raw text output for me
15:56:43
scymtym
lukego: thanks. it records deterministic information (like TRACE or SLIME trace dialog), a statistical profile and memory information
15:57:32
lukego
though I see in the profiler here that in total 50% of my time is going on (setf update-output-record) which is not _that_ much. so maybe it's not a pain point for me yet, wouldn't do major surgery for only 2x speedup
16:00:08
lukego
I'm still hacking on the simulated annealing stuff and I'm sure there's a 10-100x speedup available just by somehow tuning the coefficients better to arrive at a decent solution in fewer iterations.
16:01:34
lukego
I wrote a monte carlo tree search that I'm itching to test... maybe it could tune the knobs on the simulated annealing layout... or just be used as an alternative that chooses relative placements for nodes...