Home
last modified time | relevance | path

Searched refs:fullNode (Results 1 – 25 of 34) sorted by relevance

12

/dports/net-p2p/go-ethereum/go-ethereum-1.10.14/vendor/github.com/status-im/keycard-go/vendor/github.com/ethereum/go-ethereum/trie/
H A Dnode.go37 fullNode struct {
55 func (n *fullNode) EncodeRLP(w io.Writer) error {
68 func (n *fullNode) copy() *fullNode { copy := *n; return &copy }
83 func (n *fullNode) canUnload(gen, limit uint16) bool { return n.flags.canUnload(gen, limit) }
88 func (n *fullNode) cache() (hashNode, bool) { return n.flags.hash, n.flags.dirty }
94 func (n *fullNode) String() string { return n.fstring("") }
99 func (n *fullNode) fstring(ind string) string {
171 func decodeFull(hash, elems []byte, cachegen uint16) (*fullNode, error) {
172 n := &fullNode{flags: nodeFlag{hash: hash, gen: cachegen}}
H A Dhasher.go112 case *fullNode:
142 case *fullNode:
200 case *fullNode:
H A Dproof.go53 case *fullNode:
140 case *fullNode:
H A Dtrie.go160 case *fullNode:
238 branch := &fullNode{flags: t.newFlag()}
255 case *fullNode:
340 case *fullNode:
/dports/net-p2p/go-ethereum/go-ethereum-1.10.14/trie/
H A Dnode.go36 fullNode struct {
54 func (n *fullNode) EncodeRLP(w io.Writer) error {
67 func (n *fullNode) copy() *fullNode { copy := *n; return &copy }
76 func (n *fullNode) cache() (hashNode, bool) { return n.flags.hash, n.flags.dirty }
82 func (n *fullNode) String() string { return n.fstring("") }
87 func (n *fullNode) fstring(ind string) string {
159 func decodeFull(hash, elems []byte) (*fullNode, error) {
160 n := &fullNode{flags: nodeFlag{hash: hash}}
H A Dproof.go54 case *fullNode:
181 case *fullNode:
196 case *fullNode:
257 case *fullNode:
318 case *fullNode:
349 case *fullNode:
370 fn := parent.(*fullNode)
382 fn := parent.(*fullNode)
393 fn := parent.(*fullNode)
416 case *fullNode:
[all …]
H A Dhasher.go86 case *fullNode:
113 case *fullNode, *shortNode:
119 func (h *hasher) hashFullNodeChildren(n *fullNode) (collapsed *fullNode, cached *fullNode) {
169 func (h *hasher) fullnodeToHash(n *fullNode, force bool) node {
200 case *fullNode:
H A Dcommitter.go103 if _, ok := cn.Val.(*fullNode); ok {
117 case *fullNode:
139 func (c *committer) commitChildren(n *fullNode, db *Database) ([17]node, int, error) {
230 case *fullNode:
258 case *fullNode:
H A Dtrie.go143 case *fullNode:
218 case *fullNode:
306 branch := &fullNode{flags: t.newFlag()}
323 case *fullNode:
409 case *fullNode:
H A Diterator.go377 func findChild(n *fullNode, index int, path []byte, ancestor common.Hash) (node, *nodeIteratorState… argument
404 case *fullNode:
432 case *fullNode:
/dports/net-im/kopete/kopete-21.12.3/protocols/jabber/libiris/src/xmpp/xmpp-im/
H A Dxmpp_caps.cpp263 QString fullNode = c.flatten(); in updateCaps() local
273 if (!capsJids_[fullNode].contains(jid.full())) { in updateCaps()
274 capsJids_[fullNode].push_back(jid.full()); in updateCaps()
281 if (!CapsRegistry::instance()->isRegistered(fullNode) && capsJids_[fullNode].count() == 1) { in updateCaps()
286 disco->get(jid, fullNode); in updateCaps()
293 …om %1: node=%2, ver=%3").arg(QString(jid.full()).replace('%',"%%")).arg(fullNode).arg(c.version()); in updateCaps()
299 capsJids_[fullNode].push_back(jid.full()); in updateCaps()
/dports/net-im/psi/psi-1.5/iris/src/xmpp/xmpp-im/
H A Dxmpp_caps.cpp263 QString fullNode = c.flatten(); in updateCaps() local
273 if (!capsJids_[fullNode].contains(jid.full())) { in updateCaps()
274 capsJids_[fullNode].push_back(jid.full()); in updateCaps()
281 if (!CapsRegistry::instance()->isRegistered(fullNode) && capsJids_[fullNode].count() == 1) { in updateCaps()
286 disco->get(jid, fullNode); in updateCaps()
293 …om %1: node=%2, ver=%3").arg(QString(jid.full()).replace('%',"%%")).arg(fullNode).arg(c.version()); in updateCaps()
299 capsJids_[fullNode].push_back(jid.full()); in updateCaps()
/dports/net-p2p/go-ethereum/go-ethereum-1.10.14/vendor/github.com/status-im/keycard-go/vendor/github.com/ethereum/go-ethereum/whisper/whisperv6/
H A Dpeer.go42 fullNode bool member
60 fullNode: true,
249 return peer.fullNode || BloomFilterMatch(peer.bloomFilter, env.Bloom())
256 peer.fullNode = isFullNode(bloom)
257 if peer.fullNode && peer.bloomFilter == nil {
/dports/net/concourse-fly/concourse-6.7.1/vendor/github.com/google/jsonapi/
H A Drequest.go477 fullNode(n, included),
512 fullNode(relationship.Data, included),
532 func fullNode(n *Node, included *map[string]*Node) *Node { func
/dports/misc/concourse/concourse-6.7.2/vendor/github.com/google/jsonapi/
H A Drequest.go477 fullNode(n, included),
512 fullNode(relationship.Data, included),
532 func fullNode(n *Node, included *map[string]*Node) *Node { func
/dports/emulators/qemu-utils/qemu-4.2.1/roms/u-boot-sam460ex/board/ACube/common/slb/
H A Dour_lists.h10 struct fullNode struct
/dports/emulators/qemu5/qemu-5.2.0/roms/u-boot-sam460ex/board/ACube/common/slb/
H A Dour_lists.h10 struct fullNode struct
/dports/emulators/qemu-powernv/qemu-powernv-3.0.50/roms/u-boot-sam460ex/board/ACube/common/slb/
H A Dour_lists.h10 struct fullNode struct
/dports/emulators/qemu42/qemu-4.2.1/roms/u-boot-sam460ex/board/ACube/common/slb/
H A Dour_lists.h10 struct fullNode struct
/dports/emulators/qemu-guest-agent/qemu-5.0.1/roms/u-boot-sam460ex/board/ACube/common/slb/
H A Dour_lists.h10 struct fullNode struct
/dports/emulators/qemu/qemu-6.2.0/roms/u-boot-sam460ex/board/ACube/common/slb/
H A Dour_lists.h10 struct fullNode struct
/dports/emulators/qemu60/qemu-6.0.0/roms/u-boot-sam460ex/board/ACube/common/slb/
H A Dour_lists.h10 struct fullNode struct
/dports/security/vault/vault-1.8.2/vendor/github.com/svanharmelen/jsonapi/
H A Drequest.go313 fullNode(n, included),
348 fullNode(relationship.Data, included),
368 func fullNode(n *Node, included *map[string]*Node) *Node { func
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vault-plugin-secrets-terraform/vendor/github.com/svanharmelen/jsonapi/
H A Drequest.go313 fullNode(n, included),
348 fullNode(relationship.Data, included),
368 func fullNode(n *Node, included *map[string]*Node) *Node { func
/dports/sysutils/terraform/terraform-1.0.11/vendor/github.com/hashicorp/jsonapi/
H A Drequest.go283 fullNode(n, included),
318 fullNode(relationship.Data, included),
378 func fullNode(n *Node, included *map[string]*Node) *Node { func

12