PATH: //opt/alt/ruby22/lib64/ruby/2.2.0/rexml
FILE_BARU
CREATE
FOLDER_BARU
MKDIR
UPLOAD_FILE
GO
[ .. KEMBALI ]
📄 attlistdecl.rb
↓
X
📄 attribute.rb
↓
X
📄 cdata.rb
↓
X
📄 child.rb
↓
X
📄 comment.rb
↓
X
📄 doctype.rb
↓
X
📄 document.rb
↓
X
📁 dtd/
X
📄 element.rb
↓
X
📄 encoding.rb
↓
X
📄 entity.rb
↓
X
📁 formatters/
X
📄 functions.rb
↓
X
📄 instruction.rb
↓
X
📁 light/
X
📄 namespace.rb
↓
X
📄 node.rb
↓
X
📄 output.rb
↓
X
📄 parent.rb
↓
X
📄 parseexception.rb
↓
X
📁 parsers/
X
📄 quickpath.rb
↓
X
📄 rexml.rb
↓
X
📄 sax2listener.rb
↓
X
📄 security.rb
↓
X
📄 source.rb
↓
X
📄 streamlistener.rb
↓
X
📄 syncenumerator.rb
↓
X
📄 text.rb
↓
X
📄 undefinednamespaceexception.rb
↓
X
📁 validation/
X
📄 xmldecl.rb
↓
X
📄 xmltokens.rb
↓
X
📄 xpath.rb
↓
X
📄 xpath_parser.rb
↓
X
SAVING...
BERHASIL DIUBAH!
EDITING: node.rb
require "rexml/parseexception" require "rexml/formatters/pretty" require "rexml/formatters/default" module REXML # Represents a node in the tree. Nodes are never encountered except as # superclasses of other objects. Nodes have siblings. module Node # @return the next sibling (nil if unset) def next_sibling_node return nil if @parent.nil? @parent[ @parent.index(self) + 1 ] end # @return the previous sibling (nil if unset) def previous_sibling_node return nil if @parent.nil? ind = @parent.index(self) return nil if ind == 0 @parent[ ind - 1 ] end # indent:: # *DEPRECATED* This parameter is now ignored. See the formatters in the # REXML::Formatters package for changing the output style. def to_s indent=nil unless indent.nil? Kernel.warn( "#{self.class.name}.to_s(indent) parameter is deprecated" ) f = REXML::Formatters::Pretty.new( indent ) f.write( self, rv = "" ) else f = REXML::Formatters::Default.new f.write( self, rv = "" ) end return rv end def indent to, ind if @parent and @parent.context and not @parent.context[:indentstyle].nil? then indentstyle = @parent.context[:indentstyle] else indentstyle = ' ' end to << indentstyle*ind unless ind<1 end def parent? false; end # Visit all subnodes of +self+ recursively def each_recursive(&block) # :yields: node self.elements.each {|node| block.call(node) node.each_recursive(&block) } end # Find (and return) first subnode (recursively) for which the block # evaluates to true. Returns +nil+ if none was found. def find_first_recursive(&block) # :yields: node each_recursive {|node| return node if block.call(node) } return nil end # Returns the position that +self+ holds in its parent's array, indexed # from 1. def index_in_parent parent.index(self)+1 end end end
SIMPAN PERUBAHAN