From: User Bin Date: 2010-03-05T00:10:57+09:00 Subject: Re: Efficient implementation of saving search state Robert Klemme wrote: > 2010/2/28 User Bin : >> tree that was last reached prior to application shutdown. Also, the >> directory structure is projected to be millions of files, so I need to >> take that into consideration, as well. >> >> Initially, I was looking into Marshal and Pstore, but I am leaning >> towards potentially implementing a database to index the search paths. I >> am asking for any guidance to tutorials, design patterns, and anything >> else that may be relevant. >> >> Any and all comments are welcome. Thanks in advance for everyone's help. > > Welcome! I am not sure what you think is wrong with using Marshal. > Wouldn't it be sufficient to store a stack of currently processed > directories to a file and overwrite that file every time you have > finished reading one directory? I believe the volume should be > sufficiently small to be handled with Marshal. > > Kind regards > > robert Robert, thanks for your response. Your comment makes perfect sense. I am saving the string of the last directory searched, then Marshaling to a file. Everything appears to be working as it should. Thanks again. -- Posted via http://www.ruby-forum.com/.