bel 0.3.2-x86-mingw32 → 0.3.3-x86-mingw32

data/lib/bel/libbel/bel_ast_structs.rb

@@ -2,201 +2,203 @@ require_relative 'node_traversal'
 require_relative 'node_transformation'
 require_relative 'node_test'
 
-module LibBEL
-  class AstNodeTypeUnion < FFI::Union
-    layout(
-      :ttype,     :bel_ast_token_type,
-      :vtype,     :bel_ast_value_type
-    )
-
-    def token_type
-      self[:ttype]
-    end
+module BEL
+  module LibBEL
+    class AstNodeTypeUnion < FFI::Union
+      layout(
+        :ttype,     :bel_ast_token_type,
+        :vtype,     :bel_ast_value_type
+      )
+
+      def token_type
+        self[:ttype]
+      end
 
-    def value_type
-      self[:vtype]
+      def value_type
+        self[:vtype]
+      end
     end
-  end
 
-  class BelAstNodeTypeInfo < FFI::Struct
-    layout(
-      :type,      :bel_ast_node_type,
-      :union,     AstNodeTypeUnion
-    )
+    class BelAstNodeTypeInfo < FFI::Struct
+      layout(
+        :type,      :bel_ast_node_type,
+        :union,     AstNodeTypeUnion
+      )
 
-    def type
-      self[:type]
-    end
+      def type
+        self[:type]
+      end
 
-    def union
-      self[:union]
+      def union
+        self[:union]
+      end
     end
-  end
 
-  class BelAstNode < FFI::Union
-    include NodeTraversal
-    include NodeTransformation
-    include NodeTest
+    class BelAstNode < FFI::Union
+      include NodeTraversal
+      include NodeTransformation
+      include NodeTest
 
-    layout(
-      :type_info, BelAstNodeTypeInfo.ptr,
-      :token,     :pointer,
-      :value,     :pointer
-    )
+      layout(
+        :type_info, BelAstNodeTypeInfo.ptr,
+        :token,     :pointer,
+        :value,     :pointer
+      )
 
-    def type_info
-      self[:type_info]
-    end
+      def type_info
+        self[:type_info]
+      end
 
-    def type_info=(type_info)
-      self[:type_info] = type_info
-    end
+      def type_info=(type_info)
+        self[:type_info] = type_info
+      end
 
-    def token
-      self[:token]
-    end
+      def token
+        self[:token]
+      end
 
-    def token=(token)
-      self[:token] = token
-    end
+      def token=(token)
+        self[:token] = token
+      end
 
-    def value
-      self[:value]
-    end
+      def value
+        self[:value]
+      end
 
-    def value=(value)
-      self[:value] = value
-    end
+      def value=(value)
+        self[:value] = value
+      end
 
-    def to_typed_node
-      LibBEL.typed_node(self)
+      def to_typed_node
+        LibBEL.typed_node(self)
+      end
     end
-  end
 
-  class BelAstNodeToken < FFI::Struct
-    layout(
-      :type,      :bel_ast_node_type,
-      :ttype,     :bel_ast_token_type,
-      :left,      BelAstNode.ptr,
-      :right,     BelAstNode.ptr
-    )
+    class BelAstNodeToken < FFI::Struct
+      layout(
+        :type,      :bel_ast_node_type,
+        :ttype,     :bel_ast_token_type,
+        :left,      BelAstNode.ptr,
+        :right,     BelAstNode.ptr
+      )
 
-    def type
-      self[:type]
-    end
+      def type
+        self[:type]
+      end
 
-    def token_type
-      self[:ttype]
-    end
+      def token_type
+        self[:ttype]
+      end
 
-    def left
-      self[:left]
-    end
+      def left
+        self[:left]
+      end
 
-    def left=(left)
-      self[:left] = left
-    end
+      def left=(left)
+        self[:left] = left
+      end
 
-    def right
-      self[:right]
-    end
+      def right
+        self[:right]
+      end
 
