tablr 0.1

data/CHANGELOG

@@ -0,0 +1,3 @@
+0.1 - July 18th, 2011
+
+* Initial release

data/COPYING

@@ -0,0 +1,10 @@
+Copyright (c) 2011, Daniel Durante
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+    * Neither the name of Sinatra Fedora nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

data/README.markdown

@@ -0,0 +1,60 @@
+# Tablr #
+
+Easy console tables in Ruby
+
+## Examples ##
+
+    # New table
+    table = Tablr.new
+    
+    # We can name our columns initially...
+    table.columns ['Column X', 'Column 2', 'Column 3']
+    
+    # Or we can just add a column on the fly
+    (1..20).each do |number|
+      table.add_row 'Column 1', "Entry #{number}"
+    end
+    
+    # Just for more filler...
+    (1..10).each do
+      table.add_row 'Column 2', "Random: #{rand(20)}"
+    end
+    
+    # And let's print!
+    table.print
+
+### RESULTS ###
+
+    +----------+------------+----------+----------+
+    | Column X | Column 2   | Column 3 | Column 1 |
+    +----------+------------+----------+----------+
+    |          | Random: 8  |          | Entry 1  |
+    |          | Random: 3  |          | Entry 2  |
+    |          | Random: 10 |          | Entry 3  |
+    |          | Random: 17 |          | Entry 4  |
+    |          | Random: 4  |          | Entry 5  |
+    |          | Random: 1  |          | Entry 6  |
+    |          | Random: 19 |          | Entry 7  |
+    |          | Random: 15 |          | Entry 8  |
+    |          | Random: 5  |          | Entry 9  |
+    |          | Random: 11 |          | Entry 10 |
+    |          |            |          | Entry 11 |
+    |          |            |          | Entry 12 |
+    |          |            |          | Entry 13 |
+    |          |            |          | Entry 14 |
+    |          |            |          | Entry 15 |
+    |          |            |          | Entry 16 |
+    |          |            |          | Entry 17 |
+    |          |            |          | Entry 18 |
+    |          |            |          | Entry 19 |
+    |          |            |          | Entry 20 |
+    |          |            |          |          |
+    +----------+------------+----------+----------+
+
+## TODO ##
+
+* Clean up the code (always)
+* A way to delete a row all across columns or a specific column
+* Join cells together (Dkubb's Veritas?)
+* Quicker way to add rows
+* Basic expressions (SUM, AVG, etc).

data/lib/support/orderedhash.rb

@@ -0,0 +1,434 @@
+module TablrSpace
+  # TITLE:
+  #
+  #   OrderedHash (originally Dictionary)
+  #
+  # AUTHORS:
+  #
+  #   - Jan Molic
+  #   - Thomas Sawyer
+  #
+  # CREDIT:
+  #
+  #   - Andrew Johnson (merge, to_a, inspect, shift and Hash[])
+  #   - Jeff Sharpe    (reverse and reverse!)
+  #   - Thomas Leitner (has_key? and key?)
+  #
+  # LICENSE:
+  #
+  #   Copyright (c) 2005 Jan Molic, Thomas Sawyer
+  #
+  #   Ruby License
+  #
+  #   This module is free software. You may use, modify, and/or redistribute this
+  #   software under the same terms as Ruby.
+  #
+  #   This program is distributed in the hope that it will be useful, but WITHOUT
+  #   ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
+  #   FOR A PARTICULAR PURPOSE.
+  #
+  #   Originally ported from OrderHash 2.0, Copyright (c) 2005 jan molic
+  #
+  # LOG:
+  #
+  #   - 2007.10.31 trans
+  #     Fixed initialize so the constructor blocks correctly effected dictionary
+  #     rather then just the internal hash.
+
+  # = Dictionary
+  #
+  # The Dictionary class is a Hash that preserves order.
+  # So it has some array-like extensions also. By defualt
+  # a Dictionary object preserves insertion order, but any
+  # order can be specified including alphabetical key order.
+  #
+  # == Usage
+  #
+  # Just require this file and use Dictionary instead of Hash.
+  #
+  #   # You can do simply
+  #   hsh = Dictionary.new
+  #   hsh['z'] = 1
+  #   hsh['a'] = 2
+  #   hsh['c'] = 3
+  #   p hsh.keys     #=> ['z','a','c']
+  #
+  #   # or using Dictionary[] method
+  #   hsh = Dictionary['z', 1, 'a', 2, 'c', 3]
+  #   p hsh.keys     #=> ['z','a','c']
+  #
+  #   # but this doesn't preserve order
+  #   hsh = Dictionary['z'=>1, 'a'=>2, 'c'=>3]
+  #   p hsh.keys     #=> ['a','c','z']
+  #
+  #   # Dictionary has useful extensions: push, pop and unshift
+  #   p hsh.push('to_end', 15)       #=> true, key added
+  #   p hsh.push('to_end', 30)       #=> false, already - nothing happen
+  #   p hsh.unshift('to_begin', 50)  #=> true, key added
+  #   p hsh.unshift('to_begin', 60)  #=> false, already - nothing happen
+  #   p hsh.keys                     #=> ["to_begin", "a", "c", "z", "to_end"]
+  #   p hsh.pop                      #=> ["to_end", 15], if nothing remains, return nil
+  #   p hsh.keys                     #=> ["to_begin", "a", "c", "z"]
+  #   p hsh.shift                    #=> ["to_begin", 30], if nothing remains, return nil
+  #
+  # == Usage Notes
+  #
+  # * You can use #order_by to set internal sort order.
+  # * #<< takes a two element [k,v] array and inserts.
+  # * Use ::auto which creates Dictionay sub-entries as needed.
+  # * And ::alpha which creates a new Dictionary sorted by key.
+  class OrderedHash
+
+    include Enumerable
+
+    class << self
+      #--
+      # TODO is this needed? Doesn't the super class do this?
+      #++
+      def [](*args)
+        hsh = new
+        if Hash === args[0]
+          hsh.replace(args[0])
+        elsif (args.size % 2) != 0
+          raise ArgumentError, "odd number of elements for Hash"
+        else
+          while !args.empty?
+            hsh[args.shift] = args.shift
+          end
+        end
+        hsh
+      end
+
+      # Like #new but the block sets the order.
+      #
+      def new_by(*args, &blk)
+        new(*args).order_by(&blk)
+      end
+
+      # Alternate to #new which creates a dictionary sorted by key.
+      #
+      #   d = Dictionary.alpha
+      #   d["z"] = 1
+      #   d["y"] = 2
+      #   d["x"] = 3
+      #   d  #=> {"x"=>3,"y"=>2,"z"=>2}
+      #
+      # This is equivalent to:
+      #
+      #   Dictionary.new.order_by { |key,value| key }
+      def alpha(*args, &block)
+        new(*args, &block).order_by_key
+      end
+
+      # Alternate to #new which auto-creates sub-dictionaries as needed.
+      #
+      #   d = Dictionary.auto
+      #   d["a"]["b"]["c"] = "abc"  #=> { "a"=>{"b"=>{"c"=>"abc"}}}
+      #
+      def auto(*args)
+        #AutoDictionary.new(*args)
+        leet = lambda { |hsh, key| hsh[key] = new(&leet) }
+        new(*args, &leet)
+      end
+    end
+
+     # New Dictionary.
+    def initialize(*args, &blk)
+      @order = []
+      @order_by = nil
+      if blk
+        dict = self                                  # This ensure autmatic key entry effect the
+        oblk = lambda{ |hsh, key| blk[dict,key] }    # dictionary rather then just the interal hash.
+        @hash = Hash.new(*args, &oblk)
+      else
+        @hash = Hash.new(*args)
+      end
+    end
+
+    def order
+      reorder if @order_by
+      @order
+    end
+
+    # Keep dictionary sorted by a specific sort order.
+    def order_by( &block )
+      @order_by = block
+      order
+      self
+    end
+
+    # Keep dictionary sorted by key.
+    #
+    #   d = Dictionary.new.order_by_key
+    #   d["z"] = 1
+    #   d["y"] = 2
+    #   d["x"] = 3
+    #   d  #=> {"x"=>3,"y"=>2,"z"=>2}
+    #
+    # This is equivalent to:
+    #
+    #   Dictionary.new.order_by { |key,value| key }
+    #
+    # The initializer Dictionary#alpha also provides this.
+    def order_by_key
+      @order_by = lambda { |k,v| k }
+      order
+      self
+    end
+
+    # Keep dictionary sorted by value.
+    #
+    #   d = Dictionary.new.order_by_value
+    #   d["z"] = 1
+    #   d["y"] = 2
+    #   d["x"] = 3
+    #   d  #=> {"x"=>3,"y"=>2,"z"=>2}
+    #
+    # This is equivalent to:
+    #
+    #   Dictionary.new.order_by { |key,value| value }
+    def order_by_value
+      @order_by = lambda { |k,v| v }
+      order
+      self
+    end
+
+    #
+    def reorder
+      if @order_by
+        assoc = @order.collect{ |k| [k,@hash[k]] }.sort_by(&@order_by)
+        @order = assoc.collect{ |k,v| k }
+      end
+      @order
+    end
+
+    def ==(hsh2)
+      if hsh2.is_a?( Dictionary )
+        @order == hsh2.order &&
+        @hash  == hsh2.instance_variable_get("@hash")
+      else
+        false
+      end
+    end
+
+    def [] k
+      @hash[ k ]
+    end
+
+    def fetch(k, *a, &b)
+      @hash.fetch(k, *a, &b)
+    end
+
+    # Store operator.
+    #
+    #   h[key] = value
+    #
+    # Or with additional index.
+    #
+    #  h[key,index] = value
+    def []=(k, i=nil, v=nil)
+      if v
+        insert(i,k,v)
+      else
+        store(k,i)
+      end
+    end
+
+    def insert( i,k,v )
+      @order.insert( i,k )
+      @hash.store( k,v )
+    end
+
+    def store( a,b )
+      @order.push( a ) unless @hash.has_key?( a )
+      @hash.store( a,b )
+    end
+
+    def clear
+      @order = []
+      @hash.clear
+    end
+
+    def delete( key )
+      @order.delete( key )
+      @hash.delete( key )
+    end
+
+    def each_key
+      order.each { |k| yield( k ) }
+      self
+    end
+
+    def each_value
+      order.each { |k| yield( @hash[k] ) }
+      self
+    end
+
+    def each
+      order.each { |k| yield( k,@hash[k] ) }
+      self
+    end
+    alias each_pair each
+
+    def delete_if
+      order.clone.each { |k| delete k if yield(k,@hash[k]) }
+      self
+    end
+
+    def values
+      ary = []
+      order.each { |k| ary.push @hash[k] }
+      ary
+    end
+
+    def keys
+      order
+    end
+
+    def invert
+      hsh2 = self.class.new
+      order.each { |k| hsh2[@hash[k]] = k }
+      hsh2
+    end
+
+    def reject( &block )
+      self.dup.delete_if(&block)
+    end
+
+    def reject!( &block )
+      hsh2 = reject(&block)
+      self == hsh2 ? nil : hsh2
+    end
+
+    def replace( hsh2 )
+      @order = hsh2.order
+      @hash = hsh2.hash
+    end
+
+    def shift
+      key = order.first
+      key ? [key,delete(key)] : super
+    end
+
+    def unshift( k,v )
+      unless @hash.include?( k )
+        @order.unshift( k )
+        @hash.store( k,v )
+        true
+      else
+        false
+      end
+    end
+
+    def <<(kv)
+      push( *kv )
+    end
+
+    def push( k,v )
+      unless @hash.include?( k )
+        @order.push( k )
+        @hash.store( k,v )
+        true
+      else
+        false
+      end
+    end
+
+    def pop
+      key = order.last
+      key ? [key,delete(key)] : nil
+    end
+
+    def inspect
+      ary = []
+      each {|k,v| ary << k.inspect + "=>" + v.inspect}
+      '{' + ary.join(", ") + '}'
+    end
+
+    def dup
+      a = []
+      each{ |k,v| a << k; a << v }
+      self.class[*a]
+    end
+
+    def update( hsh2 )
+      hsh2.each { |k,v| self[k] = v }
+      reorder
+      self
+    end
+    alias :merge! update
+
+    def merge( hsh2 )
+      self.dup.update(hsh2)
+    end
+
+    def select
+      ary = []
+      each { |k,v| ary << [k,v] if yield k,v }
+      ary
+    end
+
+    def reverse!
+      @order.reverse!
+      self
+    end
+
+    def reverse
+      dup.reverse!
+    end
+
+    def first
+      @hash[order.first]
+    end
+
+    def last
+      @hash[order.last]
+    end
+
+    def length
+      @order.length
+    end
+    alias :size :length
+
+    def empty?
+      @hash.empty?
+    end
+
+    def has_key?(key)
+      @hash.has_key?(key)
+    end
+
+    def key?(key)
+      @hash.key?(key)
+    end
+
+    def to_a
+      ary = []
+      each { |k,v| ary << [k,v] }
+      ary
+    end
+
+    def to_json
+      buf = "["
+      map do |k,v|
+        buf << k.to_json
+        buf << ", "
+        buf << v.to_json
+      end.join(", ")
+      buf << "]"
+      buf
+    end
+
+    def to_s
+      self.to_a.to_s
+    end
+
+    def to_hash
+      @hash.dup
+    end
+
+    def to_h
+      @hash.dup
+    end
+  end
+end

data/lib/tablr.rb

@@ -0,0 +1,35 @@
+=begin
+ tablr.rb - Easy console tables with ruby
+ *
+ * Copyright (c) 2011, Daniel Durante <officedebo at gmail dot com>
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright notice,
+ *     this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above copyright
+ *     notice, this list of conditions and the following disclaimer in the
+ *     documentation and/or other materials provided with the distribution.
+ *   * Neither the name of Redis nor the names of its contributors may be used
+ *     to endorse or promote products derived from this software without
+ *     specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+=end
+
+$:.unshift File.dirname(__FILE__)
+
+require 'support/orderedhash.rb'
+require 'tablr/tablr.rb'

data/lib/tablr/tablr.rb

@@ -0,0 +1,112 @@
+class Tablr
+  attr_accessor :columns
+  
+  def initialize(options = {})
+    @columns            ||= TablrSpace::OrderedHash.auto
+    @row_data           ||= TablrSpace::OrderedHash.new
+    options[:separate]  ||= "false"
+    options[:headers]   ||= "true"
+
+    @options = options
+  end
+
+  # Add columns
+  def columns(columns)
+    Array(columns).each { |v| @columns[v] = { :length => v.length, :rows => [] } }
+  end
+  alias_method :column, :columns
+  alias_method :add_column, :columns
+
+  # Add rows
+  def add_row(column, value)
+    add_column(column) unless column_exists?(column) or !column.is_a? String
+
+    Array(value).each do |v|
+      @columns[column][:rows].push v
+      adjust(column, v.length)
+    end
+  end
+
+  # Adjust max width for padding
+  def adjust(column, length)
+    return nil unless column_exists?(column)
+    @columns[column][:length] = length if length > @columns[column][:length]
+  end
+
+  def print
+    str = <<EOL
+#{headers}
+#{lines}
+#{print_rows}#{lines}
+EOL
+    puts str
+  end
+  alias_method :exec, :print
+  alias_method :display, :print
+
+  protected
+
+  def column_exists?(column)
+    @columns.has_key? column
+  end
+
+  def lines
+    str = '+'
+    # Get number of dashes within columns
+    @columns.each { |k,v| str << '-' * v[:length] << '--+' }
+    str
+  end
+
+  def headers
+    return '' if @options[:headers] == "false"
+    str = lines << "\n"
+    @columns.each { |k,v| str << "| #{k}" << " " * str_length(k, v[:length], -1) }
+    str << "|"
+  end
+
+  def print_rows
+    str, array = '', Array.new
+    # Store the max lengths of each header quickly
+    @columns.each do |k,v|
+      array.push v[:length]
+    end
+
+    get_rows.each_with_index do |value, i|
+      str << "|"
+      value.each_with_index do |v, index|
+        str << " #{v}" << " " * str_length(v, array[index].to_i, 0) << " |"
+      end
+      str << "\n"
+      str << lines if @options[:separate] == "true"
+    end
+    str
+  end
+
+  def fill_rows
+    max_count = 0
+    @columns.each_with_index do |v, k|
+      max_count = v[1][:rows].length if v[1][:rows].length > max_count
+    end
+    @columns.each_with_index do |v, k|
+      (0..(max_count-v[1][:rows].length)).each do |i|
+        add_row v[0], ""
+      end
+    end
+  end
+
+  def get_rows
+    count, array = @columns.length-1, Array.new
+    fill_rows
+    @columns.each_with_index do |value, key|
+      value[1][:rows].each_with_index do |v, k|
+        array[k] = [] if array[k].nil?
+        array[k].insert -1, v
+      end
+    end
+    array
+  end
+
+  def str_length(key, length, padding=1)
+    (length-(key.length)-padding).abs
+  end
+end

metadata

@@ -0,0 +1,61 @@
+--- !ruby/object:Gem::Specification 
+name: tablr
+version: !ruby/object:Gem::Version 
+  prerelease: 
+  version: "0.1"
+platform: ruby
+authors: 
+- Daniel Durante
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2011-07-18 00:00:00 -04:00
+default_executable: 
+dependencies: []
+
+description: Create tables easily with Tablr in your console.
+email: officedebo@gmail.com
+executables: []
+
+extensions: []
+
+extra_rdoc_files: []
+
+files: 
+- lib/support/orderedhash.rb
+- lib/tablr/tablr.rb
+- lib/tablr.rb
+- CHANGELOG
+- COPYING
+- README.markdown
+has_rdoc: true
+homepage: https://github.com/durango/Tablr
+licenses: 
+- MIT
+post_install_message: 
+rdoc_options: []
+
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: 1.3.6
+requirements: []
+
+rubyforge_project: 
+rubygems_version: 1.6.2
+signing_key: 
+specification_version: 3
+summary: Tables in your console in Ruby
+test_files: []
+