backstack 0.1.0 → 0.2.0

data/VERSION

@@ -1 +1 @@
-0.1.0
+0.2.0

data/backstack.gemspec

@@ -5,11 +5,11 @@
 
 Gem::Specification.new do |s|
   s.name = %q{backstack}
-  s.version = "0.1.0"
+  s.version = "0.2.0"
 
   s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
   s.authors = ["Kevin Swope"]
-  s.date = %q{2011-07-09}
+  s.date = %q{2011-07-10}
   s.description = %q{Rails plugin used to dynamically and intelligently generate "back" links or a breadcrumb trail.}
   s.email = %q{git-kevdev@snkmail.com}
   s.extra_rdoc_files = [
@@ -24,7 +24,18 @@ Gem::Specification.new do |s|
     "README.rdoc",
     "Rakefile",
     "VERSION",
+    "art/animation/1.gif",
+    "art/animation/2.gif",
+    "art/animation/3.gif",
+    "art/animation/4.gif",
+    "art/animation/5.gif",
+    "art/animation/6.gif",
+    "art/animation/anim.gif",
+    "art/backlinks.gif",
+    "art/bowling_pins (Autosaved).graffle",
     "art/bowling_pins.graffle",
+    "art/complete.gif",
+    "art/idealized.gif",
     "backstack.gemspec",
     "lib/backstack.rb",
     "lib/backstacklib.rb",

data/lib/backstack.rb

@@ -42,15 +42,15 @@ module BackStack
       # both keys and values.
       normalizer = lambda {|x| bs_action_normal(controller_name, x) }
 
-      # Add new edges to existing graph, and extract out the names.
-      # bs_add_edges will also accumulate names for us.
-      @bs_graph, @bs_names = bs_add_edges(@bs_graph, @bs_names, 
+      # Add new edges to existing graph, and extract out the labels.
+      # bs_add_edges will also accumulate labels for us.
+      @bs_graph, @bs_labels = bs_add_edges(@bs_graph, @bs_labels, 
                                           edges, normalizer)
 
     end
 
     # So ApplicationController methods can reach @bs_graph and
-    # @bs_names.  I wanted to use @@bs_graph, so both AC::B and the
+    # @bs_labels.  I wanted to use @@bs_graph, so both AC::B and the
     # instance of AC could reach it, but this mysteriously breaks
     # rails routing!  So here are getters than we can use and access
     # from the AC instance as self.class.get_bs_graph.  RoR can be a
@@ -59,8 +59,8 @@ module BackStack
       @bs_graph
     end
 
-    def get_bs_names
-      @bs_names
+    def get_bs_labels
+      @bs_labels
     end
 
     send :include, InstanceMethods
@@ -94,7 +94,7 @@ module BackStack
 
       hashify = lambda{|x|
         c, a = x[0].split /#/
-        {:controller => c, :action => a, :fullpath => x[1], :name => x[2]}
+        {:controller => c, :action => a, :fullpath => x[1], :label => x[2]}
       }
 
       if block_given?
@@ -133,7 +133,7 @@ class ActionController::Base
     puts "=== backstack_dump() " + '=' * 50
 
     puts "backstack graph: #{self.class.get_bs_graph}"
-    puts "backstack names: #{self.class.get_bs_names}"
+    puts "backstack labels: #{self.class.get_bs_labels}"
     puts "backstack stack: #{session[:bs_stack]}"
 
     puts '=' * 71
@@ -150,7 +150,7 @@ class ActionController::Base
                                  session[:bs_stack], 
                                  action,
                                  request.fullpath,
-                                 self.class.get_bs_names[action])
+                                 self.class.get_bs_labels[action])
 
   end
 

data/lib/backstacklib.rb

@@ -30,35 +30,35 @@ module BackStackLib
   # Note: the shorthand form of the edges parameter can be taken as far as
   # something like this {[:d, :e, :f] => [:b, :c]}
   #
-  # New feature: named nodes.  Instead of {:c => :a}, the "key" can be
-  # named like this {{:c => "Charlie"} => :a}.  We're going to remove
-  # those named keys, replace them with just the key, and return them as
+  # New feature: labeled nodes.  Instead of {:c => :a}, the "key" can be
+  # labeled like this {{:c => "Charlie"} => :a}.  We're going to remove
+  # those labeled keys, replace them with just the key, and return them as
   # the second value
   #
   # Decided to allow user to pass a normalizer proc/lambda in to
   # modify all the keys and values.
-  def bs_add_edges(graph, names, edges, normalizer=nil)
+  def bs_add_edges(graph, labels, edges, normalizer=nil)
 
     graph ||= {}
-    names ||= {}
+    labels ||= {}
 
     edges.each do |k,v| # k is a scalar or array, same with v
 
       # Does this [x].flatten idiom make it less readable?
       [k].flatten.each do |x|
 
-        # Extract names out into their own hash, and normalize key
-        if x.class == Hash # if its a hash it contains a name
-          names[x.first[0]] = x.first[1]
-          x = x.first[0] # remove name and replace with normal key
+        # Extract labels out into their own hash, and normalize key
+        if x.class == Hash # if its a hash it contains a label
+          labels[x.first[0]] = x.first[1]
+          x = x.first[0] # remove label and replace with normal key
         end
 
         # Run normalizer on all keys and values of new edges
         if normalizer
           x = normalizer.call(x)
           v = [v].flatten.map{|y| normalizer.call(y)}
