|
| 1 | +# fixtures_shared.rb - This file is part of the RubyTree package. |
| 2 | +# |
| 3 | +# Copyright (c) 2026 Anupam Sengupta. All rights reserved. |
| 4 | +# |
| 5 | +# Redistribution and use in source and binary forms, with or without modification, |
| 6 | +# are permitted provided that the following conditions are met: |
| 7 | +# |
| 8 | +# - Redistributions of source code must retain the above copyright notice, this |
| 9 | +# list of conditions and the following disclaimer. |
| 10 | +# |
| 11 | +# - Redistributions in binary form must reproduce the above copyright notice, this |
| 12 | +# list of conditions and the following disclaimer in the documentation and/or |
| 13 | +# other materials provided with the distribution. |
| 14 | +# |
| 15 | +# - Neither the name of the organization nor the names of its contributors may |
| 16 | +# be used to endorse or promote products derived from this software without |
| 17 | +# specific prior written permission. |
| 18 | +# |
| 19 | +# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| 20 | +# AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 21 | +# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
| 22 | +# DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR |
| 23 | +# ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
| 24 | +# (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
| 25 | +# LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON |
| 26 | +# ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 27 | +# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
| 28 | +# SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 29 | +# |
| 30 | +# frozen_string_literal: true |
| 31 | + |
| 32 | +module TreeTestFixtures |
| 33 | + def build_basic_tree_nodes |
| 34 | + root = Tree::TreeNode.new('ROOT', 'Root Node') |
| 35 | + child1 = Tree::TreeNode.new('Child1', 'Child Node 1') |
| 36 | + child2 = Tree::TreeNode.new('Child2', 'Child Node 2') |
| 37 | + child3 = Tree::TreeNode.new('Child3', 'Child Node 3') |
| 38 | + child4 = Tree::TreeNode.new('Child4', 'Grand Child 1') |
| 39 | + child5 = Tree::TreeNode.new('Child5', 'Child Node 4') |
| 40 | + |
| 41 | + { |
| 42 | + root: root, |
| 43 | + child1: child1, |
| 44 | + child2: child2, |
| 45 | + child3: child3, |
| 46 | + child4: child4, |
| 47 | + child5: child5 |
| 48 | + } |
| 49 | + end |
| 50 | + |
| 51 | + def attach_basic_tree(nodes) |
| 52 | + nodes[:root] << nodes[:child1] |
| 53 | + nodes[:root] << nodes[:child2] |
| 54 | + nodes[:root] << nodes[:child3] << nodes[:child4] |
| 55 | + nodes |
| 56 | + end |
| 57 | + |
| 58 | + def build_basic_tree |
| 59 | + attach_basic_tree(build_basic_tree_nodes) |
| 60 | + end |
| 61 | + |
| 62 | + def build_binary_tree_nodes |
| 63 | + root = Tree::BinaryTreeNode.new('ROOT', 'Root Node') |
| 64 | + left_child1 = Tree::BinaryTreeNode.new('A Child at Left', 'Child Node @ left') |
| 65 | + right_child1 = Tree::BinaryTreeNode.new('B Child at Right', 'Child Node @ right') |
| 66 | + |
| 67 | + { |
| 68 | + root: root, |
| 69 | + left_child1: left_child1, |
| 70 | + right_child1: right_child1 |
| 71 | + } |
| 72 | + end |
| 73 | +end |
0 commit comments