/
search.go
98 lines (90 loc) · 3.24 KB
/
search.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
// Copyright 2020 MongoDB Inc
//
// 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 search provides primitives for searching Ops Manager related collections.
package search // import "go.mongodb.org/ops-manager/search"
import (
"go.mongodb.org/ops-manager/opsmngr"
)
// Processes return the smallest index i
// in [0, n) at which f(i) is true, assuming that on the range [0, n),
// f(i) == true implies f(i+1) == true.
// returns the first true index. If there is no such index, Processes returns n and false
func Processes(a []*opsmngr.Process, f func(*opsmngr.Process) bool) (int, bool) {
for i, p := range a {
if f(p) {
return i, true
}
}
return len(a), false
}
// Members return the smallest index i
// in [0, n) at which f(i) is true, assuming that on the range [0, n),
// f(i) == true implies f(i+1) == true.
// returns the first true index. If there is no such index, Members returns n and false
func Members(a []opsmngr.Member, f func(opsmngr.Member) bool) (int, bool) {
for i, m := range a {
if f(m) {
return i, true
}
}
return len(a), false
}
// ReplicaSets return the smallest index i
// in [0, n) at which f(i) is true, assuming that on the range [0, n),
// f(i) == true implies f(i+1) == true.
// returns the first true index. If there is no such index, ReplicaSets returns n and false
func ReplicaSets(a []*opsmngr.ReplicaSet, f func(*opsmngr.ReplicaSet) bool) (int, bool) {
for i, m := range a {
if f(m) {
return i, true
}
}
return len(a), false
}
// ShardingConfig return the smallest index i
// in [0, n) at which f(i) is true, assuming that on the range [0, n),
// f(i) == true implies f(i+1) == true.
// returns the first true index. If there is no such index, ShardingConfig returns n and false
func ShardingConfig(a []*opsmngr.ShardingConfig, f func(*opsmngr.ShardingConfig) bool) (int, bool) {
for i, m := range a {
if f(m) {
return i, true
}
}
return len(a), false
}
// MongoDBUsers return the smallest index i
// in [0, n) at which f(i) is true, assuming that on the range [0, n),
// f(i) == true implies f(i+1) == true.
// returns the first true index. If there is no such index, MongoDBUsers returns n and false
func MongoDBUsers(a []*opsmngr.MongoDBUser, f func(*opsmngr.MongoDBUser) bool) (int, bool) {
for i, m := range a {
if f(m) {
return i, true
}
}
return len(a), false
}
// MongoDBIndexes return the smallest index i
// in [0, n) at which f(i) is true, assuming that on the range [0, n),
// f(i) == true implies f(i+1) == true.
// returns the first true index. If there is no such index, MongoDBIndexes returns n and false
func MongoDBIndexes(a []*opsmngr.IndexConfig, f func(configs *opsmngr.IndexConfig) bool) (int, bool) {
for i, m := range a {
if f(m) {
return i, true
}
}
return len(a), false
}