warray 0.0.1 → 0.0.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 93c5839de5220d8480ab4d97b934a456e164a795
-  data.tar.gz: 9e03d55ed03a51d6d68c3c3dfbb981ad78135bae
+  metadata.gz: aa73e3ab7893ded84eb407700b7820ef51cf3bef
+  data.tar.gz: b2cc99207ea5680b6d2da5f8cdf572b675b9c5b4
 SHA512:
-  metadata.gz: 66fb67af3f6a4837faf19ec4b592f54cbf9b1add3ee27e5108d888dd28cd58e8b00cbe8c0bb1a18ce49b20ab507cc393dcc68e16bd396db570bcf3fd5e49f45f
-  data.tar.gz: 64eb639043070bbad742860b134c154e10482407dc5feba371cbf49e6a8bd9cd4cf59b1372814c89b213b68b7283c926b929091b5b3143714750a445d6c4c1d6
+  metadata.gz: 293b74d183e7ea4172cf8fcebb988c0060204aac62b72c5ddb7d25e18cd09a9e3ec380bc7ff4bcd6f257ee817ff176cf0f2cb0fee016b80748f2fc11e19b3627
+  data.tar.gz: 3942e871388177c4c2fc8ebc8d758f69dbb52e44adcf2964410a1834dd7110b4a6b98e65e8bfadec261186a02df4506d9be7121584d49f240c927de2e8aa5795

data/README.md

@@ -1,8 +1,8 @@
 # Warray
 
-[![Gem Version](https://badge.fury.io/rb/luhn_pro.svg)](http://badge.fury.io/rb/luhn_pro)
+[![Gem Version](https://badge.fury.io/rb/warray.svg)](http://badge.fury.io/rb/warray)
 [![Build Status](https://travis-ci.org/gabulyaz/warray.svg?branch=master)](https://travis-ci.org/gabulyaz/warray)
-[![Code Climate](https://codeclimate.com/github/gabulyaz/luhn_pro/badges/gpa.svg)](https://codeclimate.com/github/gabulyaz/luhn_pro)
+[![Code Climate](https://codeclimate.com/repos/55252920e30ba060cd004967/badges/5089577f6fdc90e421c5/gpa.svg)](https://codeclimate.com/repos/55252920e30ba060cd004967/feed)
 
 
 A simple weighted array implementation.

data/lib/warray.rb

@@ -1,58 +1,57 @@
-require "warray/version"
+require 'warray/version'
 
+# Warray
 class Warray
 
   attr_reader :size, :wsum, :gcd
 
-  def initialize(a=[])
+  # init
+  def initialize(a = [])
     # Warray object has a stucture like this: [[value,weight],[value,weight]...]
-    @@warray = Array.new{Array.new(2)}
+    # @warray = Array.new { Array.new(2) }
+    @warray = []
     # summerized weight for Warray object
-    @@wsum = 0
+    @wsum = 0
     # find the greatest common divisor, if there is not @gcd = 1
-    @@gcd = 1
+    @gcd = 1
     # use a temporary array to find the min weight
     j = []
     # flatten input array for avoid error
     a.flatten!
     # build Warray structure, odd items are values, even items are weights
     # make also sure that not give error if input array size is not even
-    while a.size > 1 do
+    while a.size > 1
       value = a.shift
       weight =  a.shift.to_i.abs
       # summerize weights
-      @@wsum += weight
+      @wsum += weight
       # make sure that is it not null in array
       j << weight if weight != 0
-      @@warray << [value,weight]
+      @warray << [value, weight]
     end
     # find the min weight and make gcd, if j is not empty
-    @@gcd = @@wsum.gcd(j.min.to_i) if !j.empty?
-    # return with [] if you call new method without array otherwise return with Warray
-    return @@warray
+    @gcd = @wsum.gcd(j.min.to_i) unless j.empty?
+    # return with [] if you call new method without array
+    # otherwise return with Warray
+    @warray
   end
 
   # return with size of Warray object
   def size
-    @@warray.size
+    @warray.size
   end
 
   # you can also use length method to get size of Warray object
-  alias :length :size
-
-  # return with summarized weights
-  def wsum
-    @@wsum
-  end
+  alias_method :length, :size
 
   # build an array with weighted items
   def build
     a = []
-    @@warray.map do |i|
-      a << Array.new((i[1]/@@gcd),i[0])
+    @warray.map do |i|
+      a << Array.new((i[1] / @gcd), i[0])
     end
     # make sure that it is flatten
-    return a.flatten!
+    a.flatten!
   end
 
 end

data/lib/warray/version.rb

@@ -1,3 +1,3 @@
 class Warray
-  VERSION = "0.0.1"
+  VERSION = "0.0.2"
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: warray
 version: !ruby/object:Gem::Version
-  version: 0.0.1
+  version: 0.0.2
 platform: ruby
 authors:
 - Zoltan Gabulya
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2015-04-08 00:00:00.000000000 Z
+date: 2015-05-15 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -45,7 +45,6 @@ executables: []
 extensions: []
 extra_rdoc_files: []
 files:
-- ".DS_Store"
 - ".gitignore"
 - ".rspec"
 - ".travis.yml"
@@ -57,7 +56,7 @@ files:
 - lib/warray/version.rb
 - spec/lib/warray_spec.rb
 - spec/spec_helper.rb
-- test.rb
+- warray-0.0.1.gem
 - warray.gemspec
 homepage: https://github.com/gabulyaz/warray
 licenses:

data/test.rb

@@ -1,70 +0,0 @@
-a=%w(a 1 b 2 c 3 d 4 d 5 e 6 f 7 g 8 h 9 i 10)
-b=%w(girl 3 boy 5)
-c=%w(apple 60% orange 30% peach 10%)
-
-
-class Warray
-
-  attr_reader :size, :wsum, :gcd
-
-  def initialize(a=[])
-    # Warray object has a stucture like this: [[value,weight],[value,weight]...]
-    @@warray = Array.new{Array.new(2)}
-    # summerized weight for Warray object
-    @@wsum = 0
-    # find the greatest common divisor, if there is not @gcd = 1
-    @@gcd = 1
-    # use a temporary array to find the min weight
-    j = []
-    # flatten input array for avoid error
-    a.flatten!
-    # build Warray structure, odd items are values, even items are weights
-    # make also sure that not give error if input array size is not even
-    while a.size > 1 do
-      value = a.shift
-      weight =  a.shift.to_i.abs
-      # summerize weights
-      @@wsum += weight
-      # make sure that is it not null in array
-      j << weight if weight != 0
-      @@warray << [value,weight]
-    end
-    # find the min weight and make gcd, if j is not empty
-    @@gcd = @@wsum.gcd(j.min) if !j.empty?
-    # return with [] if you call new method without array otherwise return with Warray
-    return @@warray
-  end
-
-  # return with size of Warray object
-  def size
-    @@warray.size
-  end
-
-  # you can also use length method to get size of Warray object
-  alias :length :size
-
-  # return with summarized weights
-  def wsum
-    @@wsum
-  end
-
-  # build an array with weighted items
-  def build
-    a = []
-    @@warray.map do |i|
-      a << Array.new((i[1]/@@gcd),i[0])
-    end
-    # make sure that it is flatten
-    return a.flatten!
-  end
-
-end
-
-
-
-w = Warray.new c
-a = w.build
-puts a.to_s
-
-w = Warray.new(b)
-puts w.build.sample(5).sort.to_s