journeta 0.1.7 → 0.2.0

data/bin/journeta_thread_leak_check.rb

@@ -0,0 +1,16 @@
+#!/usr/bin/env ruby
+current_dir = File.dirname(File.expand_path(__FILE__))
+lib_path = File.join(current_dir, '..', 'lib')
+$LOAD_PATH.unshift lib_path
+
+require 'journeta'
+include Journeta
+
+#puts "Threads before start: #{Thread.count}"
+
+j = Engine.new
+j.start
+sleep 10
+j.stop
+
+#puts "Threads after stop: #{Thread.count}"

data/bin/journeta_top.rb

@@ -0,0 +1,73 @@
+#!/usr/bin/env ruby
+
+banner =<<EOL
+A "top"-like tool for monitoring network status.
+Will not run on JRuby due to native dependencies.
+Copyright 2011, Preston Lee. http://prestonlee.com
+
+	Usage: #{$0}
+
+EOL
+
+puts banner
+
+current_dir = File.dirname(File.expand_path(__FILE__))
+lib_path = File.join(current_dir, '..', 'lib')
+$LOAD_PATH.unshift lib_path
+
+require 'journeta'
+include Journeta
+include Journeta::Common
+include Journeta::Common::Shutdown
+
+require 'rubygems'
+begin
+  require 'curses'
+rescue
+  puts 'Please install the curses gem to use this example.'
+  exit 1
+end
+
+peer_port = (2048 + rand( 2 ** 8))
+@journeta = Journeta::Engine.new(:peer_port => peer_port)
+@journeta.start
+stop_on_shutdown(@journeta)
+
+Curses.init_screen
+Curses.setpos(0,0)
+Curses::addstr("Press ^C to quit. ENTER to refresh.\n")
+
+@run = true
+@run_lock = Mutex.new
+
+refresh = Thread.new do
+  keep_going = true
+  begin
+    @run_lock.synchronize do
+      keep_going = @run
+    end
+    all = @journeta.known_peers
+    
+    Curses.clear
+    Curses.setpos(0,0)
+    Curses.addstr "UUID\t\tVersion\tIP Address\tDiscovered\t\t\tUpdated\t\t\t\tGroups\n"
+    all.keys.sort.each do |uuid|
+      Curses.addstr "#{all[uuid].uuid}\t#{all[uuid].version}\t#{all[uuid].ip_address}\t#{all[uuid].created_at}\t#{all[uuid].updated_at}\t#{all[uuid].groups}\n"
+    end
+    sleep(0.1)
+  end     while keep_going
+end
+
+begin
+  c = nil
+  begin
+    c = Curses.getch
+  end until c == ?C or c == ?\e
+  Curses.setpos(0,0)
+  Curses.clear
+  Curses.setpos(0,0)
+end until c == ?\e
+
+@run_lock.synchronize do
+  @run = false
+end

data/{examples/instant_messenger_gui.rb → broken/journeta_instant_messenger_gui.rb}

@@ -9,8 +9,6 @@ require 'journeta'
 include Journeta
 include Journeta::Common
 
-require 'rubygems'
-
 
 # Use UTF-8.
 $KCODE = 'u'

data/broken/journeta_instant_messenger_shoes.rb

@@ -0,0 +1,52 @@
+#!/usr/bin/env ruby
+current_dir = File.dirname(File.expand_path(__FILE__))
+lib_path = File.join(current_dir, '..', 'lib')
+$LOAD_PATH.unshift lib_path
+
+#require File.dirname(__FILE__) + '/../lib/journeta'
+# require 'shoes'
+
+Shoes.setup do
+  gem 'journeta'
+  gem 'hoe'
+end
+
+
+
+    class EditorEvent
+      attr_accessor :diff
+    end
+    
+    class EditorEventHandler
+      
+      def call(event)
+        if data && data.class == EditorEvent && data.diff.class == Diff
+          d = event.diff
+#          @edit_box.text = ''
+        else
+          # ignore it
+        end
+      end
+    end
+
+peer_port = (2048 + rand( 2 ** 8))
+@journeta = ::Journeta::Engine.new(:peer_port => peer_port, :peer_handler => EditorEventHandler.new, :groups => ['shoes_editor'])
+@journeta.start
+
+#Shoes.app :title => 'Shoes Instant Messenger' do
+#  
+#
+#  stack :margin => '20' do
+#    
+#    @edit_box = edit_box :width => '100%'  do |t|
+#      pp t
+#      e = EditorEvent.new
+#      e.diff = t.text
+##      @edit_box2.text = t.text
+#    end
+#    
+#  end
+#  
+#end
+
+@journeta.stop

