aerospike 2.19.0 → 2.26.0

data/lib/aerospike/atomic/atomic.rb

@@ -48,7 +48,7 @@ module Aerospike
         @value = value
       end
     end
-    alias_method 'value='.to_sym, :set
+    alias_method :value=, :set
 
   end # class
 

data/lib/aerospike/cdt/context.rb

@@ -17,16 +17,17 @@
 # License for the specific language governing permissions and limitations under
 # the License.
 
+require "base64"
+
 module Aerospike
   module CDT
 
-  	##
-	# Nested CDT context. Identifies the location of nested list/map to apply the operation.
-	# for the current level.
-	# An array of CTX identifies location of the list/map on multiple
-	# levels on nesting.
+    ##
+    # Nested CDT context. Identifies the location of nested list/map to apply the operation.
+    # for the current level.
+    # An array of CTX identifies location of the list/map on multiple
+    # levels on nesting.
     class Context
-
       attr_accessor :id, :value
 
       def initialize(id, value)
@@ -37,77 +38,143 @@ module Aerospike
       ##
       # Create list with given type at index offset, given an order and pad.
       def self.list_index_create(index, order, pad)
-      Context.new(0x10 | ListOrder.flag(order, pad), index)
-      end
-
-	  ##
-	  # Lookup list by index offset.
-	  # If the index is negative, the resolved index starts backwards from end of list.
-	  # If an index is out of bounds, a parameter error will be returned.
-	  # Examples:
-	  # 0: First item.
-	  # 4: Fifth item.
-	  # -1: Last item.
-	  # -3: Third to last item.
-	  def self.list_index(index)
-	  	Context.new(0x10, index)
-	  end
-	  
-	  ##
-	  # Lookup list by rank.
-	  # 0 = smallest value
-	  # N = Nth smallest value
-	  # -1 = largest value
-	  def self.list_rank(rank)
-	  	Context.new(0x11, rank)
-	  end
-	  
-	  ##
-	  # Lookup list by value.
-	  def self.list_value(key)
-	  	Context.new(0x13, key)
-	  end
-	  
-	  ##
-	  # Lookup map by index offset.
-	  # If the index is negative, the resolved index starts backwards from end of list.
-	  # If an index is out of bounds, a parameter error will be returned.
-	  # Examples:
-	  # 0: First item.
-	  # 4: Fifth item.
-	  # -1: Last item.
-	  # -3: Third to last item.
-	  def self.map_index(index)
-	  	Context.new(0x20, index)
-	  end
-	  
-	  ##
-	  # Lookup map by rank.
-	  # 0 = smallest value
-	  # N = Nth smallest value
-	  # -1 = largest value
-	  def self.map_rank(rank)
-	  	Context.new(0x21, rank)
-	  end
-	  
-	  ##
-	  # Lookup map by key.
-	  def self.map_key(key)
-	  	Context.new(0x22, key)
-	  end
-	  
+        Context.new(0x10 | ListOrder.flag(order, pad), index)
+      end
+
+      ##
+      # Lookup list by index offset.
+      # If the index is negative, the resolved index starts backwards from end of list.
+      # If an index is out of bounds, a parameter error will be returned.
+      # Examples:
+      # 0: First item.
+      # 4: Fifth item.
+      # -1: Last item.
+      # -3: Third to last item.
+      def self.list_index(index)
+        Context.new(0x10, index)
+      end
+
+      ##
+      # Lookup list by rank.
+      # 0 = smallest value
+      # N = Nth smallest value
+      # -1 = largest value
+      def self.list_rank(rank)
+        Context.new(0x11, rank)
+      end
+
+      ##
+      # Lookup list by value.
+      def self.list_value(key)
+        Context.new(0x13, key)
+      end
+
+      ##
+      # Lookup map by index offset.
+      # If the index is negative, the resolved index starts backwards from end of list.
+      # If an index is out of bounds, a parameter error will be returned.
+      # Examples:
+      # 0: First item.
+      # 4: Fifth item.
+      # -1: Last item.
+      # -3: Third to last item.
+      def self.map_index(index)
+        Context.new(0x20, index)
+      end
+
+      ##
+      # Lookup map by rank.
+      # 0 = smallest value
+      # N = Nth smallest value
+      # -1 = largest value
+      def self.map_rank(rank)
+        Context.new(0x21, rank)
+      end
+
+      ##
+      # Lookup map by key.
+      def self.map_key(key)
+        Context.new(0x22, key)
+      end
+
       ##
       # Create map with given type at map key.
       def self.map_key_create(key, order)
         Context.new(0x22 | order[:flag], key)
       end
 
