Happy Birthday Adam and Herd!

Oops, I missed this one (a) Happy b-day!

even though 1/2 the time i have no idea what he's saying. he's one step from talking in binary,,,,

lol

type Name = String

type Board = (Name,Friends)

boards = [("GfxOasis",..),("Aqua-Soft",..),("NeoWin",...)]



thankFriendsOnBoard :: [Boards] -> String -> [Friends]

thankFriendsOnBoard b n = concat (map thank (filter equalsBoardName b 

		where equalsBoardName (s,_) = s == n) 

		where thank (_,f) =  concat (map thankFriend f where thankFriend (f,_) = (f,"thanked") ))



> thankFriendsOnBoard boards "Aqua-Soft"

Now, isn't this much more pleasing than that ugly piece of VB code you posted there?

#253836

Maybe VB is ugly but at least I understood that. How can I know that your code isn't offensive?

#253837

  type Name = String
  type Board = (Name,Friends)
  boards = [("GfxOasis",..),("Aqua-Soft",..),("NeoWin",...)]

  thankFriendsOnBoard :: [Boards] -> String -> [Friends]
  thankFriendsOnBoard b n = concat (map thank (filter equalsBoardName b 
		  where equalsBoardName (s,_) = s == n) 
 		where thank (_,f) = concat (map thankFriend f where thankFriend (f,_) = (f,"thanked") ))

  > thankFriendsOnBoard boards "Aqua-Soft"

I didn`t know u speak Swahilli

#253842

Wow somebody turned the Backus-Naur form (for describing computer languages) into a language capable of describing itself. The implied recursions make my head go off like popcorn.

#253843

He's gone binary

#253845

Wow somebody turned the Backus-Naur form (for describing computer languages) into a language capable of describing itself. The implied recursions make my head go off like popcorn.

Which we call Haskell

#253851