|
|||||||||||||||||||
Source file | Conditionals | Statements | Methods | TOTAL | |||||||||||||||
AopLRUAlgorithm.java | - | - | - | - |
|
1 | package org.jboss.cache.pojo.eviction; | |
2 | ||
3 | import org.jboss.cache.eviction.LRUAlgorithm; | |
4 | ||
5 | /** | |
6 | * LRUAlgorithm specific to PojoCache. Overriding couple of hooks to customize | |
7 | * the algorithm such that it works correctly when using PojoCache. | |
8 | * The basic strategy for the AOP-specific case are: | |
9 | * <ul> | |
10 | * <li>When a node is visited, it will check if it is an PojoReference node. If it | |
11 | * is, then it is an AOP node. In that case, we will update all children nodes' | |
12 | * time stamp to synchronize with parent node.</li> | |
13 | * <li>When a node is to be evicted, it will check if it an AOP node. If it is, | |
14 | * we will traverse through the children nodes to see if their timestamp is younger. | |
15 | * If it is younger, then we must not evict the whol aop node (i.e., parent node is | |
16 | * not evicted either). Furthermore, we should synchronize the whole tree. | |
17 | * </ul> | |
18 | * | |
19 | * @author Ben Wang, Feb 17, 2004 | |
20 | */ | |
21 | class AopLRUAlgorithm extends LRUAlgorithm | |
22 | { | |
23 | } |
|