--- Log opened Mon Aug 29 00:00:22 2016 |
00:22 | | Kindamoody|autojoin [Kindamoody@Nightstar-0lgkcs.tbcn.telia.com] has quit [Connection closed] |
00:25 | | Kindamoody|autojoin [Kindamoody@Nightstar-0lgkcs.tbcn.telia.com] has joined #code |
00:25 | | mode/#code [+o Kindamoody|autojoin] by ChanServ |
00:37 | | ion_ [Owner@Nightstar-oj1.09k.65.184.IP] has joined #code |
00:38 | | ion [Owner@Nightstar-oj1.09k.65.184.IP] has quit [Ping timeout: 121 seconds] |
00:42 | | ion [Owner@Nightstar-oj1.09k.65.184.IP] has joined #code |
00:46 | | ion_ [Owner@Nightstar-oj1.09k.65.184.IP] has quit [Ping timeout: 121 seconds] |
01:53 | | himi [sjjf@Nightstar-dm0.2ni.203.150.IP] has joined #code |
01:54 | | mode/#code [+o himi] by ChanServ |
04:21 | | macdjord|slep [macdjord@Nightstar-r9vt2h.mc.videotron.ca] has joined #code |
04:21 | | mode/#code [+o macdjord|slep] by ChanServ |
04:24 | | mac [macdjord@Nightstar-r9vt2h.mc.videotron.ca] has quit [Ping timeout: 121 seconds] |
04:47 | | macdjord [macdjord@Nightstar-r9vt2h.mc.videotron.ca] has joined #code |
04:47 | | mode/#code [+o macdjord] by ChanServ |
04:47 | | macdjord|slep [macdjord@Nightstar-r9vt2h.mc.videotron.ca] has quit [Ping timeout: 121 seconds] |
05:45 | | Derakon [chriswei@Nightstar-5mvs4e.ca.comcast.net] has quit [Ping timeout: 121 seconds] |
05:48 | | catadroid` is now known as catadroid |
06:17 | | catadroid` [catadroid@Nightstar-lg8jfa.dab.02.net] has joined #code |
06:20 | | catadroid [catadroid@Nightstar-onh719.dab.02.net] has quit [Ping timeout: 121 seconds] |
06:21 | | * Vornicus vornballs |
06:37 | | catadroid` is now known as catadroid |
06:45 | | Kindamoody|autojoin is now known as Kindamoody |
07:25 | | ion_ [Owner@Nightstar-oj1.09k.65.184.IP] has joined #code |
07:28 | | ion [Owner@Nightstar-oj1.09k.65.184.IP] has quit [Ping timeout: 121 seconds] |
07:50 | | Kindamoody is now known as Kindamoody|afk |
09:00 | | himi [sjjf@Nightstar-dm0.2ni.203.150.IP] has quit [Ping timeout: 121 seconds] |
09:59 | | Vornicus [Vorn@ServerAdministrator.Nightstar.Net] has quit [Ping timeout: 121 seconds] |
11:05 | | himi [sjjf@Nightstar-v37cpe.internode.on.net] has joined #code |
11:05 | | mode/#code [+o himi] by ChanServ |
11:43 | | catadroid [catadroid@Nightstar-lg8jfa.dab.02.net] has quit [Ping timeout: 121 seconds] |
11:44 | | catadroid [catadroid@Nightstar-lg8jfa.dab.02.net] has joined #code |
12:36 | | catalyst [catalyst@Nightstar-bt5k4h.81.in-addr.arpa] has joined #code |
12:40 | | catadroid [catadroid@Nightstar-lg8jfa.dab.02.net] has quit [Ping timeout: 121 seconds] |
13:39 | | M-E [Emmy@Nightstar-9p7hb1.direct-adsl.nl] has joined #code |
14:57 | < catalyst> | https://twitter.com/indiealexh/status/769084107229958144 |
15:13 | | Derakon [chriswei@Nightstar-5mvs4e.ca.comcast.net] has joined #code |
15:13 | | mode/#code [+ao Derakon Derakon] by ChanServ |
15:39 | | catalyst [catalyst@Nightstar-bt5k4h.81.in-addr.arpa] has quit [[NS] Quit: Leaving] |
15:53 | | Vornicus [Vorn@ServerAdministrator.Nightstar.Net] has joined #code |
15:53 | | mode/#code [+qo Vornicus Vornicus] by ChanServ |
16:02 | <~Vornicus> | oh ffs. |
16:03 | <~Vornicus> | Okay I need to remove a file entirely from git, including all of history |
16:04 | <&Derakon> | http://stackoverflow.com/questions/3458685/how-can-i-completely-remove-a-file-fr om-a-git-repository |
16:05 | <&Derakon> | The most important Good Thing about git is that basically any task you want to do with it, someone has already asked StackOverflow for help with~ |
16:14 | <~Vornicus> | heh |
16:15 | <@abudhabi> | Just about any popular technology can be substituted here. |
16:16 | <&Derakon> | Ehh, it's more true for Git than anything else I've ever used. |
16:51 | | kourbou [rouk@Nightstar-deqg8j.fbx.proxad.net] has joined #code |
16:56 | | catadroid [catadroid@Nightstar-fbiii1.dab.02.net] has joined #code |
17:33 | | catadroid [catadroid@Nightstar-fbiii1.dab.02.net] has quit [The TLS connection was non-properly terminated.] |
17:33 | | catadroid [catadroid@Nightstar-fbiii1.dab.02.net] has joined #code |
17:36 | | catalyst [catalyst@Nightstar-bt5k4h.81.in-addr.arpa] has joined #code |
17:39 | | catadroid [catadroid@Nightstar-fbiii1.dab.02.net] has quit [Ping timeout: 121 seconds] |
17:48 | | kourbou [rouk@Nightstar-deqg8j.fbx.proxad.net] has quit [[NS] Quit: leaving] |
19:01 | <&VirusJTG> | FYI, looks like there is a farked copy of the visual studio 2013 iso out there on Microsoft's licensing website. |
19:01 | <&VirusJTG> | The iso is corrupted some one and installing from it, even if mounted as a drive, i not possible. |
19:01 | <&VirusJTG> | some how |
19:01 | <&VirusJTG> | not some one |
19:32 | | celticminstrel [celticminst@Nightstar-ehtgrr.dsl.bell.ca] has quit [Connection reset by peer] |
19:33 | | celticminstrel [celticminst@Nightstar-ehtgrr.dsl.bell.ca] has joined #code |
19:33 | | mode/#code [+o celticminstrel] by ChanServ |
20:28 | | gizmore [kvirc@Nightstar-86jfb4.dip0.t-ipconnect.de] has joined #code |
21:01 | | gizmore [kvirc@Nightstar-86jfb4.dip0.t-ipconnect.de] has quit [[NS] Quit: KVIrc 4.9.2 Aria http://www.kvirc.net/] |
21:42 | | ricer [ricer@Nightstar-52ic2g.wechall.net] has joined #code |
22:16 | | VirusJTG [VirusJTG@Nightstar-6i5vf7.sta.comporium.net] has quit [Connection closed] |
22:28 | | VirusJTG [VirusJTG@Nightstar-6i5vf7.sta.comporium.net] has joined #code |
22:28 | | mode/#code [+ao VirusJTG VirusJTG] by ChanServ |
22:35 | | Kindamoody|afk is now known as Kindamoody |
22:46 | | Kindamoody is now known as Kindamoody[zZz] |
22:54 | | VirusJTG [VirusJTG@Nightstar-6i5vf7.sta.comporium.net] has quit [Connection closed] |
22:54 | | VirusJTG [VirusJTG@Nightstar-6i5vf7.sta.comporium.net] has joined #code |
22:54 | | mode/#code [+ao VirusJTG VirusJTG] by ChanServ |
23:15 | <@celticminstrel> | I find myself in need of a way to minimize the area used by a series of rectangles, but it's not the obvious 2D bin-packing problem because the rectangles are ordered - like a series of inline-block divs in HTML+CSS. |
23:16 | <~Vornicus> | Got an example? |
23:16 | <@celticminstrel> | Uh, how should I phrase an example. |
23:17 | <@celticminstrel> | Like a set of boxes and their sizes or something? |
23:18 | <@celticminstrel> | The specific case has the boxes all the same size, but I want to avoid assuming that they're the same width, at least. |
23:18 | <~Vornicus> | yeah. |
23:19 | <@celticminstrel> | Okay, I'll brew up a list. |
23:21 | <&Derakon> | Would "trying to fit a bunch of sprites into a sprite sheet" be a good analogy? |
23:21 | <&Derakon> | Because there's sprite-sheet-making software out there~ |
23:22 | <&Derakon> | I guess those are unlikely to preserve order though. |
23:23 | | himi [sjjf@Nightstar-v37cpe.internode.on.net] has quit [Connection closed] |
23:31 | <@celticminstrel> | Derakon: Yeah, that's what I found in google, but it doesn't preserve order.. |
23:31 | <@celticminstrel> | My sample list is widths {55, 87, 104, 102, 77, 95, 96, 98, 94, 80, 104, 116, 158}, heights all 26. |
23:34 | | * Vornicus fiddles |
23:35 | <~Vornicus> | is it likely to be a long list |
23:35 | <~Vornicus> | like, hundreds? thousands? |
23:36 | <@celticminstrel> | Probably not that long, no. |
23:36 | <~Vornicus> | oh. also, duh, why is "just put them all on the same line" not an acceptable answer? That will have guaranteed no slop. |
23:36 | <@celticminstrel> | I want to try to keep both width and height minimal. |
23:36 | <@celticminstrel> | Actually the important part is just getting the size of the minimal rectangle. |
23:37 | <~Vornicus> | right but -- there's no slop space in "everything on the same line" |
23:37 | <@celticminstrel> | But it's maximal width. |
23:37 | <~Vornicus> | it'd be, you know, 55 + 87 + ... etc wide, ad 26 tall. |
23:37 | <&Derakon> | For your test data set, assuming my bruteforce script doesn't have any bugs, the best line length is 158. |
23:37 | <&Derakon> | Which is the length of the longest element in your test data. |
23:38 | <&Derakon> | I just brute-forced it out to a potential line length of 158 * 300. |
23:38 | <@celticminstrel> | Hmm... interesting. |
23:38 | <&Derakon> | Script: http://pastebin.com/baaeHsGP |
23:39 | <&Derakon> | That doesn't take long to run, so I think brute-force is honestly your best bet here. |
23:40 | <~Vornicus> | That ...doesn't seem to be the right answer, actually |
23:40 | <@celticminstrel> | I do think it sounds like an odd answer. |
23:41 | <&Derakon> | Do we have any options besides just slapping down boxes in order and then starting a new row every once in awhile? |
23:41 | <@celticminstrel> | That sounds pretty much what happens. |
23:42 | <@celticminstrel> | It looks like your algorithm is trying to minimize wasted space, which isn't quite what I was going for. |
23:42 | <~Vornicus> | I'm still not clear on what you're looking for. |
23:42 | <&Derakon> | Oh, you want to minimize the total area of the containing rect. Okay. |
23:42 | <&Derakon> | So minimize (number of rows) * (length of row). |
23:43 | <~Vornicus> | Minimizing wasted space is the same as minimizing area, because you have fixed area of inputs. |
23:43 | <@celticminstrel> | I think minimizing dimensions is more accurate. |
23:43 | <@celticminstrel> | Though not sure if that's different. |
23:43 | <~Vornicus> | minimizing *perimeter* is something that can be done. |
23:43 | <@celticminstrel> | Minimized perimeter, I guess you could say. |
23:44 | <~Vornicus> | okay let me see what I can come up with for that. |
23:44 | <&Derakon> | Heh, my first iteration says "use a row count of 1266". |
23:44 | <~Vornicus> | pfff |
23:45 | <&Derakon> | Try a row length of 650. |
23:45 | <&Derakon> | That's 2 rows, so 52x650. |
23:46 | <&Derakon> | http://pastebin.com/Kc0BrsKS |
23:47 | <&Derakon> | NB that script is minimizing area. |
23:47 | <&Derakon> | Minimizing perimeter instead gives a row length of 198, and 8 rows. |
--- Log closed Tue Aug 30 00:00:38 2016 |