solidus_categories 1.2 → 2.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: b5abc71aa2fa7491ab6e29530c071c24ba481b26
-  data.tar.gz: 0c61ddfc642b77c14abdef7b3b85b5f852ce4452
+  metadata.gz: 51313054558eb1051cc1be7536e7fe0954fc21fc
+  data.tar.gz: 33d3ac6570eb4f8b9bc74a79b42860d2529e8df0
 SHA512:
-  metadata.gz: fe56859ade9f6035cba97542336dcc4d53e3edc9435ebd2bb5c5646ce64902e6d2270ad1c3b1cd6a65e05279dd2cff6d39d30072416633bfba317b12462078c1
-  data.tar.gz: 60de63906e1ecb4f9d6c39784422c408ba46ca0bba06edcf8f03f601fb9017ffc04ca6a860cbfe5cdac28a6cfbf71c8ac63d2c0c15fc0d6a60ed19d6636b3d8e
+  metadata.gz: 11347b2d0a2f50949adeb03ee00d01f2fe4b608d7455982ec6ef4884a0baa3e47df22197de4b548bbd5330f586efa24226d42d69bfd7873e6f8c902cf0f84023
+  data.tar.gz: 7806e645e7f63e41918571787a4d01cd0777adb6f72af7ca0a39d6328a5d7bbdecd62736315c4ff8ae1ebb13b4ea387a2d89ce0b3d6062214971d724d98ccde8

data/.bundle/config

@@ -0,0 +1 @@
+--- {}

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in catalogs.gemspec
+gemspec

data/Gemfile.lock

@@ -0,0 +1,20 @@
+PATH
+  remote: .
+  specs:
+    solidus_categories (0.1.2)
+
+GEM
+  remote: https://rubygems.org/
+  specs:
+    rake (10.4.2)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  bundler (~> 1.12)
+  rake (~> 10.0)
+  solidus_categories!
+
+BUNDLED WITH
+   1.12.2

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2016 kchiru
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

data/README.md

