Talk:Day of the week: Difference between revisions

Content added Content deleted
(→‎Deleting examples: I missed the 32 bit/2038 thing.)
Line 171: Line 171:


I removed the <code>Time::Local</code> version because it doesn't work because on 32-bit machines due to the year 2038 problem (look at the sample output). I removed another two examples because they varied from the last example only in ways that had nothing to do with the task. I'm a big believer in TIMTOWTDI, but I see the idea behind that principle being that you can pick whatever method you like, not that you should pick multiple redundant methods. It seems obvious to me that when multiple solutions are provided for a single language, they should vary in ways that are ''relevant to the task''—see, for example, how so many languages have multiple solutions for [[Fibonacci sequence]], since (a) the task is understood to be a demonstration of looping, so showing how your language does iteration and recursion is wholly appropriate, and (b) there are a number of drastically different alternative approaches. If we allow those three different versions of essentially the same program here, I see no argument why every Perl program in Rosetta Code that has a while loop couldn't be accompanied by a nearly identical version that uses an until loop. Let's try to keep the signal-to-noise ratio high. —[[User:Underscore|Underscore]] ([[User talk:Underscore|Talk]]) 22:27, 31 July 2010 (UTC)
I removed the <code>Time::Local</code> version because it doesn't work because on 32-bit machines due to the year 2038 problem (look at the sample output). I removed another two examples because they varied from the last example only in ways that had nothing to do with the task. I'm a big believer in TIMTOWTDI, but I see the idea behind that principle being that you can pick whatever method you like, not that you should pick multiple redundant methods. It seems obvious to me that when multiple solutions are provided for a single language, they should vary in ways that are ''relevant to the task''—see, for example, how so many languages have multiple solutions for [[Fibonacci sequence]], since (a) the task is understood to be a demonstration of looping, so showing how your language does iteration and recursion is wholly appropriate, and (b) there are a number of drastically different alternative approaches. If we allow those three different versions of essentially the same program here, I see no argument why every Perl program in Rosetta Code that has a while loop couldn't be accompanied by a nearly identical version that uses an until loop. Let's try to keep the signal-to-noise ratio high. —[[User:Underscore|Underscore]] ([[User talk:Underscore|Talk]]) 22:27, 31 July 2010 (UTC)

:Thanks, I've learned something more today. So maybe keep '''a''' DateTime version, together with a note that it is on CPAN and that built-in Time::Local is not being used due to these problems on 32 bit machines? --[[User:Paddy3118|Paddy3118]] 23:50, 31 July 2010 (UTC)
Retrieved from "https://rosettacode.org/wiki/Talk:Day_of_the_week"