bitary 0.1.2 → 0.1.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 80cd57b662219349dc57edd47612599f95f5aeca086dbec30af067adb10fe587
-  data.tar.gz: dc630c61a13c74a20e3472a90f244dd995f4c7196fb6146ca15973efe02e310d
+  metadata.gz: cc3397b948d902fe5cba56205955a01b7ad9f0d5d6eb7a1bf74984005f693114
+  data.tar.gz: af6673d27575273094dc34a4c67c67fbaa603de8a4e04375b0719e247f8cbcd9
 SHA512:
-  metadata.gz: 9adf435f35e798c71a3a81213f408da0c178b2d3137ecae3619c84e3c95d564e060a4985d24a4746b93a0fb8e2d73fc4a209a38908c7dad25d87dfd728e575da
-  data.tar.gz: a6f136e8e5f140ad9455c14b13d94232d40bfc37e09e62b6827857888d03dacbc53fb027a9da1901dfa2d2f966144680a3e2d0a5dd57c4af563d4bd09af99326
+  metadata.gz: e44836498539b643e9b75ead2d63c9b91beda96008bc11d5e10a3b354d67ad4f604b1ceee4740665c60a7eeca7ca898e3f05b22aa48d2845f10fa71914a22998
+  data.tar.gz: 2cc01a7ba3ab7463ab64283fb6e4f82ab8dab61865595f93bbea1efdbf966463008faf2d9dab42f8e304e1f9e6bfa57d597b7d1826ef8521e7f480d2749403f1

data/CHANGELOG.md

@@ -1,3 +1,8 @@
+## [0.1.2] - 2024-03-29
+
+- internal refactoring of the Bitary class
+- addition of integer size enum
+
 ## [0.1.1] - 2024-03-26
 
 - Change root namespace to a class, instead of a module

data/README.md

@@ -2,7 +2,7 @@
 
 Ruby-based implementation of the bit array data structure.
 
-It's still under development, but as of now, it implements simple and well-optimized logic allowing you to set, unset and retrieve bits.
+It's still under development, but as of now, it implements simple and well-optimized logic allowing you to set, unset and retrieve bits (as well as some extra features, see below).
 
 ## Installation
 
@@ -24,10 +24,12 @@ Documentation still needs to be written, but here is a breakdown
 of the main capabilities brought by the current bit array implementation:
 
 ```ruby
+require 'bitary'
+
 bit_array_sz = Bitary.new(128) # give an explicit size. Defaults to 64 bits used per item
 bit_array_ar = Bitary.new(
   [255, 10, 20],
-  bits_per_item: 8
+  bits_per_item: Bitary::Size::BYTE # 8 bits
 ) # create based on some integer array
 
 bit_array_sz.bits_per_item # 64
@@ -55,13 +57,13 @@ bit_array_ar.to_a # [127, 10, 20]
 bit_array_ar.to_s # "01111111 00001010 00010100"
 
 # increase/decrease bits used per item
-bit_array_ar.bits_per_item = 64
+bit_array_ar.bits_per_item = Bitary::Size::LONG # 64 bits
 bit_array_ar.to_a # [8_325_652]
 bit_array_ar.to_s # "0000000000000000000000000000000000000000011111110000101000010100"
 
 bit_array_sz.bits_per_item # 64
 bit_array_sz.to_a # [1_099_511_627_776, 0]
-bit_array_sz.bits_per_item = 32
+bit_array_sz.bits_per_item = Bitary::Size::INT # 32 bits
 bit_array_sz.to_a # [256, 0, 0, 0]
 ```
 

data/lib/bitary/deptainer.rb

@@ -0,0 +1,27 @@
+# frozen_string_literal: true
+
+class Bitary
+  class Deptainer
+    def initialize
+      @store = {}
+    end
+
+    def [](key)
+      raise ArgumentError unless key.is_a?(Symbol)
+
+      @store[key]
+    end
+
+    def []=(key, value)
+      raise ArgumentError unless key.is_a?(Symbol)
+
+      @store[key] = value
+    end
+
+    def has?(key)
+      raise ArgumentError unless key.is_a?(Symbol)
+
+      @store.key?(key)
+    end
+  end
+end

data/lib/bitary/factory.rb

@@ -0,0 +1,27 @@
+# frozen_string_literal: true
+
+require_relative 'deptainer'
+
+class Bitary
+  class Factory
+    private_class_method :new
+    @container = Deptainer.new
+
+    def self.make(name, *, **)
+      raise ArgumentError unless name.is_a?(String)
+
+      name.split('::').reduce(Bitary) do |cls, str|
+        cls.const_get(str)
+      end.new(*, **)
+    end
+
+    def self.make_memo(name, *args, **kwargs)
+      raise ArgumentError unless name.is_a?(String)
+      if @container.has?(name.to_sym) && !args.empty? && !kwargs.empty?
+        raise ArgumentError
+      end
+
+      @container[name.to_sym] ||= make(name, *args, **kwargs)
+    end
+  end
+end

data/lib/bitary/handler.rb

@@ -1,6 +1,9 @@
 # frozen_string_literal: true
 
 require_relative 'handler/set'
+require_relative 'handler/unset'
+require_relative 'handler/get'
+require_relative 'handler/append'
 
 class Bitary
   class Handler

data/lib/bitary/version.rb

@@ -1,5 +1,5 @@
 # frozen_string_literal: true
 
 class Bitary
-  VERSION = '0.1.2'
+  VERSION = '0.1.3'
 end

data/lib/bitary.rb

@@ -2,6 +2,9 @@
 
 require_relative 'bitary/size'
 require_relative 'bitary/version'
+require_relative 'bitary/handler'
+require_relative 'bitary/factory'
+require_relative 'bitary/deptainer'
 
 class Bitary
   include Size
@@ -23,7 +26,7 @@ class Bitary
     item_bit_size = compute_item_bit_size(item_index)
     item = @internal_array[item_index]
 
-    Handler::Get.new(item).execute(
+    Factory.make('Handler::Get', item).execute(
       index: index % @bits_per_item,
       size: item_bit_size
     )
@@ -39,12 +42,12 @@ class Bitary
 
     @internal_array[item_index] =
       if bit == 1
-        Handler::Set.new(item).execute(
+        Factory.make('Handler::Set', item).execute(
           index: index % @bits_per_item,
           size: item_bit_size
         )
       else
-        Handler::Unset.new(item).execute(
+        Factory.make('Handler::Unset', item).execute(
           index: index % @bits_per_item,
           size: item_bit_size
         )
@@ -136,7 +139,10 @@ class Bitary
         processed_bits = 0
       end
 
-      acc[-1] = Handler::Append.new(acc[-1]).execute(offset:, value:)
+      acc[-1] = Factory.make('Handler::Append', acc[-1]).execute(
+        offset:,
+        value:
+      )
       processed_bits += bpi
     end
   end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: bitary
 version: !ruby/object:Gem::Version
-  version: 0.1.2
+  version: 0.1.3
 platform: ruby
 authors:
 - Maximilien Ballesteros
@@ -24,6 +24,8 @@ files:
 - README.md
 - Rakefile
 - lib/bitary.rb
+- lib/bitary/deptainer.rb
+- lib/bitary/factory.rb
 - lib/bitary/handler.rb
 - lib/bitary/handler/append.rb
 - lib/bitary/handler/get.rb