Linux heracles.o2switch.net 4.18.0-553.62.1.lve.el8.x86_64 #1 SMP Mon Jul 21 17:50:35 UTC 2025 x86_64

/opt/alt/ruby27/share/ri/system/REXML/XPathParser/

//opt/alt/ruby27/share/ri/system/REXML/XPathParser/cdesc-XPathParser.ri

U:RDoc::NormalClass[iI"XPathParser:ETI"REXML::XPathParser;TI"Object;To:RDoc::Markup::Document:@parts[o;;[o:RDoc::Markup::Paragraph;[ I"OYou don't want to use this class. Really. Use XPath, which is a wrapper ;TI"Jfor this class. Believe me. You don't want to poke around in here. ;TI"OThere is strange, dark magic at work in this code. Beware. Go back! Go ;TI"back while you still can!;T: @fileI"lib/rexml/xpath_parser.rb;T:0@omit_headings_from_table_of_contents_below0; 0;0[�[U:RDoc::Constant[i�I"LITERAL;TI" REXML::XPathParser::LITERAL;T:public0o;;[�; @;0@@cRDoc::NormalClass0U;[i�I" DEBUG;TI"REXML::XPathParser::DEBUG;T; 0o;;[�; @;0@@@0[[I"XMLTokens;To;;[�; @;0I"lib/rexml/xpath_parser.rb;T[[I" class;T[[; [�[:protected[�[:private[[I"new;T@)[I" instance;T[[; [�[;[�[;['[I"[]=;T@)[I" child;T@)[I"compare;T@)[I"descendant;T@)[I"descendant_recursive;T@)[I"each_unnode;T@)[I" enter;T@)[I" equality_relational_compare;T@)[I"evaluate_predicate;T@)[I" expr;T@)[I"filter_nodeset;T@)[I" first;T@)[I"following;T@)[I"following_node_of;T@)[I"get_first;T@)[I"get_namespace;T@)[I" leave;T@)[I" match;T@)[I"namespaces=;T@)[I"next_sibling_node;T@)[I"node_test;T@)[I" norm;T@)[I"normalize_compare_values;T@)[I" parse;T@)[I"preceding;T@)[I"preceding_node_of;T@)[I"predicate;T@)[I" sort;T@)[I" step;T@)[I"strict?;T@)[I" trace;T@)[I"unnode;T@)[I"value_type;T@)[I"variables=;T@)[�[U:RDoc::Context::Section[i�0o;;[�; 0;0[I"lib/rexml/xpath_parser.rb;TI" REXML;TcRDoc::NormalModule