daru_lite 0.2.1 → 0.2.4

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 6da8c79960f009b08e12c9d252a267e4d69d6c2152ded63fbe8180891eb25b86
-  data.tar.gz: 074d65df9bbc034b37089cf0938a5df45006f8e264ed259721d5823e0ae41c3b
+  metadata.gz: a04accc0b21012227f90f9586cf82bf432d0d8b973ed95238307fd6d11d17eba
+  data.tar.gz: e0fdc901b2d9b8bfb0a5af9f364921fcf4022d083d303621073161572cd189b3
 SHA512:
-  metadata.gz: 56055dcbc442963a8c9881d0b86c767cf9d49d382b1f78b33e7603d83a496028116fef819b38fd15110f67bacccf143354efdba9a919fe829d54006c2e0e6bd5
-  data.tar.gz: b3b20cfa80cd6ff336979d1ec836673de99f828883d45186a2762b396ab85ed7b57c8b75709b9ff12623121ed34c707ad66b3ad26aa530e98f43aa5fb27dd4a0
+  metadata.gz: a49e8d0219f4005d84ce38729707aa4742dcc8ee31d56ffff6f29899ad01b910f7f38d1574419d882947c791f22eeaeb0afcdf3e804283d21725d36ab7a5f016
+  data.tar.gz: 363502b7823a4cc4928e567e560d1992a873c02adaf1014de0b90b92e8772b8fce350f5cf23a86643a94c857a33343890cefbd09612dba2affbc909f97b8f253

data/daru_lite.gemspec

@@ -40,7 +40,7 @@ Gem::Specification.new do |spec|
   spec.add_development_dependency 'rake', '~> 13.0'
   spec.add_development_dependency 'rspec', '~> 3.11'
   spec.add_development_dependency 'rspec-its', '~> 2.0.0'
-  spec.add_development_dependency 'rubocop', '~> 1.60'
+  spec.add_development_dependency 'rubocop', '~> 1.86'
   spec.add_development_dependency 'rubocop-performance', '~> 1.25.0'
   spec.add_development_dependency 'rubocop-rspec', '~> 3.6'
   spec.add_development_dependency 'ruby-prof', '~> 1.7.0'

data/lib/daru_lite/category.rb

@@ -858,7 +858,7 @@ module DaruLite
     end
 
     def user_defined_coding(df)
-      DaruLite::DataFrame.rows (Array.new(size) { |pos| df.row[at(pos)].to_a }),
+      DaruLite::DataFrame.rows Array.new(size) { |pos| df.row[at(pos)].to_a },
                                index: @index,
                                order: df.vectors.to_a
     end

data/lib/daru_lite/core/merge.rb

@@ -118,9 +118,9 @@ module DaruLite
         if lkey == rkey
           self.merge_key = lkey
           add_indicator(merge_matching_rows, :both)
-        elsif !rkey || lt(lkey, rkey)
+        elsif !rkey || lt?(lkey, rkey)
           add_indicator(left_row_missing_right, :left_only)
-        else # !lkey || lt(rkey, lkey)
+        else # !lkey || lt?(rkey, lkey)
           add_indicator(right_row_missing_left, :right_only)
         end
       end
@@ -181,7 +181,7 @@ module DaruLite
         expand_row(val, right_keys) if keep_right
       end
 
-      def lt(k1, k2)
+      def lt?(k1, k2)
         (k1 <=> k2) == -1
       end
 

data/lib/daru_lite/data_frame/fetchable.rb

@@ -222,7 +222,7 @@ module DaruLite
       end
 
       def access_vector_multi_index(*names)
-        pos = @vectors[names]
+        pos = @vectors[*names]
 
         return @data[pos] if pos.is_a?(Integer)
 

data/lib/daru_lite/dataframe.rb

@@ -730,10 +730,10 @@ module DaruLite
 
       case source.first
       when Array
-        vectors ||= (0..source.size - 1).to_a
+        vectors ||= (0..(source.size - 1)).to_a
         initialize_from_array_of_arrays source, vectors, index, opts
       when Vector
-        vectors ||= (0..source.size - 1).to_a
+        vectors ||= (0..(source.size - 1)).to_a
         initialize_from_array_of_vectors source, vectors, index, opts
       when Hash
         initialize_from_array_of_hashes source, vectors, index, opts
@@ -809,10 +809,7 @@ module DaruLite
       elsif vectors_have_same_index
         source.values[0].index.dup
       else
