Hello

As you all know, I'm a true red ruby coder now, so I decided to set up a thread for us Rubiers.  Anyways, I'll start by asking a quick question.

Here is my code showing off my understanding of how lambda functions work, and I was wondering -- at the point of the while loop between the while and the end (of the nested lambda) , would the fixing of the string be returned simply?  or would it just keep on looping, or both (set the return item to be the string, but keep going)?  Here is the code, which is a Ruby version of a Cemetech-style 'L O L' to '0x5' converter:

StringFunction = lambda {|stringInput, pat, rep| #outwards lambda
  replaceAll = lambda {|inputString, pattern, replacement| #nested
    while inputString.sub!(pattern, replacement)
      inputString = inputString.sub(pattern, replacement)
    end
  }
  replaceAll.call(stringInput, pat, rep)
}

String NonLolzed = StringFunction.call(gets.chomp, " lol ", " 0x5 ")
#finally use all those lambdas :roll:
puts NonLulzed
It should work if it doesn't immediately return after the setting on line 4.

EDIT: added a small 'puts xxxx' for quick debugging

I'm running through this and so far it seems to be much the same thing as python with slightly different sntax on the builtin functions

I most of the way thorugh the turorial and so far I've only seen a few major differences. IMO python seems easier to use

This looks like an interesting twist on the same idea though. so I'll finish up these tutorials

How do things like this work books.values.each { |rate| ratings[rate] += 1 }. what is the syntax for them?

I prefer to write little modules for most thins I do a lot in my different programs

I hope this is not a quadratic solver

I spotted the word Math, sqrt and the letters a b and c, and I figured it might be a math program, and since there are often Quadratic solver jokes in the TI community, I guessed it was one.

I just looked at the first two lines of code and it is a quadratic solver :O
why do you need that much code for a quadratic solver?