rbs 4.0.0.dev.4 → 4.1.0.pre.2

data/core/enumerator/arithmetic_sequence.rbs

@@ -0,0 +1,70 @@
+# <!-- rdoc-file=enumerator.c -->
+# Enumerator::ArithmeticSequence is a subclass of Enumerator, that is a
+# representation of sequences of numbers with common difference. Instances of
+# this class can be generated by the Range#step and Numeric#step methods.
+#
+# The class can be used for slicing Array (see Array#slice) or custom
+# collections.
+#
+class Enumerator::ArithmeticSequence < Enumerator[Numeric]
+  # <!--
+  #   rdoc-file=enumerator.c
+  #   - aseq.begin -> num or nil
+  # -->
+  # Returns the number that defines the first element of this arithmetic sequence.
+  #
+  def begin: () -> Numeric?
+
+  # <!--
+  #   rdoc-file=enumerator.c
+  #   - aseq.end -> num or nil
+  # -->
+  # Returns the number that defines the end of this arithmetic sequence.
+  #
+  def end: () -> Numeric?
+
+  # <!--
+  #   rdoc-file=enumerator.c
+  #   - aseq.each {|i| block } -> aseq
+  #   - aseq.each              -> aseq
+  # -->
+  #
+  def each: () ?{ (Numeric) -> void } -> self
+
+  # <!--
+  #   rdoc-file=enumerator.c
+  #   - aseq.exclude_end? -> true or false
+  # -->
+  # Returns `true` if this arithmetic sequence excludes its end value.
+  #
+  def exclude_end?: () -> bool
+
+  # <!--
+  #   rdoc-file=enumerator.c
+  #   - aseq.last    -> num or nil
+  #   - aseq.last(n) -> an_array
+  # -->
+  # Returns the last number in this arithmetic sequence, or an array of the last
+  # `n` elements.
+  #
+  def last: () -> Numeric?
+          | (Integer n) -> Array[Numeric]
+
+  # <!--
+  #   rdoc-file=enumerator.c
+  #   - aseq.size -> num or nil
+  # -->
+  # Returns the number of elements in this arithmetic sequence if it is a finite
+  # sequence.  Otherwise, returns `nil`.
+  #
+  def size: () -> (Integer | Float)
+
+  # <!--
+  #   rdoc-file=enumerator.c
+  #   - aseq.step -> num
+  # -->
+  # Returns the number that defines the common difference between two adjacent
+  # elements in this arithmetic sequence.
+  #
+  def step: () -> Numeric
+end

data/core/enumerator/product.rbs

@@ -1,5 +1,5 @@
 %a{annotate:rdoc:skip}
-class Enumerator[unchecked out Elem, out Return = void]
+class Enumerator[unchecked out E, out R = void]
   # <!-- rdoc-file=enumerator.c -->
   # Enumerator::Product generates a Cartesian product of any number of enumerable
   # objects.  Iterating over the product of enumerable objects is roughly
@@ -30,7 +30,7 @@ class Enumerator[unchecked out Elem, out Return = void]
   #
   # This type of objects can be created by Enumerator.product.
   #
-  class Product[unchecked out Elem] < Enumerator[Array[Elem], Product[Elem]]
+  class Product[unchecked out E] < Enumerator[Array[E], Product[E]]
     # <!--
     #   rdoc-file=enumerator.c
     #   - Enumerator::Product.new(*enums) -> enum
@@ -42,7 +42,7 @@ class Enumerator[unchecked out Elem, out Return = void]
     #     e.to_a #=> [[1, 4], [1, 5], [2, 4], [2, 5], [3, 4], [3, 5]]
     #     e.size #=> 6
     #
-    def initialize: (*_EachEntry[Elem]) -> void
+    def initialize: (*_EachEntry[E]) -> void
 
     # <!--
     #   rdoc-file=enumerator.c
@@ -55,7 +55,7 @@ class Enumerator[unchecked out Elem, out Return = void]
     #
     # If no block is given, returns an enumerator.  Otherwise, returns self.
     #
-    def each: () { (Array[Elem]) -> void } -> self
+    def each: () { (Array[E]) -> void } -> self
 
     # <!--
     #   rdoc-file=enumerator.c
@@ -87,6 +87,6 @@ class Enumerator[unchecked out Elem, out Return = void]
 
     private
 
-    def initialize_copy: (Product[Elem]) -> void
+    def initialize_copy: (Product[E]) -> void
   end
 end

