facets 2.3.0 → 2.4.0

data/lib/core/facets/proc/compose.rb

@@ -1,41 +0,0 @@
-class Proc
-
-  # Returns a new proc that is the functional
-  # composition of two procs, in order.
-  #
-  #   a = lambda { |x| x + 4 }
-  #   b = lambda { |y| y / 2 }
-  #
-  #   a.compose(b).call(4)  #=> 6
-  #   b.compose(a).call(4)  #=> 4
-  #
-  #   CREDIT: Dave
-
-  def compose(g)
-    raise ArgumentError, "arity count mismatch" unless arity == g.arity
-    lambda{ |*a| self[ *g[*a] ] }
-  end
-
-  # Operator for Proc#compose and Integer#times_collect/of.
-  #
-  #   a = lambda { |x| x + 4 }
-  #   b = lambda { |y| y / 2 }
-  #
-  #   (a * b).call(4)  #=> 6
-  #   (b * a).call(4)  #=> 4
-  #
-  #   CREDIT: Dave
-
-  def *(x)
-    if Integer===x
-      # collect times
-      c = []
-      x.times{|i| c << call(i)}
-      c
-    else
-      # compose procs
-      lambda{|*a| self[x[*a]]}
-    end
-  end
-
-end

data/lib/core/facets/proc/fn.rb

@@ -1,12 +0,0 @@
-module Kernel
-
-  # A nice shorthand for lambda.
-  #
-  #   adder = fn { |x,y| x + y }
-  #   adder[1,2]  #=> 3
-  #
-  #   CREDIT: Trans
-
-  alias_method :fn, :lambda
-
-end

data/lib/core/facets/proc/op_mul.rb

@@ -1 +0,0 @@
-require 'facets/proc/compose.rb'

data/lib/core/facets/proc/to_h.rb

@@ -1 +0,0 @@
-require 'facets/conversion.rb'

data/lib/core/facets/proc/to_method.rb

@@ -1 +0,0 @@
-require 'facets/proc/bind.rb'

data/lib/core/facets/proc/update.rb

@@ -1,9 +0,0 @@
-class Proc
-
-  # Use a Proc as an observable.
-  #
-  #   CREDIT: Tim Pease
-
-  alias_method :update, :call
-
-end

data/lib/core/facets/range.rb

@@ -1,2 +0,0 @@
-require 'facets/range/overlap.rb'
-require 'facets/range/combine.rb'

data/lib/core/facets/range/combine.rb

@@ -1,47 +0,0 @@
-class Range
-
-  # Combine intervals.
-  #
-  #   Range.combine(1..2, 2..4)   #=> [1..4]
-  #   Range.combine(1..2, 3..4)   #=> [1..2, 3..4]
-  #
-  #   CREDIT: Trans
-
-  def self.combine(*intervals)
-    intype = intervals.first.class
-    result = []
-
-    intervals = intervals.collect do |i|
-      [i.first, i.last]
-    end
-
-    intervals.sort.each do |(from, to)|  #inject([]) do |result,
-      if result.empty? or from > result.last[1]
-        result << [from, to]
-      elsif to > result.last[1]
-        result.last[1] = to
-      end
-      #result
-    end
-
-    if intype <= Range
-      result.collect{ |i| ((i.first)..(i.last)) }
-    else
-      result
-    end
-  end
-
-  # Combine ranges.
-  #
-  #   (1..2).combine(2..4)   #=> [1..4]
-  #   (1..2).combine(3..4)   #=> [1..2, 3..4]
-  #
-  #   TODO: Incorporate end-sentinal inclusion vs. exclusion.
-  #
-  #   CREDIT: Trans
-
-  def combine(*intervals)
-    Range.combine(self, *intervals)
-  end
-
-end

data/lib/core/facets/range/overlap.rb

