code logs -> 2019 -> Mon, 30 Sep 2019< code.20190929.log - code.20191001.log >
--- Log opened Mon Sep 30 00:00:08 2019
01:22 Pink [user1@Nightstar-g7hdo5.dyn.optonline.net] has quit [Ping timeout: 121 seconds]
01:23 Pink [user1@Nightstar-g7hdo5.dyn.optonline.net] has joined #code
01:34
<@celticminstrel>
I feel like using the width attribute to make a table cell take minimum space is not really correct?
01:35
<&[R]>
Given that such a thing is the default, I agree
01:35
<@celticminstrel>
IIRC, the old HTML4 width attribute had something like width="*" for this purpose (maybe it was something other than *, the main point was that it wasn't an actual number). I don't remember how to get the same effect with CSS tho.
01:38
<&[R]>
https://stackoverflow.com/questions/26983301/how-to-make-a-table-column-be-a-minimum-width <-- apparently it is a suggested solution though
01:48
<&ToxicFrog>
Yeah, it's definitely not "the default", by default all the cells try to equally share the space no matter how much they actually need and it looks hideous
01:48
<&[R]>
I didn't notice you had specified a width to the table when I made that comment
01:55 Vornicus [Vorn@ServerAdministrator.Nightstar.Net] has joined #code
01:55 mode/#code [+qo Vornicus Vornicus] by ChanServ
02:09
<@sshine>
hmm
02:10
<@sshine>
at Exercism we have this hard problem of showing "community solutions" to a problem, which often amounts to 20.000 variations of very simple problems.
02:11
<@sshine>
it'd be neat to be able to classify solutions as either alike or unlike the one you're currently looking at so as to be able to provide a more distinct overview of the span of solutions.
02:11
<@sshine>
it seems that most code similarity algorithms focus on plagiarism or duplication.
02:12
<&McMartin>
That seems like it would be a fine starting point.
02:12
<@sshine>
what seems?
02:12
<@sshine>
oh, right!
02:12
<&McMartin>
Anti-plagiarism.
02:12
<&McMartin>
Most solutions are 98% similar to each other or more even when not plagiarized, simply by dint of solving the same problem.
02:13
<&McMartin>
But if you're looking for *wildly different approaches* I'd expect there to be clusters of very similar answers where leaving the cluster makes similarity noticably drop.
02:13
<@sshine>
right
02:13
<@sshine>
I seem to recall one professor doing a simple plagiarism check by way of... I don't even know... hamming distance?
02:14
<@sshine>
it was something super simple and inefficient (I need something efficient, though).
02:14
<&McMartin>
You may be thinking of the professor Alex Aiken?
02:14
<&McMartin>
If not, I think he wrote some tools for this stuff like 20 years ago
02:15
<@sshine>
ah, no, it was Andrzej Filinski: http://hjemmesider.diku.dk/~andrzej/
02:16 catalyst [catalyst@Nightstar-5dv16h.cable.virginm.net] has joined #code
02:16
<&[R]>
Man, people who have their phone numbers online are super trusting
02:17
<@sshine>
I don't even list *anywhere* my employer's name.
02:18
<@sshine>
so when I look around for plagiarism articles and code, I get super confused. most of it is focused on software that detects plagiarism in human language.
02:18
<@sshine>
ah, found some.
02:18
<@sshine>
just a sec.
02:19
<&McMartin>
https://theory.stanford.edu/~aiken/moss/ is the one I was thinking of
02:19
<&McMartin>
Had to dig through a lot of dead links to find the one that works.
02:20
<@sshine>
also, a lot of plagiarism of source code deals with finding needles in haystacks.
02:20
< catalyst>
I've now been working on the same codebase for 23 days
02:20
< catalyst>
I think I got it back
02:20
<@sshine>
catalyst, where did it go?
02:20
<@sshine>
McMartin, wow, thanks for that link!
02:20
< catalyst>
I burned out years ago and I've been running low for a long time
02:21
< catalyst>
took a long break
02:21
<&McMartin>
sshine: This may not be what they want though because it's apparently an "internet service" isntead of a thing you can run on a fixed corpus? Maybe there are other bits.
02:22
<~Vornicus>
I once considered writing a bot to give specific criticisms of exercism solutions but determined that I didn't know anywhere near enough about source code analysis to do it
02:25
< Mahal>
Real phone number, or Google Voice number, though?
02:25
< Mahal>
the latter seems a bit safer
02:31
<&[R]>
" However, Moss is for non-commercial use. If you are interested in commercial uses of Moss, contact Similix Corporation."
02:31
<@Reiv>
catalyst: It's grand to hear you've got the mojo back :)
02:31
<@Reiv>
Are you working on a personal project, or something paid?
02:31
<@sshine>
McMartin, what do you mean by "internet service"? is this a possible license problem or a possible use-case problem?
02:32
<@sshine>
[R], Exercism is a non-commercial project, though.
02:32
<&[R]>
sshine: Search for "An Internet Service" that section and the one after it
02:34
<@sshine>
oh >_<
02:34
<@sshine>
at least they link to a paper on some of the ideas behind Moss.
02:36
<&McMartin>
Yeah. That said, for fixed corpuses, it might still be usable.
02:37
<&McMartin>
If it lets you say "here are 20,000 solutions, give me measures of software similarity" that might be a one-shot solution.
02:38
< catalyst>
Reiv: personal stuff for the moment :)
02:39
<@Reiv>
nifty
03:44 catalyst [catalyst@Nightstar-5dv16h.cable.virginm.net] has quit [Connection closed]
05:06 Vornicus [Vorn@ServerAdministrator.Nightstar.Net] has quit [Connection closed]
05:08 Vorntastic [uid293981@Nightstar-6br85t.irccloud.com] has joined #code
05:08 mode/#code [+qo Vorntastic Vorntastic] by ChanServ
05:22 gnolam [quassel@Nightstar-csto10.cust.bahnhof.se] has joined #code
05:22 mode/#code [+o gnolam] by ChanServ
06:33 celticminstrel [celticminst@Nightstar-ocfc15.dsl.bell.ca] has quit [[NS] Quit: And lo! The computer falls into a deep sleep, to awake again some other day!]
06:49
<&Reiver>
(Fwiw, I'm not asking because I presume if you wanted to share you'd say so, so it's either Sekret or Incomprehensible, and both are entirely respectable choices~)
07:14 * Vorntastic blings
07:16 * Reiver gives Vorntastic a dubloon
07:17 * Vorntastic dublings?
07:49
<&Reiver>
:D
07:49
<&Reiver>
how you doin' vorny
07:55
<~Vorntastic>
Pretty good. Trying to convince mobile Excel to do things. Unfortunately it cannot
07:56
<~Vorntastic>
(array formulas like transpose can't be created)
08:09
<&Reiver>
oh really? :/
08:10
<~Vorntastic>
Also array reshape doesn't exist in Excel at all
08:14
<&Reiver>
I wonder if this is a memory-preservation technique for mobiles
08:16
<~Vorntastic>
More likely they couldn't figure out how to reveal it
08:20
<~Vorntastic>
Not having Ctrl shift alt meta bucky available makes it hard
08:21
<&Reiver>
truth
10:50 Degi [Degi@Nightstar-so0es3.dyn.telefonica.de] has joined #code
11:37 Kindamoody[zZz] is now known as Kindamoody
13:37 celticminstrel [celticminst@Nightstar-ocfc15.dsl.bell.ca] has joined #code
13:37 mode/#code [+o celticminstrel] by ChanServ
14:27 Reiver [quassel@Nightstar-ksqup0.co.uk] has quit [[NS] Quit: Reblooting.]
16:22 Vornicus [Vorn@ServerAdministrator.Nightstar.Net] has joined #code
16:22 mode/#code [+qo Vornicus Vornicus] by ChanServ
16:51 Emmy [Emmy@Nightstar-9p7hb1.direct-adsl.nl] has joined #code
17:05 Degi [Degi@Nightstar-so0es3.dyn.telefonica.de] has quit [Connection closed]
17:19 Vorntastic [uid293981@Nightstar-6br85t.irccloud.com] has quit [[NS] Quit: Connection closed for inactivity]
18:24 Vornicus [Vorn@ServerAdministrator.Nightstar.Net] has quit [Connection closed]
21:43 Vornicus [Vorn@ServerAdministrator.Nightstar.Net] has joined #code
21:43 mode/#code [+qo Vornicus Vornicus] by ChanServ
23:08 gnolam [quassel@Nightstar-csto10.cust.bahnhof.se] has quit [[NS] Quit: Z?]
23:33 Emmy [Emmy@Nightstar-9p7hb1.direct-adsl.nl] has quit [Ping timeout: 121 seconds]
23:34 Kindamoody is now known as Kindamoody[zZz]
23:58 VirusJTG_ [VirusJTG@Nightstar-42s.jso.104.208.IP] has quit [[NS] Quit: Leaving]
23:58 VirusJTG [VirusJTG@Nightstar-42s.jso.104.208.IP] has joined #code
23:58 mode/#code [+ao VirusJTG VirusJTG] by ChanServ
--- Log closed Tue Oct 01 00:00:09 2019
code logs -> 2019 -> Mon, 30 Sep 2019< code.20190929.log - code.20191001.log >

[ Latest log file ]