Implement efficient MessageQueue for improved performance

[HoberMin]

Description

This PR implements a new MessageQueue class to improve the performance of message handling in the InMemoryTransport. The implementation uses an efficient index-based approach instead of array operations.

Key changes:

• Add new MessageQueue class in shared directory
• Implement efficient FIFO operations (O(1) complexity)
• Add comprehensive test coverage
• Refactor InMemoryTransport to use the new MessageQueue

Motivation and Context

The previous implementation used array operations (shift/push) which have O(n) complexity. The new implementation provides O(1) operations for better performance with large message queues.

Type of changes

• New feature (non-breaking change which adds functionality)
• Breaking change (fix or feature that would cause existing functionality to not work as expected)
• Performance improvement

How Has This Been Tested?

• Added dedicated test suite for MessageQueue
• All tests pass successfully
• Tested FIFO operations, length management, peek functionality, and clear operations

Checklist:

• My code follows the code style of this project
• I have added tests to cover my changes
• All new and existing tests passed
• My changes generate no new warnings