philiprehberger-tree 0.6.0 → 0.7.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 91e5be36f41a4f8a272b17d0c3a35d8a6419f4f6db9ec574c6a8d5d7abd106c8
-  data.tar.gz: bdb14a71fcef1e89d4e68735256365332ab9c3df367de379de3e95c9088f94df
+  metadata.gz: 18d116458c7316353a7876c8553cc05016b24e0abd7ebc30317c51919c75434a
+  data.tar.gz: 580e5b3c1ab53950728e43be7118d577b8cfd7a42c6849f46cfd95e856ff7a9f
 SHA512:
-  metadata.gz: e85b4c064ac1c83bc3806451e4cf5a7a3cb95202f810416f8e7bb2d139a362e2738d799dd96ebea3d31e79132a69e42d8eb18254bb048501cacb94d415c2e3b2
-  data.tar.gz: 657c5e461fdf233a38c6e888e251618ced0319edf6e354aeec164defd613f949a649e35176137591486ce56ab6d1d0a3a4c60575d5f9d72ea67ddfcf42e07e7c
+  metadata.gz: fb2b4327188f7a3ac49ed51f40d6c8d85e935a62b12af38abe911274c7fd21ff7bd47b228a8bf23cfb80570620a1d5b67d2d202a58208d6c97af2b0bb1c91325
+  data.tar.gz: aa48e67482c08f87b69ad2b321a796f33fe59931bcb2c6726c17b82a5a6149ff3e6910fdfae0e817c6413409555de7ea6551500f2163151aaa5438abcf020e0e

data/CHANGELOG.md

@@ -7,6 +7,13 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 ## [Unreleased]
 
+## [0.7.0] - 2026-04-26
+
+### Added
+- `Node#siblings` returns sibling nodes (children of the same parent, excluding self); empty array for root
+- `Node#next_sibling` returns the next sibling in the parent's child order, or nil if last child or no parent
+- `Node#prev_sibling` returns the previous sibling in the parent's child order, or nil if first child or no parent
+
 ## [0.6.0] - 2026-04-17
 
 ### Added
@@ -83,6 +90,7 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 - Visual tree printing via `print_tree`
 - Add and remove child operations
 
+[0.7.0]: https://github.com/philiprehberger/rb-tree/releases/tag/v0.7.0
 [0.6.0]: https://github.com/philiprehberger/rb-tree/releases/tag/v0.6.0
 [0.5.0]: https://github.com/philiprehberger/rb-tree/releases/tag/v0.5.0
 [0.4.0]: https://github.com/philiprehberger/rb-tree/releases/tag/v0.4.0

data/README.md

@@ -135,6 +135,19 @@ grandchild.ancestors.map(&:value)  # => ['child', 'root']
 child.siblings.map(&:value)        # => ['other_child']
 ```
 
+### Sibling Navigation
+
+```ruby
+a = root.add_child('a')
+b = root.add_child('b')
+c = root.add_child('c')
+
+b.next_sibling.value  # => 'c'
+b.prev_sibling.value  # => 'a'
+a.prev_sibling        # => nil (first child)
+c.next_sibling        # => nil (last child)
+```
+
 ### Leaf Collection
 
 ```ruby
@@ -194,6 +207,8 @@ root.prune(max_depth: 2).flatten
 | `#==` | Structural equality comparison |
 | `#ancestors` | Array of ancestors from parent to root |
 | `#siblings` | Sibling nodes excluding self |
+| `#next_sibling` | Next sibling in parent's child order, or nil |
+| `#prev_sibling` | Previous sibling in parent's child order, or nil |
 | `#map { \|value\| }` | New tree with transformed values |
 | `#flatten` | All values as flat array (DFS pre-order) |
 | `#each_with_depth` | Iterate yielding node and depth level |

data/lib/philiprehberger/tree/node.rb

@@ -198,6 +198,30 @@ module Philiprehberger
         @parent.children.reject { |c| c.equal?(self) }
       end
 
+      # Return the next sibling in the parent's child order.
+      #
+      # @return [Node, nil] the next sibling, or nil if this is the last child or has no parent
+      def next_sibling
+        return nil unless @parent
+
+        index = @parent.children.index { |c| c.equal?(self) }
+        return nil unless index
+
+        @parent.children[index + 1]
+      end
+
+      # Return the previous sibling in the parent's child order.
+      #
+      # @return [Node, nil] the previous sibling, or nil if this is the first child or has no parent
+      def prev_sibling
+        return nil unless @parent
+
+        index = @parent.children.index { |c| c.equal?(self) }
+        return nil if index.nil? || index.zero?
+
+        @parent.children[index - 1]
+      end
+
       # Find the first node matching the block.
       #
       # @yield [Node] predicate block

data/lib/philiprehberger/tree/version.rb

@@ -2,6 +2,6 @@
 
 module Philiprehberger
   module Tree
-    VERSION = '0.6.0'
+    VERSION = '0.7.0'
   end
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: philiprehberger-tree
 version: !ruby/object:Gem::Version
-  version: 0.6.0
+  version: 0.7.0
 platform: ruby
 authors:
 - Philip Rehberger
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2026-04-17 00:00:00.000000000 Z
+date: 2026-04-27 00:00:00.000000000 Z
 dependencies: []
 description: A generic tree data structure supporting depth-first and breadth-first
   traversal, node search, path finding, and hash serialization. Each node tracks its