-    def right=(right)
-      self[:right] = right
+      def right=(right)
+        self[:right] = right
+      end
     end
-  end
 
-  class BelAstNodeValue < FFI::Struct
-    layout(
-      :type,      :bel_ast_node_type,
-      :vtype,     :bel_ast_value_type,
-      :value,     :string
-    )
+    class BelAstNodeValue < FFI::Struct
+      layout(
+        :type,      :bel_ast_node_type,
+        :vtype,     :bel_ast_value_type,
+        :value,     :string
+      )
 
-    def type
-      self[:type]
-    end
+      def type
+        self[:type]
+      end
 
-    def value_type
-      self[:vtype]
-    end
+      def value_type
+        self[:vtype]
+      end
 
-    def value
-      self[:value]
+      def value
+        self[:value]
+      end
     end
-  end
 
-  class BelAst < FFI::ManagedStruct
-    include NodeTraversal
-    include NodeTransformation
-    include NodeTest
+    class BelAst < FFI::ManagedStruct
+      include NodeTraversal
+      include NodeTransformation
+      include NodeTest
 
-    layout(
-      :root,      BelAstNode.ptr
-    )
+      layout(
+        :root,      BelAstNode.ptr
+      )
 
-    def root
-      self[:root]
-    end
+      def root
+        self[:root]
+      end
 
-    def root=(root)
-      self[:root] = root
-    end
+      def root=(root)
+        self[:root] = root
+      end
 
-    # overrides {NodeTraversal#each_depth_first}
-    def each_depth_first(&block)
-      if block_given?
-        root.each_depth_first(&block)
-      else
-        root.enum_for(:each_depth_first)
+      # overrides {NodeTraversal#each_depth_first}
+      def each_depth_first(&block)
+        if block_given?
+          root.each_depth_first(&block)
+        else
+          root.enum_for(:each_depth_first)
+        end
       end
-    end
 
-    # overrides {NodeTraversal#each_breadth_first}
-    def each_breadth_first(queue = [], &block)
-      if block_given?
-        root.each_breadth_first(&block)
-      else
-        root.enum_for(:each_breadth_first)
+      # overrides {NodeTraversal#each_breadth_first}
+      def each_breadth_first(queue = [], &block)
+        if block_given?
+          root.each_breadth_first(&block)
+        else
+          root.enum_for(:each_breadth_first)
+        end
       end
-    end
 
-    def transform(transforms, options = {})
-      transform_tree(transforms, :depth_first, options)
-    end
+      def transform(transforms, options = {})
+        transform_tree(transforms, :depth_first, options)
+      end
 
-    def transform_tree(transforms, traversal = :depth_first, options = {})
-      copy_ast = LibBEL::copy_ast(self)
-      options = {
-        :mutate => true
-      }.merge(options)
+      def transform_tree(transforms, traversal = :depth_first, options = {})
+        copy_ast = LibBEL::copy_ast(self)
+        options = {
+          :mutate => true
+        }.merge(options)
 
-      copy_ast.root.transform_tree(transforms, traversal, options)
-      copy_ast
-    end
+        copy_ast.root.transform_tree(transforms, traversal, options)
+        copy_ast
+      end
 
-    def any?(predicates)
-      self.root.any_in_tree?(predicates)
-    end
+      def any?(predicates)
+        self.root.any_in_tree?(predicates)
+      end
 
-    def all?(predicates)
-      self.root.all_in_tree?(predicates)
-    end
+      def all?(predicates)
+        self.root.all_in_tree?(predicates)
+      end
 
-    def self.release(ptr)
-      if !ptr.null?
-        LibBEL::bel_free_ast(ptr)
+      def self.release(ptr)
+        if !ptr.null?
+          LibBEL::bel_free_ast(ptr)
+        end
       end
     end
-  end
 
-  private
+    private
 
