Key Features • Dependencies • How To Use • Documentation
- Maximize total spent of a voucher with N items.
- The items are represented by a list of tuples (item, price).
- The algorithm is greedy inspired by the Knapsack problem.
Before running the project please ensure that all the dependencies are installed in your system. Then follow the next:
-
Run pubsub emulator. Click here
-
Create topic.
- Topic:
voucher-metric
- Subscription:
voucher-metric-sub
- Topic:
-
Run the project itself.
make web
-
Test it.
curl -X POST -H "Content-Type: application/json" -d '{"item_ids": ["MLU605321798", "MLU473655928", "MLU468171212", "MLU473464533", "MLU608054906"], "amount": 500}' http://localhost:8080/calculator/coupon
In order to run the project tests you need to execute the following command:
make test
- Refactor transport layer
- Integration tests
- Circuit breaker
- Logging
- Monitoring
- Error handling
- Documentation
-
-
- Decentralized microservice architecture
- Project architecture based in onion architecture
- CI / CD pipelines with GitHub Actions
- K8s deployment
-
- If you want to add new features to this project please see the contribution guide
- Questions?, write here