Class: Arachni::Support::Cache::LeastCostReplacement
- Defined in:
- lib/arachni/support/cache/least_cost_replacement.rb
Overview
Least Cost Replacement cache implementation.
Maintains 3 cost classes (low, medium, high) ) and discards entries from the lowest cost classes in order to make room for new ones.
Constant Summary collapse
- VALID_COSTS =
[ :low, :medium, :high ]
Instance Attribute Summary
Attributes inherited from Base
Instance Method Summary collapse
- #clear ⇒ Object
-
#initialize ⇒ LeastCostReplacement
constructor
A new instance of LeastCostReplacement.
-
#store(k, v, cost = :low) ⇒ Object
Storage method.
Methods inherited from Base
#[], #[]=, #any?, #capped?, #delete, #empty?, #fetch_or_store, #include?, #size, #uncap, #uncapped?
Constructor Details
#initialize ⇒ LeastCostReplacement
Returns a new instance of LeastCostReplacement.
33 34 35 36 |
# File 'lib/arachni/support/cache/least_cost_replacement.rb', line 33 def initialize( * ) super reset_costs end |
Instance Method Details
#clear ⇒ Object
58 59 60 61 62 |
# File 'lib/arachni/support/cache/least_cost_replacement.rb', line 58 def clear super ensure reset_costs end |
#store(k, v, cost = :low) ⇒ Object
Storage method
49 50 51 52 53 54 55 |
# File 'lib/arachni/support/cache/least_cost_replacement.rb', line 49 def store( k, v, cost = :low ) fail( "invalid cost: #{cost}" ) if !valid_cost?( cost ) super( k, v ) ensure @costs[cost] << k end |