-	  ##
-	  # Lookup map by value.
-	  def self.map_value(key)
-	  	Context.new(0x23, key)
-	  end      
+      ##
+      # Lookup map by value.
+      def self.map_value(key)
+        Context.new(0x23, key)
+      end
+
+      ##
+      # Encodes the context via message pack.
+      def self.pack(packer, ctx)
+        unless ctx.to_a.empty?
+          packer.write_array_header(2)
+          ctx.each do |c|
+            packer.write(c.id)
+            Value.of(c.value)
+          end
+        end
+      end
+
+      ##
+      # Encodes the context via message pack and return the results.
+      def self.bytes(ctx)
+        unless ctx.to_a.empty?
+          Packer.use do |packer|
+            packer.write_array_header(ctx.length * 2)
+            ctx.each do |c|
+              packer.write(c.id)
+              Value.of(c.value).pack(packer)
+            end
+            return packer.bytes
+          end
+        end
+        nil
+      end
+
+      def ==(other)
+        self.id == other.id && self.value == other.value
+      end
 
+      ##
+      # decodes the base64 encoded messagepack byte array
+      # and converts it to an array of Context.
+      def self.from_bytes(buf)
+        list = nil
+        Unpacker.use do |unpacker|
+          list = unpacker.unpack(buf)
+        end
+
+        unless list.length % 2 == 0
+          raise Exceptions::Aerospike.new(Aerospike::ResultCode::PARAMETER_ERROR, "Invalid buffer")
+        end
+
+        list.each_slice(2).map { |id, value| Context.new(id, value) }
+      end
+
+      ##
+      # Encodes the context array to messagepack and then encodes
+      # the resulting byte array to base64.
+      def self.base64(ctx)
+        unless ctx.to_a.empty?
+          data = self.bytes(ctx)
+          return Base64.strict_encode64(data).force_encoding("binary")
+        end
+        ""
+      end
+
+      ##
+      # Decodes the byte array to messagepack and then decodes
+      # the resulting byte array to an array of Context.
+      def self.from_base64(buf)
+        bytes = Base64.strict_decode64(buf)
+        self.from_bytes(bytes)
+      end
     end
   end
 end

data/lib/aerospike/cdt/list_return_type.rb

@@ -60,6 +60,10 @@ module Aerospike
       # Return value for single key read and value list for range read.
       VALUE = 7
 
+      ##
+      # Return true if count > 0.
+      EXISTS = 13
+
       ##
       # :private
       #

data/lib/aerospike/cdt/map_operation.rb

@@ -138,9 +138,7 @@ module Aerospike
       # The map policy dictates the type of map to create when it does not exist.
       # The map policy also specifies the flags used when writing items to the map.
       def self.put(bin_name, key, value, ctx: nil, policy: MapPolicy::DEFAULT)
-        if policy.flags != MapWriteFlags::DEFAULT
-          MapOperation.new(Operation::CDT_MODIFY, PUT, bin_name, key, value, policy.order[:attr], policy.flags, ctx: ctx)
-        else
+        if policy.flags == MapWriteFlags::DEFAULT
           case policy.write_mode
           when MapWriteMode::UPDATE_ONLY
             # Replace doesn't allow map order because it does not create on non-existing key.