@@ -0,0 +1,45 @@
+# Solidus Categories
+
+Welcome to your new gem! In this directory, you'll find the files you need to be able to package up your Ruby library into a gem. Put your Ruby code in the file `lib/Solidus Categories`. To experiment with that code, run `bin/console` for an interactive prompt.
+
+TODO: Delete this and the text above, and describe your gem
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'solidus_categories' , :github => 'prasanthiym/solidus_categories'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install solidus_categories
+
+
+## Usage
+
+Install gem intializers
+  
+bundle exec rails g solidus_categories:install
+
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
+
+To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/[USERNAME]/solidus_categories. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [Contributor Covenant](http://contributor-covenant.org) code of conduct.
+
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](http://opensource.org/licenses/MIT).
+

data/Rakefile

@@ -0,0 +1,2 @@
+require "bundler/gem_tasks"
+task :default => :spec

data/app/decorators/spree/admin/properties_controller_decorator.rb

@@ -0,0 +1,61 @@
+ Spree::Admin::PropertiesController.class_eval do
+ include TheSortableTreeController::Rebuild
+  
+   def index
+    if params[:q].present?
+      @properties = Spree::Property.where("name LIKE ?","%#{params[:q][:name_cont]}%").nested_set.select('id, name,  parent_id').limit(15)
+    else
+      @properties = Spree::Property.nested_set.select('id, name,  parent_id').limit(15)
+    end
+  end
+  
+  def new
+    
+  end
+  
+  def create
+   
+    @property = Spree::Property.new(property_params)
+    if @property.save
+      flash[:message] = "Property Successfully Saved"
+      redirect_to admin_properties_url
+    else
+      render :action => "new"
+    end
+  end
+  
+  def show
+  
+  end
+  def manage
+    @properties = Spree::Property.nested_set.select('id, name,  parent_id').limit(15)
+  end
+
+  def nested_options
+    @properties = Spree::Property.nested_set.select('id, name,  parent_id').limit(15)
+  end
+
+  def node_manage
+    @root  = Spree::Property.root
+    @properties = @root.self_and_descendants.nested_set.select('id, name,  parent_id').limit(15)
+    render template: 'spree/properties/manage'
+  end
+
+  protected 
+
+  def sortable_model
+    Spree::Property
+  end
+
+  def sortable_collection
+    'properties'
+  end
+
+  private
+   
+    def property_params
+      params.require(:property).permit(:name,:presentation,:positition,:lft,:depth,:rgt,:parent_id)
+    end
+  
+  
+ end

data/app/helpers/render_nested_options_helper.rb

@@ -0,0 +1,23 @@
+module RenderNestedOptionsHelper
+  class Render
+    class << self
+      attr_accessor :h, :options
+
+      def render_node(h, options)
+        @h, @options = h, options
+
+        node = options[:node]
+
+        this_node      = options[:selected] == node
+        selected_class = this_node ? ' selected' : nil
+        selected       = this_node ? " selected='selected'" : nil
+
+        "
+        <option value='#{node[:id]}' class='l_#{ options[:level] }#{selected_class}' #{selected}>#{ node[:name] }</option>
+        #{ options[:children] }
+        "
+      end
+
+    end
+  end
+end

data/app/helpers/render_sortable_tree_helper.rb

@@ -0,0 +1,62 @@
+# DOC:
+# We use Helper Methods for tree building,
+# because it's faster than View Templates and Partials
+
+# SECURITY note
+# Prepare your data on server side for rendering
+# or use h.html_escape(node.content)
+# for escape potentially dangerous content
+module RenderSortableTreeHelper
+  module Render 
+    class << self
+      attr_accessor :h, :options
+
+      def render_node(h, options)
+        @h, @options = h, options
+        node = options[:node]
+
+        "
+          <li data-node-id='#{ node.id }'>
+            <div class='item'>
+              <i class='handle'></i>
+              #{ show_link }
+              #{ controls }
+            </div>
+            #{ children }
+          </li>
+        "
+      end
+
+      def show_link
+        node = options[:node]
+        ns   = options[:namespace]
+        url = h.url_for(:controller => 'admin/properties', :action => :show, :id => node)
+       #  url = h.url_for(ns + [node])
+        title_field = node[:name]
+        #p options
+        "<h4>#{ h.link_to(title_field, url) }</h4>"
+      end
+
+      def controls
+        node = options[:node]
+
+        edit_path = h.url_for(:controller => 'admin/properties', :action => :edit, :id => node)
+        destroy_path = h.url_for(:controller => 'admin/properties', :action => :destroy, :id => node)
+
+        "
+          <div class='controls'>
+            #{ h.link_to '', edit_path, :class => :edit }
+            #{ h.link_to '', destroy_path, :class => :delete, :method => :delete, :data => { :confirm => 'Are you sure?' } }
+          </div>
+        "
+      end
+
+      def children
+        unless options[:children].blank?
+          "<ol class='nested_set'>#{ options[:children] }</ol>"
+        end
+      end
+
+    end
+  end
+end

data/app/helpers/render_tree_helper.rb

@@ -0,0 +1,45 @@
+# DOC:
+# We use Helper Methods for tree building,
+# because it's faster than View Templates and Partials
+
+# SECURITY note
+# Prepare your data on server side for rendering
+# or use h.html_escape(node.content)
+# for escape potentially dangerous content
+module RenderTreeHelper
+  class Render
+    class << self
+      attr_accessor :h, :options
+
+      def render_node(h, options)
+        @h, @options = h, options
+
+        node = options[:node]
+        "
+          <li>
+            <div class='item'>
+              #{ show_link }
+            </div>
+            #{ children }
+          </li>
+        "
+      end
+
+      def show_link
+        node = options[:node]
+        ns   = options[:namespace]
+        url  = h.url_for(ns + [node])
+        title_field = node[:name]
+
+        "<h4>#{ h.link_to(title_field, url) }</h4>"
+      end
+
+      def children
+        unless options[:children].blank?
+          "<ol>#{ options[:children] }</ol>"
+        end
+      end
+
+    end
+  end
+end

data/app/helpers/the_sortable_tree_helper.rb

@@ -0,0 +1,146 @@
+module TheSortableTreeHelper
+  # Publicated by MIT
+  # Nested Set View Helper
+
+  # Ilya Zykin, zykin-ilya@ya.ru, Russia [Ivanovo, Saint Petersburg] 2009-2014
+  # github.com/the-teacher
+
+  # Default renderers
+  TREE_RENDERERS = {
+    :tree     => RenderTreeHelper,
+    :sortable => RenderSortableTreeHelper,
+    :expandable => RenderExpandableTreeHelper,
+    :nested_options => RenderNestedOptionsHelper
+  }
+
+  ###############################################
+  # Common Base Methods
+  ###############################################
+
+  def define_class_of_elements_of tree
+    case
+      when tree.is_a?(ActiveRecord::Relation) then tree.name.to_s.underscore.downcase
+      when tree.empty?                        then nil
+      else tree.first.class.to_s.underscore.downcase
+    end
+  end
+
+  def build_tree_html context, render_module, options = {}
+    render_module::Render::render_node(self, options)
+  end
+
+  ###############################################
+  # Shortcuts
+  ###############################################
+  
+  def just_tree tree, options = {}
+    build_server_tree(tree, { :type => :tree }.merge!(options))
+  end
+
+  def sortable_tree tree, options = {}
+    build_server_tree(tree, { :type => :sortable }.merge!(options))
+  end
+
+  def nested_options tree, options = {}
+    build_server_tree(tree, { :type => :nested_options }.merge!(options))
+  end
+
+  def expandable_tree tree, options = {}
+    build_server_tree(tree, { :type => :expandable }.merge!(options))
+  end
+
+  ###############################################
+  # Server Side Render Tree Helper
+  ###############################################
+
+  def build_server_tree(tree, options= {})
+    result = ''
+    tree   = Array.wrap tree
+    opts   = {
+      # node and base node params
+      :id    => :id,      # node id field
+      :title => :title,   # name of title fileld
+      :node  => nil,      # node
+
+      # base options
+      :type  => :tree,    # tree type
+      :root  => false,    # is it root node?
+      :level => 0,        # recursion level
+      :namespace => [],   # :admin
+
+      # BOOST! hash
+      :boost => {} 
+    }.merge!(options)
+
+    # Basic vars
+    root = opts[:root]
+    node = opts[:node]
+
+    # namespace prepare [Rails require]
+    opts[:namespace] = Array.wrap opts[:namespace]
+
+    # Module with **Render** class
+    opts[:render_module] = TREE_RENDERERS[opts[:type]] unless opts[:render_module]
+
+    # Define tree class
+    opts[:klass] = define_class_of_elements_of(tree) unless opts[:klass]
+
+    # BOOST PATCH (BUILD ONCE)
+    # solution of main perfomance problem
+    # magick index-hash, which made me happy!
+
+    # Performance comparison
+    # Boost OFF: 8000 nodes, 3 levels => (Views: 176281.9ms | ActiveRecord: 189.8ms)
+    # Boost  ON: 8000 nodes, 3 levels => (Views: 8987.8ms   | ActiveRecord: 141.6ms)
+
+    if opts[:boost].empty?
+      tree.each do |item|
+        num = item.parent_id || 0
+        opts[:boost][num.to_s] = [] unless opts[:boost][num.to_s]
+        opts[:boost][num.to_s].push item
+      end
+    end
+
+    unless node
+      # RENDER ROOTS
+      roots = opts[:boost]['0']
+
+      # Boost OFF
+      # roots = tree.select{ |node| node.parent_id.blank? }
+
+      # define roots, if it's need
+      if roots.nil? && !tree.empty?
+        min_parent_id = tree.map(&:parent_id).compact.min
+        roots = tree.select{ |elem| elem.parent_id == min_parent_id }
+      end
+
+      # children rendering
+      if roots
+        roots.each do |root|
+          _opts  =  opts.merge({ :node => root, :root => true, :level => opts[:level].next, :boost => opts[:boost] })
+          result << build_server_tree(tree, _opts)
+        end
+      end
+    else
+      # RENDER NODE'S CHILDREN
+      children_res = ''
+      children = opts[:boost][node.id.to_s]
+
+      # Boost OFF
+      # children = tree.select{ |_node| _node.parent_id == node.id } 
+
+      opts.merge!({ :has_children => children.blank? })
+
+      unless children.nil?
+        children.each do |elem|
+          _opts        =  opts.merge({ :node => elem, :root => false, :level => opts[:level].next, :boost => opts[:boost] })
+          children_res << build_server_tree(tree, _opts)
+        end
+      end
+
+      result << build_tree_html(self, opts[:render_module], opts.merge({ :root => root, :node => node, :children => children_res }))
+    end
+
+    raw result
+  end
+end