2020-03-17 03:04:32 +00:00
|
|
|
// Copyright 2016-2020, Pulumi Corporation.
|
|
|
|
//
|
|
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
|
|
// you may not use this file except in compliance with the License.
|
|
|
|
// You may obtain a copy of the License at
|
|
|
|
//
|
|
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
//
|
|
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
|
|
// See the License for the specific language governing permissions and
|
|
|
|
// limitations under the License.
|
|
|
|
|
|
|
|
package codegen
|
|
|
|
|
|
|
|
import (
|
2020-07-15 23:11:37 +00:00
|
|
|
"os"
|
|
|
|
"path/filepath"
|
2020-03-17 03:04:32 +00:00
|
|
|
"sort"
|
|
|
|
|
2022-12-07 12:03:41 +00:00
|
|
|
"github.com/pulumi/pulumi/pkg/v3/codegen/schema"
|
2023-06-28 16:02:04 +00:00
|
|
|
"github.com/pulumi/pulumi/sdk/v3/go/common/slice"
|
2021-03-17 13:20:05 +00:00
|
|
|
"github.com/pulumi/pulumi/sdk/v3/go/common/util/contract"
|
2020-03-17 03:04:32 +00:00
|
|
|
)
|
|
|
|
|
|
|
|
type StringSet map[string]struct{}
|
|
|
|
|
|
|
|
func NewStringSet(values ...string) StringSet {
|
|
|
|
s := StringSet{}
|
|
|
|
for _, v := range values {
|
|
|
|
s.Add(v)
|
|
|
|
}
|
|
|
|
return s
|
|
|
|
}
|
|
|
|
|
|
|
|
func (ss StringSet) Add(s string) {
|
|
|
|
ss[s] = struct{}{}
|
|
|
|
}
|
|
|
|
|
2021-01-30 00:52:00 +00:00
|
|
|
func (ss StringSet) Any() bool {
|
|
|
|
return len(ss) > 0
|
|
|
|
}
|
|
|
|
|
[codegen/python] Fix nested quotes. (#4539)
Unlike most languages with interpolated strings, Python's formatted
string literals do not allow the nesting of quotes. For example,
this expression is not legal Python:
f"Foo {"bar"} baz"
If an interpolation requires quotes, those quotes nust differ from the
quotes used by the enclosing literal. We can fix the previous example
by rewriting it with single quotes:
f"Foo {'bar'} baz"
However, this presents a problem if there are more than two levels of
nesting, as Python only has two kinds of quotes (four if the outermost
string uses """ or '''): in this case, the expression becomes
unspellable, and must be assigned to a local that is then used in place
of the original expression. So this:
f"Foo {bar[f'index {baz["qux"]}']} zed"
becomes this:
index = "qux"
f"Foo {bar[f'index {baz[index]}']}"
To put it bluntly, Python code generation reqiures register allocation,
but for quotes. These changes implement exactly that.
These changes also include a fix for traversals that access values that
are dictionaries rather than objects, and must use indexers rather than
attributes.
2020-04-30 23:34:25 +00:00
|
|
|
func (ss StringSet) Delete(s string) {
|
|
|
|
delete(ss, s)
|
|
|
|
}
|
|
|
|
|
2020-03-17 03:04:32 +00:00
|
|
|
func (ss StringSet) Has(s string) bool {
|
|
|
|
_, ok := ss[s]
|
|
|
|
return ok
|
|
|
|
}
|
|
|
|
|
2022-01-21 20:58:11 +00:00
|
|
|
// StringSet.Except returns the string set setminus s.
|
|
|
|
func (ss StringSet) Except(s string) StringSet {
|
|
|
|
return ss.Subtract(NewStringSet(s))
|
|
|
|
}
|
|
|
|
|
2020-03-17 03:04:32 +00:00
|
|
|
func (ss StringSet) SortedValues() []string {
|
2023-06-28 16:02:04 +00:00
|
|
|
values := slice.Prealloc[string](len(ss))
|
2020-03-17 03:04:32 +00:00
|
|
|
for v := range ss {
|
|
|
|
values = append(values, v)
|
|
|
|
}
|
|
|
|
sort.Strings(values)
|
|
|
|
return values
|
|
|
|
}
|
|
|
|
|
2021-06-09 10:02:32 +00:00
|
|
|
// Contains returns true if all elements of the subset are also present in the current set. It also returns true
|
|
|
|
// if subset is empty.
|
|
|
|
func (ss StringSet) Contains(subset StringSet) bool {
|
|
|
|
for v := range subset {
|
|
|
|
if !ss.Has(v) {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
|
|
|
|
// Subtract returns a new string set with all elements of the current set that are not present in the other set.
|
|
|
|
func (ss StringSet) Subtract(other StringSet) StringSet {
|
|
|
|
result := NewStringSet()
|
|
|
|
for v := range ss {
|
|
|
|
if !other.Has(v) {
|
|
|
|
result.Add(v)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return result
|
|
|
|
}
|
|
|
|
|
2022-10-05 19:19:29 +00:00
|
|
|
func (ss StringSet) Union(other StringSet) StringSet {
|
|
|
|
result := NewStringSet()
|
|
|
|
for v := range ss {
|
|
|
|
result.Add(v)
|
|
|
|
}
|
|
|
|
for v := range other {
|
|
|
|
result.Add(v)
|
|
|
|
}
|
|
|
|
return result
|
|
|
|
}
|
|
|
|
|
2020-03-17 03:04:32 +00:00
|
|
|
type Set map[interface{}]struct{}
|
|
|
|
|
|
|
|
func (s Set) Add(v interface{}) {
|
|
|
|
s[v] = struct{}{}
|
|
|
|
}
|
|
|
|
|
2021-09-28 14:33:14 +00:00
|
|
|
func (s Set) Delete(v interface{}) {
|
|
|
|
delete(s, v)
|
|
|
|
}
|
|
|
|
|
2020-03-17 03:04:32 +00:00
|
|
|
func (s Set) Has(v interface{}) bool {
|
|
|
|
_, ok := s[v]
|
|
|
|
return ok
|
|
|
|
}
|
|
|
|
|
2023-02-13 14:30:10 +00:00
|
|
|
// SortedKeys returns a sorted list of keys for the given map.
|
|
|
|
func SortedKeys[T any](m map[string]T) []string {
|
2023-06-28 16:02:04 +00:00
|
|
|
keys := slice.Prealloc[string](len(m))
|
2023-02-13 14:30:10 +00:00
|
|
|
for k := range m {
|
|
|
|
keys = append(keys, k)
|
2020-03-17 03:04:32 +00:00
|
|
|
}
|
|
|
|
sort.Strings(keys)
|
|
|
|
|
|
|
|
return keys
|
|
|
|
}
|
2020-07-15 23:11:37 +00:00
|
|
|
|
|
|
|
// CleanDir removes all existing files from a directory except those in the exclusions list.
|
|
|
|
// Note: The exclusions currently don't function recursively, so you cannot exclude a single file
|
|
|
|
// in a subdirectory, only entire subdirectories. This function will need improvements to be able to
|
|
|
|
// target that use-case.
|
|
|
|
func CleanDir(dirPath string, exclusions StringSet) error {
|
2022-09-10 07:22:11 +00:00
|
|
|
subPaths, err := os.ReadDir(dirPath)
|
2020-07-15 23:11:37 +00:00
|
|
|
if err != nil {
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
|
|
|
|
if len(subPaths) > 0 {
|
|
|
|
for _, path := range subPaths {
|
|
|
|
if !exclusions.Has(path.Name()) {
|
|
|
|
err = os.RemoveAll(filepath.Join(dirPath, path.Name()))
|
|
|
|
if err != nil {
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return nil
|
|
|
|
}
|
2020-11-11 18:42:08 +00:00
|
|
|
|
|
|
|
var commonEnumNameReplacements = map[string]string{
|
|
|
|
"*": "Asterisk",
|
|
|
|
"0": "Zero",
|
|
|
|
"1": "One",
|
|
|
|
"2": "Two",
|
|
|
|
"3": "Three",
|
|
|
|
"4": "Four",
|
|
|
|
"5": "Five",
|
|
|
|
"6": "Six",
|
|
|
|
"7": "Seven",
|
|
|
|
"8": "Eight",
|
|
|
|
"9": "Nine",
|
|
|
|
}
|
|
|
|
|
|
|
|
func ExpandShortEnumName(name string) string {
|
|
|
|
if replacement, ok := commonEnumNameReplacements[name]; ok {
|
|
|
|
return replacement
|
|
|
|
}
|
|
|
|
return name
|
|
|
|
}
|
2022-11-09 19:49:59 +00:00
|
|
|
|
|
|
|
// A simple in memory file system.
|
|
|
|
type Fs map[string][]byte
|
|
|
|
|
|
|
|
// Add a new file to the Fs.
|
|
|
|
//
|
|
|
|
// Panic if the file is a duplicate.
|
|
|
|
func (fs Fs) Add(path string, contents []byte) {
|
|
|
|
_, has := fs[path]
|
|
|
|
contract.Assertf(!has, "duplicate file: %s", path)
|
|
|
|
fs[path] = contents
|
|
|
|
}
|
2022-12-07 12:03:41 +00:00
|
|
|
|
|
|
|
// Check if two packages are the same.
|
|
|
|
func PkgEquals(p1, p2 schema.PackageReference) bool {
|
|
|
|
if p1 == p2 {
|
|
|
|
return true
|
|
|
|
} else if p1 == nil || p2 == nil {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
|
|
|
|
if p1.Name() != p2.Name() {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
|
|
|
|
v1, v2 := p1.Version(), p2.Version()
|
|
|
|
if v1 == v2 {
|
|
|
|
return true
|
|
|
|
} else if v1 == nil || v2 == nil {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
return v1.Equals(*v2)
|
|
|
|
}
|