facets 2.6.0 → 2.7.0

data/lib/more/facets/elementor.rb

@@ -1,133 +0,0 @@
-# = Elementor
-#
-# Provides elementwise functionality.
-#
-# == Authors
-#
-# * Thomas Sawyer
-# * George Moschovitis
-# * Martin DeMello
-#
-# == Notes
-#
-# * This could have been impemented with a generic Functor, rather than
-#   the specialized Elementor, but for the fact Procs can not yet
-#   handle blocks.
-# * There used to be a "Cascading Elementor", but that proved idiotic
-#   in the face of adding an instance_eval block to #every.
-# * Any ideas for a better name for #accumulate? --gmosx
-# * The use of every! and it's relation to Enumerator still seems a bit
-#   off beat. Should #every always use #map? And another method #each?
-#
-# == Copying
-#
-# Copyright (c) 2006 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.
-
-require 'enumerator'
-require 'facets/functor'
-
-module Enumerable
-
-  # Create Elementor.
-
-  def to_elem(meth=nil)
-    Elementor.new(self, meth || :map)
-  end
-
-  def per
-    @__per__ ||= Functor.new do |op|
-      Elementor.new(self, op)
-    end
-  end
-
-  # Returns an elemental object. This allows
-  # you to map a method on to every element.
-  #
-  #   r = [1,2,3].every + 3  #=> [4,5,6]
-
-  def every
-    @_every ||= to_elem
-  end
-
-  # In place version of #every.
-
-  def every!
-    raise NoMethodError unless respond_to?(:map!)
-    @_every_inplace ||= to_elem(:map!)
-  end
-
-  #def every
-  #  @_every ||= Functor.new do |op,*args|
-  #    map{ |a| a.send(op,*args) }
-  #  end
-  #end
-
-  #def every!
-  #  raise NoMethodError unless respond_to?(:map!)
-  #  @_every_inplace ||= Functor.new do |op,*args|
-  #    map!{ |a| a.send(op,*args) }
-  #  end
-  #end
-
-  # Possible name change for every.
-  #
-  #   r = [1,2,3].elements + 3  #=> [4,5,6]
-  #
-  # Certainly reads better.
-
-  alias_method :elements, :every
-  alias_method :elements!, :every!
-
-end
-
-
-# = Elementor
-#
-# Elementor is a type of Functor. Operations
-# applied to it are routed to each element.
-
-class Enumerable::Elementor
-  private(*instance_methods.select{|x| x !~ /^__/ })
-
-  def initialize(elem_object, elem_method=nil)
-    @elem_object = elem_object
-    @elem_method = elem_method || :map
-  end
-
-  def instance_delegate
-    @elem_object
-  end
-
-  def instance_operator
-    @elem_method
-  end
-
-  def method_missing(sym,*args,&blk)
-    @elem_object.__send__(@elem_method){ |x| x.__send__(sym,*args,&blk) }
-  end
-end
-
-
-class Enumerable::Enumerator
-
-  # Create Elementor.
-
-  def to_elem(meth=nil)
-    Elementor.new(self, meth || :each)
-  end
-
-  # Enumerator doesn't support inplace element operations, per se.
-
-  undef_method :every!
-  undef_method :elements!
-end
-

data/lib/more/facets/filter.rb

@@ -1,121 +0,0 @@
-require 'facets/enumerable/take'
-require 'facets/enumerator'
-
-module Enumerable
-
-  # Without a block: wrap the Enumerable object in such a way that map,
-  # select and similar operations are performed "horizontally" across a
-  # series of blocks, instead of building an array of results at each step.
-  # This reduces memory usage, allows partial results to be provided
-  # early, and permits working with infinite series.
-  #
-  #   (1..1_000_000_000).filter.select{ |i| i % 2 == 0 }.
-  #                             map{ |i| i + 100 }.
-  #                             take(10).to_a
-  #
-  # With a block: the block acts as an arbitrary filter on the data. Unlike
-  # map, it can choose to drop elements from the result, and/or add
-  # additional ones. The first object passed to the block is the receiver
-  # of the output.
-  #
-  #   (1..1_000_000_000).
-  #     filter { |out,i| out << i if i % 2 == 0 }.  # like select
-  #     filter { |out,i| out << i + 100 }.          # like map
-  #     take(10).each { |i| puts i }
-  #
-  # Use a method like to_a or to_h at the end of the chain if you want an
-  # Array or Hash built with the results, or each { ... } if you just want
-  # to output each result and discard it.
-  #
-  def filter(&blk)
-    if block_given?
-      Enumerator::Filter.new do |output|
-        each do |*input|
-          yield output, *input
-        end
-      end
-    else
-      Enumerator::Filter.new do |output|
-        each do |*input|
-          output.yield *input
-        end
-      end
-    end
-  end
-
-  # = Filterable
-  #
-  # Classes which include Enumerable::Filterable will get versions
-  # of map, select etc. which return a Filter, so that they work
-  # horizontally without creating intermediate arrays.
-  #
-  module Filterable
-    def map
-      Enumerator::Filter.new do |output|
-        each do |*input|
-          output.yield yield(*input)
-        end
-      end
-    end
-    alias :collect :map
-
-    def select
-      Enumerator::Filter.new do |output|
-        each do |*input|
-          output.yield(*input) if yield(*input)
-        end
-      end
-    end
-    alias :find_all :select
-
-    def reject
-      Enumerator::Filter.new do |output|
-        each do |*input|
-          output.yield(*input) unless yield(*input)
-        end
-      end
-    end
-
-    # Limit to the first n items in the list
-
-    def take(n)
-      Enumerator::Filter.new do |output|
-        count = 0
-        each do |*input|
-          break if count >= n
-          output.yield(*input)
-          count += 1
-        end
-      end
-    end
-
-    # Skip the first n items in the list
-
-    def skip(n)
-      Enumerator::Filter.new do |output|
-        count = 0
-        each do |*input|
-          output.yield(*input) if count >= n
-          count += 1
-        end
-      end
-    end
-
-    # TODO: add more methods, e.g. grep, take_while etc.
-  end
-
-end # module Enumerable
-
-
-class Enumerator
-
-  # = Enumerator::Filter
-  #
-  # A class like Enumerator, but which has 'lazy' versions of map, select etc.
-  #
-  class Filter < Enumerator
-    include Enumerable::Filterable
-  end
-
-end
-

