2010-04-01 03:45:16 -04:00
|
|
|
##
|
|
|
|
# A Module include in a class with \#include
|
|
|
|
|
|
|
|
class RDoc::Include < RDoc::CodeObject
|
|
|
|
|
|
|
|
##
|
|
|
|
# Name of included module
|
|
|
|
|
|
|
|
attr_accessor :name
|
|
|
|
|
|
|
|
##
|
|
|
|
# Creates a new Include for +name+ with +comment+
|
|
|
|
|
|
|
|
def initialize(name, comment)
|
|
|
|
super()
|
|
|
|
@name = name
|
|
|
|
self.comment = comment
|
2012-11-26 23:28:14 -05:00
|
|
|
@module = nil # cache for module if found
|
2010-04-01 03:45:16 -04:00
|
|
|
end
|
|
|
|
|
|
|
|
##
|
|
|
|
# Includes are sorted by name
|
|
|
|
|
|
|
|
def <=> other
|
|
|
|
return unless self.class === other
|
|
|
|
|
|
|
|
name <=> other.name
|
|
|
|
end
|
|
|
|
|
|
|
|
def == other # :nodoc:
|
2012-11-26 23:28:14 -05:00
|
|
|
self.class === other and @name == other.name
|
2010-04-01 03:45:16 -04:00
|
|
|
end
|
|
|
|
|
2012-11-26 23:28:14 -05:00
|
|
|
alias eql? ==
|
|
|
|
|
2010-04-01 03:45:16 -04:00
|
|
|
##
|
|
|
|
# Full name based on #module
|
|
|
|
|
|
|
|
def full_name
|
|
|
|
m = self.module
|
|
|
|
RDoc::ClassModule === m ? m.full_name : @name
|
|
|
|
end
|
|
|
|
|
2012-11-26 23:28:14 -05:00
|
|
|
def hash # :nodoc:
|
|
|
|
[@name, self.module].hash
|
|
|
|
end
|
|
|
|
|
2010-04-01 03:45:16 -04:00
|
|
|
def inspect # :nodoc:
|
|
|
|
"#<%s:0x%x %s.include %s>" % [
|
|
|
|
self.class,
|
|
|
|
object_id,
|
|
|
|
parent_name, @name,
|
|
|
|
]
|
|
|
|
end
|
|
|
|
|
|
|
|
##
|
|
|
|
# Attempts to locate the included module object. Returns the name if not
|
|
|
|
# known.
|
2010-12-19 22:22:49 -05:00
|
|
|
#
|
|
|
|
# The scoping rules of Ruby to resolve the name of an included module are:
|
|
|
|
# - first look into the children of the current context;
|
|
|
|
# - if not found, look into the children of included modules,
|
|
|
|
# in reverse inclusion order;
|
|
|
|
# - if still not found, go up the hierarchy of names.
|
2012-11-26 23:28:14 -05:00
|
|
|
#
|
|
|
|
# This method has <code>O(n!)</code> behavior when the module calling
|
|
|
|
# include is referencing nonexistent modules. Avoid calling #module until
|
|
|
|
# after all the files are parsed. This behavior is due to ruby's constant
|
|
|
|
# lookup behavior.
|
|
|
|
#
|
|
|
|
# As of the beginning of October, 2011, no gem includes nonexistent modules.
|
2010-04-01 03:45:16 -04:00
|
|
|
|
|
|
|
def module
|
2010-12-19 22:22:49 -05:00
|
|
|
return @module if @module
|
|
|
|
|
|
|
|
# search the current context
|
|
|
|
return @name unless parent
|
|
|
|
full_name = parent.child_name(@name)
|
2012-11-26 23:28:14 -05:00
|
|
|
@module = @store.modules_hash[full_name]
|
2010-12-19 22:22:49 -05:00
|
|
|
return @module if @module
|
|
|
|
return @name if @name =~ /^::/
|
|
|
|
|
|
|
|
# search the includes before this one, in reverse order
|
|
|
|
searched = parent.includes.take_while { |i| i != self }.reverse
|
|
|
|
searched.each do |i|
|
|
|
|
inc = i.module
|
|
|
|
next if String === inc
|
|
|
|
full_name = inc.child_name(@name)
|
2012-11-26 23:28:14 -05:00
|
|
|
@module = @store.modules_hash[full_name]
|
2010-12-19 22:22:49 -05:00
|
|
|
return @module if @module
|
|
|
|
end
|
|
|
|
|
|
|
|
# go up the hierarchy of names
|
2012-11-26 23:28:14 -05:00
|
|
|
up = parent.parent
|
|
|
|
while up
|
|
|
|
full_name = up.child_name(@name)
|
|
|
|
@module = @store.modules_hash[full_name]
|
2010-12-19 22:22:49 -05:00
|
|
|
return @module if @module
|
2012-11-26 23:28:14 -05:00
|
|
|
up = up.parent
|
2010-12-19 22:22:49 -05:00
|
|
|
end
|
|
|
|
|
|
|
|
@name
|
|
|
|
end
|
|
|
|
|
2012-11-26 23:28:14 -05:00
|
|
|
##
|
|
|
|
# Sets the store for this class or module and its contained code objects.
|
|
|
|
|
|
|
|
def store= store
|
|
|
|
super
|
|
|
|
|
|
|
|
@file = @store.add_file @file.full_name if @file
|
|
|
|
end
|
|
|
|
|
2010-12-19 22:22:49 -05:00
|
|
|
def to_s # :nodoc:
|
|
|
|
"include #@name in: #{parent}"
|
2010-04-01 03:45:16 -04:00
|
|
|
end
|
|
|
|
|
|
|
|
end
|
|
|
|
|