data/core/enumerator.rbs

@@ -125,19 +125,19 @@
 #     puts ext_each(o.to_enum) {|*x| puts x; [:b, *x] }
 #     # => [], [:b], [1], [:b, 1], [1, 2], [:b, 1, 2], 3
 #
-class Enumerator[unchecked out Elem, out Return = void] < Object
-  include Enumerable[Elem]
+class Enumerator[unchecked out E, out R = void] < Object
+  include Enumerable[E]
 
   # A convenience interface for `each` with optional block
   #
-  interface _Each[out E, out R]
-    def each: () { (E) -> void } -> R
-            | () -> Enumerator[E, R]
+  interface _Each[out T, out R]
+    def each: () { (T) -> void } -> R
+            | () -> Enumerator[T, R]
   end
 
   # <!--
   #   rdoc-file=enumerator.c
-  #   - Enumerator.produce(initial = nil) { |prev| block } -> enumerator
+  #   - Enumerator.produce(initial = nil, size: nil) { |prev| block } -> enumerator
   # -->
   # Creates an infinite enumerator from any block, just called over and over.  The
   # result of the previous iteration is passed to the next one. If `initial` is
@@ -169,6 +169,30 @@ class Enumerator[unchecked out Elem, out Return = void] < Object
   #     Enumerator.produce { scanner.scan(PATTERN) }.slice_after { scanner.eos? }.first
   #     # => ["7", "+", "38", "/", "6"]
   #
+  # The optional `size` keyword argument specifies the size of the enumerator,
+  # which can be retrieved by Enumerator#size.  It can be an integer,
+  # <code>Float::INFINITY</code>, a callable object (such as a lambda), or `nil`
+  # to indicate unknown size.  When not specified, the size defaults to
+  # <code>Float::INFINITY</code>.
+  #
+  #     # Infinite enumerator
+  #     enum = Enumerator.produce(1, size: Float::INFINITY, &:succ)
+  #     enum.size  # => Float::INFINITY
+  #
+  #     # Finite enumerator with known/computable size
+  #     abs_dir = File.expand_path("./baz") # => "/foo/bar/baz"
+  #     traverser = Enumerator.produce(abs_dir, size: -> { abs_dir.count("/") + 1 }) {
+  #       raise StopIteration if it == "/"
+  #       File.dirname(it)
+  #     }
+  #     traverser.size  # => 4
+  #
+  #     # Finite enumerator with unknown size
+  #     calendar = Enumerator.produce(Date.today, size: nil) {
+  #       it.monday? ? raise(StopIteration) : it + 1
+  #     }
+  #     calendar.size  # => nil
+  #
   def self.produce: [T] () { (T? prev) -> T } -> Enumerator[T, bot]
                   | [T] (T initial) { (T prev) -> T } -> Enumerator[T, bot]
 
@@ -187,7 +211,7 @@ class Enumerator[unchecked out Elem, out Return = void] < Object
   # When a block is given, calls the block with each N-element array generated and
   # returns `nil`.
   #
-  def self.product: [Elem] (*_EachEntry[Elem]) -> Product[Elem]
+  def self.product: [E] (*_EachEntry[E]) -> Product[E]
 
   # <!--
   #   rdoc-file=enumerator.c
@@ -224,7 +248,7 @@ class Enumerator[unchecked out Elem, out Return = void] < Object
   #     enum.each(:y, :z).equal?(enum)  #=> false
   #     enum.each(:y, :z) { |elm| elm } #=> :method_returned
   #
-  def each: () { (Elem arg0) -> untyped } -> Return
+  def each: () { (E arg0) -> untyped } -> R
           | () -> self
 
   # <!--
@@ -272,7 +296,7 @@ class Enumerator[unchecked out Elem, out Return = void] < Object
   #     e.next              # (7)
   #                         # (10)
   #
-  def feed: (Elem arg0) -> NilClass
+  def feed: (E arg0) -> NilClass
 
   # <!--
   #   rdoc-file=enumerator.c
@@ -282,7 +306,7 @@ class Enumerator[unchecked out Elem, out Return = void] < Object
   #
   # Iteration is defined by the given block, in which a "yielder" object, given as
   # block parameter, can be used to yield a value by calling the `yield` method
-  # (aliased as `<<`):
+  # (aliased as <code><<</code>):
   #
   #     fib = Enumerator.new do |y|
   #       a = b = 1