-  def self.typed_node(bel_ast_node)
-    if bel_ast_node.type_info.type == :BEL_TOKEN
-      BelAstNodeToken.new(bel_ast_node.token)
-    else
-      BelAstNodeValue.new(bel_ast_node.value)
+    def self.typed_node(bel_ast_node)
+      if bel_ast_node.type_info.type == :BEL_TOKEN
+        BelAstNodeToken.new(bel_ast_node.token)
+      else
+        BelAstNodeValue.new(bel_ast_node.value)
+      end
     end
   end
 end

data/lib/bel/libbel/bel_token.rb

@@ -1,38 +1,40 @@
-module LibBEL
+module BEL
+  module LibBEL
 
-  class BelToken < FFI::Struct
+    class BelToken < FFI::Struct
 
-    layout :type,      :bel_token_type,
-           :pos_start, :int,
-           :pos_end,   :int,
-           :value,     :pointer
+      layout :type,      :bel_token_type,
+             :pos_start, :int,
+             :pos_end,   :int,
+             :value,     :pointer
 
-    def type
-      self[:type]
-    end
+      def type
+        self[:type]
+      end
 
-    def pos_start
-      self[:pos_start]
-    end
+      def pos_start
+        self[:pos_start]
+      end
 
-    def pos_end
-      self[:pos_end]
-    end
+      def pos_end
+        self[:pos_end]
+      end
 
-    def value
-      self[:value].read_string
-    end
+      def value
+        self[:value].read_string
+      end
 
-    def hash
-      [self.type, self.value, self.pos_start, self.pos_end].hash
-    end
+      def hash
+        [self.type, self.value, self.pos_start, self.pos_end].hash
+      end
 
-    def ==(other)
-      return false if other == nil
-      self.type == other.type && self.value == other.value &&
-        self.pos_start == other.pos_start && self.pos_end == other.pos_end
-    end
+      def ==(other)
+        return false if other == nil
+        self.type == other.type && self.value == other.value &&
+          self.pos_start == other.pos_start && self.pos_end == other.pos_end
+      end
 
-    alias_method :eql?, :'=='
+      alias_method :eql?, :'=='
+    end
   end
 end

data/lib/bel/libbel/bel_token_list.rb

@@ -1,36 +1,38 @@
-module LibBEL
+module BEL
+  module LibBEL
 
-  class BelTokenList < FFI::ManagedStruct
-    include Enumerable
+    class BelTokenList < FFI::ManagedStruct
+      include Enumerable
 
-    layout :length,    :int,
-           :tokens,    BelToken.ptr
+      layout :length,    :int,
+             :tokens,    BelToken.ptr
 
-    def each
-      if block_given?
-        iterator = LibBEL::bel_new_token_iterator(self.pointer)
-        while LibBEL::bel_token_iterator_end(iterator).zero?
-          current_token = LibBEL::bel_token_iterator_get(iterator)
-          yield LibBEL::BelToken.new(current_token)
-          LibBEL::bel_token_iterator_next(iterator)
+      def each
+        if block_given?
+          iterator = LibBEL::bel_new_token_iterator(self.pointer)
+          while LibBEL::bel_token_iterator_end(iterator).zero?
+            current_token = LibBEL::bel_token_iterator_get(iterator)
+            yield LibBEL::BelToken.new(current_token)
+            LibBEL::bel_token_iterator_next(iterator)
+          end
+          LibBEL::free_bel_token_iterator(iterator)
+        else
+          enum_for(:each)
         end
-        LibBEL::free_bel_token_iterator(iterator)
-      else
-        enum_for(:each)
       end
-    end
 
-    def token_at(position)
-      self.each_with_index { |tk, index|
-        if (tk.pos_start..tk.pos_end).include? position
-          return [tk, index]
-        end
-      }
-      nil
-    end
+      def token_at(position)
+        self.each_with_index { |tk, index|
+          if (tk.pos_start..tk.pos_end).include? position
+            return [tk, index]
+          end
+        }
+        nil
+      end
 
-    def self.release(ptr)
-      LibBEL::free_bel_token_list(ptr)
+      def self.release(ptr)
+        LibBEL::free_bel_token_list(ptr)
+      end
     end
   end
 end