inmemory_kv 0.1.0 → 0.1.1

checksums.yaml

@@ -1,15 +1,15 @@
 ---
 !binary "U0hBMQ==":
   metadata.gz: !binary |-
-    YWFiZGI1MGRlM2I4MDg3NzFlZGEyYzBkMzAwOWU0MjFkNWY4ZGRiNQ==
+    MWU3YjA2NjJmYmQ0ZTg1NWE1NWE5MTBmMDg3YWEzNjUyOTI2ZTFiZQ==
   data.tar.gz: !binary |-
-    ZjkxOTg3MTUzOWY0OTM1N2JhOGFiMmNkMDUzYjQ0ODQ3NDg3M2JhOQ==
+    Mjk4MWUzN2FhMmE1N2QyOGNjMWFmM2NmMWU1YjBhODcxNmRhNjM0Mw==
 SHA512:
   metadata.gz: !binary |-
-    YzFlNGQ3MmU1ODE1NDI4ZGEyOWU0MTYzYzdjYTlmMTgzMzRiMTM0ZjQ1YzUy
-    ZjI1MjM0YTBjNTUyMjEwODFhMzVjMmFmM2FlZTUwZmNhOWZkMjdiODUyYWY5
-    MjUxZDEzZGI4ZjAyNDAwZjI1MGIyNzM2MzVmMTcxOTU3MzI4ZDg=
+    N2M4MTRjZmEyZjY5OGYyNDg0YmMxNzAyOWJjMWQ3MDBlMzU1M2M2MzUzODkw
+    Njk2OTU4YWZkYmVkZmExNDYzOTJhZWE3YmRiNmQxZWUwYmE1ODIzYjMxOWFl
+    MWQ0ODI0YTk0YTQxY2RmNDEzYzFkOWIyYzk2YmEyNTI5ZThhYWM=
   data.tar.gz: !binary |-
-    MGVjZWZmMDM5YTQzYmVmMjEyNmU5YjVkYTAxNTExMjllMGJhM2VhNjczMDc0
-    OWIzYTczMGNmYTBlMzhlMzIwNTI2NDIxN2NmODNjNGJhZTdkZWYxYWY5MzVk
-    MTYwZjE4MGQ1N2Q2ZDYwYmE3MDI2NGYwNDI0YTZjZWFiZDY5MmI=
+    YjdlNDY4M2VjZGE2Njc5MzY2MmFmNjA3YThhYmM1YmRiOGI0NWM0MDgzMjU3
+    MDdhYjQzZTgwYTZhNjM0ZjY3NmU2ZTFkYTdkMTM5ZWZjZGU1Nzk1ZjU4ZTNi
+    MGUzYTY3ZGJiMTk2ZjAzMDVlNzE2MzZlZjE3M2QwZTJkM2YwZWI=

data/README.md

@@ -7,7 +7,7 @@ with LRU built in (a lot like builtin Hash).
 
 It doesn't participate in GC and not encounted in. It uses `malloc` for simplicity.
 
-If you do not clone and not mutate it in a fork, than it is as fork-frienly as your malloc is.
+If you do not clone and not mutate it in a fork, than it is as fork-friendly as your malloc is.
 
 It is not thread-safe, so protect it by you self. (builtin hash is also not thread-safe)
 
@@ -32,6 +32,9 @@ Or install it yourself as:
 ```ruby
 s2s = InMemoryKV::Str2Str.new
 s2s['asdf'] = 'qwer'
+s2s.size
+s2s.count
+s2s.empty?
 s2s.keys
 s2s.values
 s2s.entries
@@ -47,6 +50,7 @@ s2s.first # first/oldest entry in LRU
 s2s.shift # shift oldest entry
 s2s.data_size # size of key+value entries
 s2s.total_size # size of key+value entries + internal structures
+s2s.clear
 
 # Str2Str is more memory efficient than storing string in a builtin hash
 # also it is a bit faster.

data/ext/inmemory_kv.c

@@ -775,6 +775,15 @@ rb_kv_init_copy(VALUE self, VALUE orig) {
 	return self;
 }
 
+static VALUE
+rb_kv_clear(VALUE self) {
+	inmemory_kv* kv;
+	GetKV(self, kv);
+	kv_destroy(kv);
+	memset(kv, 0, sizeof(*kv));
+	return self;
+}
+
 void
 Init_inmemory_kv() {
 	VALUE mod_inmemory_kv, cls_str2str;
@@ -805,5 +814,6 @@ Init_inmemory_kv() {
 	rb_define_method(cls_str2str, "each", rb_kv_each, 0);
 	rb_define_method(cls_str2str, "inspect", rb_kv_inspect, 0);
 	rb_define_method(cls_str2str, "initialize_copy", rb_kv_init_copy, 1);
+	rb_define_method(cls_str2str, "clear", rb_kv_clear, 0);
 	rb_include_module(cls_str2str, rb_mEnumerable);
 }

data/lib/inmemory_kv/version.rb

@@ -1,3 +1,3 @@
 module InMemoryKV
-  VERSION = "0.1.0"
+  VERSION = "0.1.1"
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: inmemory_kv
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.1.1
 platform: ruby
 authors:
 - Sokolov Yura aka funny_falcon