@@ -298,7 +322,7 @@ class Enumerator[unchecked out Elem, out Return = void] < Object
   # lazy fashion (see Enumerator#size). It can either be a value or a callable
   # object.
   #
-  def initialize: (?Integer arg0) { (Enumerator::Yielder arg0) -> Return } -> void
+  def initialize: (?Integer arg0) { (Enumerator::Yielder arg0) -> R } -> void
 
   # <!--
   #   rdoc-file=enumerator.c
@@ -326,7 +350,7 @@ class Enumerator[unchecked out Elem, out Return = void] < Object
   #
   # See class-level notes about external iterators.
   #
-  def next: () -> Elem
+  def next: () -> E
 
   # <!--
   #   rdoc-file=enumerator.c
@@ -370,7 +394,7 @@ class Enumerator[unchecked out Elem, out Return = void] < Object
   #     #  yield nil        [nil]            nil
   #     #  yield [1, 2]     [[1, 2]]         [1, 2]
   #
-  def next_values: () -> ::Array[Elem]
+  def next_values: () -> ::Array[E]
 
   # <!--
   #   rdoc-file=enumerator.c
@@ -394,7 +418,7 @@ class Enumerator[unchecked out Elem, out Return = void] < Object
   #     p e.next   #=> 3
   #     p e.peek   #raises StopIteration
   #
-  def peek: () -> Elem
+  def peek: () -> E
 
   # <!--
   #   rdoc-file=enumerator.c
@@ -424,7 +448,7 @@ class Enumerator[unchecked out Elem, out Return = void] < Object
   #     e.next
   #     p e.peek_values    # raises StopIteration
   #
-  def peek_values: () -> ::Array[Elem]
+  def peek_values: () -> ::Array[E]
 
   # <!--
   #   rdoc-file=enumerator.c
@@ -446,8 +470,39 @@ class Enumerator[unchecked out Elem, out Return = void] < Object
   #     loop.size # => Float::INFINITY
   #     (1..100).drop_while.size # => nil
   #
+  # Note that enumerator size might be inaccurate, and should be rather treated as
+  # a hint. For example, there is no check that the size provided to ::new is
+  # accurate:
+  #
+  #     e = Enumerator.new(5) { |y| 2.times { y << it} }
+  #     e.size # => 5
+  #     e.to_a.size # => 2
+  #
+  # Another example is an enumerator created by ::produce without a `size`
+  # argument. Such enumerators return `Infinity` for size, but this is inaccurate
+  # if the passed block raises StopIteration:
+  #
+  #     e = Enumerator.produce(1) { it + 1 }
+  #     e.size # => Infinity
+  #
+  #     e = Enumerator.produce(1) { it > 3 ? raise(StopIteration) : it + 1 }
+  #     e.size # => Infinity
+  #     e.to_a.size # => 4
+  #
   def size: () -> (Integer | Float)?
 
+  # <!--
+  #   rdoc-file=enumerator.c
+  #   - e + enum -> enumerator
+  # -->
+  # Returns an enumerator object generated from this enumerator and a given
+  # enumerable.
+  #
+  #     e = (1..3).each + [4, 5]
+  #     e.to_a #=> [1, 2, 3, 4, 5]
+  #
+  def +: [Elem2] (::_Each[Elem2]) -> ::Enumerator::Chain[E | Elem2]
+
   # <!--
   #   rdoc-file=enumerator.c
   #   - e.with_index(offset = 0) {|(*args), idx| ... }
@@ -460,8 +515,8 @@ class Enumerator[unchecked out Elem, out Return = void] < Object
   # `offset`
   # :   the starting index to use
   #
-  def with_index: (?Integer offset) { (Elem arg0, Integer arg1) -> untyped } -> Return
-                | (?Integer offset) -> ::Enumerator[[ Elem, Integer ], Return]
+  def with_index: (?Integer offset) { (E arg0, Integer arg1) -> untyped } -> R
+                | (?Integer offset) -> ::Enumerator[[ E, Integer ], R]
 
   # <!-- rdoc-file=enumerator.c -->
   # Iterates the given block for each element with an arbitrary object, `obj`, and
@@ -486,17 +541,17 @@ class Enumerator[unchecked out Elem, out Return = void] < Object
   #     # => foo: 1
   #     # => foo: 2
   #
