rb_lovely 0.6.2 → 0.6.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: cc6858428c1b20ccab46f7c4b561e3531853ad7a
-  data.tar.gz: 2de01f2967e14c0149184a12b7191969b07a0821
+  metadata.gz: 81e2fd334254b0f4e4583898aec3b6dd84f81e0a
+  data.tar.gz: 00285bf3cd11e2b69fc919668beda886ee618b5d
 SHA512:
-  metadata.gz: 23cdc3ee67aeab749cb6bc0dadb1864f4b860511d9ed511abcf7854c601f6858c34be1a8cb16b8e0f3e2ee4481dd6740188978fb1a9cf54744508bb8027b98b9
-  data.tar.gz: 1e7d603e62caa5c32773bdcda4366a928e3e16ab47fb3392a8173904daabb7a7407093c307db312578962ef51c9bde2da57b6b0fe1fc043e0323c9594096028c
+  metadata.gz: 81555a532701e85a2e4dd0fd2388d895ee2810e07a273f5e039e45373d4476b8be3b3bbcf1d1a8afda11af4c0829ba7f24d28e71fd55efeda70810ea5e5e6add
+  data.tar.gz: 03117a51cacbb791b7529cd8691c087e0b8c4bb9c47cf95ac1d638731e1f374fc53d979b2992ceb559b75ba74776303c7465c81f02d69f492b8ce55ab639f93f

data/ext/rb_lovely/sorted_hash.cpp

@@ -94,6 +94,12 @@ VALUE hashInitialize(int argc, VALUE *argv, VALUE self) {
   return self;
 }
 
