There's a term for it: soramimi
Not a soramimi, but more of a bunch of mondegreens (and IMHO very funny. Possibly NSFW): http://uk.youtube.com/watch?v=7-ZnPE3G_YY
There's a term for it: soramimi
Not a soramimi, but more of a bunch of mondegreens (and IMHO very funny. Possibly NSFW): http://uk.youtube.com/watch?v=7-ZnPE3G_YY
@rc_pinchey said:
6) Swear very very loudly when XP insists on showing an animation of the dog WALKING SLOWLY AWAY.
@Control_Alt_Kaboom said:
damn...
I was sure I knew the name of the person with the anonymous avatar with the googly eyes. but it turns out I didn't.
Would it be possible for the forum software to disable posters from rating their own submissions? Considering that it's CapitalT's first post, I honestly believe it wasn't intentional.
The good news is that Microsoft now has at least one browser-independent web page.
I like how they then tried to solve it - by setting the background colour of that text to a very dark purple. Surely it won't be long before they discover that it's even harder to see on a black background.
[quote user="nick8325"]
[quote user="Autonuke"]
howManyEqual only makes sense for 2 or 3 numbers, so using a list would be overkill.
[/quote]
Does it? Why's that? It seems to make sense for any amount of numbers to me...howManyEqual should find the size of the biggest equivalence class in a set, in other words the biggest number of same elements which appear in the set.
Actually, come to think of it, that's not what the original howManyEqual does, because it'll return 0 if all three elements are different, but the list/equivalence-class version will return 1 (since anything is at least equal to itself). IMO 1 is a more sensible answer, but I didn't realise it was different earlier...
[quote user="nick8325"]
Patterns are matched top-to-bottom, so if (a == b) && (b == c), the other patterns will be ignored. So there's no need for all those nots:
howManyEqual a b c | a == b && b == c = 3 | a == b || b == c || a == c = 2 | otherwise = 0
Also, I might write howManyOfTwoEqual directly:
howManyOfTwoEqual a b = if a == b then 2 else 0
By the way, if you use lists you can make howManyEqual work for any number of items, but I don't know if you know enough Haskell yet:
howManyEqual = maximum . map length . group . sort
(you'll need to write import Data.List at the top of your source file). Given a list, say [2,3,4,2,4,2], this function sorts the list (giving [2,2,2,3,4,4]), splits it up into groups of equal elements (giving [[2,2,2], [3], [4,4]]), finds the length of each group (giving [3, 1, 2]) and then finds the biggest length (giving 3). But don't worry about all this until you've learned about lists and higher-order functions :)
[/quote]When writing to management, I've had very good results just by applying the correct formatting. E.g. "3 hours" vs. "could take weeks". A manager's brain is simpler than us geeks can ever hope to understand.