-
Notifications
You must be signed in to change notification settings - Fork 132
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
feat(memorydb): add connectiondetails for cluster
Signed-off-by: Christopher Paul Haar <[email protected]>
- Loading branch information
Christopher Paul Haar
committed
Apr 2, 2023
1 parent
fd3ab74
commit 6768c08
Showing
3 changed files
with
68 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,63 @@ | ||
/* | ||
Copyright 2022 Upbound Inc. | ||
*/ | ||
|
||
package memorydb | ||
|
||
import ( | ||
"fmt" | ||
|
||
"github.com/upbound/upjet/pkg/config" | ||
) | ||
|
||
// Configure adds configurations for memorydb group. | ||
func Configure(p *config.Provider) { | ||
p.AddResourceConfigurator("aws_memorydb_cluster", func(r *config.Resource) { | ||
r.UseAsync = true | ||
|
||
r.Sensitive.AdditionalConnectionDetailsFn = func(attr map[string]any) (map[string][]byte, error) { | ||
conn := map[string][]byte{} | ||
if clusterendpoints, ok := attr["cluster_endpoint"].([]any); ok { | ||
for i, cp := range clusterendpoints { | ||
if clusterendpoint, ok := cp.(map[string]any); ok && len(clusterendpoint) > 0 { | ||
if address, ok := clusterendpoint["address"].(string); ok { | ||
key := fmt.Sprintf("cluster_endpoint_%d_address", i) | ||
conn[key] = []byte(address) | ||
} | ||
if port, ok := clusterendpoint["port"].(float64); ok { | ||
key := fmt.Sprintf("cluster_endpoint_%d_port", i) | ||
conn[key] = []byte(fmt.Sprintf("%g", port)) | ||
} | ||
} | ||
} | ||
} | ||
if shards, ok := attr["shards"].([]any); ok { | ||
for i, shard := range shards { | ||
if s, ok := shard.(map[string]any); ok { | ||
if nodes, ok := s["nodes"].([]any); ok { | ||
for j, node := range nodes { | ||
if nod, ok := node.(map[string]any); ok { | ||
if endpoints, ok := nod["endpoint"].([]any); ok && len(endpoints) > 0 { | ||
for _, endpoint := range endpoints { | ||
if ep, ok := endpoint.(map[string]any); ok && len(ep) > 0 { | ||
if address, ok := ep["address"].(string); ok { | ||
key := fmt.Sprintf("shard_node_%d_%d_endpoint_address", i+1, j+1) | ||
conn[key] = []byte(address) | ||
} | ||
if port, ok := ep["port"].(float64); ok { | ||
key := fmt.Sprintf("shard_node_%d_%d_endpoint_port", i+1, j+1) | ||
conn[key] = []byte(fmt.Sprintf("%g", port)) | ||
} | ||
} | ||
} | ||
} | ||
} | ||
} | ||
} | ||
} | ||
} | ||
} | ||
return conn, nil | ||
} | ||
}) | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters