It would have been interesting to compare numbers if some of the teams would have thrown their project to e.g. Kickstarter or sold it directly to consumers via Steam or similar service.
354 karma · joined February 1, 2011
It would have been interesting to compare numbers if some of the teams would have thrown their project to e.g. Kickstarter or sold it directly to consumers via Steam or similar service.
I don't know about the masses, but at least that was the biggest reason in my circles why people were excited to have Chrome on iOS.
Secondly, IANAL and I might be mistaken, but I'm under the impression that the current case is solely about whether Samsung violates the patents or not. The validity of the patents themselves would have to be argued in a separate court case.
I know it sounds superficial, but I'd love a CoffeeScript-like alternative syntax for Haxe. That would probably elevate it to the number one language choice for game programming for me.
What the quoted bit boils down to is that any function that returns normally can be converted into a function that calls a callback, but not the other way around.
- James Hague's "Programming in the 21st Century": http://prog21.dadgum.com/
- Edward Z. Yang's blog: http://blog.ezyang.com/
Rest of my daily blog hits I get via Hacker News and reddit/r/haskell
Also, in practice, most technical terms are borrowed from English, instead of inventing native, Finnish words for them.
However, Scala was the "gateway" language that helped me grok the core functional concepts after a long history of doing just OOP.
type Dict = Set String
hasWord :: Dict -> String -> Bool
hasWord = flip Set.member
fmtWords :: [[String]] -> Maybe String
fmtWords = fmap (intercalate " ") . listToMaybe
splitWordsSimple :: Dict -> String -> Maybe String
splitWordsSimple dct = fmtWords . go where
go [] = return []
go s = do
(i,t) <- zip (inits s) (tails s)
guard $ hasWord dct i
(i:) <$> go t
splitWordsDP :: Dict -> String -> Maybe String
splitWordsDP dct s = fmtWords $ a ! 0 where
a = listArray (0, len) $ map f [0..len-1] ++ [[[]]]
len = length s
f i = do
l <- [1..len-i]
let w = take l $ drop i s
guard $ hasWord dct w
(w:) <$> a ! (i+l)I tried to make it short, but still somewhat readable, so it's not completely "golfed".