-        all_indexes = source
-                      .values.map { |v| v.index.to_a }
-                      .flatten.uniq.sort # sort only if missing indexes detected
-
+        all_indexes = source.values.map { |v| v.index.to_a }.flatten.uniq.sort # sort only if missing indexes detected
         DaruLite::Index.new all_indexes
       end
     end

data/lib/daru_lite/date_time/index.rb

@@ -96,7 +96,7 @@ module DaruLite
       def infer_offset(data)
         diffs = data.each_cons(2).map { |d1, d2| d2 - d1 }
 
-        return nil unless diffs.uniq.count == 1
+        return nil unless diffs.uniq.one?
 
         return TIME_INTERVALS[diffs.first].new if TIME_INTERVALS.include?(diffs.first)
 
@@ -216,6 +216,7 @@ module DaruLite
 
   class DateTimeIndex < Index
     include Enumerable
+
     Helper = DateTimeIndexHelper
 
     def self.try_create(source)

data/lib/daru_lite/date_time/offsets.rb

@@ -249,7 +249,7 @@ module DaruLite
       end
 
       def freq_string
-        "#{@n == 1 ? '' : @n.to_s}W-#{DaruLite::DAYS_OF_WEEK.key(@weekday)}"
+        "#{@n.to_s unless @n == 1}W-#{DaruLite::DAYS_OF_WEEK.key(@weekday)}"
       end
     end
 

data/lib/daru_lite/index/index.rb

@@ -1,6 +1,7 @@
 module DaruLite
   class Index # rubocop:disable Metrics/ClassLength
     include Enumerable
+
     # It so happens that over riding the .new method in a super class also
     # tampers with the default .new method for class that inherit from the
     # super class (Index in this case). Thus we first alias the original
@@ -170,7 +171,7 @@ module DaruLite
       if start_idx.nil?
         nil
       elsif en_idx.nil?
-        Array(start_idx..size - 1)
+        Array(start_idx..(size - 1))
       else
         Array(start_idx..en_idx)
       end

data/lib/daru_lite/index/multi_index.rb

@@ -122,18 +122,16 @@ module DaruLite
     end
 
     def [](*key)
-      if key[0].is_a?(Array)
-        collection = key.map { |actual_key| self[*actual_key] }
-        collection.one? ? collection.first : collection
-      elsif key[0].is_a?(Range)
-        retrieve_from_range(key[0])
-      elsif key[0].is_a?(Integer) && key.size == 1
-        try_retrieve_from_integer(key[0])
+      if key.all? { |subkey| subkey.is_a?(Array) && subkey.length > 1 }
+        retrieve_from_tuples(*key)
       else
-        begin
-          retrieve_from_tuples key
-        rescue NoMethodError
-          raise IndexError, "Specified index #{key.inspect} do not exist"
+        key.flatten!
+        if key[0].is_a?(Range)
+          retrieve_from_range(key[0])
+        elsif key[0].is_a?(Integer) && key.size == 1
+          try_retrieve_from_integer(key[0])
+        else
+          retrieve_from_tuple(key)
         end
       end
     end
@@ -217,14 +215,19 @@ module DaruLite
     end
 
     def try_retrieve_from_integer(int)
-      @levels[0].key?(int) ? retrieve_from_tuples([int]) : int
+      @levels[0].key?(int) ? retrieve_from_tuple([int]) : int
     end
 
     def retrieve_from_range(range)
       MultiIndex.from_tuples(range.map { |index| key(index) })
     end
 
-    def retrieve_from_tuples(key)
+    def retrieve_from_tuples(*keys)
+      collection = keys.map { |key| retrieve_from_tuple(key) }
+      collection.one? ? collection.first : collection
+    end
+
+    def retrieve_from_tuple(key)
       chosen = []
 
       key.each_with_index do |k, depth|
@@ -238,6 +241,8 @@ module DaruLite
       return chosen[0] if chosen.size == 1 && key.size == @levels.size
 
       multi_index_from_multiple_selections(chosen)
+    rescue NoMethodError
+      raise IndexError, "Specified index #{key.inspect} do not exist"
     end
 
     def multi_index_from_multiple_selections(chosen)
@@ -287,8 +292,8 @@ module DaruLite
       raise SizeError, [error_msg, suggestion_msg].join("\n") if names.size < levels.size
     end
 
