Search
15:12:29
shinmera
gingerale: I am here.... now
15:13:06
shinmera
gingerale: what's v2y?
15:15:00
shinmera
gingerale: the initial element is not copied, so each element would point to the same instance.
15:18:35
shinmera
gingerale: the bounds of a dotimes do not need to be integers
15:19:00
shinmera
gingerale: that's not what it complained about
15:19:57
shinmera
gingerale: you want to build the actual graph
15:20:49
shinmera
gingerale: you would have to construct the lines yourself pretty much.
15:24:08
shinmera
gingerale: but C... so it has to be fast
16:00:44
shinmera
gingerale: you can sort sequences
16:00:58
shinmera
gingerale: 1d arrays are sequences.
16:05:58
shinmera
gingerale: what kindsa data structures? There's several libraries out there.
16:06:18
shinmera
gingerale: a priority queue
16:06:34
shinmera
gingerale: (ql:system-apropos "priority")
16:06:56
shinmera
gingerale: the search sucks since it only checks system names, but yeah
16:07:18
shinmera
gingerale: try the "damn fast priority queue"
16:08:23
shinmera
gingerale: in this one you need to assign a priority number.
16:09:30
shinmera
gingerale: idx = (+ x (* y max-x))
16:10:50
shinmera
gingerale: check package local nicknames.
16:10:58
shinmera
gingerale: there's examples of that in trial
16:11:46
shinmera
gingerale: eh? you don't need alexandria