17:16:54Bikethe bit vector operations have a non consing mode
17:18:56NilbyBike: yes, that's one reason. random 2d access seems easier too. i imagine i might go back to the the ldb way if need be
17:20:39Nilbywith bignums it's hard to be sure when it conses
17:27:56NilbyI would wish that the number and array would end up being equivalent speed, and one could just choose the most convenient representation, but I guess i'll have to see
17:33:21pjbNilby: there's almost no difference between number and bit-vector access times: https://termbin.com/wmxs
17:33:22Nilbypjb: Thanks. That looks pretty fast. That is very similar in structure to what I did with %*vector-raw-bits. Perhaps I can do that for other implementations.
17:34:19pjbOnly, integer are immutable. This is what may let you choose bit-vector over integer.
17:35:20NilbyYes, my code is very mutating, which is one reason why I chose the vector way to begin with
17:36:03pjbAnd, if you have very big vectors, you can also use multithreads to process separate parts.