@@ -1,74 +0,0 @@
-class Range
-
-  # Do two ranges overlap?
-  #
-  #   CREDIT: Daniel Schierbeck
-  #   CREDIT: Brandon Keepers
-
-  def overlap?(other)
-    include?(other.first) or other.include?(first)
-  end
-
-  # Returns a two element array of the relationship
-  # between two Ranges.
-  #
-  # Diagram:
-  #
-  #     Relationship     Returns
-  #
-  #   self |-----------|
-  #   r    |-----------|    [0,0]
-  #
-  #   self |-----------|
-  #   r     |---------|     [-1,-1]
-  #
-  #   self  |---------|
-  #   r    |-----------|    [1,1]
-  #
-  #   self |-----------|
-  #   r     |----------|    [-1,0]
-  #
-  #   self |-----------|
-  #   r     |-----------|   [-1,1]
-  #
-  #   etc.
-  #
-  # Example:
-  #
-  #   (0..3).umbrella(1..2)  #=>  [-1,-1]
-  #
-  #   CREDIT: Trans
-  #   CREDIT: Chris Kappler
-
-  def umbrella(r)
-    s = first <=> r.first
-    e = r.last <=> last
-
-    if e == 0
-      if r.exclude_end? and exclude_end?
-        e = r.max <=> max
-      else
-        e = (r.exclude_end? ? 0 : 1) <=> (exclude_end? ? 0 : 1)
-      end
-    end
-
-    return s,e
-  end
-
-  # Uses the Range#umbrella method to determine
-  # if another Range is _anywhere_ within this Range.
-  #
-  #   (1..3).within?(0..4)  #=> true
-  #
-  #   CREDIT: Trans
-
-  def within?(rng)
-    case rng.umbrella(self)
-    when [0,0], [-1,0], [0,-1], [-1,-1]
-      return true
-    else
-      return false
-    end
-  end
-
-end

data/lib/core/facets/range/to_r.rb

@@ -1 +0,0 @@
-require 'facets/conversion.rb'

data/lib/core/facets/range/to_range.rb

@@ -1 +0,0 @@
-require 'facets/conversion.rb'

data/lib/core/facets/range/umbrella.rb

@@ -1 +0,0 @@
-require 'facets/range/overlap.rb'

data/lib/core/facets/range/within.rb

@@ -1 +0,0 @@
-require 'facets/range/overlap.rb'

data/lib/core/facets/regexp.rb

@@ -1 +0,0 @@
-require 'facets/regexp/arity.rb'

data/lib/core/facets/regexp/arity.rb

