cache_tree 0.0.1 → 0.0.2

data/README.rdoc

@@ -1,6 +1,21 @@
-= cache_tree
+= CacheTree
 
-Btree based cache
+The idea behind this, is to be able to manage very large ammounts of cache files.
+and expire millions of cache files in just a few microseconds.
+
+Instead of performing some ActiveRecord#touch and have it creating a massive sequence
+of queries bouncing off going up/down the herarchies to eliminate a group of items from the cache
+
+CacheTree stores cache in trees, actually it borrows the btree strategy to fetch
+and quickly determine where cache files are.
+
+you can always add new subtrees or create new trees and handle the cache at different levels.
+no matter where you are cache expiring is superfast.
+
+While the actual deletion of the expired cache files is also fast. it is recomended to do so
+in some sort of background job solution.
+
+Trees are cool :)
 
 == Contributing to cache_tree
 

data/VERSION

@@ -1 +1 @@
-0.0.1
+0.0.2

data/cache_tree.gemspec

@@ -5,11 +5,11 @@
 
 Gem::Specification.new do |s|
   s.name = %q{cache_tree}
-  s.version = "0.0.1"
+  s.version = "0.0.2"
 
   s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
   s.authors = ["kazuyoshi tlacaelel"]
-  s.date = %q{2012-11-01}
+  s.date = %q{2012-11-02}
   s.description = %q{Cache based on btrees, for large ammounts of cache.}
   s.email = %q{kazu.dev@gmail.com}
   s.extra_rdoc_files = [

data/lib/cache_tree.rb

@@ -6,6 +6,14 @@ require 'tree_node'
 
 module CacheTree
 
+  def self.use(node, report = proc {}, &block)
+    CacheTree::Manager.instance.use(node, report, &block)
+  end
+
+  def self.node(object)
+    CacheTree::Node.new(object)
+  end
+
   class Manager
 
     include Singleton
@@ -17,31 +25,33 @@ module CacheTree
       @configuration  = { :perform_caching => true }
     end
 
-    def use(cache_link)
-      @current_link = cache_link
+    def use(node, report, &block)
+      return yield unless @configuration[:perform_caching]
+      @node = node
+      @node.map(:up) { |parent| parent.load! }
+      return read if exists?
+      report.call
+      save(yield)
     end
 
+    protected
+
     def exists?
       return false unless @configuration[:perform_caching]
-      btree_key_files = @current_link.map(:up) { |node| node.btree_key }
+      btree_key_files = @node.map(:up) { |node| node.btree_key }
       return false unless btree_key_files.all? { |btree_key| File.exists?(btree_key) }
-      @current_link.map(:up) { |node| node.load_btree_key }
-      File.exists?(@current_link.cache_file)
-    end
-
-    def expire!
-      @current_link.expire
+      File.exists?(@node.cache_file)
     end
 
     def read
-      @current_link.map(:up) { |node| node.load_btree_key }
-      File.read(@current_link.cache_file)
+      File.read(@node.cache_file)
     end
 
     def save(data)
-      @current_link.map(:up) { |node| node.save }
-      FileUtils.mkdir_p(File.dirname(@current_link.cache_file))
-      File.open(@current_link.cache_file, 'w+') { |file| file.write data }
+      @node.map(:up) { |node| node.save }
+      FileUtils.mkdir_p(File.dirname(@node.cache_file))
+      File.open(@node.cache_file, 'w+') { |file| file.write data }
+      data
     end
 
   end
@@ -83,10 +93,16 @@ module CacheTree
     end
 
     # Updates current node stamp from btree_key
-    def load_btree_key
+    def load
       @stamp = eval(File.read(btree_key))
     end
 
+    # Updates current node stamp from btree_key
+    # ensuring the btree file is present reflecting node-data on memory.
+    def load!
+      File.exists?(btree_key) ? load : save
+    end
+
     # Sums up all stamps and generates a checksum.
     def checksum
       MD5.hexdigest(map(:up) { |node| node.stamp } * '')
@@ -126,11 +142,11 @@ module CacheTree
     # @return [Hash] with detailed diagnosis of curret status for that
     # node's cache
     def diagnose
+      map(:up) { |node| node.load! }
       file_alive             = cache_file
       base                   = File.basename(file_alive)
       dir                    = File.dirname(file_alive)
       diagnostic             = {}
-      diagnostic[:btree_key] = btree_key
       diagnostic[:alive]     = file_alive
       diagnostic[:dead]      = []
       Dir["#{dir}/*.cache"].each do |cached_file|
@@ -142,11 +158,17 @@ module CacheTree
 
     # Prints out active cache in green, and expired files in red.
     def debug
-      puts cache_file.to_ansi.green
-      diagnose[:dead].each { |file| puts file.to_ansi.red }
+      diagnostic = diagnose
+      if File.exists?(diagnostic[:alive])
+        puts diagnostic[:alive].to_ansi.green
+      else
+        puts diagnostic[:alive].to_ansi.yellow
+      end
+      diagnostic[:dead].each { |file| puts file.to_ansi.red }
       nil
     end
 
+
   end
 
 end

metadata

@@ -1,13 +1,13 @@
 --- !ruby/object:Gem::Specification 
 name: cache_tree
 version: !ruby/object:Gem::Version 
-  hash: 29
+  hash: 27
   prerelease: false
   segments: 
   - 0
   - 0
-  - 1
-  version: 0.0.1
+  - 2
+  version: 0.0.2
 platform: ruby
 authors: 
 - kazuyoshi tlacaelel
@@ -15,7 +15,7 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2012-11-01 00:00:00 -06:00
+date: 2012-11-02 00:00:00 -06:00
 default_executable: 
 dependencies: 
 - !ruby/object:Gem::Dependency