--- Log opened Sat May 23 00:00:30 2020
14:56 < ja> seems like accumulator.DedupeSwapDirt([]uint64{33, 40}, []accumulator.Arrow{{1, 40}}) returns [33 40]
14:56 < ja> isn't that wrong?
14:58 < ja> i thought it would remove any elements of a that appear in b.to, assuming they are both sorted
16:25 < ja> i don't understand makeDestInRow. is there any particular reason that the condition is "len(maybeArrow) == 0" instead of "len(maybeArrow) == 0 || len(hashDirt) != 0 && hashDirt[0] > maybeArrow[0].To"?
18:26 -!- dergoegg1 [~dergoegge@196.240.57.220] has joined #utreexo
18:28 -!- dergoegg1 [~dergoegge@196.240.57.220] has quit [Client Quit]
18:32 -!- dergoegge [~dergoegge@196.240.57.220] has joined #utreexo
21:50 -!- rjected [~dan@pool-71-184-77-198.bstnma.fios.verizon.net] has quit [Ping timeout: 264 seconds]
22:04 -!- rjected [~dan@pool-71-184-77-198.bstnma.fios.verizon.net] has joined #utreexo
--- Log closed Sun May 24 00:00:30 2020