Skip to content

Conversation

@kevinherron
Copy link
Contributor

Provides an alternative to AddressSpaceComposite when routing decisions can be made directly from NodeId, enabling HashMap-based O(1) lookups instead of O(n) filter iteration.

Provides an alternative to AddressSpaceComposite when routing decisions
can be made directly from NodeId, enabling HashMap-based O(1) lookups
instead of O(n) filter iteration.
Copy link
Contributor

Copilot AI left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Pull request overview

This PR adds a new SimpleAddressSpaceComposite class that provides an alternative to AddressSpaceComposite for scenarios where address space routing decisions can be made directly from a NodeId, enabling HashMap-based O(1) lookups instead of O(n) filter iteration.

Changes:

  • Adds SimpleAddressSpaceComposite abstract class that delegates routing to subclasses via getAddressSpace(NodeId)
  • Implements all AddressSpaceFragment methods with efficient routing
  • Includes comprehensive documentation with usage examples

💡 Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.

…/server/SimpleAddressSpaceComposite.java

Co-authored-by: Copilot <175728472+Copilot@users.noreply.github.com>
Copy link
Contributor

Copilot AI commented Jan 30, 2026

@kevinherron I've opened a new pull request, #1701, to work on those changes. Once the pull request is ready, I'll request review from you.

* Initial plan

* Add copyright header to SimpleAddressSpaceComposite

Co-authored-by: kevinherron <340273+kevinherron@users.noreply.github.com>

---------

Co-authored-by: copilot-swe-agent[bot] <198982749+Copilot@users.noreply.github.com>
Co-authored-by: kevinherron <340273+kevinherron@users.noreply.github.com>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants