The queue based solutions seems to be not optimal. Therefore, we decided to create a datstaructure similar to something like a priority bucket list.
Every bucket holds exactly one state. If you click on a new link, which is already included in teh beradcrumbs, we take the bucket holding it, replace the old data with the new one und move this bucket to the top of the list.
Let's say we have four states: a, b, c, d
Suppose the following situation: You have a breadcrumb with the following values:
a | b | c | d now you click on b => a | c | d | b
in the current version:
a | b | c | d now you click on b => b| c | d | b
sekaiser
commented
9 years ago
The queue based solutions seems to be not optimal. Therefore, we decided to create a datstaructure similar to something like a priority bucket list.
Every bucket holds exactly one state. If you click on a new link, which is already included in teh beradcrumbs, we take the bucket holding it, replace the old data with the new one und move this bucket to the top of the list.
Let's say we have four states: a, b, c, d
Suppose the following situation: You have a breadcrumb with the following values: a | b | c | d now you click on b => a | c | d | b
in the current version: a | b | c | d now you click on b => b| c | d | b