-    private :find_all_indexes, :multi_index_from_multiple_selections,
-            :retrieve_from_range, :retrieve_from_tuples, :validate_name
+    private :find_all_indexes, :multi_index_from_multiple_selections, :retrieve_from_range,
+            :retrieve_from_tuples, :retrieve_from_tuple, :validate_name
 
     def key(index)
       raise ArgumentError, "Key #{index} is too large" if index >= @labels[0].size

data/lib/daru_lite/io/io.rb

@@ -141,7 +141,6 @@ module DaruLite
         query = "INSERT INTO #{table} (#{ds.vectors.to_a.join(',')}) VALUES (#{(['?'] * ds.vectors.size).join(',')})"
         sth   = dbh.prepare(query)
         ds.each_row { |c| sth.execute(*c.to_a) }
-        true
       end
 
       # Load dataframe from AR::Relation
@@ -161,12 +160,13 @@ module DaruLite
 
       def from_plaintext(filename, fields)
         ds = DaruLite::DataFrame.new({}, order: fields)
-        fp = File.open(filename, 'r')
-        fp.each_line do |line|
-          row = DaruLite::IOHelpers.process_row(line.strip.split(/\s+/), [''])
-          next if row == ["\x1A"]
+        File.open(filename, 'r') do |fp|
+          fp.each_line do |line|
+            row = DaruLite::IOHelpers.process_row(line.strip.split(/\s+/), [''])
+            next if row == ["\x1A"]
 
-          ds.add_row(row)
+            ds.add_row(row)
+          end
         end
         ds.update
         fields.each { |f| ds[f].rename f }
@@ -175,9 +175,7 @@ module DaruLite
 
       # Loading and writing Marshalled DataFrame/Vector
       def save(klass, filename)
-        fp = File.open(filename, 'w')
-        Marshal.dump(klass, fp)
-        fp.close
+        File.open(filename, 'w') { Marshal.dump(klass, it) }
       end
 
       def load(filename)
@@ -248,7 +246,7 @@ module DaruLite
         data, size = html_scrape_tag(table, 'td')
         data.keep_if { |x| x.count == size }
         order, indice = html_parse_hash(headers, size, headers_size) if headers_size >= size
-        return unless (indice.nil? || indice.count == data.count) && !order.nil? && order.count.positive?
+        return unless (indice.nil? || indice.count == data.count) && !order.nil? && order.any?
 
         { data: data.compact, index: indice, order: order }
       end
@@ -267,7 +265,7 @@ module DaruLite
         order = headers[headers_index]
         order_index = order.count - size
         order = order[order_index..]
-        indice = headers[headers_index + 1..].flatten
+        indice = headers[(headers_index + 1)..].flatten
         indice = nil if indice.to_a.empty?
         [order, indice]
       end

data/lib/daru_lite/maths/statistics/dataframe.rb

@@ -166,8 +166,7 @@ module DaruLite
         private
 
         def apply_method_to_numerics(method, *)
-          numerics = @vectors.to_a.map { |n| [n, @data[@vectors[n]]] }
-                             .select { |_n, v| v.numeric? }
+          numerics = @vectors.to_a.map { |n| [n, @data[@vectors[n]]] }.select { |_n, v| v.numeric? }
           computed = numerics.map { |_n, v| v.send(method, *) }
 
           DaruLite::DataFrame.new(computed, index: @index, order: numerics.map(&:first), clone: false)
@@ -189,9 +188,8 @@ module DaruLite
 
         def compute_stats(method)
           DaruLite::Vector.new(
-            numeric_vectors.each_with_object({}) do |vec, hash|
-              hash[vec] = self[vec].send(method)
-            end, name: method
+            numeric_vectors.to_h { [it, self[it].send(method)] },
+            name: method
           )
         end
         alias sds std

data/lib/daru_lite/maths/statistics/vector.rb

@@ -180,7 +180,7 @@ module DaruLite
           #   dv.max(2) { |a,b| a.size <=> b.size }
           #   #=> ["Jon Starkgaryen","Daenerys"]
           def max(size = nil, &)
-            range = size.nil? ? 0 : (0..size - 1)
+            range = size.nil? ? 0 : (0..(size - 1))
             reject_values(*DaruLite::MISSING_VALUES).to_a.sort(&).reverse[range]
           end
 
@@ -203,7 +203,7 @@ module DaruLite
           def max_by(size = nil, &block)
             raise ArgumentError, 'Expected compulsory object block in max_by method' unless block
 
