Repository navigation
Conversation
| idGen idgen.Generator | ||
| } | ||
|
|
||
| type Repositories struct { |
There was a problem hiding this comment.
Placement has enough repositories that grouping them into a struct improves service construction readability. This is the same explicit dependency approach as compute, just packaged for a wider surface.
| return candidates | ||
| } | ||
|
|
||
| for _, provider := range s.resourceProviderRepository.List() { |
There was a problem hiding this comment.
Allocation candidates are intentionally computed from current providers, inventories, and usages rather than stored as their own resource. This is the key semantic endpoint in the Placement slice.
| return resources | ||
| } | ||
|
|
||
| func capacity(inventory Inventory, used int) int { |
There was a problem hiding this comment.
Capacity follows the simple Placement formula used by this MVP: total minus reserved, multiplied by allocation ratio, then reduced by usage. Nested providers or sharing providers would need a more advanced model later.
264e59a to
7864e35
Compare
56e91e6 to
63658ef
Compare
|
Closing without merge. The repository was reset to a new root that keeps only the retained design decisions (see |
1 participant
Summary
Main Review Points
Verification