-  def with_object: [U] (U obj) { (Elem, U obj) -> untyped } -> U
-                 | [U] (U obj) -> ::Enumerator[[ Elem, U ], U]
+  def with_object: [U] (U obj) { (E, U obj) -> untyped } -> U
+                 | [U] (U obj) -> ::Enumerator[[ E, U ], U]
 end
 
 # <!-- rdoc-file=enumerator.c -->
 # Generator
 #
-class Enumerator::Generator[out Elem] < Object
-  include Enumerable[Elem]
+class Enumerator::Generator[out E] < Object
+  include Enumerable[E]
 
-  def each: () { (Elem) -> void } -> void
+  def each: () { (E) -> void } -> void
 end
 
 # <!-- rdoc-file=enumerator.c -->
@@ -565,7 +620,7 @@ end
 #     # This returns an array of items like a normal enumerator does.
 #     all_checked = active_items.select(&:checked)
 #
-class Enumerator::Lazy[out Elem, out Return = void] < Enumerator[Elem, Return]
+class Enumerator::Lazy[out E, out R = void] < Enumerator[E, R]
   # <!-- rdoc-file=enumerator.c -->
   # Expands `lazy` enumerator to an array. See Enumerable#to_a.
   #
@@ -577,7 +632,15 @@ class Enumerator::Lazy[out Elem, out Return = void] < Enumerator[Elem, Return]
   # -->
   # Like Enumerable#compact, but chains operation to be lazy-evaluated.
   #
-  def compact: () -> Enumerator::Lazy[Elem, Return]
+  def compact: () -> Enumerator::Lazy[E, R]
+
+  # <!--
+  #   rdoc-file=enumerator.c
+  #   - lzy.eager -> enum
+  # -->
+  # Returns a non-lazy Enumerator converted from the lazy enumerator.
+  #
+  def eager: () -> ::Enumerator[E, R]
 end
 
 # <!-- rdoc-file=enumerator.c -->
@@ -612,7 +675,7 @@ end
 #
 # This type of objects can be created by Enumerable#chain and Enumerator#+.
 #
-class Enumerator::Chain[out Elem] < Enumerator[Elem, void]
+class Enumerator::Chain[out E] < Enumerator[E, void]
   # <!--
   #   rdoc-file=enumerator.c
   #   - Enumerator::Chain.new(*enums) -> enum
@@ -624,7 +687,7 @@ class Enumerator::Chain[out Elem] < Enumerator[Elem, void]
   #     e.to_a #=> [1, 2, 3, 4, 5]
   #     e.size #=> 5
   #
-  def initialize: (*_Each[Elem] enums) -> void
+  def initialize: (*_Each[E] enums) -> void
 
   # <!--
   #   rdoc-file=enumerator.c
@@ -637,6 +700,6 @@ class Enumerator::Chain[out Elem] < Enumerator[Elem, void]
   #
   # If no block is given, returns an enumerator.
   #
-  def each: () { (Elem) -> void } -> self
-          | () -> Enumerator[Elem, self]
+  def each: () { (E) -> void } -> self
+          | () -> Enumerator[E, self]
 end

data/core/errno.rbs

@@ -9,7 +9,7 @@
 #
 # When the Ruby interpreter interacts with the operating system and receives
 # such an error code (e.g., `2`), it maps the code to a particular Ruby
-# exception class (e.g., `Errno::ENOENT`):
+# exception class (e.g., <code>Errno::ENOENT</code>):
 #
 #     File.open('nosuch.txt')
 #     # => No such file or directory @ rb_sysopen - nosuch.txt (Errno::ENOENT)
@@ -25,7 +25,8 @@
 #     Errno::ENOENT.superclass # => SystemCallError
 #     Errno::ENOENT::Errno     # => 2
 #
-# The names of nested classes are returned by method `Errno.constants`:
+# The names of nested classes are returned by method
+# <code>Errno.constants</code>:
 #
 #     Errno.constants.size         # => 158
 #     Errno.constants.sort.take(5) # => [:E2BIG, :EACCES, :EADDRINUSE, :EADDRNOTAVAIL, :EADV]
@@ -38,6 +39,14 @@
 #     Errno::ENOENT::Errno      # => 2
 #     Errno::ENOTCAPABLE::Errno # => 0
 #
+# Each class in Errno can be created with optional messages:
+#
+#     Errno::EPIPE.new                  # => #<Errno::EPIPE: Broken pipe>
+#     Errno::EPIPE.new("foo")           # => #<Errno::EPIPE: Broken pipe - foo>
+#     Errno::EPIPE.new("foo", "here")   # => #<Errno::EPIPE: Broken pipe @ here - foo>
+#
+# See SystemCallError.new.
+#
 module Errno
   class NOERROR < SystemCallError
     Errno: 0

