JezK
Edit File: cdesc-LinkedList.ri
U:RDoc::NormalClass[iI"LinkedList:EFI"Hashery::LinkedList;FI"Object;To:RDoc::Markup::Document:@parts[o;;[o:RDoc::Markup::Paragraph;[I"FLinkedList implements a simple doubly linked list with efficient ;TI"hash-like element access.;To:RDoc::Markup::BlankLine o; ;[I"GThis is a simple linked-list implementation with efficient random ;TI"Eaccess of data elements. It was inspired by George Moscovitis' ;TI"DLRUCache implementation found in Facets 1.7.30, but unlike the ;TI"Glinked-list in that cache, this one does not require the use of a ;TI"Dmixin on any class to be stored. The linked-list provides the ;TI"Gpush, pop, shift, unshift, first, last, delete and length methods ;TI"Ewhich work just like their namesakes in the Array class, but it ;TI"Ealso supports setting and retrieving values by key, just like a ;TI" hash.;T@o; ;[I"NLinkedList was ported from the original in Kirk Hanes IOWA web framework.;T@S:RDoc::Markup::Heading: leveli: textI"Acknowledgements;T@o; ;[I"BLinkedList is based on the LinkedList library by Kirk Haines.;T@o; ;[I"8Copyright (C) 2006 Kirk Haines <khaines@enigo.com>.;T: @fileI"lib/hashery/linked_list.rb;T:0@omit_headings_from_table_of_contents_below0;0;0[ [ [[I"Enumerable;To;;[ ;@);0I"lib/hashery/linked_list.rb;T[[I" class;T[[:public[[I"new;T@1[:protected[ [:private[ [I" instance;T[[;[[I"<<;T@1[I"[];F@1[I"[]=;F@1[I"delete;F@1[I" each;F@1[I"empty?;F@1[I" first;F@1[I" last;F@1[I"length;F@1[I"pop;F@1[I" push;F@1[I" queue;F@1[I" shift;F@1[I" size;F@1[I" to_a;F@1[I"unshift;F@1[;[ [;[[I"node_delete;F@1[I"node_join;F@1[I"node_purge;F@1[ [U:RDoc::Context::Section[i 0o;;[ ;0;0[@)I"Hashery;FcRDoc::NormalModule