Lines Matching refs:nodes
89 Mainly, it customizes a few methods specifically to deal with tree nodes
95 assumptions about the class of the actual nodes it processes. One consequence of
98 construction and analysis of your tree nodes.
187 ############################################ Tree Nodes ############################################
200 tree nodes as well as the methods trees need to implement.
211 tree nodes
214 [siblings] all other nodes sharing the same parent as some node
453 value) and contains zero or more child tree nodes. Additionally, it tracks
677 * copying and creating tree nodes and tokens
678 * defining parent-child relationships between nodes
680 * reading and writing the attributes ANTLR expects of tree nodes
822 builds and manipulates CommonTree nodes.
935 special +UP+ and +DOWN+ nodes.
950 Other than serializing a tree into a sequence of nodes, a tree node stream
990 @token_stream = @adaptor = @nodes = @down = @up = @eof = nil
993 @token_stream = @nodes = @down = @up = @eof = nil
998 @nodes = parent.nodes[ start ... stop ]
1012 @nodes ||= []
1021 @nodes << tree unless nil_tree = @adaptor.flat_list?( tree )
1033 return @nodes.index( node )
1044 @nodes << navigation_node
1049 @nodes.at( index )
1058 @nodes.fetch( absolute, @eof )
1068 return( absolute < 0 ? nil : @nodes.fetch( absolute, @eof ) )
1090 node = @nodes.fetch( @position, @eof )
1147 return @nodes.length
1152 @nodes.map { |nd| @adaptor.type_name( nd ) }.join( ' ' )
1164 when EOF then to = @nodes.length - 2
1171 for node in @nodes
1182 for node in @nodes do yield( node ) end
1189 return @nodes.dup
1194 start ||= @nodes.first
1195 stop ||= @nodes.last
1202 return extract_text( start, @nodes[ - 2 ] )
1210 start_index = @nodes.index( start ) || @nodes.length
1211 stop_index = @nodes.index( stop ) || @nodes.length
1213 @nodes[ start_index .. stop_index ].map do | n |
1226 # @nodes.each_with_index do |n, i|
