mementus 0.2.3 → 0.2.4

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 92652ba97da7674692fac49d6ea139aeb9c680d5
-  data.tar.gz: 5ea49d59abd929eb237956e2dea519e1300e94c6
+  metadata.gz: 9008afd3cf8e01e46d74afdb9ba4421ba5fa6576
+  data.tar.gz: 3a23ffd82033bad559238dd80ec316efb86feb60
 SHA512:
-  metadata.gz: 6bf3f09c02410fbc0070d40d0016d5161f57cecf975a660ccedebcb0d10fdebdf11e01cf63e350d1fc9d33fface9ebc81d9b64002dba5911221d4dd1a6f2b3c5
-  data.tar.gz: c36019eb7529244bf07b4f5c1654c87e5d55c6e675e16bd82fcdce6fccb12a328d78595170b3dc698b4a41a37967c4b437c0d19c945a0bba5e3b3d0c50cb5589
+  metadata.gz: a51672c818d3883aeecf5a599e8b33c6f5f342e8434345e3c93d60749a591781b8557dd640c3e74b98abb222702dd6a2a28ade00702f452f723f7144be3fb9a6
+  data.tar.gz: c35706222b866937ad4439a762df37969cd800bae904f91751c6eb2b557c293cdd2085676e53a4dee70ca667b09b5086244af3e05b84dea4db0daa9258b29c87

data/lib/mementus/query/source.rb

@@ -0,0 +1,13 @@
+module Mementus
+  module Query
+    class Source
+      def initialize(graph)
+        @traversal = Traversal.new(graph)
+      end
+
+      def node(id)
+        @traversal.add_step(Step.new(@traversal, id))
+      end
+    end
+  end
+end

data/lib/mementus/query/step.rb

@@ -0,0 +1,13 @@
+module Mementus
+  module Query
+    class Step
+      def initialize(traversal, id)
+        @node = NodeProxy.new(traversal.graph.node(id), traversal.graph)
+      end
+
+      def to_node
+        @node
+      end
+    end
+  end
+end

data/lib/mementus/query/traversal.rb

@@ -0,0 +1,25 @@
+module Mementus
+  module Query
+    class Traversal
+      attr_reader :graph
+
+      def initialize(graph)
+        @graph = graph
+        @steps = []
+      end
+
+      def add_step(step)
+        @steps << step
+        self
+      end
+
+      def adjacent
+        @steps.last.to_node.adjacent
+      end
+
+      def id
+        @steps.last.to_node.id
+      end
+    end
+  end
+end

data/lib/mementus/version.rb

@@ -1,3 +1,3 @@
 module Mementus
-  VERSION = '0.2.3'.freeze
+  VERSION = '0.2.4'.freeze
 end

data/lib/mementus.rb

@@ -4,3 +4,6 @@ require_relative 'mementus/edge'
 require_relative 'mementus/node_proxy'
 require_relative 'mementus/depth_first_search'
 require_relative 'mementus/breadth_first_search'
+require_relative 'mementus/query/source'
+require_relative 'mementus/query/step'
+require_relative 'mementus/query/traversal'

data/spec/query_spec.rb

@@ -0,0 +1,17 @@
+require 'spec_helper'
+
+describe Mementus::Query do
+  let(:query) do
+    graph = Mementus::Graph.new
+    graph.add_edge(Mementus::Edge.new(Mementus::Node.new(1, :node), Mementus::Node.new(2, :node)))
+    Mementus::Query::Source.new(graph)
+  end
+
+  specify '#node' do
+    expect(query.node(1).id).to eq(1)
+  end
+
+  specify '#node#adjacent' do
+    expect(query.node(1).adjacent.first.id).to eq(2)
+  end
+end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: mementus
 version: !ruby/object:Gem::Version
-  version: 0.2.3
+  version: 0.2.4
 platform: ruby
 authors:
 - maetl
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2016-04-11 00:00:00.000000000 Z
+date: 2016-04-13 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -70,14 +70,17 @@ files:
 - lib/mementus/depth_first_search.rb
 - lib/mementus/edge.rb
 - lib/mementus/graph.rb
-- lib/mementus/model.rb
 - lib/mementus/node.rb
 - lib/mementus/node_proxy.rb
+- lib/mementus/query/source.rb
+- lib/mementus/query/step.rb
+- lib/mementus/query/traversal.rb
 - lib/mementus/relation.rb
 - lib/mementus/version.rb
 - mementus.gemspec
 - spec/graph_spec.rb
 - spec/node_proxy_spec.rb
+- spec/query_spec.rb
 - spec/spec_helper.rb
 - spec/traversal_spec.rb
 homepage: https://github.com/maetl/mementus
@@ -107,6 +110,7 @@ summary: In-memory data model
 test_files:
 - spec/graph_spec.rb
 - spec/node_proxy_spec.rb
+- spec/query_spec.rb
 - spec/spec_helper.rb
 - spec/traversal_spec.rb
 has_rdoc: 

data/lib/mementus/model.rb

@@ -1,120 +0,0 @@
-require 'virtus'
-require 'axiom-memory-adapter'
- 
-module Mementus
- 
-  # Proof of concept for a toy ORM that combines some aspects of the
-  # ActiveRecord API with an in-memory query model based on the Axiom
-  # relational algebra API.
-  #
-  class Model
-
-    def self.inherited(concrete_model)
-      concrete_model.send(:include, Virtus.model)
-      concrete_model.send(:extend, Relation::ClassMethods)
-    end
-
-    @@local_storage = nil
-    @@model_registry = {}
- 
-    def self.name_to_sym  
-      name_without_namespace = name.split("::").last
-      name_without_namespace.gsub(/([^\^])([A-Z])/,'\1_\2').downcase.to_sym
-    end
-
-    # Unique cache identifier for this instance
-    #
-    def cache_key
-      "#{self.class.name_to_sym.to_s}-#{object_id.to_s}"
-    end
- 
-    # TODO: this mapping could be based on declared indexes,
-    # rather than dumping the entire attribute schema here.
-    #
-    def schema_tuple
-      tuple = [[:__cache_key, String]]
-      attribute_set.each do |attribute_type|
-        tuple << [attribute_type.name.to_sym, attribute_type.primitive]
-      end
-      tuple
-    end
- 
-    # TODO: this mapping could be based on declared indexes,
-    # rather than dumping the entire attribute data set here.
-    #
-    def values_tuple
-      tuple = [cache_key]
-      attributes.each do |_, attribute_value|
-        tuple << attribute_value
-      end
-      tuple
-    end
- 
-    # Create only writes to memory. It's required in order to
-    # index the object's attributes in the query model.
-    #
-    def create
-      ensure_registered(self)
-      local_storage[self.class.name_to_sym].insert([values_tuple])
-      self.class.cache_put(self.cache_key, self)
-    end
- 
-    def ensure_registered(model)
-      register(model) unless registered?(model)
-    end
- 
-    def registered?(model)
-      model_registry.has_key? model.class.name_to_sym
-    end
- 
-    def register(model)
-      model_id = model.class.name_to_sym
-      model_registry[model_id] = true
-      local_storage[model_id] = Axiom::Relation.new(model.schema_tuple)
-    end
- 
-    def model_registry
-      @@model_registry
-    end
- 
-    def local_storage
-      @@local_storage ||= Axiom::Adapter::Memory.new
-    end
- 
-    def self.collection
-      @@local_storage ||= Axiom::Adapter::Memory.new
-
-      if @@local_storage.has_key?(name_to_sym)
-        @@local_storage[name_to_sym]
-      else
-        Axiom::Relation.new(self.new.schema_tuple)
-      end
-    end
-
-    # TODO: fix incomplete scope chaining
-    def self.scope(name, conditions)
-      if conditions.is_a? Hash
-        scope_method = lambda { self.where(conditions) }
-      elsif conditions.is_a? Proc
-        scope_method = conditions
-      end
-
-      define_singleton_method(name, &scope_method)
-    end
-
-    private
-
-    def self.cache
-      @@cache ||= {}
-    end
-
-    def self.cache_put(cache_key, object)
-      self.cache[cache_key] = object
-    end
-
-    def self.cache_get(cache_key)
-      self.cache[cache_key]
-    end
- 
-  end
-end