本文整理汇总了Golang中github.com/dedis/onet.TreeNodeInstance.Tree方法的典型用法代码示例。如果您正苦于以下问题：Golang TreeNodeInstance.Tree方法的具体用法？Golang TreeNodeInstance.Tree怎么用？Golang TreeNodeInstance.Tree使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类github.com/dedis/onet.TreeNodeInstance的用法示例。
在下文中一共展示了TreeNodeInstance.Tree方法的3个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Golang代码示例。
示例1: NewBFTCoSiProtocol
// NewBFTCoSiProtocol returns a new bftcosi struct
func NewBFTCoSiProtocol(n *onet.TreeNodeInstance, verify VerificationFunction) (*ProtocolBFTCoSi, error) {
// initialize the bftcosi node/protocol-instance
bft := &ProtocolBFTCoSi{
TreeNodeInstance: n,
collectStructs: collectStructs{
prepare: cosi.NewCosi(n.Suite(), n.Private(), n.Roster().Publics()),
commit: cosi.NewCosi(n.Suite(), n.Private(), n.Roster().Publics()),
},
verifyChan: make(chan bool),
VerificationFunction: verify,
threshold: (len(n.Tree().List()) + 1) * 2 / 3,
Msg: make([]byte, 0),
Data: make([]byte, 0),
}
idx, _ := n.Roster().Search(bft.ServerIdentity().ID)
bft.index = idx
// Registering channels.
err := bft.RegisterChannels(&bft.announceChan,
&bft.challengePrepareChan, &bft.challengeCommitChan,
&bft.commitChan, &bft.responseChan)
if err != nil {
return nil, err
}
n.OnDoneCallback(bft.nodeDone)
return bft, nil
}示例2: NewBroadcastProtocol
// NewBroadcastProtocol returns a new Broadcast protocol
func NewBroadcastProtocol(n *onet.TreeNodeInstance) (onet.ProtocolInstance, error) {
b := &Broadcast{
TreeNodeInstance: n,
tnIndex: -1,
}
for i, tn := range n.Tree().List() {
if tn.ID == n.TreeNode().ID {
b.tnIndex = i
}
}
if b.tnIndex == -1 {
return nil, errors.New("Didn't find my TreeNode in the Tree")
}
err := n.RegisterHandler(b.handleContactNodes)
if err != nil {
return nil, err
}
err = n.RegisterHandler(b.handleDone)
if err != nil {
return nil, err
}
return b, nil
}示例3: NewProtocol
// NewProtocol returns a new pbft protocol
func NewProtocol(n *onet.TreeNodeInstance) (*Protocol, error) {
pbft := new(Protocol)
pbft.state = statePrePrepare
tree := n.Tree()
pbft.TreeNodeInstance = n
pbft.nodeList = tree.List()
idx := notFound
for i, tn := range pbft.nodeList {
if tn.ID.Equal(n.TreeNode().ID) {
idx = i
}
}
if idx == notFound {
panic(fmt.Sprintf("Could not find ourselves %+v in the list of nodes %+v", n, pbft.nodeList))
}
pbft.index = idx
// 2/3 * #participants == threshold FIXME the threshold is actually XXX
pbft.threshold = int(math.Ceil(float64(len(pbft.nodeList)) * 2.0 / 3.0))
pbft.prepMsgCount = 0
pbft.commitMsgCount = 0
if err := n.RegisterChannel(&pbft.prePrepareChan); err != nil {
return pbft, err
}
if err := n.RegisterChannel(&pbft.prepareChan); err != nil {
return pbft, err
}
if err := n.RegisterChannel(&pbft.commitChan); err != nil {
return pbft, err
}
if err := n.RegisterChannel(&pbft.finishChan); err != nil {
return pbft, err
}
return pbft, nil
}