adrienconrath
BAN USERI think this is considered recursion as well
- adrienconrath April 21, 2013The actions the user can perform are:
- 1) Add a new URL in history (it would have the greatest timestamp).
- 2) See history
-> The user can browse today's history
-> The user can browse yesterday's history
-> The user can browse the history of a specific month
-> The user can browse the history of a specific year
- 3) The user can delete history (last day, last week, last month, all, a particular entry).
- 4) Search in browsing history (can use page's URL or page's title)
Maybe — to make the search — more efficient, we want to find a way to have a quicker access to pages that are visited more frequently.
For 2) and 3), I guess a skip-list would do it. The skip list would have 4 levels (days, weeks, months, years).
For 4), we could use a Generalized Suffix Tree.
The nodes from the skip list would reference nodes from the suffix tree and vice versa.
Are we talking about loops at the assembly level?
When building this with g++ -std=c++11 -ftemplate-depth=1000, this generates a binary without loops.
- adrienconrath April 21, 2013