Perl 6 - the future is here, just unevenly distributed

IRC log for #moarvm, 2017-05-02

| Channels | #moarvm index | Today | | Search | Google Search | Plain-Text | summary

All times shown according to UTC.

Time Nick Message
01:49 ilbot3 joined #moarvm
01:49 Topic for #moarvm is now https://github.com/moarvm/moarvm | IRC logs at  http://irclog.perlgeek.de/moarvm/today
05:41 domidumont joined #moarvm
05:48 domidumont joined #moarvm
05:49 domidumont joined #moarvm
06:40 brrt joined #moarvm
06:49 brrt morning moarvm
06:49 lizmat brrt o/
06:49 brrt \o lizmat
06:54 brrt i need some efficient way to represent sets...
06:55 brrt in C, that is :-)
06:56 stmuk joined #moarvm
06:58 lizmat sets of what ?
06:59 brrt sets of live ranges (well, indexes-into-an-array-of-live-ranges, really)
07:00 lizmat monotonically increasing integer values ?
07:00 brrt … yes
07:00 brrt but not necessarily within a single set
07:01 brrt and i need the operations: add, remove, merge
07:02 brrt i could be using linked lists, i guess
07:02 lizmat what is most important to you: CPU or memory ?
07:04 brrt CPU, usually
07:04 lizmat ok, that rules out any encoding such as with MIDI  :-)
07:05 brrt MIDI as in the sound files?
07:06 lizmat yeah, they have a nice way of encoding data  :-)
07:06 lizmat but forget about it  :-)
07:07 lizmat so how often do you add/remove/merge ?
07:08 lizmat I mean, all the time, or just every now and then ?
07:08 brrt merge is every basic block; add is every use, remove is every definition, so 'all the time'
07:08 lizmat if a lot, I guess linked lists would be an option, as they can easily merge (if I understand you right)
07:08 brrt uhuh
07:09 brrt oh, i have another requirement
07:09 brrt the merge needs to be nondestructive
07:11 brrt but, i think i have an answer
07:11 brrt i'm going to keep a few sorted arrays
07:12 brrt one for the original set, one for the removals, one for the additions
07:13 brrt actually, the removals and additions can be binary heap
07:18 zakharyas joined #moarvm
07:32 samcv efficient with memory or with cpu or both
07:32 samcv or efficeient for the programmer ;) heh
07:32 samcv heh sorry looks like you mention that there too. reading :)
07:35 domidumont joined #moarvm
07:42 AlexDaniel joined #moarvm
07:43 brrt joined #moarvm
07:46 * brrt was riding the ICE just now. it was very, very nice
08:54 jnthn ICE++
08:55 jnthn Which model of ICE, though? :-)
09:04 samcv ICE?
09:09 brrt ehm, the one riding between frankfurt and germany
09:09 brrt i have no idea
09:09 brrt it was shiny, and quiet
09:10 brrt d'oh, frankfurt-amsterdam, i mean
09:10 jnthn Heh, I was gonna say, did Frankfurt secede... :P
09:11 jnthn Think I've been some of the way on that route at some points in the past
09:11 jnthn I remember we had to change ICE at some point around the NL/DE border because our ICE broke :)
09:12 jnthn But that aside, I have memories of it being comfortable :)
09:12 jnthn There's also a diesel ICE
09:12 jnthn Those are a bit less quiet but still not bad
09:12 brrt i think it was ICE-3
09:13 jnthn Yeah, likely :)
09:13 brrt not ICE-4, and ICE-T is not riding in NL
09:13 jnthn Ah, thinking about it, it was probably Brussels - DE where I had the busted train :)
10:39 stmuk_ joined #moarvm
10:45 stmuk joined #moarvm
10:48 stmuk_ joined #moarvm
10:52 stmuk joined #moarvm
10:53 ilmari joined #moarvm
10:53 brrt so thinking a bit about complexity; just adding stuff to an array and sorting it afterwards could well be as cheap as keeping it sorted throughout
10:54 lizmat brrt: I had an interesting bit of that trying to faster .WHICH representations of sets
10:55 lizmat turned out that, even written in pure nqp, there was no way I could beat the mergesort logic  :-(
10:55 lizmat even if I know I couldn't get any duplicates, so I didn't need to make it stable
10:57 brrt mergesort++
10:57 timotimo mergesort sorts some good merges
10:57 brrt it is one of my favorite algorithms, so mechanical, yet so efficient
10:58 stmuk joined #moarvm
10:59 brrt hmm, i know removals are never duplicated
10:59 brrt because the IR is in SSA form
11:06 stmuk joined #moarvm
11:49 stmuk_ joined #moarvm
11:55 brrt this is good - this is my obsesion with precomputing sizes again - because it means that we have an upper bound on the size of the live range in
12:00 stmuk joined #moarvm
12:05 stmuk_ joined #moarvm
12:08 stmuk joined #moarvm
12:32 domidumont joined #moarvm
12:54 stmuk joined #moarvm
13:28 stmuk_ joined #moarvm
14:17 lizmat joined #moarvm
14:50 zostay joined #moarvm
14:55 zakharyas joined #moarvm
15:08 brrt joined #moarvm
15:10 zakharyas joined #moarvm
16:13 lizmat joined #moarvm
16:44 domidumont joined #moarvm
16:53 stmuk joined #moarvm
16:53 MasterDuke_ joined #moarvm
17:28 buggable joined #moarvm
17:38 buggable joined #moarvm
17:39 buggable joined #moarvm
17:45 buggable joined #moarvm
17:45 buggable ???????????? It's time for the monthlyAccidental /win Lottery ???????????? We have  ballots submitted by  users! And the winner is...
17:45 buggable True
17:48 Zoffix disregard :)
17:50 geekosaur buggabley
17:55 buggable joined #moarvm
17:58 timotimo Zoffix: damn! i wanted to implement that!
17:58 timotimo though i wasn't actually going to do it just yet
17:58 buggable joined #moarvm
18:08 stmuk joined #moarvm
18:11 stmuk_ joined #moarvm
18:11 buggable joined #moarvm
18:13 buggable joined #moarvm
18:14 Zoffix timotimo: too slow :P
18:38 domidumont joined #moarvm
18:47 stmuk joined #moarvm
19:15 buggable joined #moarvm
19:16 buggable joined #moarvm
19:18 buggable joined #moarvm
19:38 Ven joined #moarvm
20:20 zakharyas joined #moarvm
20:24 AlexDaniel joined #moarvm
20:45 samcv hello
20:45 samcv True?
20:45 samcv hahah
20:54 Ven joined #moarvm
21:09 ingy joined #moarvm
21:12 Zoffix Yeah, instead of $.irc.send: :$text I typed $.irc.send: :text
21:12 Zoffix :)
21:24 unicodable6 joined #moarvm
21:24 evalable6 joined #moarvm
21:29 ingy joined #moarvm
22:48 AlexDaniel joined #moarvm
23:16 stmuk_ joined #moarvm

| Channels | #moarvm index | Today | | Search | Google Search | Plain-Text | summary