U:RDoc::NormalClass[iI"Map:ETI"Concurrent::Map;TI".Concurrent::Collection::MapImplementation;To:RDoc::Markup::Document:@parts[o;;[o:RDoc::Markup::Paragraph;[I"U`Concurrent::Map` is a hash-like object and should have much better performance ;TI"Rcharacteristics, especially under high concurrency, than `Concurrent::Hash`. ;TI"YHowever, `Concurrent::Map `is not strictly semantically equivalent to a ruby `Hash` ;TI"Z-- for instance, it does not necessarily retain ordering by insertion time as `Hash` ;TI"Qdoes. For most uses it should do fine though, and we recommend you consider ;TI"Z`Concurrent::Map` instead of `Concurrent::Hash` for your concurrency-safe hash needs.;T:
@fileI"*lib/concurrent-ruby/concurrent/map.rb;T:0@omit_headings_from_table_of_contents_below0;
0;0[[[[[I"
class;T[[:public[[I"new;TI"*lib/concurrent-ruby/concurrent/map.rb;T[:protected[[:private[[I"
instance;T[[;[[I"[];T@"[I"[]=;T@"[I"	each;T@"[I"
each_key;T@"[I"each_pair;T@"[I"each_value;T@"[I"empty?;T@"[I"
fetch;T@"[I"fetch_or_store;T@"[I"get;T@"[I"
index;T@"[I"inspect;T@"[I"key;T@"[I"	keys;T@"[I"marshal_dump;T@"[I"marshal_load;T@"[I"put;T@"[I"put_if_absent;T@"[I"	size;T@"[I"value?;T@"[I"values;T@"[;
[[;[	[I"initialize_copy;T@"[I"populate_from;T@"[I"raise_fetch_no_key;T@"[I"validate_options_hash!;T@"[[U:RDoc::Context::Section[i0o;;[;
0;0[@I"Concurrent;TcRDoc::NormalModule