data/core/errors.rbs

@@ -6,7 +6,7 @@
 #
 #     [1, 2, 3].first(4, 5)
 #
-# *raises the exception:*
+# <em>raises the exception:</em>
 #
 #     ArgumentError: wrong number of arguments (given 2, expected 1)
 #
@@ -14,7 +14,7 @@
 #
 #     [1, 2, 3].first(-4)
 #
-# *raises the exception:*
+# <em>raises the exception:</em>
 #
 #     ArgumentError: negative array size
 #
@@ -66,7 +66,7 @@ end
 #
 #     [1, 2, 3].freeze << 4
 #
-# *raises the exception:*
+# <em>raises the exception:</em>
 #
 #     FrozenError: can't modify frozen Array
 #
@@ -115,11 +115,11 @@ end
 #       puts "Note: You will typically use Signal.trap instead."
 #     end
 #
-# *produces:*
+# <em>produces:</em>
 #
 #     Press ctrl-C when you get bored
 #
-# *then waits until it is interrupted with Control-C and then prints:*
+# <em>then waits until it is interrupted with Control-C and then prints:</em>
 #
 #     Note: You will typically use Signal.trap instead.
 #
@@ -184,7 +184,7 @@ end
 #
 #     require 'this/file/does/not/exist'
 #
-# *raises the exception:*
+# <em>raises the exception:</em>
 #
 #     LoadError: no such file to load -- this/file/does/not/exist
 #
@@ -209,7 +209,7 @@ end
 #     end
 #     call_block
 #
-# *raises the exception:*
+# <em>raises the exception:</em>
 #
 #     LocalJumpError: no block given (yield)
 #
@@ -220,7 +220,7 @@ end
 #     end
 #     get_me_a_return.call
 #
-# *raises the exception:*
+# <em>raises the exception:</em>
 #
 #     LocalJumpError: unexpected return
 #
@@ -248,7 +248,7 @@ end
 #
 #     puts foo
 #
-# *raises the exception:*
+# <em>raises the exception:</em>
 #
 #     NameError: undefined local variable or method `foo' for main:Object
 #
@@ -256,7 +256,7 @@ end
 #
 #     Integer.const_set :answer, 42
 #
-# *raises the exception:*
+# <em>raises the exception:</em>
 #
 #     NameError: wrong constant name answer
 #
@@ -302,9 +302,15 @@ class NameError[T] < StandardError
   def receiver: () -> T?
 end
 
+# <!-- rdoc-file=error.c -->
+# Raised when matching pattern not found.
+#
 class NoMatchingPatternError < StandardError
 end
 
+# <!-- rdoc-file=error.c -->
+# Raised when matching key not found.
+#
 class NoMatchingPatternKeyError[M, K] < NoMatchingPatternError
   # <!--
   #   rdoc-file=error.c
@@ -344,7 +350,7 @@ end
 #
 #     "hello".to_ary
 #
-# *raises the exception:*
+# <em>raises the exception:</em>
 #
 #     NoMethodError: undefined method `to_ary' for an instance of String
 #
@@ -354,11 +360,13 @@ class NoMethodError[T] < NameError[T]
   #   - NoMethodError.new(msg=nil, name=nil, args=nil, private=false, receiver: nil)  -> no_method_error
   # -->
   # Construct a NoMethodError exception for a method of the given name called with
-  # the given arguments. The name may be accessed using the `#name` method on the
-  # resulting object, and the arguments using the `#args` method.
+  # the given arguments. The name may be accessed using the <code>#name</code>
+  # method on the resulting object, and the arguments using the <code>#args</code>
+  # method.
   #
   # If *private* argument were passed, it designates method was attempted to call
-  # in private context, and can be accessed with `#private_call?` method.
+  # in private context, and can be accessed with <code>#private_call?</code>
+  # method.
   #
   # *receiver* argument stores an object whose method was called.
   #
@@ -387,8 +395,8 @@ end
 # exception if the underlying operating system or Ruby runtime does not support
 # them.
 #
-# Note that if `fork` raises a `NotImplementedError`, then `respond_to?(:fork)`
-# returns `false`.
+# Note that if `fork` raises a `NotImplementedError`, then
+# <code>respond_to?(:fork)</code> returns `false`.
 #
 class NotImplementedError < ScriptError
 end
