nats 0.3.12

data/lib/nats/server/sublist.rb

@@ -0,0 +1,116 @@
+#--
+#
+# Sublist implementation for a publish-subscribe system.
+# This container class holds subscriptions and matches 
+# candidate subjects to those subscriptions.
+# Certain wildcards are supported for subscriptions. 
+# '*' will match any given token at any level.
+# '>' will match all subsequent tokens.
+#--
+# See included test for example usage:
+##
+
+class Sublist #:nodoc:
+  PWC = '*'.freeze
+  FWC = '>'.freeze
+  CACHE_SIZE = 4096
+  
+  attr_reader :count
+
+  SublistNode  = Struct.new(:leaf_nodes, :next_level)
+  SublistLevel = Struct.new(:nodes, :pwc, :fwc)
+  
+  def initialize(options = {})
+    @count = 0
+    @results = []
+    @root = SublistLevel.new({})
+    @cache = {}
+  end
+
+  # Ruby is a great language to make selective trade offs of space versus time.
+  # We do that here with a low tech front end cache. The cache holds results
+  # until it is exhausted or if the instance inserts or removes a subscription.
+  # The assumption is that the cache is best suited for high speed matching,
+  # and that once it is cleared out it will naturally fill with the high speed
+  # matches. This can obviously be improved with a smarter LRU structure that
+  # does not need to completely go away when a remove happens..
+  #
+  # front end caching is on by default, but we can turn it off here if needed
+  
+  def disable_cache; @cache = nil; end
+  def enable_cache;  @cache ||= {};  end
+  def clear_cache; @cache = {} if @cache; end
+
+  # Insert a subscriber into the sublist for the given subject.
+  def insert(subject, subscriber)
+    # TODO - validate subject as correct.
+    level, tokens = @root, subject.split('.')
+    for token in tokens
+      # This is slightly slower than direct if statements, but looks cleaner.
+      case token
+        when FWC then node = (level.fwc || (level.fwc = SublistNode.new([])))
+        when PWC then node = (level.pwc || (level.pwc = SublistNode.new([])))
+        else node  = ((level.nodes[token]) || (level.nodes[token] = SublistNode.new([])))
+      end
+      level = (node.next_level || (node.next_level = SublistLevel.new({})))
+    end
+    node.leaf_nodes.push(subscriber)
+    @count += 1
+    clear_cache # Clear the cache
+  end
+
+  # Remove a given subscriber from the sublist for the given subject.
+  def remove(subject, subscriber)
+    # TODO: implement (remember cache and count cleanup if applicable)
+    # Reference counts and GC for long empty tree.
+    level, tokens = @root, subject.split('.')
+    for token in tokens
+      next unless level
+      case token
+        when FWC then node = level.fwc
+        when PWC then node = level.pwc
+        else node  = level.nodes[token]
+      end
+      level = node.next_level      
+    end
+    # This could be expensize if a large number of subscribers exist.
+    node.leaf_nodes.delete(subscriber) if (node && node.leaf_nodes) 
+    clear_cache # Clear the cache
+  end
+  
+  # Match a subject to all subscribers, return the array of matches.
+  def match(subject)
+    return @cache[subject] if (@cache && @cache[subject])    
+    tokens = subject.split('.')
+    @results.clear
+    matchAll(@root, tokens)
+    # FIXME: This is too low tech, will revisit when needed.
+    if @cache
+      clear_cache if @cache.size > CACHE_SIZE
+      @cache[subject] = Array.new(@results).freeze # Avoid tampering of copy
+    end
+    @results
+  end
+
+  private
+  
+  def matchAll(level, tokens)
+    node, pwc = nil, nil # Define for scope
+    i, ts = 0, tokens.size
+    while (i < ts) do
+      return if level == nil
+      # Handle a full wildcard here by adding all of the subscribers.
+      @results.concat(level.fwc.leaf_nodes) if level.fwc      
+      # Handle an internal partial wildcard by branching recursively
+      lpwc = level.pwc
+      matchAll(lpwc.next_level, tokens[i+1, ts]) if lpwc
+      node, pwc = level.nodes[tokens[i]], lpwc
+      #level = node.next_level if node
+      level = node ? node.next_level : nil    
+      i += 1
+    end
+    @results.concat(pwc.leaf_nodes) if pwc    
+    @results.concat(node.leaf_nodes) if node
+  end  
+
+end

