Sha256: 81f47baaad38a1ba628075471f78b1200dd0d1a9ea7f031501e44d85b321c691
Contents?: true
Size: 1.9 KB
Versions: 5
Compression:
Stored size: 1.9 KB
Contents
module NestedHelper
def nested_li(objects, &block)
objects = objects.order(:lft) if objects.is_a? Class
return '' if objects.size == 0
output = "<ul><li #{'class=active' if is_active_page?(objects.first)}>"
path = [nil]
objects.each_with_index do |o, i|
if o.parent_id != path.last
# We are on a new level, did we descend or ascend?
if path.include?(o.parent_id)
# Remove the wrong trailing path elements
while path.last != o.parent_id
path.pop
output << '</li></ul>'
end
output << "</li><li #{'class=active' if is_active_page?(o)}>"
else
path << o.parent_id
output << "<ul><li #{'class=active' if is_active_page?(o)}>"
end
elsif i != 0
output << "</li><li #{'class=active' if is_active_page?(o)}>"
end
output << capture(o, path.size - 1, &block)
end
output << '</li></ul>' * path.length
output.html_safe
end
def sorted_nested_li(objects, order, &block)
nested_li sort_list(objects, order), &block
end
private
def is_active_page?(page)
return unless current_page
current_page.is_or_is_descendant_of?(page)
end
def sort_list(objects, order)
objects = objects.order(:lft) if objects.is_a? Class
# Partition the results
children_of = {}
objects.each do |o|
children_of[ o.parent_id ] ||= []
children_of[ o.parent_id ] << o
end
# Sort each sub-list individually
children_of.each_value do |children|
children.sort_by! &order
end
# Re-join them into a single list
results = []
recombine_lists(results, children_of, nil)
results
end
def recombine_lists(results, children_of, parent_id)
if children_of[parent_id]
children_of[parent_id].each do |o|
results << o
recombine_lists(results, children_of, o.id)
end
end
end
end
Version data entries
5 entries across 5 versions & 1 rubygems