=begin Andreas Grau schrieb: > BTW, a trivial optimization would be to test matching of the regexp using > fast DFA/NFA automat and in case of a matching, use backtracking... The new Ruby regex interpreter Oniguruma works on "very ex...WoNaDo (Wolfgang Nádasi-Donner)
=begin As far as I understand this Ticket can be closed. If RubyVM::InstructionSequence.compile_option exists (defined? RubyVM::InstructionSequence.compile_option) and the value is "true" a program can expect a working tail recursion op...WoNaDo (Wolfgang Nádasi-Donner)
=begin Nobuyoshi Nakada schrieb: > Hi, > > At Mon, 9 Mar 2009 02:41:55 +0900, > Wolfgang Nádasi-Donner wrote in [ruby-core:22748]: >> Tail recursion optimization is an implementation detail and >> not a language feature in genera...WoNaDo (Wolfgang Nádasi-Donner)
=begin Shyouhei Urabe schrieb: > I'm curious, how you can be happy if you detect your VM supports tail-call optimization or not (from your script)? > > I think you have to write without tail-calls anyway for compatibilities with tho...WoNaDo (Wolfgang Nádasi-Donner)
=begin Ruby 1.9 has the possibility to support tail recursion optimization for methods and proc objects. Due to technical problems it cannot be easy implemented for every VM or platform, which will support Ruby 1.9 functionality.
=begin Yukihiro Matsumoto schrieb: > To substitute one backslash into two, you have to do > > s.gsub!("\\","\\\\\\") ... myprompt> irb191-p0 irb(main):001:0> puts "a\\b".gsub!("\\","\\\\\\") a\\b => nil irb(main):002:0> puts...WoNaDo (Wolfgang Nádasi-Donner)
=begin It should be possible to use relative group references in back reference with nest level.
Reason: As named in Ticket 1200 relative group references can be very helpful in writing subexpessions, which can be used later on as...WoNaDo (Wolfgang Nádasi-Donner)
WoNaDo (Wolfgang Nádasi-Donner)10:32 PM Ruby Bug #1301: Poor RegExp Matching Performance