-          # also run normalizer on names keys
-          names = Hash[names.map {|k,v| [normalizer.call(k), v]}]
+          # also run normalizer on labels keys
+          labels = Hash[labels.map {|k,v| [normalizer.call(k), v]}]
         end
 
         # If merge finds dupe keys it will use block to determine
@@ -71,20 +71,20 @@ module BackStackLib
 
     end
 
-    [graph, names]
+    [graph, labels]
 
   end
 
   # Judging by graph, push onto stack if appropriate.  Pushing doesn't
   # necessarily build stack up, it might cause a rewind and actually
   # shrink stack.
-  def bs_push(graph, stack, action, fullpath, name=nil)
+  def bs_push(graph, stack, action, fullpath, label=nil)
 
     # bs_push might be called before there is a graph or stack
     graph ||= {}
     stack ||= []
 
-    element = [action, fullpath, name]
+    element = [action, fullpath, label]
 
     # if action closes to what's on top of stack, build stack up
     if graph[action] && stack.last && graph[action].include?(stack.last.first)

data/test/rails_root/Gemfile.lock

@@ -1,7 +1,7 @@
 PATH
   remote: ../..
   specs:
-    backstack (0.0.0)
+    backstack (0.1.0)
 
 GEM
   remote: http://rubygems.org/

data/test/rails_root/app/views/layouts/_pins.html.erb

@@ -18,9 +18,9 @@
 <p class="trail" id="link_trail">
   <% backstack_trail do |c| %>
     <% if c[:fullpath] == request.fullpath %>
-      <%= c[:name] %> /
+      <%= c[:label] %> /
     <% else %>
-      <%= smart_link_to(c[:name], c[:fullpath]) %> /
+      <%= smart_link_to(c[:label], c[:fullpath]) %> /
     <% end %>
   <% end %>
 </p>
@@ -29,9 +29,9 @@
 <%# trail demonstrating calling without block returns array, no links this time %>
 <p class="trail" id="no_link_trail">
 
-  <% links = [] %>
-  <% backstack_trail.each {|c| links.push c[:name] } %>
-  <%= links.join(" / ").html_safe %>
+  <% crumbs = [] %>
+  <% backstack_trail.each {|c| crumbs.push c[:label] } %>
+  <%= crumbs.join(" / ").html_safe %>
 
 </p>
 

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: backstack
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.2.0
   prerelease: 
 platform: ruby
 authors:
@@ -9,12 +9,12 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2011-07-09 00:00:00.000000000 -04:00
+date: 2011-07-10 00:00:00.000000000 -04:00
 default_executable: 
 dependencies:
 - !ruby/object:Gem::Dependency
   name: minitest
-  requirement: &2153556140 !ruby/object:Gem::Requirement
+  requirement: &2152716200 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -22,10 +22,10 @@ dependencies:
         version: '0'
   type: :development
   prerelease: false
-  version_requirements: *2153556140
+  version_requirements: *2152716200
 - !ruby/object:Gem::Dependency
   name: bundler
-  requirement: &2153555660 !ruby/object:Gem::Requirement
+  requirement: &2152715720 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ~>
@@ -33,10 +33,10 @@ dependencies:
         version: 1.0.0
   type: :development
   prerelease: false
-  version_requirements: *2153555660
+  version_requirements: *2152715720
 - !ruby/object:Gem::Dependency
   name: jeweler
-  requirement: &2153555180 !ruby/object:Gem::Requirement
+  requirement: &2152715240 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ~>
@@ -44,10 +44,10 @@ dependencies:
         version: 1.6.0
   type: :development
   prerelease: false
-  version_requirements: *2153555180
+  version_requirements: *2152715240
 - !ruby/object:Gem::Dependency
   name: rcov
-  requirement: &2153571060 !ruby/object:Gem::Requirement
+  requirement: &2152714760 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -55,7 +55,7 @@ dependencies:
         version: '0'
   type: :development
   prerelease: false
-  version_requirements: *2153571060
+  version_requirements: *2152714760
 description: Rails plugin used to dynamically and intelligently generate "back" links
   or a breadcrumb trail.
 email: git-kevdev@snkmail.com
@@ -72,7 +72,18 @@ files:
 - README.rdoc
 - Rakefile
 - VERSION
+- art/animation/1.gif
+- art/animation/2.gif
+- art/animation/3.gif
+- art/animation/4.gif
+- art/animation/5.gif
+- art/animation/6.gif
+- art/animation/anim.gif
+- art/backlinks.gif
+- art/bowling_pins (Autosaved).graffle
 - art/bowling_pins.graffle
+- art/complete.gif
+- art/idealized.gif
 - backstack.gemspec
 - lib/backstack.rb
 - lib/backstacklib.rb
@@ -160,7 +171,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
       version: '0'
       segments:
       - 0
-      hash: -3534997333895431026
+      hash: -463953268826810848
 required_rubygems_version: !ruby/object:Gem::Requirement
   none: false
   requirements: