[jboss-cvs] JBossCache/docs/JBossCache-UserGuide/en/modules ...

[Manik Surtani]

  User: msurtani
  Date: 07/02/02 08:10:40

  Modified:    docs/JBossCache-UserGuide/en/modules  eviction_policies.xml
  Log:
  Big O notation fix
  
  Revision  Changes    Path
  1.8       +7 -7      JBossCache/docs/JBossCache-UserGuide/en/modules/eviction_policies.xml
  
  (In the diff below, changes in quantity of whitespace are not shown.)
  
  Index: eviction_policies.xml
  ===================================================================
  RCS file: /cvsroot/jboss/JBossCache/docs/JBossCache-UserGuide/en/modules/eviction_policies.xml,v
  retrieving revision 1.7
  retrieving revision 1.8
  diff -u -b -r1.7 -r1.8
  --- eviction_policies.xml	30 Jan 2007 02:06:03 -0000	1.7
  +++ eviction_policies.xml	2 Feb 2007 13:10:40 -0000	1.8
  @@ -96,7 +96,7 @@
   
         <para>
            <literal>org.jboss.cache.eviction.LRUPolicy</literal>
  -         controls both the node lifetime and age. This policy guarantees O(n) = 1 for
  +         controls both the node lifetime and age. This policy guarantees a constant order (<literal>O (1)</literal>) for
            adds, removals and lookups (visits). It has the following configuration
            parameters:
         </para>
  @@ -119,7 +119,7 @@
         <para>
            <literal>org.jboss.cache.eviction.FIFOPolicy</literal>
            controls the eviction in a proper first in first out order. This policy
  -         guarantees O(n) = 1 for adds, removals and lookups (visits). It has the
  +         guarantees a constant order (<literal>O (1)</literal>) for adds, removals and lookups (visits). It has the
            following configuration parameters:
         </para>
   
  @@ -137,7 +137,7 @@
            controls
            the eviction in based on most recently used algorithm. The most recently
            used nodes will be the first to evict with this policy. This policy
  -         guarantees O(n) = 1 for adds, removals and lookups (visits). It has the
  +         guarantees a constant order (<literal>O (1)</literal>) for adds, removals and lookups (visits). It has the
            following configuration parameters:
         </para>
   
  @@ -159,11 +159,11 @@
            which nodes are least frequently used. LFU is also a sorted eviction
            algorithm. The underlying EvictionQueue implementation and algorithm is
            sorted in ascending order of the node visits counter. This class
  -         guarantees O(n) = 1 for adds, removal and searches. However, when any
  +         guarantees a constant order (<literal>O (1)</literal>) for adds, removal and searches. However, when any
            number of nodes are added/visited to the queue for a given processing
  -         pass, a single O(n) = n*log(n) operation is used to resort the queue in
  +         pass, a single quasilinear (<literal>O (n * log n)</literal>) operation is used to resort the queue in
            proper LFU order. Similarly if any nodes are removed or evicted, a
  -         single O(n) = n pruning operation is necessary to clean up the
  +         single linear (<literal>O (n)</literal>) pruning operation is necessary to clean up the
            EvictionQueue. LFU has the following configuration parameters:
         </para>
   
  @@ -200,7 +200,7 @@
         </para>
   
         <para>
  -         This policy guarantees O(n) = 1 for adds and removals.
  +         This policy guarantees a constant order (<literal>O (1)</literal>) for adds and removals.
            Internally, a sorted set (TreeSet) containing the expiration
            time and Fqn of the nodes is stored, which essentially
            functions as a heap.