But you only have to construct it once. Many data structures with good lookup perf will take time to set up
Kris P.s., However, databases are highly evolved, and do all of this very efficiently, so the whole argument is somewhat silly, as if you just use one you'll be fine. 2011/12/20 felix <[email protected]>: > I've considered trie. But it consumes a lot of memory to construct... > > On 12月20日, 下午2时35分, Jim Graham <[email protected]> wrote: >> On Tue, Dec 20, 2011 at 01:30:10AM -0500, Kristopher Micinski wrote: >> > On Tue, Dec 20, 2011 at 1:27 AM, Jim Graham <[email protected]> wrote: >> > > On Mon, Dec 19, 2011 at 09:26:11PM -0800, felix wrote: >> >http://en.wikipedia.org/wiki/Trie >> >> Wow...I never knew that had a name. :-) >> >> Later, >> --jim >> >> -- >> THE SCORE: ME: 2 CANCER: 0 >> 73 DE N5IAL (/4) MiSTie #49997 < Running FreeBSD 7.0 > >> [email protected] ICBM/Hurricane: 30.44406N 86.59909W >> >> "'Wrong' is one of those concepts that depends on witnesses." >> --Catbert: Evil Director of Human Resources (Dilbert, 05Nov09) >> >> Android Apps Listing athttp://www.jstrack.org/barcodes.html > > -- > You received this message because you are subscribed to the Google > Groups "Android Developers" group. > To post to this group, send email to [email protected] > To unsubscribe from this group, send email to > [email protected] > For more options, visit this group at > http://groups.google.com/group/android-developers?hl=en -- You received this message because you are subscribed to the Google Groups "Android Developers" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/android-developers?hl=en