-            reject_values(*DaruLite::MISSING_VALUES).to_a.sort_by(&block).reverse[size.nil? ? 0 : (0..size - 1)]
+            reject_values(*DaruLite::MISSING_VALUES).to_a.sort_by(&block).reverse[size.nil? ? 0 : (0..(size - 1))]
           end
 
           # Returns the minimum value(s) present in the vector, with an optional comparator block.
@@ -226,7 +226,7 @@ module DaruLite
           #   dv.min(2) { |a,b| a.size <=> b.size }
           #   #=> ["Tyrion","Daenerys"]
           def min(size = nil, &)
-            range = size.nil? ? 0 : (0..size - 1)
+            range = size.nil? ? 0 : (0..(size - 1))
             reject_values(*DaruLite::MISSING_VALUES).to_a.sort(&)[range]
           end
 
@@ -252,7 +252,7 @@ module DaruLite
           def min_by(size = nil, &block)
             raise ArgumentError, 'Expected compulsory object block in min_by method' unless block
 
-            reject_values(*DaruLite::MISSING_VALUES).to_a.sort_by(&block)[size.nil? ? 0 : (0..size - 1)]
+            reject_values(*DaruLite::MISSING_VALUES).to_a.sort_by(&block)[size.nil? ? 0 : (0..(size - 1))]
           end
         end
 
@@ -279,7 +279,7 @@ module DaruLite
         def index_of_max(size = nil, &)
           vals = max(size, &)
           dv   = reject_values(*DaruLite::MISSING_VALUES)
-          vals.is_a?(Array) ? (vals.map { |x| dv.index_of(x) }) : dv.index_of(vals)
+          vals.is_a?(Array) ? vals.map { |x| dv.index_of(x) } : dv.index_of(vals)
         end
 
         # Returns the index of the maximum value(s) present in the vector, with a compulsory
@@ -302,7 +302,7 @@ module DaruLite
         def index_of_max_by(size = nil, &)
           vals = max_by(size, &)
           dv   = reject_values(*DaruLite::MISSING_VALUES)
-          vals.is_a?(Array) ? (vals.map { |x| dv.index_of(x) }) : dv.index_of(vals)
+          vals.is_a?(Array) ? vals.map { |x| dv.index_of(x) } : dv.index_of(vals)
         end
 
         # Returns the index of the minimum value(s) present in the vector, with an optional
@@ -328,7 +328,7 @@ module DaruLite
         def index_of_min(size = nil, &)
           vals = min(size, &)
           dv   = reject_values(*DaruLite::MISSING_VALUES)
-          vals.is_a?(Array) ? (vals.map { |x| dv.index_of(x) }) : dv.index_of(vals)
+          vals.is_a?(Array) ? vals.map { |x| dv.index_of(x) } : dv.index_of(vals)
         end
 
         # Returns the index of the minimum value(s) present in the vector, with a compulsory
@@ -351,7 +351,7 @@ module DaruLite
         def index_of_min_by(size = nil, &)
           vals = min_by(size, &)
           dv   = reject_values(*DaruLite::MISSING_VALUES)
-          vals.is_a?(Array) ? (vals.map { |x| dv.index_of(x) }) : dv.index_of(vals)
+          vals.is_a?(Array) ? vals.map { |x| dv.index_of(x) } : dv.index_of(vals)
         end
 
         # Return the maximum element present in the Vector, as a Vector.
@@ -409,11 +409,7 @@ module DaruLite
 
         # Count number of occurrences of each value in the Vector
         def value_counts
-          values = @data.each_with_object(Hash.new(0)) do |d, memo|
-            memo[d] += 1
-          end
-
-          DaruLite::Vector.new(values)
+          DaruLite::Vector.new(@data.tally)
         end
 
         def proportion(value = 1)

data/lib/daru_lite/monkeys/array.rb

@@ -0,0 +1,11 @@
+class Array
+  def daru_lite_vector(name = nil, index = nil, dtype = :array)
+    DaruLite::Vector.new self, name: name, index: index, dtype: dtype
+  end
+
+  alias dv daru_lite_vector
+
+  def to_index
+    DaruLite::Index.new self
+  end
+end

data/lib/daru_lite/monkeys/hash.rb

@@ -0,0 +1,7 @@
+class Hash
+  def daru_lite_vector(index = nil, dtype = :array)
+    DaruLite::Vector.new values[0], name: keys[0], index: index, dtype: dtype
+  end
+
+  alias dv daru_lite_vector
+end

