ÿØÿà JFIF    ÿÛ „ ( %!1!%*+...983,7(-.- PKƒ$ ]EFù¯éécdesc-Abbrev.rinu„[µü¤U:RDoc::NormalModule[iI" Abbrev:ET@0o:RDoc::Markup::Document: @parts[o;;[o:RDoc::Markup::Paragraph;[I"PCalculates the set of unambiguous abbreviations for a given set of strings.;To:RDoc::Markup::BlankLineo:RDoc::Markup::Verbatim;[ I"require 'abbrev' ;TI"require 'pp' ;TI" ;TI" pp Abbrev.abbrev(['ruby']) ;TI"E#=> {"ruby"=>"ruby", "rub"=>"ruby", "ru"=>"ruby", "r"=>"ruby"} ;TI" ;TI"(pp Abbrev.abbrev(%w{ ruby rules }) ;T: @format0o; ;[I"_Generates:_;To; ;[ I"{ "ruby" => "ruby", ;TI" "rub" => "ruby", ;TI" "rules" => "rules", ;TI" "rule" => "rules", ;TI" "rul" => "rules" } ;T; 0o; ;[I" "summer", ;TI" "summe" => "summer", ;TI" "summ" => "summer", ;TI" "sum" => "summer", ;TI" "su" => "summer", ;TI" "s" => "summer", ;TI" "winter" => "winter", ;TI" "winte" => "winter", ;TI" "wint" => "winter", ;TI" "win" => "winter", ;TI" "wi" => "winter", ;TI" "w" => "winter" };T; 0: @fileI"lib/abbrev.rb;T:0@omit_headings_from_table_of_contents_below0; 0;0[[[[[I" class;T[[: public[[:protected[[: private[[I" abbrev;TI"lib/abbrev.rb;T[I" instance;T[[;[[;[[;[[@I@J[[U:RDoc::Context::Section[i0o;;[; 0;0[I"lib/abbrev.rb;T@:cRDoc::TopLevelPKƒ$ ]U¡·   abbrev-c.rinu„[µü¤U:RDoc::AnyMethod[iI" abbrev:ETI"Abbrev::abbrev;TT: privateo:RDoc::Markup::Document: @parts[ o:RDoc::Markup::Paragraph; [I"PGiven a set of strings, calculate the set of unambiguous abbreviations for ;TI"Jthose strings, and return a hash where the keys are all the possible ;TI"7abbreviations and the values are the full strings.;To:RDoc::Markup::BlankLineo; ; [I"OThus, given +words+ is "car" and "cone", the keys pointing to "car" would ;TI"Qbe "ca" and "car", while those pointing to "cone" would be "co", "con", and ;TI" "cone".;T@o:RDoc::Markup::Verbatim; [ I"require 'abbrev' ;TI" ;TI"#Abbrev.abbrev(%w{ car cone }) ;TI"R#=> {"ca"=>"car", "con"=>"cone", "co"=>"cone", "car"=>"car", "cone"=>"cone"} ;T: @format0o; ; [I"KThe optional +pattern+ parameter is a pattern or a string. Only input ;TI"Qstrings that match the pattern or start with the string are included in the ;TI"output hash.;T@o; ; [ I"/Abbrev.abbrev(%w{car box cone crab}, /b/) ;TI"C#=> {"box"=>"box", "bo"=>"box", "b"=>"box", "crab" => "crab"} ;TI" ;TI"+Abbrev.abbrev(%w{car box cone}, 'ca') ;TI"$#=> {"car"=>"car", "ca"=>"car"};T; 0: @fileI"lib/abbrev.rb;T:0@omit_headings_from_table_of_contents_below000[I"(words, pattern = nil);T@(FI" Abbrev;TcRDoc::NormalModule00PKƒ$ ]ß2½¯ abbrev-i.rinu„[µü¤U:RDoc::AnyMethod[iI" abbrev:ETI"Abbrev#abbrev;TF: privateo:RDoc::Markup::Document: @parts[ o:RDoc::Markup::Paragraph; [I"PGiven a set of strings, calculate the set of unambiguous abbreviations for ;TI"Jthose strings, and return a hash where the keys are all the possible ;TI"7abbreviations and the values are the full strings.;To:RDoc::Markup::BlankLineo; ; [I"OThus, given +words+ is "car" and "cone", the keys pointing to "car" would ;TI"Qbe "ca" and "car", while those pointing to "cone" would be "co", "con", and ;TI" "cone".;T@o:RDoc::Markup::Verbatim; [ I"require 'abbrev' ;TI" ;TI"#Abbrev.abbrev(%w{ car cone }) ;TI"R#=> {"ca"=>"car", "con"=>"cone", "co"=>"cone", "car"=>"car", "cone"=>"cone"} ;T: @format0o; ; [I"KThe optional +pattern+ parameter is a pattern or a string. Only input ;TI"Qstrings that match the pattern or start with the string are included in the ;TI"output hash.;T@o; ; [ I"/Abbrev.abbrev(%w{car box cone crab}, /b/) ;TI"C#=> {"box"=>"box", "bo"=>"box", "b"=>"box", "crab" => "crab"} ;TI" ;TI"+Abbrev.abbrev(%w{car box cone}, 'ca') ;TI"$#=> {"car"=>"car", "ca"=>"car"};T; 0: @fileI"lib/abbrev.rb;T:0@omit_headings_from_table_of_contents_below000[I"(words, pattern = nil);T@(FI" Abbrev;TcRDoc::NormalModule00PKƒ$ ]EFù¯éécdesc-Abbrev.rinu„[µü¤PKƒ$ ]U¡·   (abbrev-c.rinu„[µü¤PKƒ$ ]ß2½¯ ƒ abbrev-i.rinu„[µü¤PKåÝ