+VALUE hashFactory(VALUE clss, VALUE args) {
+  auto obj = rb_obj_alloc(clss);
+  rb_obj_call_init(obj, 1, &args);
+  return obj;
+}
+
 VALUE hashClear(VALUE self) {
   Hash* hash = rubyCast<Hash>(self);
   hash->container.clear();
@@ -246,6 +252,7 @@ extern "C" {
     rb_include_module(rbHash, rb_const_get(rb_cObject, rb_intern("Enumerable")));
 
     rb_define_method(rbHash, "initialize", RUBY_METHOD_FUNC(hashInitialize), -1);
+    rb_define_singleton_method(rbHash, "[]", RUBY_METHOD_FUNC(hashFactory), -2);
     rb_define_method(rbHash, "clear", RUBY_METHOD_FUNC(hashClear), 0);
     rb_define_method(rbHash, "length", RUBY_METHOD_FUNC(hashLength), 0);
     rb_define_method(rbHash, "[]=", RUBY_METHOD_FUNC(hashUpdate), 2);

data/ext/rb_lovely/sorted_set.cpp

@@ -35,6 +35,12 @@ VALUE setInitialize(int argc, VALUE *argv, VALUE self) {
   return self;
 }
 
+VALUE setFactory(VALUE clss, VALUE args) {
+  auto obj = rb_obj_alloc(clss);
+  rb_obj_call_init(obj, 1, &args);
+  return obj;
+}
+
 VALUE setClear(VALUE self) {
   Set* set = rubyCast<Set>(self);
   set->clear();
@@ -212,6 +218,7 @@ extern "C" {
     rb_include_module(rbSet, rb_const_get(rb_cObject, rb_intern("Enumerable")));
 
     rb_define_method(rbSet, "initialize", RUBY_METHOD_FUNC(setInitialize), -1);
+    rb_define_singleton_method(rbSet, "[]", RUBY_METHOD_FUNC(setFactory), -2);
     rb_define_method(rbSet, "clear", RUBY_METHOD_FUNC(setClear), 0);
     rb_define_method(rbSet, "length", RUBY_METHOD_FUNC(setLength), 0);
     rb_define_method(rbSet, "add", RUBY_METHOD_FUNC(setAdd), 1);

data/yard.rb

@@ -22,7 +22,7 @@ module RbLovely
   #
   #   empty_set = RbLovely::SortedSet.new
   #
-  #   set = RbLovely::SortedSet.new [ Person.new('Nyamuk', 2), Person.new('Cold Rain', 9999) ]
+  #   set = RbLovely::SortedSet [ Person.new('Nyamuk', 2), Person.new('Cold Rain', 9999) ]
   #   set.add Person.new('Beards', 15)
   #   set << Person.new('Anna', 12)
   #   set.add Person.new('Moust', 18)
@@ -37,14 +37,25 @@ module RbLovely
     include Enumerable
 
     # @param content [Array] An array of values to insert into the set.
+    # @example
+    #   set = RbLovely::SortedSet.new [3,1,2]
+    #   expect(set.to_a).to eql [1,2,3]
     def initialize content = [] ; end
 
+    # Factory method for creating sorted set from array.
+    # @param content [Array] An array of values to insert into the created set.
+    # @return [SortedSet] New sorted set instance.
+    # @example
+    #   set = RbLovely::SortedSet [3,1,2]
+    #   expect(set.to_a).to eql [1,2,3]
+    def self.[](*content) ; end
+
     # Deletes first member equivalent to value.
     # @complexity O(log(n)).
     # @return The value that was removed or nil if no value was removed.
     # @param value Value to remove (each member is compared to value using the <=> method).
     # @example
-    #   set = RbLovely::SortedSet.new [ 1, 5, 3 ]
+    #   set = RbLovely::SortedSet [ 1, 5, 3 ]
     #   set.delete 3
     #   expect(set.to_a).to eql [1, 5]
     def delete value ; end
@@ -53,7 +64,7 @@ module RbLovely
     # @complexity O(c).
     # @return The first value according to the <=> method defined on each member.
     # @example
-    #   set = RbLovely::SortedSet.new [4, 0, 2]
+    #   set = RbLovely::SortedSet [4, 0, 2]
     #   expect(set.first).to equal 0
     def first ; end
 
@@ -61,7 +72,7 @@ module RbLovely
     # @complexity O(c).
     # @return The first value according to the <=> method defined on each member or nil if the set is empty.
     # @example
-    #   set = RbLovely::SortedSet.new [4, 0, 2]
+    #   set = RbLovely::SortedSet [4, 0, 2]
     #   expect(set.shift).to equal 0
     def shift ; end
 
@@ -69,7 +80,7 @@ module RbLovely
     # @complexity O(c).
     # @return The last value according to the <=> method defined on each member.
     # @example
-    #   set = RbLovely::SortedSet.new [4, 0, 2]
+    #   set = RbLovely::SortedSet [4, 0, 2]
     #   expect(set.last).to equal 4
     def last ; end
 
@@ -77,7 +88,7 @@ module RbLovely
     # @complexity O(c).
     # @return The last value according to the <=> method defined on each member or nil if the set is empty.
     # @example
-    #   set = RbLovely::SortedSet.new [4, 0, 2]
+    #   set = RbLovely::SortedSet [4, 0, 2]
     #   expect(set.pop).to equal 4
     def pop ; end
 
@@ -85,7 +96,7 @@ module RbLovely
     # @complexity O(n)
     # @param predicate Items are removed from the set for which predicate returns true.
     # @example
-    #   set = RbLovely::SortedSet.new [0, 1, 2, 3]
+    #   set = RbLovely::SortedSet [0, 1, 2, 3]
     #   set.reject!(&:odd?)
     #   expect(set.to_a).to eql([0, 2])
     def reject!(&predicate) ; end
@@ -94,7 +105,7 @@ module RbLovely
     # @complexity O(log n)
     # @param predicate The first item is removed which predicate returns true for.
     # @example
-    #   set = RbLovely::SortedSet.new [0, 1, 2, 3]
+    #   set = RbLovely::SortedSet [0, 1, 2, 3]
     #   set.reject!(&:odd?)
     #   expect(set.to_a).to eql([0, 2, 3])
     def reject_first!(&predicate) ; end
@@ -103,7 +114,7 @@ module RbLovely
     # @complexity O(n)
     # @param predicate Items are removed from the set for which predicate does not return true.
     # @example
-    #   set = RbLovely::SortedSet.new [0, 1, 2, 3]
+    #   set = RbLovely::SortedSet [0, 1, 2, 3]
     #   set.select!(&:odd?)
     #   expect(set.to_a).to eql([1, 3])
     def select!(&predicate) ; end
@@ -111,7 +122,7 @@ module RbLovely
     # Calls block once with each value in the set.
     # @complexity O(n)
     # @example
-    #   set = RbLovely::SortedSet.new [0, 1, 2, 3]
+    #   set = RbLovely::SortedSet [0, 1, 2, 3]
     #   set.each { |x| puts x }
     def each(&block) ; end
   end
@@ -129,7 +140,7 @@ module RbLovely
   #   empty_hash = RbLovely::SortedHash.new
   #
   #   # constructor is like: hash[20] = 5 ; hash[9] = 1
-  #   hash = RbLovely::SortedHash.new [20, 5, 9, 1]
+  #   hash = RbLovely::SortedHash [20, 5, 9, 1]
   #   hash[2] = 16
   #   hash[20] = 4 # updates previous value
   #   expect(hash[20]).to equal 4
@@ -141,7 +152,7 @@ module RbLovely
     # @param compare [Proc] Comparison function used to order values (rather than default
     #                       of using <=> method).
     # @example
-    #   hash = RbLovely::SortedHash.new([:a, 10, :c, 5, :b, 1 ])
+    #   hash = RbLovely::SortedHash.new [:a, 10, :c, 5, :b, 1 ]
     #   expect(hash.to_a).to eql [[:b, 1], [:c, 5], [:a, 10]]
     #
     #   # compare function reverses default sort order
@@ -152,10 +163,18 @@ module RbLovely
     #   expect(hash.to_a).to eql [[:b, 10], [:c, 5], [:a, 1 ]]
     def initialize content = [], compare: nil ; end
 
+    # Factory method for creating sorted hash from array.
+    # @param content [Array] An array of values to insert into the created hash.
+    # @return [SortedHash] New sorted set instance.
+    # @example
+    #   hash = RbLovely::SortedHash [:a, 3, :b, 1]
+    #   expect(hash.to_a).to eql [[:b, 1], [:a, 3]]
+    def self.[](*content) ; end
+
     # Delete the value associated with a key.
     # @return The value associated with the deleted key or nil if the key was not in the hash.
     # @example
-    #   hash = RbLovely::SortedHash.new([:a, 5 ])
+    #   hash = RbLovely::SortedHash [:a, 5 ]
     #   expect(hash.delete(:a)).to equal 5
     #   expect(hash.delete(:b)).to equal nil
     def delete key ; end
@@ -163,14 +182,14 @@ module RbLovely
     # Calls block once for each key, passing the key-value pair as parameters.
     # @complexity O(n)
     # @example
-    #   hash = RbLovely::SortedHash.new [:a, 10, :b, 1]
+    #   hash = RbLovely::SortedHash [:a, 10, :b, 1]
     #   # This would call the block in value order: with (:b, 1) followed by (:a, 10).
     #   hash.each { |key, value| puts "#{key} => #{value}" }
     def each(&block) ; end
 
     # Remove all values from the hash.
     # @example
-    #   hash = RbLovely::SortedHash.new [:a, 10]
+    #   hash = RbLovely::SortedHash [:a, 10]
     #   hash.clear
     #   expect(hash.length).to equal 0
     def clear ; end
@@ -178,7 +197,7 @@ module RbLovely
     # Retrieve value associated with the corresponding key or nil if the key doesn't exist.
     # @complexity O(c)
     # @example
-    #   hash = RbLovely::SortedHash.new [:a, 2]
+    #   hash = RbLovely::SortedHash [:a, 2]
     #   expect(hash[:a]).to equal 2
     #   expect(hash[:b]).to equal nil
     def [](key) ; end
@@ -186,10 +205,10 @@ module RbLovely
     # Return true if the key is contained in the hash.
     def include?(key) ; end
 
-    # Retrieve first value sorted by <=> or comparison function or nil if the hash is empty.
+    # Retrieve first value as determined by value sort order or nil if the hash is empty.
     def first ; end
 
-    # Retrieve last value sorted by <=> or comparison function or nil if the hash is empty.
+    # Retrieve last value as determined by value sort order or nil if the hash is empty.
     def last ; end
 
     alias :has_key? :include?

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: rb_lovely
 version: !ruby/object:Gem::Version
-  version: 0.6.2
+  version: 0.6.3
 platform: ruby
 authors:
 - James Pike