All checks were successful
		
		
	
	Check usage of free licenses / check-licenses (pull_request) Successful in 1m38s
				
			Add copyright notice / copyright_notice (pull_request) Successful in 3m16s
				
			Run unit tests / unit_tests (pull_request) Successful in 5m31s
				
			Build Nginx-based docker image / build-static-assets (pull_request) Successful in 41m31s
				
			
		
			
				
	
	
		
			23 lines
		
	
	
		
			583 B
		
	
	
	
		
			Ruby
		
	
	
	
	
	
			
		
		
	
	
			23 lines
		
	
	
		
			583 B
		
	
	
	
		
			Ruby
		
	
	
	
	
	
# Copyright (C) 2024-2025 LibreWeddingPlanner contributors
 | 
						|
 | 
						|
# frozen_string_literal: true
 | 
						|
 | 
						|
module TreeNodeExtension
 | 
						|
  def distance_to_common_ancestor(another_node)
 | 
						|
    return 0 if self == another_node
 | 
						|
 | 
						|
    my_path = path_as_array
 | 
						|
    another_path = another_node.path_as_array
 | 
						|
 | 
						|
    common_elements = my_path.zip(another_path)
 | 
						|
                             .take_while { |(p1, p2)| p1 == p2 }
 | 
						|
                             .count
 | 
						|
 | 
						|
    return nil if common_elements.zero?
 | 
						|
 | 
						|
    [my_path.count, another_path.count].max - common_elements
 | 
						|
  end
 | 
						|
end
 | 
						|
 | 
						|
Tree::TreeNode.include(TreeNodeExtension)
 |