data/lib/daru_lite/monkeys/m_d_array.rb

@@ -0,0 +1,7 @@
+class MDArray
+  def daru_lite_vector(name = nil, index = nil, *)
+    DaruLite::Vector.new self, name: name, index: index, dtype: :mdarray
+  end
+
+  alias dv daru_lite_vector
+end

data/lib/daru_lite/monkeys/matrix.rb

@@ -0,0 +1,7 @@
+class Matrix
+  def elementwise_division(other)
+    map.with_index do |e, index|
+      e / other.to_a.flatten[index]
+    end
+  end
+end

data/lib/daru_lite/monkeys/object.rb

@@ -0,0 +1,7 @@
+class Object
+  if RUBY_VERSION < '2.2'
+    def itself
+      self
+    end
+  end
+end

data/lib/daru_lite/monkeys/range.rb

@@ -0,0 +1,11 @@
+class Range
+  def daru_lite_vector(name = nil, index = nil, dtype = :array)
+    DaruLite::Vector.new self, name: name, index: index, dtype: dtype
+  end
+
+  alias dv daru_lite_vector
+
+  def to_index
+    DaruLite::Index.new to_a
+  end
+end

data/lib/daru_lite/vector/calculatable.rb

@@ -51,7 +51,7 @@ module DaruLite
                   "\n  Distribution\n"
 
         data = frequencies.sort.each_with_index.map do |v, k|
-          [k, v, format('%0.2f%%', ((nval.zero? ? 1 : v.quo(nval)) * 100))]
+          [k, v, format('%0.2f%%', (nval.zero? ? 1 : v.quo(nval)) * 100)]
         end
 
         summary + Formatters::Table.format(data)

data/lib/daru_lite/vector/duplicatable.rb

@@ -10,7 +10,7 @@ module DaruLite
       # Copies the structure of the vector (i.e the index, size, etc.) and fills all
       # all values with nils.
       def clone_structure
-        DaruLite::Vector.new(([nil] * size), name: @name, index: @index.dup)
+        DaruLite::Vector.new([nil] * size, name: @name, index: @index.dup)
       end
     end
   end

data/lib/daru_lite/vector/fetchable.rb

@@ -56,8 +56,9 @@ module DaruLite
       end
 
       def tail(q = 10)
-        start = [size - q, 0].max
-        self[start..(size - 1)]
+        from = [size - q, 0].max
+        to = size - 1
+        self[from..to]
       end
 
       def last(q = 1)

data/lib/daru_lite/vector.rb

@@ -164,6 +164,7 @@ module DaruLite
       if opts[:type] == :category
         # Initialize category type vector
         extend DaruLite::Category
+
         initialize_category source, opts
       else
         # Initialize non-category type vector
@@ -256,7 +257,7 @@ module DaruLite
       other = other.zip(Array.new(other.size, 0)).to_h
       DaruLite::Core::Query::BoolArray.new(
         @data.each_with_object([]) do |d, memo|
-          memo << (other.key?(d))
+          memo << other.key?(d)
         end
       )
     end

data/lib/daru_lite/version.rb

@@ -1,3 +1,3 @@
 module DaruLite
-  VERSION = '0.2.1'.freeze
+  VERSION = '0.2.4'.freeze
 end

data/lib/daru_lite.rb

@@ -86,11 +86,17 @@ require 'daru_lite/helpers/array'
 require 'daru_lite/configuration'
 require 'daru_lite/vector'
 require 'daru_lite/dataframe'
-require 'daru_lite/monkeys'
 require 'daru_lite/formatters/table'
 require 'daru_lite/iruby/helpers'
 require 'daru_lite/exceptions'
 
+require 'daru_lite/monkeys/array'
+require 'daru_lite/monkeys/hash'
+require 'daru_lite/monkeys/m_d_array'
+require 'daru_lite/monkeys/matrix'
+require 'daru_lite/monkeys/object'
+require 'daru_lite/monkeys/range'
+
 require 'daru_lite/core/group_by'
 require 'daru_lite/core/query'
 require 'daru_lite/core/merge'

data/spec/data_frame/fetchable_example.rb

@@ -58,6 +58,11 @@ shared_examples_for 'a fetchable DataFrame' do
           DaruLite::Vector.new(vector_arry1, index: multi_index))
       end
 