data/nats.gemspec

@@ -0,0 +1,46 @@
+
+
+lib = File.expand_path('../lib/', __FILE__)
+$:.unshift lib unless $:.include?(lib)
+
+require 'nats/server/const.rb'
+
+spec = Gem::Specification.new do |s|
+  s.name = 'nats'
+  s.version = NATSD::VERSION
+  s.date = '2010-11-20'
+  s.summary = 'Simple Publish-Subscribe Messaging System'
+  s.homepage = "http://github.com/derekcollison/nats"
+  s.description = "A lightweight, fast, publish-subscribe messaging system."
+  s.has_rdoc = true
+
+  s.authors = ["Derek Collison"]
+  s.email = ["derek.collison@gmail.com"]
+
+  s.add_dependency('eventmachine', '>= 0.12.10')
+  s.add_dependency('yajl-ruby', '>= 0.7.8')
+  s.add_dependency('daemons', '>= 1.1.0')
+
+  s.require_paths = ['lib']
+  s.bindir = 'bin'
+  s.executables = [NATSD::APP_NAME, 'nats-pub', 'nats-sub']
+
+  s.files = %w[
+    COPYING
+    README.md
+    nats.gemspec
+    Rakefile
+    bin/nats-server
+    bin/nats-sub
+    bin/nats-pub
+    lib/nats/client.rb
+    lib/nats/ext/bytesize.rb
+    lib/nats/ext/em.rb
+    lib/nats/ext/json.rb
+    lib/nats/server.rb
+    lib/nats/server/options.rb
+    lib/nats/server/sublist.rb
+    lib/nats/server/const.rb
+  ]
+
+end

metadata

@@ -0,0 +1,125 @@
+--- !ruby/object:Gem::Specification 
+name: nats
+version: !ruby/object:Gem::Version 
+  prerelease: false
+  segments: 
+  - 0
+  - 3
+  - 12
+  version: 0.3.12
+platform: ruby
+authors: 
+- Derek Collison
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2010-11-20 00:00:00 -06:00
+default_executable: 
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  name: eventmachine
+  prerelease: false
+  requirement: &id001 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 0
+        - 12
+        - 10
+        version: 0.12.10
+  type: :runtime
+  version_requirements: *id001
+- !ruby/object:Gem::Dependency 
+  name: yajl-ruby
+  prerelease: false
+  requirement: &id002 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 0
+        - 7
+        - 8
+        version: 0.7.8
+  type: :runtime
+  version_requirements: *id002
+- !ruby/object:Gem::Dependency 
+  name: daemons
+  prerelease: false
+  requirement: &id003 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 1
+        - 1
+        - 0
+        version: 1.1.0
+  type: :runtime
+  version_requirements: *id003
+description: A lightweight, fast, publish-subscribe messaging system.
+email: 
+- derek.collison@gmail.com
+executables: 
+- nats-server
+- nats-pub
+- nats-sub
+extensions: []
+
+extra_rdoc_files: []
+
+files: 
+- COPYING
+- README.md
+- nats.gemspec
+- Rakefile
+- bin/nats-server
+- bin/nats-sub
+- bin/nats-pub
+- lib/nats/client.rb
+- lib/nats/ext/bytesize.rb
+- lib/nats/ext/em.rb
+- lib/nats/ext/json.rb
+- lib/nats/server.rb
+- lib/nats/server/options.rb
+- lib/nats/server/sublist.rb
+- lib/nats/server/const.rb
+has_rdoc: true
+homepage: http://github.com/derekcollison/nats
+licenses: []
+
+post_install_message: 
+rdoc_options: []
+
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      segments: 
+      - 0
+      version: "0"
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      segments: 
+      - 0
+      version: "0"
+requirements: []
+
+rubyforge_project: 
+rubygems_version: 1.3.7
+signing_key: 
+specification_version: 3
+summary: Simple Publish-Subscribe Messaging System
+test_files: []
+