facets 2.9.2 → 2.9.3

data/src/core/facets/string/characters.rb

@@ -1,13 +0,0 @@
-class String
-
-  # Returns an array of characters.
-  #
-  #   "abc".characters.to_a  #=> ["a","b","c"]
-  #
-  # TODO: Probably should make this an enumerator. With #scan?
-  def characters
-    split(//)
-  end
-
-end
-

data/src/core/facets/string/cleanlines.rb

@@ -1,27 +0,0 @@
-require "facets/enumerator"
-
-class String
-
-  # Returns an Enumerator for iterating over each
-  # line of the string, stripped of whitespace on
-  # either side.
-  #
-  #   "this\nthat\nother\n".cleanlines.to_a  #=> ['this', 'that', 'other']
-  #
-  def cleanlines(&block)
-    if block
-      scan(/^.*?$/) do |line|
-        block.call(line.strip)
-      end
-    else
-      str = self
-      Enumerator.new do |output|
-        str.scan(/^.*?$/) do |line|
-          output.yield(line.strip)
-        end
-      end
-    end
-  end
-
-end
-

data/src/core/facets/string/cleave.rb

@@ -1,36 +0,0 @@
-class String
-
-  # Cleave a string. Break a string in two parts at
-  # the nearest whitespace.
-  #
-  # CREDIT: Trans
-
-  def cleave(threshold=nil, len=nil)
-    l = (len || size / 2)
-    t = threshold || size
-
-    h1 = self[0...l]
-    h2 = self[l..-1]
-
-    i1 = h1.rindex(/\s/) || 0
-    d1 = (i1 - l).abs
-
-    d2 = h2.index(/\s/) || l
-    i2 = d2 + l
-
-    d1 = (i1-l).abs
-    d2 = (i2-l).abs
-
-    if [d1, d2].min > t
-      i = t
-    elsif d1 < d2
-      i = i1
-    else
-      i = i2
-    end
-
-    #dup.insert(l, "\n").gsub(/^\s+|\s+$/, '')
-    return self[0..i].to_s.strip, self[i+1..-1].to_s.strip
-  end
-
-end

data/src/core/facets/string/cmp.rb

@@ -1 +0,0 @@
-require 'facets/comparable/cmp'

data/src/core/facets/string/compress_lines.rb

@@ -1,17 +0,0 @@
-class String
-
-  # Matches any whitespace (including newline) and replaces with a single space
-  #
-  #   string = <<-QUERY.compress_lines
-  #     SELECT name
-  #     FROM users
-  #   QUERY
-  #
-  #   string  #=> "SELECT name FROM users"
-  #
-  def compress_lines(spaced = true)
-    split($/).map{ |line| line.strip }.join(spaced ? ' ' : '')
-  end
-
-end
-

data/src/core/facets/string/divide.rb

@@ -1,18 +0,0 @@
-class String
-
-  # Breaks a string up into an array based on a regular expression.
-  # Similar to scan, but includes the matches.
-  #
-  #   s = "<p>This<b>is</b>a test.</p>"
-  #   s.divide( /\<.*?\>/ )
-  #   #=> ["<p>This", "<b>is", "</b>a test.", "</p>"]
-  #
-  # CREDIT: Trans
-
-  def divide( re )
-    re2 = /#{re}.*?(?=#{re}|\Z)/
-    scan(re2) #{re}(?=#{re})/)
-  end
-
-end
-

data/src/core/facets/string/each_char.rb

@@ -1,31 +0,0 @@
-class String
-
-  unless method_defined?(:each_char) # 1.9
-
-    require 'strscan'
-
-    # Yields a single-character string for each character in the string.
-    # When $KCODE = 'UTF8', multi-byte characters are yielded appropriately.
-    #
-    #   a = ''
-    #   "HELLO".each_char{ |c| a << "#{c.downcase}" }
-    #   a  #=> 'hello'
-    #
-    def each_char # :yield:
-      scanner, char = StringScanner.new(self), /./mu
-      loop{ yield(scanner.scan(char) || break) }
-    end
-
-    #--
-    # Iterates through each character. This is a little faster than
-    # using #chars b/c it does not create the intermediate array...
-    #
-    #   def each_char  # :yield:
-    #     size.times{ |i| yield(self[i,1]) }
-    #   end
-    #++
-
-  end
-
-end
-

data/src/core/facets/string/each_word.rb

@@ -1,17 +0,0 @@
-require 'facets/string/words'
-
-class String
-
-  # Iterate through each word of a string.
-  #
-  #   a = []
-  #
-  #   "list of words".each_word { |word| a << word }
-  #
-  #   a  #=> ['list', 'of', 'words']
-  #
-  def each_word(&block)
-    words.each(&block)
-  end
-
-end

data/src/core/facets/string/edit_distance.rb

@@ -1,124 +0,0 @@
-class String
-
-  # Levenshtein distance algorithm implementation for Ruby, with UTF-8 support.
-  #
-  # The Levenshtein distance is a measure of how similar two strings s and t are,
-  # calculated as the number of deletions/insertions/substitutions needed to
-  # transform s into t. The greater the distance, the more the strings differ.
-  #
-  # The Levenshtein distance is also sometimes referred to as the
-  # easier-to-pronounce-and-spell 'edit distance'.
-  #
-  # Calculate the Levenshtein distance between two strings +self+ and +str2+.
-  # +self+ and +str2+ should be ASCII, UTF-8, or a one-byte-per character encoding
-  # such as ISO-8859-*.
-  #
-  # The strings will be treated as UTF-8 if $KCODE is set appropriately (i.e. 'u').
-  # Otherwise, the comparison will be performed byte-by-byte. There is no specific support
-  # for Shift-JIS or EUC strings.
-  #
-  # When using Unicode text, be aware that this algorithm does not perform normalisation.
-  # If there is a possibility of different normalised forms being used, normalisation
-  # should be performed beforehand.
-  #
-  # CREDIT: Paul Battley
-  def edit_distance(str2)
-    str1 = self
-    if $KCODE =~ /^U/i
-      unpack_rule = 'U*'
-    else
-      unpack_rule = 'C*'
-    end
-
-    s = str1.unpack(unpack_rule)
-    t = str2.unpack(unpack_rule)
-
-    n = s.length
-    m = t.length
-
-    return m if (0 == n)
-    return n if (0 == m)
-
-    d = (0..m).to_a
-    x = nil
-
-    (0...n).each do |i|
-      e = i+1
-      (0...m).each do |j|
-        cost = (s[i] == t[j]) ? 0 : 1
-        x = [
-          d[j+1] + 1, # insertion
-          e + 1,      # deletion
-          d[j] + cost # substitution
-        ].min
-        d[j] = e
-        e = x
-      end
-      d[m] = x
-    end
-
-    return x
-  end if RUBY_VERSION < '1.9'
-
-  # Levenshtein distance algorithm implementation for Ruby, with UTF-8 support.
-  #
-  # The Levenshtein distance is a measure of how similar two strings s and t are,
-  # calculated as the number of deletions/insertions/substitutions needed to
-  # transform s into t. The greater the distance, the more the strings differ.
-  #
-  # The Levenshtein distance is also sometimes referred to as the
-  # easier-to-pronounce-and-spell 'edit distance'.
-  #
-  # Calculate the Levenshtein distance between two strings +self+ and +str2+.
-  # +self+ and +str2+ should be ASCII, UTF-8, or a one-byte-per character encoding
-  # such as ISO-8859-*.
-  #
-  # The strings will be treated as UTF-8 if $KCODE is set appropriately (i.e. 'u').
-  # Otherwise, the comparison will be performed byte-by-byte. There is no specific support
-  # for Shift-JIS or EUC strings.
-  #
-  # When using Unicode text, be aware that this algorithm does not perform normalisation.
-  # If there is a possibility of different normalised forms being used, normalisation
-  # should be performed beforehand.
-  #
-  # CREDIT: Paul Battley
-  def edit_distance(str2)
-    str1 = self
-
-    if str2.encoding != str1.encoding
-      str2 = str2.encode(str1.encoding.name)
-    end
-
-    s = str1.codepoints.to_a
-    t = str2.codepoints.to_a
-
-    n = s.length
-    m = t.length
-
-    return m if (0 == n)
-    return n if (0 == m)
-
-    d = (0..m).to_a
-    x = nil
-
-    (0...n).each do |i|
-      e = i+1
-      (0...m).each do |j|
-        cost = (s[i] == t[j]) ? 0 : 1
-        x = [
-          d[j+1] + 1, # insertion
-          e + 1,      # deletion
-          d[j] + cost # substitution
-        ].min
-        d[j] = e
-        e = x
-      end
-      d[m] = x
-    end
-
-    return x
-  end if RUBY_VERSION >= '1.9'
-
-end
-
-

data/src/core/facets/string/end_with.rb

@@ -1 +0,0 @@
-require 'facets/string/start_with'

data/src/core/facets/string/exclude.rb

@@ -1,10 +0,0 @@
-class String
-
-  # The inverse of include?.
-  #
-  def exclude?(str)
-    !include?(str)
-  end
-
-end
-

data/src/core/facets/string/expand_tab.rb

@@ -1,35 +0,0 @@
-class String
-
-  # Expands tabs to +n+ spaces. Non-destructive. If +n+ is 0,
-  # then tabs are simply removed. Raises an exception if +n+
-  # is negative.
-  #
-  #   "\t\tHey".expand_tabs(2)  #=> "    Hey"
-  #
-  # Thanks to GGaramuno for a more efficient algorithm. Very nice.
-  #
-  # CREDIT: Gavin Sinclair, Noah Gibbs, GGaramuno
-  #
-  # TODO: Don't much care for the name String#expand_tabs.
-  # What about a more concise name like #detab?
-
-  def expand_tabs(n=8)
-    n = n.to_int
-    raise ArgumentError, "n must be >= 0" if n < 0
-    return gsub(/\t/, "") if n == 0
-    return gsub(/\t/, " ") if n == 1
-    str = self.dup
-    while
-      str.gsub!(/^([^\t\n]*)(\t+)/) { |f|
-        val = ( n * $2.size - ($1.size % n) )
-        $1 << (' ' * val)
-      }
-    end
-    str
-  end
-
-  # Singular form of #expand_tabs.
-  alias_method :expand_tab, :expand_tabs
-
-end
-

data/src/core/facets/string/file.rb

@@ -1,35 +0,0 @@
-require 'facets/functor'
-
-class String
-
-  # Use fluent notation for making file directives.
-  #
-  # For instance, if we had a file 'foo.txt',
-  #
-  #    'foo.txt'.file.mtime
-  #
-  def file
-    Functor.new(&method(:file_send).to_proc)
-  end
-
-  private
-
-  def file_send(op, *a, &b)
-    File.send(op, self, *a, &b)
-  end
-
-  ## TODO: When no longer needing to support 1.8.6 we can use:
-  ##
-  ## # Use fluent notation for making file directives.
-  ## #
-  ## #    'README.rdoc'.file.mtime
-  ## #  
-  ## def file
-  ##   f = self
-  ##   Functor.new do |op, *a, &b|
-  ##     File.send(op, f, *a, &b)
-  ##   end
-  ## end
-
-end
-

data/src/core/facets/string/fold.rb

@@ -1,39 +0,0 @@
-class String
-
-  # Returns a new string with all new lines removed from
-  # adjacent lines of text.
-  #
-  #   s = "This is\na test.\n\nIt clumps\nlines of text."
-  #   s.fold
-  #
-  # _produces_
-  #
-  #   "This is a test.\n\nIt clumps lines of text. "
-  #
-  # One arguable flaw with this, that might need a fix:
-  # if the given string ends in a newline, it is replaced with
-  # a single space.
-  #
-  # CREDIT: Trans
-
-  def fold(ignore_indented=false)
-    ns = ''
-    i = 0
-    br = self.scan(/(\n\s*\n|\Z)/m) do |m|
-      b = $~.begin(1)
-      e = $~.end(1)
-      nl = $&
-      tx = slice(i...b)
-      if ignore_indented and slice(i...b) =~ /^[ ]+/
-        ns << tx
-      else
-        ns << tx.gsub(/[ ]*\n+/,' ')
-      end
-      ns << nl
-      i = e
-    end
-    ns
-  end
-
-end
-

data/src/core/facets/string/indent.rb

@@ -1,67 +0,0 @@
-class String
-
-  # Indent left or right by n spaces.
-  # (This used to be called #tab and aliased as #indent.)
-  #
-  # CREDIT: Gavin Sinclair, Trans, Tyler Rick
-
-  def indent(n, c=' ')
-    if n >= 0
-      gsub(/^/, c * n)
-    else
-      gsub(/^#{Regexp.escape(c)}{0,#{-n}}/, "")
-    end
-  end
-
-  # Equivalent to String#indent, but modifies the receiver in place.
-
-  def indent!(n, c=' ')
-    replace(indent(n,c))
-  end
-
-  # Remove excessive indentation. Useful for multi-line strings embeded in
-  # already indented code.
-  #
-  #   <<-END.unindent
-  #       ohaie
-  #         wurld
-  #   END
-  #
-  # Outputs ...
-  #
-  #   ohaie
-  #     wurld
-  #
-  # Instead of ...
-  #
-  #       ohaie
-  #         wurld
-  #
-  # CREDIT: Noah Gibbs, mynyml
-
-  def unindent(size=nil)
-    if size
-      indent(-size)
-    else
-      char = ' '
-      self.scan(/^[\ \t]*\S/) do |m|
-        if size.nil? || m.size < size
-          size = m.size
-          char = m[0...-1]
-        end
-      end
-      size -= 1
-      indent(-size, char)
-    end
-  end
-
-  # Equivalent to String#unindent, but modifies the receiver in place.
-  #
-  # CREDIT: mynyml
-
-  def unindent!
-    self.replace(self.unindent)
-  end
-
-end
-