641615b299
1. Remove ks-iam standalone binary, move it to ks-apiserver 2. Generate all devops apis inside kubesphere repository, no need to import s2ioperator. 3. Reorganize ldap code, make it more flexible to use.
139 lines
3.8 KiB
Go
139 lines
3.8 KiB
Go
/*
|
|
|
|
Copyright 2019 The KubeSphere Authors.
|
|
|
|
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 s2buildertemplate
|
|
|
|
import (
|
|
"kubesphere.io/kubesphere/pkg/apis/devops/v1alpha1"
|
|
"kubesphere.io/kubesphere/pkg/client/informers/externalversions"
|
|
"kubesphere.io/kubesphere/pkg/constants"
|
|
"kubesphere.io/kubesphere/pkg/models/resources/v1alpha2"
|
|
|
|
"kubesphere.io/kubesphere/pkg/server/params"
|
|
"kubesphere.io/kubesphere/pkg/utils/sliceutil"
|
|
"sort"
|
|
"strings"
|
|
|
|
"k8s.io/apimachinery/pkg/labels"
|
|
)
|
|
|
|
type s2iBuilderTemplateSearcher struct {
|
|
informers externalversions.SharedInformerFactory
|
|
}
|
|
|
|
func NewS2iBuidlerTemplateSearcher(informers externalversions.SharedInformerFactory) v1alpha2.Interface {
|
|
return &s2iBuilderTemplateSearcher{informers: informers}
|
|
}
|
|
|
|
func (s *s2iBuilderTemplateSearcher) Get(namespace, name string) (interface{}, error) {
|
|
return s.informers.Devops().V1alpha1().S2iBuilderTemplates().Lister().Get(name)
|
|
}
|
|
|
|
// exactly Match
|
|
func (*s2iBuilderTemplateSearcher) match(match map[string]string, item *v1alpha1.S2iBuilderTemplate) bool {
|
|
for k, v := range match {
|
|
switch k {
|
|
case v1alpha2.Name:
|
|
names := strings.Split(v, "|")
|
|
if !sliceutil.HasString(names, item.Name) {
|
|
return false
|
|
}
|
|
case v1alpha2.Keyword:
|
|
if !strings.Contains(item.Name, v) && !v1alpha2.SearchFuzzy(item.Labels, "", v) && !v1alpha2.SearchFuzzy(item.Annotations, "", v) {
|
|
return false
|
|
}
|
|
default:
|
|
// label not exist or value not equal
|
|
if val, ok := item.Labels[k]; !ok || val != v {
|
|
return false
|
|
}
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
|
|
// Fuzzy searchInNamespace
|
|
func (*s2iBuilderTemplateSearcher) fuzzy(fuzzy map[string]string, item *v1alpha1.S2iBuilderTemplate) bool {
|
|
for k, v := range fuzzy {
|
|
switch k {
|
|
case v1alpha2.Name:
|
|
if !strings.Contains(item.Name, v) && !strings.Contains(item.Annotations[constants.DisplayNameAnnotationKey], v) {
|
|
return false
|
|
}
|
|
case v1alpha2.Label:
|
|
if !v1alpha2.SearchFuzzy(item.Labels, "", v) {
|
|
return false
|
|
}
|
|
case v1alpha2.Annotation:
|
|
if !v1alpha2.SearchFuzzy(item.Annotations, "", v) {
|
|
return false
|
|
}
|
|
return false
|
|
default:
|
|
if !v1alpha2.SearchFuzzy(item.Labels, k, v) {
|
|
return false
|
|
}
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
|
|
func (*s2iBuilderTemplateSearcher) compare(a, b *v1alpha1.S2iBuilderTemplate, orderBy string) bool {
|
|
switch orderBy {
|
|
case v1alpha2.CreateTime:
|
|
return a.CreationTimestamp.Time.Before(b.CreationTimestamp.Time)
|
|
case v1alpha2.Name:
|
|
fallthrough
|
|
default:
|
|
return strings.Compare(a.Name, b.Name) <= 0
|
|
}
|
|
}
|
|
|
|
func (s *s2iBuilderTemplateSearcher) Search(namespace string, conditions *params.Conditions, orderBy string, reverse bool) ([]interface{}, error) {
|
|
builderTemplates, err := s.informers.Devops().V1alpha1().S2iBuilderTemplates().Lister().List(labels.Everything())
|
|
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
result := make([]*v1alpha1.S2iBuilderTemplate, 0)
|
|
|
|
if len(conditions.Match) == 0 && len(conditions.Fuzzy) == 0 {
|
|
result = builderTemplates
|
|
} else {
|
|
for _, item := range builderTemplates {
|
|
if s.match(conditions.Match, item) && s.fuzzy(conditions.Fuzzy, item) {
|
|
result = append(result, item)
|
|
}
|
|
}
|
|
}
|
|
sort.Slice(result, func(i, j int) bool {
|
|
if reverse {
|
|
tmp := i
|
|
i = j
|
|
j = tmp
|
|
}
|
|
return s.compare(result[i], result[j], orderBy)
|
|
})
|
|
|
|
r := make([]interface{}, 0)
|
|
for _, i := range result {
|
|
r = append(r, i)
|
|
}
|
|
return r, nil
|
|
}
|