代码拉取完成,页面将自动刷新
/*
Copyright IBM Corp. 2017 All Rights Reserved.
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 util
import (
"sync"
"github.com/hyperledger/fabric/gossip/common"
proto "github.com/hyperledger/fabric/protos/gossip"
)
// MembershipStore struct which encapsulates
// membership message store abstraction
type MembershipStore struct {
m map[string]*proto.SignedGossipMessage
sync.RWMutex
}
// NewMembershipStore creates new membership store instance
func NewMembershipStore() *MembershipStore {
return &MembershipStore{m: make(map[string]*proto.SignedGossipMessage)}
}
// MsgByID returns a message stored by a certain ID, or nil
// if such an ID isn't found
func (m *MembershipStore) MsgByID(pkiID common.PKIidType) *proto.SignedGossipMessage {
m.RLock()
defer m.RUnlock()
if msg, exists := m.m[string(pkiID)]; exists {
return msg
}
return nil
}
// Size of the membership store
func (m *MembershipStore) Size() int {
m.RLock()
defer m.RUnlock()
return len(m.m)
}
// Put associates msg with the given pkiID
func (m *MembershipStore) Put(pkiID common.PKIidType, msg *proto.SignedGossipMessage) {
m.Lock()
defer m.Unlock()
m.m[string(pkiID)] = msg
}
// Remove removes a message with a given pkiID
func (m *MembershipStore) Remove(pkiID common.PKIidType) {
m.Lock()
defer m.Unlock()
delete(m.m, string(pkiID))
}
// ToSlice returns a slice backed by the elements
// of the MembershipStore
func (m *MembershipStore) ToSlice() []*proto.SignedGossipMessage {
m.RLock()
defer m.RUnlock()
members := make([]*proto.SignedGossipMessage, len(m.m))
i := 0
for _, member := range m.m {
members[i] = member
i++
}
return members
}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。