Karavel/fixin.me
0
0
Fork 0
forked from fixin.me/fixin.me
Code Pull Requests Activity

Cleanup of hierarchy related methods

Browse Source
This commit is contained in:
cryptogopher 2025-01-15 14:45:15 +01:00
parent cb69629276
commit 30686dd1fc
1 changed files with 7 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

26
app/models/quantity.rb
View File

@ -73,13 +73,12 @@ class Quantity < ApplicationRecord
parent_id.nil? parent_id.nil?
end end
# Return: successive record in order of appearance, including :depth # Return: successive record in order of appearance; used for partial view reload
# attribute. Used for partial view reload.
def successive def successive
quantities = Quantity.arel_table quantities = Quantity.arel_table
Quantity.with( Quantity.with(
quantities: user.quantities.ordered.select( quantities: user.quantities.ordered.select(
quantities[Arel.star],
Arel::Nodes::NamedFunction.new('LAG', [quantities[:id]]).over.as('lag_id') Arel::Nodes::NamedFunction.new('LAG', [quantities[:id]]).over.as('lag_id')
) )
).where(quantities[:lag_id].eq(id)).first ).where(quantities[:lag_id].eq(id)).first
@ -89,17 +88,13 @@ class Quantity < ApplicationRecord
user.quantities.ordered(root: self).to_a user.quantities.ordered(root: self).to_a
end end
def progenies # Return: record with ID `of` with its ancestors, sorted by `depth`
user.quantities.progenies(self).to_a
end
# Return: record `of` with its ancestors, sorted by `depth`
scope :with_ancestors, ->(of) { scope :with_ancestors, ->(of) {
selected = Arel::Table.new('selected') selected = Arel::Table.new('selected')
model.with(selected: self).with_recursive(arel_table.name => [ model.with(selected: self).with_recursive(arel_table.name => [
selected.project(selected[Arel.star], Arel::Nodes.build_quoted(0).as('depth')) selected.project(selected[Arel.star], Arel::Nodes.build_quoted(0).as('depth'))
.where(selected[:id].eq(of&.id)), .where(selected[:id].eq(of)),
# Ancestors are listed bottom up, so it's impossible to know depth at the # Ancestors are listed bottom up, so it's impossible to know depth at the
# start. Start with depth = 0 and count downwards, then adjust by the # start. Start with depth = 0 and count downwards, then adjust by the
# amount needed to set biggest negative depth to 0. # amount needed to set biggest negative depth to 0.
@ -114,17 +109,10 @@ class Quantity < ApplicationRecord
# Return: ancestors of (possibly destroyed) self # Return: ancestors of (possibly destroyed) self
def ancestors def ancestors
user.quantities.with_ancestors(parent) user.quantities.with_ancestors(parent_id).order(:depth).to_a
end end
def ancestor_of?(descendant) def ancestor_of?(progeny)
quantities = Quantity.arel_table user.quantities.with_ancestors(progeny.id).exists?(id)
ancestors = Arel::Table.new('ancestors')
Quantity.with_recursive(ancestors: [
user.quantities.where(id: descendant.id),
user.quantities.joins(quantities.create_join(
ancestors, quantities.create_on(quantities[:id].eq(ancestors[:parent_id]))
))
]).from(ancestors).exists?(ancestors: {id: id})
end end
end end