2026/03/07

Newest at the top

2026-03-07 13:28:20 +0100 <Guest89> darn
2026-03-07 13:28:16 +0100merijn(~merijn@62.45.136.136) (Ping timeout: 244 seconds)
2026-03-07 13:28:10 +0100 <int-e> no, but also: <+haskellbridge> <sm> got to go.. good luck
2026-03-07 13:27:09 +0100 <Guest89> sorry I think I lost connection; I posted some replies to you sm but I'm not sure if they got through?
2026-03-07 13:26:35 +0100Guest89(~Guest89@185.45.21.144)
2026-03-07 13:23:39 +0100merijn(~merijn@62.45.136.136) merijn
2026-03-07 13:19:46 +0100target_i(~target_i@user/target-i/x-6023099) target_i
2026-03-07 13:14:10 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 248 seconds)
2026-03-07 13:13:14 +0100czan(~czan@user/mange) (Ping timeout: 245 seconds)
2026-03-07 13:11:01 +0100gmg(~user@user/gehmehgeh) (Remote host closed the connection)
2026-03-07 13:09:37 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-03-07 13:06:30 +0100Square(~Square@user/square) Square
2026-03-07 13:06:12 +0100Square3(~Square@user/square) (Remote host closed the connection)
2026-03-07 13:05:04 +0100fun-safe-math(~fun-safe-@97.115.234.213) fun-safe-math
2026-03-07 13:03:00 +0100fun-safe-math(~fun-safe-@97.115.234.213) ()
2026-03-07 12:59:28 +0100bggd__(~bgg@2a01:e0a:fd5:f510:537e:c033:7f9f:3728)
2026-03-07 12:58:53 +0100 <haskellbridge> <sm> got to go.. good luck
2026-03-07 12:58:49 +0100merijn(~merijn@62.45.136.136) (Ping timeout: 244 seconds)
2026-03-07 12:56:58 +0100Guest89(~Guest89@185.45.21.144) (Ping timeout: 240 seconds)
2026-03-07 12:54:15 +0100merijn(~merijn@62.45.136.136) merijn
2026-03-07 12:54:13 +0100__monty__(~toonn@user/toonn) toonn
2026-03-07 12:52:51 +0100 <haskellbridge> <sm> it looks like there's a lot comparing needed to do an insert. Is it your own custom priority queue ?
2026-03-07 12:50:44 +0100 <Guest89> it seems like a lot but I can't dismiss it as unexpected
2026-03-07 12:50:19 +0100 <Guest89> but most likely it should be less than that because of short circuiting on a lot of the node combinations
2026-03-07 12:50:02 +0100 <Guest89> so in this particular example the data is generated from a fold that iteratively uses bddApply on new BDDs, but only 7 times total. the largest BDDs being applied have a few thousand nodes each, which means that the upper bound for bddApply will necessarily be in the millions
2026-03-07 12:48:17 +0100arandombit(~arandombi@user/arandombit) (Ping timeout: 268 seconds)
2026-03-07 12:47:02 +0100 <Guest89> well insert is probably from the data structure I use to maintain a priority queue
2026-03-07 12:46:16 +0100 <Guest89> I've only seem them now that I'm running with -P instead of -p
2026-03-07 12:46:07 +0100 <Guest89> I don't know what they are either
2026-03-07 12:45:47 +0100 <haskellbridge> <sm> (I don't know why these names are obfuscated)
2026-03-07 12:44:57 +0100 <haskellbridge> <sm> $sinsert_$sgo4 14 million. maybe one of those...
2026-03-07 12:44:50 +0100 <Guest89> let me try something for a quick sanity check
2026-03-07 12:44:30 +0100 <haskellbridge> <sm> $wbddApply'' is called half a million times
2026-03-07 12:44:02 +0100 <haskellbridge> <sm> it sounds like something is doing too much work
2026-03-07 12:43:46 +0100 <Guest89> but on that particular run; no, that is excessive
2026-03-07 12:43:34 +0100 <Guest89> so currently on a benchmark that I have (encoding `n-queens`) the number of nodes in my data structure is expected to quadruple for each n but currently space and time seems to increase 10-fold instead
2026-03-07 12:43:12 +0100arandombit(~arandombi@user/arandombit) arandombit
2026-03-07 12:43:07 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 268 seconds)
2026-03-07 12:43:01 +0100 <haskellbridge> <sm> see the entries column.. you have something being called 26 million times, eg. Is that what you'd expect ? Is the data that large ?
2026-03-07 12:42:17 +0100 <Guest89> will try
2026-03-07 12:41:39 +0100 <haskellbridge> <sm> lovely. And it might be interesting to run profiterole on that too.
2026-03-07 12:41:02 +0100Square3(~Square@user/square) Square
2026-03-07 12:40:51 +0100 <Guest89> https://paste.tomsmeding.com/AUb2v7Sh
2026-03-07 12:40:18 +0100 <haskellbridge> <sm> by all means show it :)
2026-03-07 12:40:07 +0100 <Guest89> yes
2026-03-07 12:40:02 +0100 <haskellbridge> <sm> do you have a .prof file ?
2026-03-07 12:39:54 +0100 <Guest89> do you just want a file dump?
2026-03-07 12:38:58 +0100 <Guest89> I've got the files from profiling and some html pages rendered from them if that's what you mean
2026-03-07 12:38:54 +0100 <haskellbridge> <sm> I looked it up: stack install --profile PROG; PROG +RTS -P -RTS ... this will save PROG.prof
2026-03-07 12:38:34 +0100 <Guest89> when you say *make* a profile, what do you mean exactly?