data/lib/more/facets/heap.rb

@@ -1,22 +0,0 @@
-# = Heap
-#
-# Another name for PQueue.
-#
-# == Copying
-#
-# Copyright (c) 2005 Thomas Sawyer, George Moschovitis
-#
-# 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.
-
-require 'facets/pqueue'
-
-# Heap is PQueue.
-Heap = PQueue
-

data/lib/more/facets/infinity.rb

@@ -1,193 +0,0 @@
-# = Infinity
-#
-# A full featured Infinity class, supporting signed direction.
-# Inifinty is a multiton based on direction The constant INFINITY
-# is provided as the common case with direction=+1 (positive).
-#
-# Besides being an class, these four constants are preset:
-#
-#   NaN
-#   Inf
-#   PosInf
-#   NegInf
-#
-# These four constants a built from two other basic constants:
-#
-#   UNDEFINED
-#   INFINITY
-#
-# In physical memory there are actually only three objects, namely
-# three instances of InfinityClass, one for NaN, PosInf and NegInf,
-# respectively.
-#
-# == Copying
-#
-# Copyright (c) 2004 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
-#
-# == Todo
-#
-# * Could @direction values greater than 1 support Aleph?
-
-require 'facets/multiton'
-
-# = Infinity
-#
-# A full featured Infinity class, supporting signed direction.
-# Inifinty is a multiton based on direction The constant INFINITY
-# is provided as the common case with direction=+1 (positive).
-#
-# Besides being an class, these four constants are preset:
-#
-#   NaN
-#   Inf
-#   PosInf
-#   NegInf
-#
-# These four constants a built from two other basic constants:
-#
-#   UNDEFINED
-#   INFINITY
-#
-# In physical memory there are actually only three objects, namely
-# three instances of InfinityClass, one for NaN, PosInf and NegInf,
-# respectively.
-#
-class InfinityClass < Numeric
-  include Multiton
-
-  attr_reader :direction
-
-  def initialize(direction=1)
-    @direction = (direction <=> 0)
-    super()
-  end
-
-  # Change direction of infinity.
-
-  def -@
-    case @direction
-    when  0 : self.class.instance(0)
-    when  1 : self.class.instance(-1)
-    when -1 : self.class.instance(1)
-    end
-  end
-
-  # Noop.
-
-  def +@
-    self
-  end
-
-  # Convert to the float version of infinity.
-
-  def to_f
-    (1.0/0) * @direction
-  end
-
-  # Gee, a real infinite loop!
-
-  def times
-    loop do yield end
-  end
-
-  # Coerce allows other numbers to be
-  # compared to infinity.
-
-  def coerce(other)
-    case other
-    when InfinityClass
-      super
-    else
-      return -self, other
-    end
-  end
-
-  # Equality. Note that NaN != NaN.
-
-  def ==(other)
-    case other
-    when InfinityClass
-      if @direction == 0 and other.direction == 0
-        false
-      else
-        super
-      end
-    else
-      false
-    end
-  end
-
-  # Comparision where infinity is alway greatest
-  # and negative infinityalways least.
-
-  def <=>(other)
-    case other
-    when InfinityClass
-      @direction <=> other.direction
-    else
-      @direction
-    end
-  end
-
-  #
-
-  def to_s
-    case @direction
-    when  0  : "NaN"
-    when  1  : "PosInf"
-    when -1  : "NegInf"
-    end
-  end
-
-end
-
-#
-
-class Numeric
-
-  def finite?
-    not InfinityClass === self
-  end
-
-  def infinite?
-    return false if NaN == self
-    InfinityClass === self
-  end
-  alias :inf? :infinite?
-
-  def nan?
-    NaN == self
-  end
-
-  def posinf?
-    PosInf == self
-  end
-
-  def neginf?
-    NegInf == self
-  end
-
-end
-
-# Set constant to positive infinity.
-UNDEFINED = InfinityClass.new(0)
-INFINITY  = InfinityClass.new(1)
-
-NaN = UNDEFINED
-Inf = INFINITY
-PosInf = +INFINITY
-NegInf = -INFINITY
-