本文整理匯總了Golang中github.com/coreos/fleet/pkg.Set.Contains方法的典型用法代碼示例。如果您正苦於以下問題:Golang Set.Contains方法的具體用法?Golang Set.Contains怎麽用?Golang Set.Contains使用的例子?那麽, 這裏精選的方法代碼示例或許可以為您提供幫助。您也可以進一步了解該方法所在類github.com/coreos/fleet/pkg.Set
的用法示例。
在下文中一共展示了Set.Contains方法的3個代碼示例,這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚,您的評價將有助於係統推薦出更棒的Golang代碼示例。
示例1: GetUnitStates
func (m *systemdUnitManager) GetUnitStates(filter pkg.Set) (map[string]*unit.UnitState, error) {
// Unfortunately we need to lock for the entire operation to ensure we
// have a consistent view of the hashes. Otherwise, Load/Unload
// operations could mutate the hashes before we've retrieved the state
// for every unit in the filter, since they won't necessarily all be
// present in the initial ListUnits() call.
fallback := false
m.mutex.Lock()
defer m.mutex.Unlock()
dbusStatuses, err := m.systemd.ListUnitsByNames(filter.Values())
if err != nil {
fallback = true
log.Debugf("ListUnitsByNames is not implemented in your systemd version (requires at least systemd 230), fallback to ListUnits: %v", err)
dbusStatuses, err = m.systemd.ListUnits()
if err != nil {
return nil, err
}
}
states := make(map[string]*unit.UnitState)
for _, dus := range dbusStatuses {
if fallback && !filter.Contains(dus.Name) {
// If filter could not be applied on DBus side, we will filter unit files here
continue
}
us := &unit.UnitState{
LoadState: dus.LoadState,
ActiveState: dus.ActiveState,
SubState: dus.SubState,
}
if h, ok := m.hashes[dus.Name]; ok {
us.UnitHash = h.String()
}
states[dus.Name] = us
}
// grab data on subscribed units that didn't show up in ListUnits in fallback mode, most
// likely due to being inactive
if fallback {
for _, name := range filter.Values() {
if _, ok := states[name]; ok {
continue
}
us, err := m.getUnitState(name)
if err != nil {
return nil, err
}
if h, ok := m.hashes[name]; ok {
us.UnitHash = h.String()
}
states[name] = us
}
}
return states, nil
}
示例2: GetUnitStates
func (m *systemdUnitManager) GetUnitStates(filter pkg.Set) (map[string]*unit.UnitState, error) {
// Unfortunately we need to lock for the entire operation to ensure we
// have a consistent view of the hashes. Otherwise, Load/Unload
// operations could mutate the hashes before we've retrieved the state
// for every unit in the filter, since they won't necessarily all be
// present in the initial ListUnits() call.
m.mutex.Lock()
defer m.mutex.Unlock()
dbusStatuses, err := m.systemd.ListUnits()
if err != nil {
return nil, err
}
states := make(map[string]*unit.UnitState)
for _, dus := range dbusStatuses {
if !filter.Contains(dus.Name) {
continue
}
us := &unit.UnitState{
LoadState: dus.LoadState,
ActiveState: dus.ActiveState,
SubState: dus.SubState,
}
if h, ok := m.hashes[dus.Name]; ok {
us.UnitHash = h.String()
}
states[dus.Name] = us
}
// grab data on subscribed units that didn't show up in ListUnits, most
// likely due to being inactive
for _, name := range filter.Values() {
if _, ok := states[name]; ok {
continue
}
us, err := m.getUnitState(name)
if err != nil {
return nil, err
}
if h, ok := m.hashes[name]; ok {
us.UnitHash = h.String()
}
states[name] = us
}
return states, nil
}
示例3: calculateTasksForOffer
func (ar *AgentReconciler) calculateTasksForOffer(dState *agentState, ms *machine.MachineState, j *job.Job, bids pkg.Set, taskchan chan *task) {
if bids.Contains(ms.ID) {
log.V(1).Infof("Bid already submitted for unresolved JobOffer(%s)", j.Name)
return
}
if able, reason := ar.ableToRun(dState, ms, j); !able {
log.V(1).Infof("Not bidding on Job(%s): %s", j.Name, reason)
return
}
taskchan <- &task{
Type: taskTypeSubmitBid,
Job: j,
Reason: taskReasonAbleToResolveOffer,
}
}