data/lib/diff.rb

@@ -0,0 +1,280 @@
+class Diff
+
+  VERSION = 0.3
+
+  def Diff.lcs(a, b)
+    astart = 0
+    bstart = 0
+    afinish = a.length-1
+    bfinish = b.length-1
+    mvector = []
+    
+    # First we prune off any common elements at the beginning
+    while (astart <= afinish && bstart <= afinish && a[astart] == b[bstart])
+      mvector[astart] = bstart
+      astart += 1
+      bstart += 1
+    end
+    
+    # now the end
+    while (astart <= afinish && bstart <= bfinish && a[afinish] == b[bfinish])
+      mvector[afinish] = bfinish
+      afinish -= 1
+      bfinish -= 1
+    end
+
+    bmatches = b.reverse_hash(bstart..bfinish)
+    thresh = []
+    links = []
+    
+    (astart..afinish).each { |aindex|
+      aelem = a[aindex]
+      next unless bmatches.has_key? aelem
+      k = nil
+      bmatches[aelem].reverse.each { |bindex|
+	if k && (thresh[k] > bindex) && (thresh[k-1] < bindex)
+	  thresh[k] = bindex
+	else
+	  k = thresh.replacenextlarger(bindex, k)
+	end
+	links[k] = [ (k==0) ? nil : links[k-1], aindex, bindex ] if k
+      }
+    }
+
+    if !thresh.empty?
+      link = links[thresh.length-1]
+      while link
+	mvector[link[1]] = link[2]
+	link = link[0]
+      end
+    end
+
+    return mvector
+  end
+
+  def makediff(a, b)
+    mvector = Diff.lcs(a, b)
+    ai = bi = 0
+    while ai < mvector.length
+      bline = mvector[ai]
+      if bline
+	while bi < bline
+	  discardb(bi, b[bi])
+	  bi += 1
+	end
+	match(ai, bi)
+	bi += 1
+      else
+	discarda(ai, a[ai])
+      end
+      ai += 1
+    end
+    while ai < a.length
+      discarda(ai, a[ai])
+      ai += 1
+    end
+    while bi < b.length
+      discardb(bi, b[bi])
+      bi += 1
+    end
+    match(ai, bi)
+    1
+  end
+
+  def compactdiffs
+    diffs = []
+    @diffs.each { |df|
+      i = 0
+      curdiff = []
+      while i < df.length
+	whot = df[i][0]
+	s = @isstring ? df[i][2].chr : [df[i][2]]
+	p = df[i][1]
+	last = df[i][1]
+	i += 1
+	while df[i] && df[i][0] == whot && df[i][1] == last+1
+	  s << df[i][2]
+	  last  = df[i][1]
+	  i += 1
+	end
+	curdiff.push [whot, p, s]
+      end
+      diffs.push curdiff
+    }
+    return diffs
+  end
+
+  attr_reader :diffs, :difftype
+
+  def initialize(diffs_or_a, b = nil, isstring = nil)
+    if b.nil?
+      @diffs = diffs_or_a
+      @isstring = isstring
+    else
+      @diffs = []
+      @curdiffs = []
+      makediff(diffs_or_a, b)
+      @difftype = diffs_or_a.type
+    end
+  end
+  
+  def match(ai, bi)
+    @diffs.push @curdiffs unless @curdiffs.empty?
+    @curdiffs = []
+  end
+
+  def discarda(i, elem)
+    @curdiffs.push ['-', i, elem]
+  end
+
+  def discardb(i, elem)
+    @curdiffs.push ['+', i, elem]
+  end
+
+  def compact
+    return Diff.new(compactdiffs)
+  end
+
+  def compact!
+    @diffs = compactdiffs
+  end
+
+  def inspect
+    @diffs.inspect
+  end
+
+end
+
+module Diffable
+  def diff(b)
+    Diff.new(self, b)
+  end
+
+  # Create a hash that maps elements of the array to arrays of indices
+  # where the elements are found.
+
+  def reverse_hash(range = (0...self.length))
+    revmap = {}
+    range.each { |i|
+      elem = self[i]
+      if revmap.has_key? elem
+	revmap[elem].push i
+      else
+	revmap[elem] = [i]
+      end
+    }
+    return revmap
+  end
+
+  def replacenextlarger(value, high = nil)
+    high ||= self.length
+    if self.empty? || value > self[-1]
+      push value
+      return high
+    end
+    # binary search for replacement point
+    low = 0
+    while low < high
+      index = (high+low)/2
+      found = self[index]
+      return nil if value == found
+      if value > found
+	low = index + 1
+      else
+	high = index
+      end
+    end
+
+    self[low] = value
+    # $stderr << "replace #{value} : 0/#{low}/#{init_high} (#{steps} steps) (#{init_high-low} off )\n"
+    # $stderr.puts self.inspect
+    #gets
+    #p length - low
+    return low
+  end
+
+  def patch(diff)
+    newary = nil
+    if diff.difftype == String
+      newary = diff.difftype.new('')
+    else
+      newary = diff.difftype.new
+    end
+    ai = 0
+    bi = 0
+    diff.diffs.each { |d|
+      d.each { |mod|
+	case mod[0]
+	when '-'
+	  while ai < mod[1]
+	    newary << self[ai]
+	    ai += 1
+	    bi += 1
+	  end
+	  ai += 1
+	when '+'
+	  while bi < mod[1]
+	    newary << self[ai]
+	    ai += 1
+	    bi += 1
+	  end
+	  newary << mod[2]
+	  bi += 1
+	else
+	  raise "Unknown diff action"
+	end
+      }
+    }
+    while ai < self.length
+      newary << self[ai]
+      ai += 1
+      bi += 1
+    end
+    return newary
+  end
+end
+
+class Array
+  include Diffable
+end
+
+class String
+  include Diffable
+end
+
+=begin
+= Diff
+(({diff.rb})) - computes the differences between two arrays or
+strings. Copyright (C) 2001 Lars Christensen
+
+== Synopsis
+
+    diff = Diff.new(a, b)
+    b = a.patch(diff)
+
+== Class Diff
+=== Class Methods
+--- Diff.new(a, b)
+--- a.diff(b)
+      Creates a Diff object which represent the differences between
+      ((|a|)) and ((|b|)). ((|a|)) and ((|b|)) can be either be arrays
+      of any objects, strings, or object of any class that include
+      module ((|Diffable|))
+
+== Module Diffable
+The module ((|Diffable|)) is intended to be included in any class for
+which differences are to be computed. Diffable is included into String
+and Array when (({diff.rb})) is (({require}))'d.
+
+Classes including Diffable should implement (({[]})) to get element at
+integer indices, (({<<})) to append elements to the object and
+(({ClassName#new})) should accept 0 arguments to create a new empty
+object.
+
+=== Instance Methods
+--- Diffable#patch(diff)
+      Applies the differences from ((|diff|)) to the object ((|obj|))
+      and return the result. ((|obj|)) is not changed. ((|obj|)) and
+      can be either an array or a string, but must match the object
+      from which the ((|diff|)) was created.
+=end

data/lib/journeta.rb

@@ -1,3 +1,4 @@
+# Copyright 2009, Preston Lee Ventures, LLC. All rights reserved.
 
 require 'yaml'
 require 'set'

data/lib/journeta/asynchronous.rb

@@ -1,6 +1,6 @@
-# Copyright © 2007 OpenRain, LLC. All rights reserved.
+# Copyright © 2011 Preston Lee Ventures, LLC. All rights reserved.
 #
-# Preston Lee <preston.lee@openrain.com>
+# Preston Lee <preston.lee@prestonlee.com>
 
 
 require 'journeta/logger'