[jira] Commented: (JCS-50) 3 new memory caches
"Maxim Gordienko (JIRA)" <[email protected]> Thu, 11 Sep 2008 02:49:44 -0700 (PDT)
| Newsgroups | gmane.comp.jakarta.turbine.jcs.devel |
|---|---|
| Message-ID | <828668372.1221126584582.JavaMail.jira@brutus> |
[ https://issues.apache.org/jira/browse/JCS-50?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=12630145#action_12630145 ]
Maxim Gordienko commented on JCS-50:
------------------------------------
No no, i completely agree with you about base class extension. Contract on memory cache is defined by interface not by base abstract class.
I was talking about data structure PriorityList. It requires support structure just like DoubleLikedList does.
Here an example - methods get*(key)/remove(key)
We have to locate list node by key before we can efficiently modify any of these structures.
Replacement of super class' HashMap with TreeMap in PriorityList does not solve the problem - we still need the support data structure (now this structure is the HashMap from superclass).
> 3 new memory caches
> -------------------
>
> Key: JCS-50
> URL: https://issues.apache.org/jira/browse/JCS-50
> Project: JCS
> Issue Type: Improvement
> Components: Composite Cache
> Affects Versions: jcs-1.4-dev
> Environment: current jcs trunk
> Reporter: Maxim Gordienko
> Assignee: Aaron Smuts
> Attachments: 0001-refactored-memory-cache-hierarchy.patch, 0002-improve-performance-or-MRU-list.patch, 0003-added-new-structure-PriorityList.patch, 0004-added-new-FIFO-memory-cache.patch, 0005-added-LFU-memory-cache.patch, 0006-added-Expiration-memory-cache.patch
>
>
> This is a refactoring/reformat of patch introduced in JCS-43.
> Patch is splitted in 6 parts
> 1) refactoring memory caches to achieve higher code reuse
> 2) refactoring MRU cache to use double linked list instead of LinkedList
> 3) introduction of new PriorityList structure
> 4-6) new caches FIFO, LFU, Expiration
--
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.