+      it "returns a vector when specifying last tuple part as an array" do
+        expect(df_mi[:a, :one, [:bar]]).to eq(
+          DaruLite::Vector.new(vector_arry1, index: multi_index))
+      end
+
       it "returns DataFrame when specified first layer of MultiIndex" do
         sub_order = DaruLite::MultiIndex.from_tuples([
           [:one, :bar],

data/spec/index/multi_index_spec.rb

@@ -141,6 +141,10 @@ describe DaruLite::MultiIndex do
       expect(index[:a, :one, :baz]).to eq(1)
     end
 
+    it "returns the row number when specifying last tuple part as an array" do
+      expect(index[:a, :one, [:baz]]).to eq(1)
+    end
+
     it "returns the row numbers when specifying multiple tuples" do
       expect(index[[:a, :one, :baz], [:b, :two, :bar]]).to eq([1, 5])
     end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: daru_lite
 version: !ruby/object:Gem::Version
-  version: 0.2.1
+  version: 0.2.4
 platform: ruby
 authors:
 - Thomas Naude-Filonnière
@@ -9,9 +9,10 @@ authors:
 - Julie Thomas
 - Amar Slaoua
 - Mourtada Belhantri
+autorequire:
 bindir: bin
 cert_chain: []
-date: 1980-01-02 00:00:00.000000000 Z
+date: 2026-04-10 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: activerecord
@@ -187,14 +188,14 @@ dependencies:
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '1.60'
+        version: '1.86'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '1.60'
+        version: '1.86'
 - !ruby/object:Gem::Dependency
   name: rubocop-performance
   requirement: !ruby/object:Gem::Requirement
@@ -316,6 +317,7 @@ description: |
   and can be used with many others like mixed_models, gnuplotrb and iruby.
 
   Daru Lite is a fork of Daru that aims to focus on data manipulation and stability.
+email:
 executables: []
 extensions: []
 extra_rdoc_files: []
@@ -420,7 +422,12 @@ files:
 - lib/daru_lite/maths/arithmetic/vector.rb
 - lib/daru_lite/maths/statistics/dataframe.rb
 - lib/daru_lite/maths/statistics/vector.rb
-- lib/daru_lite/monkeys.rb
+- lib/daru_lite/monkeys/array.rb
+- lib/daru_lite/monkeys/hash.rb
+- lib/daru_lite/monkeys/m_d_array.rb
+- lib/daru_lite/monkeys/matrix.rb
+- lib/daru_lite/monkeys/object.rb
+- lib/daru_lite/monkeys/range.rb
 - lib/daru_lite/vector.rb
 - lib/daru_lite/vector/aggregatable.rb
 - lib/daru_lite/vector/calculatable.rb
@@ -531,6 +538,7 @@ homepage: https://github.com/pollandroll/daru
 licenses:
 - BSD-2-Clause
 metadata: {}
+post_install_message:
 rdoc_options: []
 require_paths:
 - lib
@@ -545,7 +553,8 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 4.0.4
+rubygems_version: 3.4.10
+signing_key:
 specification_version: 4
 summary: Data Analysis in RUby, stripped down
 test_files:

data/lib/daru_lite/monkeys.rb

@@ -1,56 +0,0 @@
-class Array
-  def daru_lite_vector(name = nil, index = nil, dtype = :array)
-    DaruLite::Vector.new self, name: name, index: index, dtype: dtype
-  end
-
-  alias dv daru_lite_vector
-
-  def to_index
-    DaruLite::Index.new self
-  end
-end
-
-class Range
-  def daru_lite_vector(name = nil, index = nil, dtype = :array)
-    DaruLite::Vector.new self, name: name, index: index, dtype: dtype
-  end
-
-  alias dv daru_lite_vector
-
-  def to_index
-    DaruLite::Index.new to_a
-  end
-end
-
-class Hash
-  def daru_lite_vector(index = nil, dtype = :array)
-    DaruLite::Vector.new values[0], name: keys[0], index: index, dtype: dtype
-  end
-
-  alias dv daru_lite_vector
-end
-
-class MDArray
-  def daru_lite_vector(name = nil, index = nil, *)
-    DaruLite::Vector.new self, name: name, index: index, dtype: :mdarray
-  end
-
-  alias dv daru_lite_vector
-end
-
-class Matrix
-  def elementwise_division(other)
-    map.with_index do |e, index|
-      e / other.to_a.flatten[index]
-    end
-  end
-end
-
-class Object
-  if RUBY_VERSION < '2.2'
-    def itself
-      self
-    end
-  end
-end
-# :nocov: