rb_lovely 0.6.4 → 0.6.5

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 0f77c4e7bc0c9011e9fac59b5c509836c1217661
-  data.tar.gz: abeb9c72ab3f9c8a636986fb792639fb922c3409
+  metadata.gz: fbacf68a03009f39933493ff077a97ace08685c0
+  data.tar.gz: 4c8d5d57b559c93215e7b9be01c95fb3c6073e40
 SHA512:
-  metadata.gz: 424beddca21eba29ed7e03d7bc61c071d4f29eeced343c4160a0259ef3132249b84b6c29293d27ccb755cb44fd14e4a9f49f0aa053534de9856ba532f5b44068
-  data.tar.gz: 5df6f7524c57ad2b0dbe6753f8b4c4ec6d2f50dfc387a6a0894f43172952bc2cf102c76fa546a266851099302791c9f1292fa361a064da4cb911a66314521a75
+  metadata.gz: 6b457ed98975e79f3d567f32c5ba42efa38df04400918908d3213f2a5461133044f4dcde5f6565e0b57fe6364aeecfd607d1c34582c57f9b251ca132eaf51392
+  data.tar.gz: 0402307048f4051120ccc841dc86e1971de96cfe4c927c67ad0c0c084219ca765a797c0a40944cbd7b15564ffe69015555ad89c7698b3c0e6eae866bf526781a

data/.yardopts

@@ -1 +1 @@
-yard.rb
+yard.rb --tag complexity:"Complexity"

data/ext/rb_lovely/sorted_hash.cpp

@@ -60,6 +60,11 @@ VALUE hashLength(VALUE self) {
   return INT2NUM(hash->container.size());
 }
 
+VALUE hashEmpty(VALUE self) {
+  Hash* hash = rubyCast<Hash>(self);
+  return hash->container.empty() ? Qtrue : Qfalse;
+}
+
 VALUE hashInitialize(int argc, VALUE *argv, VALUE self) {
   Hash* hash = rubyCast<Hash>(self);
   if (argc == 1) {
@@ -255,6 +260,7 @@ extern "C" {
     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, "empty?", RUBY_METHOD_FUNC(hashEmpty), 0);
     rb_define_method(rbHash, "[]=", RUBY_METHOD_FUNC(hashUpdate), 2);
     // like []= but return previous value if there was one
     rb_define_method(rbHash, "replace", RUBY_METHOD_FUNC(hashReplace), 2);

data/ext/rb_lovely/sorted_set.cpp

@@ -52,6 +52,11 @@ VALUE setLength(VALUE self) {
   return INT2NUM(set->size());
 }
 
+VALUE setEmpty(VALUE self) {
+  Set* set = rubyCast<Set>(self);
+  return set->empty() ? Qtrue : Qfalse;
+}
+
 VALUE setAdd(VALUE self, VALUE val) {
   Set* set = rubyCast<Set>(self);
   set->insert(val);
@@ -221,6 +226,7 @@ extern "C" {
     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, "empty?", RUBY_METHOD_FUNC(setEmpty), 0);
     rb_define_method(rbSet, "add", RUBY_METHOD_FUNC(setAdd), 1);
     rb_define_method(rbSet, "<<", RUBY_METHOD_FUNC(setAdd), 1);
     rb_define_method(rbSet, "each", RUBY_METHOD_FUNC(setEach), 0);

data/yard.rb

@@ -68,14 +68,6 @@ module RbLovely
     #   expect(set.first).to equal 0
     def first ; end
 
-    # Remove the first element from the set.
-    # @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 [4, 0, 2]
-    #   expect(set.shift).to equal 0
-    def shift ; end
-
     # Access the last element in the set.
     # @complexity O(c).
     # @return The last value according to the <=> method defined on each member.
@@ -84,7 +76,17 @@ module RbLovely
     #   expect(set.last).to equal 4
     def last ; end
 
+    # Remove the first element from the set.
+    # @see #pop
+    # @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 [4, 0, 2]
+    #   expect(set.shift).to equal 0
+    def shift ; end
+
     # Remove the last element from the set.
+    # @see #shift
     # @complexity O(c).
     # @return The last value according to the <=> method defined on each member or nil if the set is empty.
     # @example
@@ -125,6 +127,14 @@ module RbLovely
     #   set = RbLovely::SortedSet [0, 1, 2, 3]
     #   set.each { |x| puts x }
     def each(&block) ; end
+
+    # Gets the number of elements in the set.
+    # @return [Number] Number of items in set.
+    def length ; end
+
+    # Return true if the set is empty.
+    # @return [Boolean] True only if the set is empty else false.
+    def empty? ; end
   end
 
 
@@ -206,7 +216,7 @@ module RbLovely
     # @example
     #   hash = RbLovely::SortedHash [:a, 10]
     #   hash.clear
-    #   expect(hash.length).to equal 0
+    #   expect(hash.empty?).to equal true
     def clear ; end
 
     # Retrieve value associated with the corresponding key or nil if the key doesn't exist.
@@ -219,13 +229,41 @@ module RbLovely
 
     # Return true if the key is contained in the hash.
     def include?(key) ; end
+    alias :has_key? :include?
+    alias :key? :include?
 
     # Retrieve first value as determined by value sort order or nil if the hash is empty.
+    # @complexity O(c)
     def first ; end
 
     # Retrieve last value as determined by value sort order or nil if the hash is empty.
+    # @complexity O(c)
     def last ; end
 
-    alias :has_key? :include?
+    # Remove the first value in the hash and return it or return nil if the hash is empty.
+    # @complexity O(c).
+    # @see #pop
+    # @return The first value according to the <=> method defined on each member or nil if the hash is empty.
+    # @example
+    #   set = RbLovely::SortedHash [:a, 2, :b, 10]
+    #   expect(hash.shift).to equal 2
+    def shift ; end
+
+    # Remove the last value in the hash and return it or return nil if the hash is empty.
+    # @complexity O(c).
+    # @see #shift
+    # @return The last value according to the <=> method defined on each member or nil if the hash is empty.
+    # @example
+    #   set = RbLovely::SortedHash [:a, 2, :b, 10]
+    #   expect(hash.pop).to equal 10
+    def pop ; end
+
+    # Gets the number of elements in the hash.
+    # @return [Number] Number of items in hash.
+    def length ; end
+
+    # Return true if the hash is empty.
+    # @return [Boolean] True only if the hash is empty else false.
+    def empty? ; end
   end
 end

metadata

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