@@ -150,6 +148,8 @@ module Aerospike
           else
             MapOperation.new(Operation::CDT_MODIFY, PUT, bin_name, key, value, policy.order[:attr], ctx: ctx)
           end
+        else
+          MapOperation.new(Operation::CDT_MODIFY, PUT, bin_name, key, value, policy.order[:attr], policy.flags, ctx: ctx)
         end
       end
 
@@ -160,9 +160,7 @@ module Aerospike
       # The map policy dictates the type of map to create when it does not exist.
       # The map policy also specifies the flags used when writing items to the map.
       def self.put_items(bin_name, values, ctx: nil, policy: MapPolicy::DEFAULT)
-        if policy.flags != MapWriteFlags::DEFAULT
-          MapOperation.new(Operation::CDT_MODIFY, PUT_ITEMS, bin_name, values, policy.order[:attr], policy.flags, ctx: ctx)
-        else
+        if policy.flags == MapWriteFlags::DEFAULT
           case policy.write_mode
           when MapWriteMode::UPDATE_ONLY
             # Replace doesn't allow map order because it does not create on non-existing key.
@@ -172,6 +170,8 @@ module Aerospike
           else
             MapOperation.new(Operation::CDT_MODIFY, PUT_ITEMS, bin_name, values, policy.order[:attr], ctx: ctx)
           end
+        else
+          MapOperation.new(Operation::CDT_MODIFY, PUT_ITEMS, bin_name, values, policy.order[:attr], policy.flags, ctx: ctx)
         end
       end
 

data/lib/aerospike/cdt/map_policy.rb

@@ -17,8 +17,8 @@
 module Aerospike
   module CDT
     class MapPolicy
-
       attr_accessor :order, :write_mode, :flags
+      attr_accessor :item_command, :items_command, :attributes
 
       def initialize(order: nil, write_mode: nil, flags: nil)
         if write_mode && flags
@@ -28,10 +28,24 @@ module Aerospike
         @order = order || MapOrder::DEFAULT
         @write_mode = write_mode || MapWriteMode::DEFAULT
         @flags = flags || MapWriteFlags::DEFAULT
+        @attributes = order ? order[:attr] : 0
+
+        case @write_mode
+        when CDT::MapWriteMode::DEFAULT
+          @item_command = CDT::MapOperation::PUT
+          @items_command = CDT::MapOperation::PUT_ITEMS
+        when CDT::MapWriteMode::UPDATE_ONLY
+          @item_command = CDT::MapOperation::REPLACE
+          @items_command = CDT::MapOperation::REPLACE_ITEMS
+        when CDT::MapWriteMode::CREATE_ONLY
+          @item_command = CDT::MapOperation::ADD
+          @items_command = CDT::MapOperation::ADD_ITEMS
+        else
+          raise Exceptions.new(ResultCode::PARAMETER_ERROR, "invalid value for MapWriteMode #{write_mode}")
+        end
       end
 
       DEFAULT = MapPolicy.new
-
     end
   end
 end

data/lib/aerospike/cdt/map_return_type.rb

@@ -65,10 +65,22 @@ module Aerospike
       # Return key/value items.
       KEY_VALUE = 8
 
+      ##
+      # Return true if count > 0.
+      EXISTS = 13
+
+      ##
+      #  :private
+      #
+      # TODO: Should be like ListOperation and Implement InvertibleMapOperation
+      # Inverts meaning of map command and return values. For example:
+      # map_remove_by_key_range(bin_name, key_begin, key_end, MapReturnType::KEY | MapReturnType::INVERTED)
+      # With the INVERTED flag enabled, the keys outside of the specified key range will be removed and returned.
+      INVERTED = 0x10000
+
       ##
       # Default return type: NONE
       DEFAULT_RETURN_TYPE = NONE
-
     end
   end
 end