Data Transfer Hash pattern

[iluwatar]

Description: The Data Transfer Hash design pattern is used to transfer a large amount of data between different parts of a system or across systems. This pattern uses a hash map to store data as key-value pairs, which facilitates easy data retrieval and manipulation. The primary elements of this pattern include:

• Data Container: A hash map or dictionary to store the data.
• Serialization/Deserialization: Methods to convert data to and from the hash map format.
• Encapsulation: Ensuring that the data structure hides its implementation details and exposes only necessary interfaces for interaction.
• Efficiency: Optimization for quick data access and manipulation.

References:

1. Data Transfer Hash Design Pattern - Link to Book
2. Project Contribution Guidelines - Github Wiki

Acceptance Criteria:

1. Implement a hash map-based data container with appropriate methods for adding, retrieving, and removing data.
2. Include serialization and deserialization methods for converting the data container to and from a transferable format.
3. Ensure the implementation adheres to the project's coding standards and passes all existing unit tests.

[x418-22n]

Hello, I would work on this issue within one month.

[ohbus]

Here you go @x418-22n

Please mention a timeline for when can we expect a PR against this issue.

[iluwatar]

This issue is free for taking again.

[SpaceIshtar]

Hi, I would like to give it a shot. Could you please assign it to me? I believe I could open a PR before Apr 24th.

[iluwatar]

Ok @SpaceIshtar

[iluwatar]

@SpaceIshtar are you working on this?