lib/fa.rb
# Return the representation of +self+ as a regular expression. Note
# that that regular expression can look pretty complicated, even for
# seemingly simple automata. Sometimes, minimizing the automaton before
# turning it into a string helps; sometimes it doesn't.
#
# @return [String] the regular expression for +self+
Return the representation of +self+ as a regular expression. Note
that that regular expression can look pretty complicated, even for
seemingly simple automata. Sometimes, minimizing the automaton before
turning it into a string helps; sometimes it doesn't.
Return the representation of + self + as a regular expression . Note that that regular expression can look pretty complicated even for seemingly simple automata . Sometimes minimizing the automaton before turning it into a string helps ; sometimes it doesn ' t .
def to_s
      rx = ::FFI::MemoryPointer.new :string
      rx_len = ::FFI::MemoryPointer.new :size_t
      r = FFI::as_regexp(faptr, rx, rx_len)
      raise OutOfMemoryError if r < 0
      str_ptr = rx.read_pointer()
      return str_ptr.null? ? nil : str_ptr.read_string()
    end
def to_s rx = :: FFI :: MemoryPointer . new :string rx_len = :: FFI :: MemoryPointer . new :size_t r = FFI :: as_regexp ( faptr , rx , rx_len ) raise OutOfMemoryError if r < 0 str_ptr = rx . read_pointer ( ) return str_ptr . null? ? nil : str_ptr . read_string ( ) end
Return the representation of +self+ as a regular expression.
Return the representation of + self + as a regular expression .
the regular expression for +self+
the regular expression for + self +
String