@@ -398,7 +406,7 @@ end
 #
 #     [1, 2, 3].drop(1 << 100)
 #
-# *raises the exception:*
+# <em>raises the exception:</em>
 #
 #     RangeError: bignum too big to convert into `long'
 #
@@ -410,7 +418,7 @@ end
 #
 #     Regexp.new("?")
 #
-# *raises the exception:*
+# <em>raises the exception:</em>
 #
 #     RegexpError: target of repeat operator is not specified: /?/
 #
@@ -423,7 +431,7 @@ end
 #
 #     raise "ouch"
 #
-# *raises the exception:*
+# <em>raises the exception:</em>
 #
 #     RuntimeError: ouch
 #
@@ -455,7 +463,7 @@ end
 #       puts "received Exception #{e}"
 #     end
 #
-# *produces:*
+# <em>produces:</em>
 #
 #     received Exception SIGHUP
 #
@@ -496,7 +504,7 @@ end
 #
 #     require 'does/not/exist' rescue "Hi"
 #
-# *raises the exception:*
+# <em>raises the exception:</em>
 #
 #     LoadError: no such file to load -- does/not/exist
 #
@@ -514,7 +522,7 @@ end
 #     end
 #     puts "Done!"
 #
-# *produces:*
+# <em>produces:</em>
 #
 #     Hello
 #     Done!
@@ -554,7 +562,7 @@ end
 #
 #     eval("1+1=2")
 #
-# *raises the exception:*
+# <em>raises the exception:</em>
 #
 #     SyntaxError: (eval):1: syntax error, unexpected '=', expecting $end
 #
@@ -581,20 +589,41 @@ end
 #
 #     File.open("does/not/exist")
 #
-# *raises the exception:*
+# <em>raises the exception:</em>
 #
 #     Errno::ENOENT: No such file or directory - does/not/exist
 #
 class SystemCallError < StandardError
   # <!--
   #   rdoc-file=error.c
-  #   - SystemCallError.new(msg, errno)  -> system_call_error_subclass
+  #   - SystemCallError.new(msg, errno = nil, func = nil)  -> system_call_error_subclass
   # -->
   # If *errno* corresponds to a known system error code, constructs the
   # appropriate Errno class for that error, otherwise constructs a generic
   # SystemCallError object. The error number is subsequently available via the
   # #errno method.
   #
+  # If only numeric object is given, it is treated as an Integer *errno*, and
+  # *msg* is omitted, otherwise the first argument *msg* is used as the additional
+  # error message.
+  #
+  #     SystemCallError.new(Errno::EPIPE::Errno)
+  #     #=> #<Errno::EPIPE: Broken pipe>
+  #
+  #     SystemCallError.new("foo")
+  #     #=> #<SystemCallError: unknown error - foo>
+  #
+  #     SystemCallError.new("foo", Errno::EPIPE::Errno)
+  #     #=> #<Errno::EPIPE: Broken pipe - foo>
+  #
+  # If *func* is not `nil`, it is appended to the message with "<code> @ </code>".
+  #
+  #     SystemCallError.new("foo", Errno::EPIPE::Errno, "here")
+  #     #=> #<Errno::EPIPE: Broken pipe @ here - foo>
+  #
+  # A subclass of SystemCallError can also be instantiated via the `new` method of
+  # the subclass.  See Errno.
+  #
   def initialize: (string msg, Integer errno) -> void
 
   # <!--
@@ -658,7 +687,7 @@ end
 #     end
 #     me_myself_and_i
 #
-# *raises the exception:*
+# <em>raises the exception:</em>
 #
 #     SystemStackError: stack level too deep
 #
@@ -685,7 +714,7 @@ end
 #
 #     [1, 2, 3].first("two")
 #
-# *raises the exception:*
+# <em>raises the exception:</em>
 #
 #     TypeError: no implicit conversion of String into Integer
 #
@@ -698,7 +727,7 @@ end
 #
 #     throw "foo", "bar"
 #
-# *raises the exception:*
+# <em>raises the exception:</em>
 #
 #     UncaughtThrowError: uncaught throw "foo"
 #
@@ -714,7 +743,7 @@ class UncaughtThrowError < ArgumentError
   #
   #     throw "foo", "bar"
   #
-  # *raises the exception:*
+  # <em>raises the exception:</em>
   #
   #     UncaughtThrowError: uncaught throw "foo"
   #