@@ -1,17 +0,0 @@
-class Regexp
-
-  # Returns the number of backreferencing subexpressions.
-  #
-  #   /(a)(b)(c)/.arity  #=> 3
-  #   /(a(b(c)))/.arity  #=> 3
-  #
-  # Note that this is not perfect, especially with regards to \x
-  # and embedded comments.
-  #
-  #   CREDIT: Trans
-
-  def arity
-    source.scan( /(?!\\)[(](?!\?[#=:!>-imx])/ ).length
-  end
-
-end

data/lib/core/facets/regexp/to_re.rb

@@ -1 +0,0 @@
-require 'facets/conversion.rb'

data/lib/core/facets/regexp/to_regexp.rb

@@ -1 +0,0 @@
-require 'facets/conversion.rb'

data/lib/core/facets/stackable.rb

@@ -1,86 +0,0 @@
-# = TITLE:
-#
-#   Stackable
-#
-# = DESCRIPTION:
-#
-#   Stackable mixin provides #pop, #push, #pull, etc.
-#   It depends on #slice, #splice and #insert.
-#
-# = COPYRIGHT:
-#
-#   Copyright (c) 2007 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.
-#
-# = AUTHORS:
-#
-#   - Thomas Sawyer
-
-# Stackable mixin provides #pop, #push, #pull, etc.
-# It depends on #slice, #splice and #insert.
-
-module Stackable
-
-  # Pop item off stack.
-  #
-  #   a = [1, 2, 3]
-  #   a.pop           #=> 3
-  #   a               #=> [1, 2]
-
-  def pop
-    splice(-1)
-  end
-
-  # Push item onto the stack.
-  #
-  #   a = [1, 2]
-  #   a.push(3)       #=> [1, 2, 3]
-
-  def push(x)
-    insert(-1,x)
-  end
-
-  # Pull item off the stack.
-  #
-  #   a = [1, 2, 3]
-  #   a.pull          #=> 1
-  #   a               #=> [2, 3]
-
-  def pull
-    slice(0)
-  end
-
-  alias_method :shift, :pull
-
-  # Poke item onto the stack.
-  #
-  #   a = [2, 3]
-  #   a.poke(1)       #=> [1, 2, 3]
-  #
-  #   TODO: Better name (besides unshift)?
-
-  def poke(x)
-    insert(0,x)
-  end
-
-  alias_method :unshift, :poke
-
-  # Peek at the top of the stack.
-  #
-  #   a = [1, 2, 3]
-  #   a.peek          #=> 3
-  #   a               #=> [1, 2, 3]
-
-  def peek
-    splice(-1)
-  end
-
-end

data/lib/core/facets/string.rb

@@ -1,20 +0,0 @@
-require 'facets/string/interpolate.rb'
-require 'facets/string/splice.rb'
-require 'facets/string/scan.rb'
-require 'facets/string/filter.rb'
-require 'facets/string/blank.rb'
-require 'facets/string/partitions.rb'
-require 'facets/string/stackable.rb'
-require 'facets/string/tabs.rb'
-require 'facets/string/align.rb'
-require 'facets/string/indexable.rb'
-require 'facets/string/range.rb'
-require 'facets/string/regesc.rb'
-require 'facets/string/crypt.rb'
-require 'facets/string/nchar.rb'
-require 'facets/string/bracket.rb'
-require 'facets/string/case.rb'
-require 'facets/string/natcmp.rb'
-require 'facets/string/op'
-require 'facets/string/wrap'
-

data/lib/core/facets/string/_crypt.rb

@@ -1 +0,0 @@
-require 'facets/string/crypt.rb'

data/lib/core/facets/string/align.rb

@@ -1,92 +0,0 @@
-class String
-
-  # Align a string to the right.
-  # The defualt alignment seperation is a new line ("/n")
-  # This can be changes as can be the padding string which
-  # defaults to a single space (' ').
-  #
-  #   s = <<-EOS
-  #   This is a test
-  #     and
-  #     so on
-  #   EOS
-  #
-  #   puts s.align_right(2)
-  #
-  # _produces_
-  #
-  #     This is a test
-  #                and
-  #              so on
-  #
-  #   CREDIT: Trans
-
-  def align_right(n, sep="\n", c=' ')
-    return rjust(n.to_i,c.to_s) if sep==nil
-    q = split(sep.to_s).collect { |line|
-      line.rjust(n.to_i,c.to_s)
-    }
-    q.join(sep.to_s)
-  end
-
-  # Align a string to the left.
-  #
-  # The defualt alignment seperation is a new line ("/n")
-  # This can be changes as can be the padding string which
-  # defaults to a single space (' ').
-  #
-  #   s = <<-EOS
-  #   This is a test
-  #     and
-  #     so on
-  #   EOS
-  #
-  #   puts s.align_left(2)
-  #
-  # _produces_
-  #
-  #     This is a test
-  #     and
-  #     so on
-  #
-  #   CREDIT: Trans
-
-  def align_left(n, sep="\n", c=' ')
-    return ljust(n.to_i,c.to_s) if sep==nil
-    q = split(sep.to_s).collect { |line|
-      line.ljust(n.to_i,c.to_s)
-    }
-    q.join(sep.to_s)
-  end
-
-  # Centers each line of a string.
-  #
-  # The defualt alignment seperation is a new line ("/n")
-  # This can be changed as can be the padding string which
-  # defaults to a single space (' ').
-  #
-  #   s = <<-EOS
-  #     This is a test
-  #     and
-  #     so on
-  #   EOS
-  #
-  #   puts s.align_center(14)
-  #
-  # _produces_
-  #
-  #   This is a test
-  #        and
-  #       so on
-  #
-  #   CREDIT: Trans
-
-  def align_center(n, sep="\n", c=' ')
-    return center(n.to_i,c.to_s) if sep==nil
-    q = split(sep.to_s).collect { |line|
-      line.center(n.to_i,c.to_s)
-    }
-    q.join(sep.to_s)
-  end
-
-end