repo stringlengths 5 67 | path stringlengths 4 218 | func_name stringlengths 0 151 | original_string stringlengths 52 373k | language stringclasses 6 values | code stringlengths 52 373k | code_tokens listlengths 10 512 | docstring stringlengths 3 47.2k | docstring_tokens listlengths 3 234 | sha stringlengths 40 40 | url stringlengths 85 339 | partition stringclasses 3 values |
|---|---|---|---|---|---|---|---|---|---|---|---|
shiyanhui/dht | routingtable.go | GetPeers | func (pm *peersManager) GetPeers(infoHash string, size int) []*Peer {
peers := make([]*Peer, 0, size)
v, ok := pm.table.Get(infoHash)
if !ok {
return peers
}
for e := range v.(*keyedDeque).Iter() {
peers = append(peers, e.Value.(*Peer))
}
if len(peers) > size {
peers = peers[len(peers)-size:]
}
return peers
} | go | func (pm *peersManager) GetPeers(infoHash string, size int) []*Peer {
peers := make([]*Peer, 0, size)
v, ok := pm.table.Get(infoHash)
if !ok {
return peers
}
for e := range v.(*keyedDeque).Iter() {
peers = append(peers, e.Value.(*Peer))
}
if len(peers) > size {
peers = peers[len(peers)-size:]
}
return peers
} | [
"func",
"(",
"pm",
"*",
"peersManager",
")",
"GetPeers",
"(",
"infoHash",
"string",
",",
"size",
"int",
")",
"[",
"]",
"*",
"Peer",
"{",
"peers",
":=",
"make",
"(",
"[",
"]",
"*",
"Peer",
",",
"0",
",",
"size",
")",
"\n",
"v",
",",
"ok",
":=",
... | // GetPeers returns size-length peers who announces having infoHash. | [
"GetPeers",
"returns",
"size",
"-",
"length",
"peers",
"who",
"announces",
"having",
"infoHash",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/routingtable.go#L131-L147 | train |
shiyanhui/dht | routingtable.go | newKBucket | func newKBucket(prefix *bitmap) *kbucket {
bucket := &kbucket{
nodes: newKeyedDeque(),
candidates: newKeyedDeque(),
lastChanged: time.Now(),
prefix: prefix,
}
return bucket
} | go | func newKBucket(prefix *bitmap) *kbucket {
bucket := &kbucket{
nodes: newKeyedDeque(),
candidates: newKeyedDeque(),
lastChanged: time.Now(),
prefix: prefix,
}
return bucket
} | [
"func",
"newKBucket",
"(",
"prefix",
"*",
"bitmap",
")",
"*",
"kbucket",
"{",
"bucket",
":=",
"&",
"kbucket",
"{",
"nodes",
":",
"newKeyedDeque",
"(",
")",
",",
"candidates",
":",
"newKeyedDeque",
"(",
")",
",",
"lastChanged",
":",
"time",
".",
"Now",
... | // newKBucket returns a new kbucket pointer. | [
"newKBucket",
"returns",
"a",
"new",
"kbucket",
"pointer",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/routingtable.go#L158-L166 | train |
shiyanhui/dht | routingtable.go | LastChanged | func (bucket *kbucket) LastChanged() time.Time {
bucket.RLock()
defer bucket.RUnlock()
return bucket.lastChanged
} | go | func (bucket *kbucket) LastChanged() time.Time {
bucket.RLock()
defer bucket.RUnlock()
return bucket.lastChanged
} | [
"func",
"(",
"bucket",
"*",
"kbucket",
")",
"LastChanged",
"(",
")",
"time",
".",
"Time",
"{",
"bucket",
".",
"RLock",
"(",
")",
"\n",
"defer",
"bucket",
".",
"RUnlock",
"(",
")",
"\n",
"return",
"bucket",
".",
"lastChanged",
"\n",
"}"
] | // LastChanged return the last time when it changes. | [
"LastChanged",
"return",
"the",
"last",
"time",
"when",
"it",
"changes",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/routingtable.go#L169-L174 | train |
shiyanhui/dht | routingtable.go | RandomChildID | func (bucket *kbucket) RandomChildID() string {
prefixLen := bucket.prefix.Size / 8
return strings.Join([]string{
bucket.prefix.RawString()[:prefixLen],
randomString(20 - prefixLen),
}, "")
} | go | func (bucket *kbucket) RandomChildID() string {
prefixLen := bucket.prefix.Size / 8
return strings.Join([]string{
bucket.prefix.RawString()[:prefixLen],
randomString(20 - prefixLen),
}, "")
} | [
"func",
"(",
"bucket",
"*",
"kbucket",
")",
"RandomChildID",
"(",
")",
"string",
"{",
"prefixLen",
":=",
"bucket",
".",
"prefix",
".",
"Size",
"/",
"8",
"\n",
"return",
"strings",
".",
"Join",
"(",
"[",
"]",
"string",
"{",
"bucket",
".",
"prefix",
".... | // RandomChildID returns a random id that has the same prefix with bucket. | [
"RandomChildID",
"returns",
"a",
"random",
"id",
"that",
"has",
"the",
"same",
"prefix",
"with",
"bucket",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/routingtable.go#L177-L184 | train |
shiyanhui/dht | routingtable.go | UpdateTimestamp | func (bucket *kbucket) UpdateTimestamp() {
bucket.Lock()
defer bucket.Unlock()
bucket.lastChanged = time.Now()
} | go | func (bucket *kbucket) UpdateTimestamp() {
bucket.Lock()
defer bucket.Unlock()
bucket.lastChanged = time.Now()
} | [
"func",
"(",
"bucket",
"*",
"kbucket",
")",
"UpdateTimestamp",
"(",
")",
"{",
"bucket",
".",
"Lock",
"(",
")",
"\n",
"defer",
"bucket",
".",
"Unlock",
"(",
")",
"\n",
"bucket",
".",
"lastChanged",
"=",
"time",
".",
"Now",
"(",
")",
"\n",
"}"
] | // UpdateTimestamp update bucket's last changed time.. | [
"UpdateTimestamp",
"update",
"bucket",
"s",
"last",
"changed",
"time",
".."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/routingtable.go#L187-L192 | train |
shiyanhui/dht | routingtable.go | Insert | func (bucket *kbucket) Insert(no *node) bool {
isNew := !bucket.nodes.HasKey(no.id.RawString())
bucket.nodes.Push(no.id.RawString(), no)
bucket.UpdateTimestamp()
return isNew
} | go | func (bucket *kbucket) Insert(no *node) bool {
isNew := !bucket.nodes.HasKey(no.id.RawString())
bucket.nodes.Push(no.id.RawString(), no)
bucket.UpdateTimestamp()
return isNew
} | [
"func",
"(",
"bucket",
"*",
"kbucket",
")",
"Insert",
"(",
"no",
"*",
"node",
")",
"bool",
"{",
"isNew",
":=",
"!",
"bucket",
".",
"nodes",
".",
"HasKey",
"(",
"no",
".",
"id",
".",
"RawString",
"(",
")",
")",
"\n",
"bucket",
".",
"nodes",
".",
... | // Insert inserts node to the bucket. It returns whether the node is new in
// the bucket. | [
"Insert",
"inserts",
"node",
"to",
"the",
"bucket",
".",
"It",
"returns",
"whether",
"the",
"node",
"is",
"new",
"in",
"the",
"bucket",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/routingtable.go#L196-L203 | train |
shiyanhui/dht | routingtable.go | Fresh | func (bucket *kbucket) Fresh(dht *DHT) {
for e := range bucket.nodes.Iter() {
no := e.Value.(*node)
if time.Since(no.lastActiveTime) > dht.NodeExpriedAfter {
dht.transactionManager.ping(no)
}
}
} | go | func (bucket *kbucket) Fresh(dht *DHT) {
for e := range bucket.nodes.Iter() {
no := e.Value.(*node)
if time.Since(no.lastActiveTime) > dht.NodeExpriedAfter {
dht.transactionManager.ping(no)
}
}
} | [
"func",
"(",
"bucket",
"*",
"kbucket",
")",
"Fresh",
"(",
"dht",
"*",
"DHT",
")",
"{",
"for",
"e",
":=",
"range",
"bucket",
".",
"nodes",
".",
"Iter",
"(",
")",
"{",
"no",
":=",
"e",
".",
"Value",
".",
"(",
"*",
"node",
")",
"\n",
"if",
"time... | // Fresh pings the expired nodes in the bucket. | [
"Fresh",
"pings",
"the",
"expired",
"nodes",
"in",
"the",
"bucket",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/routingtable.go#L233-L240 | train |
shiyanhui/dht | routingtable.go | newRoutingTableNode | func newRoutingTableNode(prefix *bitmap) *routingTableNode {
return &routingTableNode{
children: make([]*routingTableNode, 2),
bucket: newKBucket(prefix),
}
} | go | func newRoutingTableNode(prefix *bitmap) *routingTableNode {
return &routingTableNode{
children: make([]*routingTableNode, 2),
bucket: newKBucket(prefix),
}
} | [
"func",
"newRoutingTableNode",
"(",
"prefix",
"*",
"bitmap",
")",
"*",
"routingTableNode",
"{",
"return",
"&",
"routingTableNode",
"{",
"children",
":",
"make",
"(",
"[",
"]",
"*",
"routingTableNode",
",",
"2",
")",
",",
"bucket",
":",
"newKBucket",
"(",
"... | // newRoutingTableNode returns a new routingTableNode pointer. | [
"newRoutingTableNode",
"returns",
"a",
"new",
"routingTableNode",
"pointer",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/routingtable.go#L250-L255 | train |
shiyanhui/dht | routingtable.go | Child | func (tableNode *routingTableNode) Child(index int) *routingTableNode {
if index >= 2 {
return nil
}
tableNode.RLock()
defer tableNode.RUnlock()
return tableNode.children[index]
} | go | func (tableNode *routingTableNode) Child(index int) *routingTableNode {
if index >= 2 {
return nil
}
tableNode.RLock()
defer tableNode.RUnlock()
return tableNode.children[index]
} | [
"func",
"(",
"tableNode",
"*",
"routingTableNode",
")",
"Child",
"(",
"index",
"int",
")",
"*",
"routingTableNode",
"{",
"if",
"index",
">=",
"2",
"{",
"return",
"nil",
"\n",
"}",
"\n",
"tableNode",
".",
"RLock",
"(",
")",
"\n",
"defer",
"tableNode",
"... | // Child returns routingTableNode's left or right child. | [
"Child",
"returns",
"routingTableNode",
"s",
"left",
"or",
"right",
"child",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/routingtable.go#L258-L267 | train |
shiyanhui/dht | routingtable.go | SetChild | func (tableNode *routingTableNode) SetChild(index int, c *routingTableNode) {
tableNode.Lock()
defer tableNode.Unlock()
tableNode.children[index] = c
} | go | func (tableNode *routingTableNode) SetChild(index int, c *routingTableNode) {
tableNode.Lock()
defer tableNode.Unlock()
tableNode.children[index] = c
} | [
"func",
"(",
"tableNode",
"*",
"routingTableNode",
")",
"SetChild",
"(",
"index",
"int",
",",
"c",
"*",
"routingTableNode",
")",
"{",
"tableNode",
".",
"Lock",
"(",
")",
"\n",
"defer",
"tableNode",
".",
"Unlock",
"(",
")",
"\n",
"tableNode",
".",
"childr... | // SetChild sets routingTableNode's left or right child. When index is 0, it's
// the left child, if 1, it's the right child. | [
"SetChild",
"sets",
"routingTableNode",
"s",
"left",
"or",
"right",
"child",
".",
"When",
"index",
"is",
"0",
"it",
"s",
"the",
"left",
"child",
"if",
"1",
"it",
"s",
"the",
"right",
"child",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/routingtable.go#L271-L276 | train |
shiyanhui/dht | routingtable.go | KBucket | func (tableNode *routingTableNode) KBucket() *kbucket {
tableNode.RLock()
defer tableNode.RUnlock()
return tableNode.bucket
} | go | func (tableNode *routingTableNode) KBucket() *kbucket {
tableNode.RLock()
defer tableNode.RUnlock()
return tableNode.bucket
} | [
"func",
"(",
"tableNode",
"*",
"routingTableNode",
")",
"KBucket",
"(",
")",
"*",
"kbucket",
"{",
"tableNode",
".",
"RLock",
"(",
")",
"\n",
"defer",
"tableNode",
".",
"RUnlock",
"(",
")",
"\n",
"return",
"tableNode",
".",
"bucket",
"\n",
"}"
] | // KBucket returns the bucket routingTableNode holds. | [
"KBucket",
"returns",
"the",
"bucket",
"routingTableNode",
"holds",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/routingtable.go#L279-L284 | train |
shiyanhui/dht | routingtable.go | SetKBucket | func (tableNode *routingTableNode) SetKBucket(bucket *kbucket) {
tableNode.Lock()
defer tableNode.Unlock()
tableNode.bucket = bucket
} | go | func (tableNode *routingTableNode) SetKBucket(bucket *kbucket) {
tableNode.Lock()
defer tableNode.Unlock()
tableNode.bucket = bucket
} | [
"func",
"(",
"tableNode",
"*",
"routingTableNode",
")",
"SetKBucket",
"(",
"bucket",
"*",
"kbucket",
")",
"{",
"tableNode",
".",
"Lock",
"(",
")",
"\n",
"defer",
"tableNode",
".",
"Unlock",
"(",
")",
"\n",
"tableNode",
".",
"bucket",
"=",
"bucket",
"\n",... | // SetKBucket sets the bucket. | [
"SetKBucket",
"sets",
"the",
"bucket",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/routingtable.go#L287-L292 | train |
shiyanhui/dht | routingtable.go | Split | func (tableNode *routingTableNode) Split() {
prefixLen := tableNode.KBucket().prefix.Size
if prefixLen == maxPrefixLength {
return
}
for i := 0; i < 2; i++ {
tableNode.SetChild(i, newRoutingTableNode(newBitmapFrom(
tableNode.KBucket().prefix, prefixLen+1)))
}
tableNode.Lock()
tableNode.children[1].bucket.prefix.Set(prefixLen)
tableNode.Unlock()
for e := range tableNode.KBucket().nodes.Iter() {
nd := e.Value.(*node)
tableNode.Child(nd.id.Bit(prefixLen)).KBucket().nodes.PushBack(nd)
}
for e := range tableNode.KBucket().candidates.Iter() {
nd := e.Value.(*node)
tableNode.Child(nd.id.Bit(prefixLen)).KBucket().candidates.PushBack(nd)
}
for i := 0; i < 2; i++ {
tableNode.Child(i).KBucket().UpdateTimestamp()
}
} | go | func (tableNode *routingTableNode) Split() {
prefixLen := tableNode.KBucket().prefix.Size
if prefixLen == maxPrefixLength {
return
}
for i := 0; i < 2; i++ {
tableNode.SetChild(i, newRoutingTableNode(newBitmapFrom(
tableNode.KBucket().prefix, prefixLen+1)))
}
tableNode.Lock()
tableNode.children[1].bucket.prefix.Set(prefixLen)
tableNode.Unlock()
for e := range tableNode.KBucket().nodes.Iter() {
nd := e.Value.(*node)
tableNode.Child(nd.id.Bit(prefixLen)).KBucket().nodes.PushBack(nd)
}
for e := range tableNode.KBucket().candidates.Iter() {
nd := e.Value.(*node)
tableNode.Child(nd.id.Bit(prefixLen)).KBucket().candidates.PushBack(nd)
}
for i := 0; i < 2; i++ {
tableNode.Child(i).KBucket().UpdateTimestamp()
}
} | [
"func",
"(",
"tableNode",
"*",
"routingTableNode",
")",
"Split",
"(",
")",
"{",
"prefixLen",
":=",
"tableNode",
".",
"KBucket",
"(",
")",
".",
"prefix",
".",
"Size",
"\n",
"if",
"prefixLen",
"==",
"maxPrefixLength",
"{",
"return",
"\n",
"}",
"\n",
"for",... | // Split splits current routingTableNode and sets it's two children. | [
"Split",
"splits",
"current",
"routingTableNode",
"and",
"sets",
"it",
"s",
"two",
"children",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/routingtable.go#L295-L324 | train |
shiyanhui/dht | routingtable.go | newRoutingTable | func newRoutingTable(k int, dht *DHT) *routingTable {
root := newRoutingTableNode(newBitmap(0))
rt := &routingTable{
RWMutex: &sync.RWMutex{},
k: k,
root: root,
cachedNodes: newSyncedMap(),
cachedKBuckets: newKeyedDeque(),
dht: dht,
clearQueue: newSyncedList(),
}
rt.cachedKBuckets.Push(root.bucket.prefix.String(), root.bucket)
return rt
} | go | func newRoutingTable(k int, dht *DHT) *routingTable {
root := newRoutingTableNode(newBitmap(0))
rt := &routingTable{
RWMutex: &sync.RWMutex{},
k: k,
root: root,
cachedNodes: newSyncedMap(),
cachedKBuckets: newKeyedDeque(),
dht: dht,
clearQueue: newSyncedList(),
}
rt.cachedKBuckets.Push(root.bucket.prefix.String(), root.bucket)
return rt
} | [
"func",
"newRoutingTable",
"(",
"k",
"int",
",",
"dht",
"*",
"DHT",
")",
"*",
"routingTable",
"{",
"root",
":=",
"newRoutingTableNode",
"(",
"newBitmap",
"(",
"0",
")",
")",
"\n",
"rt",
":=",
"&",
"routingTable",
"{",
"RWMutex",
":",
"&",
"sync",
".",
... | // newRoutingTable returns a new routingTable pointer. | [
"newRoutingTable",
"returns",
"a",
"new",
"routingTable",
"pointer",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/routingtable.go#L338-L353 | train |
shiyanhui/dht | routingtable.go | Insert | func (rt *routingTable) Insert(nd *node) bool {
rt.Lock()
defer rt.Unlock()
if rt.dht.blackList.in(nd.addr.IP.String(), nd.addr.Port) ||
rt.cachedNodes.Len() >= rt.dht.MaxNodes {
return false
}
var (
next *routingTableNode
bucket *kbucket
)
root := rt.root
for prefixLen := 1; prefixLen <= maxPrefixLength; prefixLen++ {
next = root.Child(nd.id.Bit(prefixLen - 1))
if next != nil {
// If next is not the leaf.
root = next
} else if root.KBucket().nodes.Len() < rt.k ||
root.KBucket().nodes.HasKey(nd.id.RawString()) {
bucket = root.KBucket()
isNew := bucket.Insert(nd)
rt.cachedNodes.Set(nd.addr.String(), nd)
rt.cachedKBuckets.Push(bucket.prefix.String(), bucket)
return isNew
} else if root.KBucket().prefix.Compare(nd.id, prefixLen-1) == 0 {
// If node has the same prefix with bucket, split it.
root.Split()
rt.cachedKBuckets.Delete(root.KBucket().prefix.String())
root.SetKBucket(nil)
for i := 0; i < 2; i++ {
bucket = root.Child(i).KBucket()
rt.cachedKBuckets.Push(bucket.prefix.String(), bucket)
}
root = root.Child(nd.id.Bit(prefixLen - 1))
} else {
// Finally, store node as a candidate and fresh the bucket.
root.KBucket().candidates.PushBack(nd)
if root.KBucket().candidates.Len() > rt.k {
root.KBucket().candidates.Remove(
root.KBucket().candidates.Front())
}
go root.KBucket().Fresh(rt.dht)
return false
}
}
return false
} | go | func (rt *routingTable) Insert(nd *node) bool {
rt.Lock()
defer rt.Unlock()
if rt.dht.blackList.in(nd.addr.IP.String(), nd.addr.Port) ||
rt.cachedNodes.Len() >= rt.dht.MaxNodes {
return false
}
var (
next *routingTableNode
bucket *kbucket
)
root := rt.root
for prefixLen := 1; prefixLen <= maxPrefixLength; prefixLen++ {
next = root.Child(nd.id.Bit(prefixLen - 1))
if next != nil {
// If next is not the leaf.
root = next
} else if root.KBucket().nodes.Len() < rt.k ||
root.KBucket().nodes.HasKey(nd.id.RawString()) {
bucket = root.KBucket()
isNew := bucket.Insert(nd)
rt.cachedNodes.Set(nd.addr.String(), nd)
rt.cachedKBuckets.Push(bucket.prefix.String(), bucket)
return isNew
} else if root.KBucket().prefix.Compare(nd.id, prefixLen-1) == 0 {
// If node has the same prefix with bucket, split it.
root.Split()
rt.cachedKBuckets.Delete(root.KBucket().prefix.String())
root.SetKBucket(nil)
for i := 0; i < 2; i++ {
bucket = root.Child(i).KBucket()
rt.cachedKBuckets.Push(bucket.prefix.String(), bucket)
}
root = root.Child(nd.id.Bit(prefixLen - 1))
} else {
// Finally, store node as a candidate and fresh the bucket.
root.KBucket().candidates.PushBack(nd)
if root.KBucket().candidates.Len() > rt.k {
root.KBucket().candidates.Remove(
root.KBucket().candidates.Front())
}
go root.KBucket().Fresh(rt.dht)
return false
}
}
return false
} | [
"func",
"(",
"rt",
"*",
"routingTable",
")",
"Insert",
"(",
"nd",
"*",
"node",
")",
"bool",
"{",
"rt",
".",
"Lock",
"(",
")",
"\n",
"defer",
"rt",
".",
"Unlock",
"(",
")",
"\n",
"if",
"rt",
".",
"dht",
".",
"blackList",
".",
"in",
"(",
"nd",
... | // Insert adds a node to routing table. It returns whether the node is new
// in the routingtable. | [
"Insert",
"adds",
"a",
"node",
"to",
"routing",
"table",
".",
"It",
"returns",
"whether",
"the",
"node",
"is",
"new",
"in",
"the",
"routingtable",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/routingtable.go#L357-L415 | train |
shiyanhui/dht | routingtable.go | GetNeighbors | func (rt *routingTable) GetNeighbors(id *bitmap, size int) []*node {
rt.RLock()
nodes := make([]interface{}, 0, rt.cachedNodes.Len())
for item := range rt.cachedNodes.Iter() {
nodes = append(nodes, item.val.(*node))
}
rt.RUnlock()
neighbors := getTopK(nodes, id, size)
result := make([]*node, len(neighbors))
for i, nd := range neighbors {
result[i] = nd.(*node)
}
return result
} | go | func (rt *routingTable) GetNeighbors(id *bitmap, size int) []*node {
rt.RLock()
nodes := make([]interface{}, 0, rt.cachedNodes.Len())
for item := range rt.cachedNodes.Iter() {
nodes = append(nodes, item.val.(*node))
}
rt.RUnlock()
neighbors := getTopK(nodes, id, size)
result := make([]*node, len(neighbors))
for i, nd := range neighbors {
result[i] = nd.(*node)
}
return result
} | [
"func",
"(",
"rt",
"*",
"routingTable",
")",
"GetNeighbors",
"(",
"id",
"*",
"bitmap",
",",
"size",
"int",
")",
"[",
"]",
"*",
"node",
"{",
"rt",
".",
"RLock",
"(",
")",
"\n",
"nodes",
":=",
"make",
"(",
"[",
"]",
"interface",
"{",
"}",
",",
"0... | // GetNeighbors returns the size-length nodes closest to id. | [
"GetNeighbors",
"returns",
"the",
"size",
"-",
"length",
"nodes",
"closest",
"to",
"id",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/routingtable.go#L418-L433 | train |
shiyanhui/dht | routingtable.go | GetNeighborCompactInfos | func (rt *routingTable) GetNeighborCompactInfos(id *bitmap, size int) []string {
neighbors := rt.GetNeighbors(id, size)
infos := make([]string, len(neighbors))
for i, no := range neighbors {
infos[i] = no.CompactNodeInfo()
}
return infos
} | go | func (rt *routingTable) GetNeighborCompactInfos(id *bitmap, size int) []string {
neighbors := rt.GetNeighbors(id, size)
infos := make([]string, len(neighbors))
for i, no := range neighbors {
infos[i] = no.CompactNodeInfo()
}
return infos
} | [
"func",
"(",
"rt",
"*",
"routingTable",
")",
"GetNeighborCompactInfos",
"(",
"id",
"*",
"bitmap",
",",
"size",
"int",
")",
"[",
"]",
"string",
"{",
"neighbors",
":=",
"rt",
".",
"GetNeighbors",
"(",
"id",
",",
"size",
")",
"\n",
"infos",
":=",
"make",
... | // GetNeighborIds return the size-length compact node info closest to id. | [
"GetNeighborIds",
"return",
"the",
"size",
"-",
"length",
"compact",
"node",
"info",
"closest",
"to",
"id",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/routingtable.go#L436-L445 | train |
shiyanhui/dht | routingtable.go | GetNodeKBucktByID | func (rt *routingTable) GetNodeKBucktByID(id *bitmap) (
nd *node, bucket *kbucket) {
rt.RLock()
defer rt.RUnlock()
var next *routingTableNode
root := rt.root
for prefixLen := 1; prefixLen <= maxPrefixLength; prefixLen++ {
next = root.Child(id.Bit(prefixLen - 1))
if next == nil {
v, ok := root.KBucket().nodes.Get(id.RawString())
if !ok {
return
}
nd, bucket = v.Value.(*node), root.KBucket()
return
}
root = next
}
return
} | go | func (rt *routingTable) GetNodeKBucktByID(id *bitmap) (
nd *node, bucket *kbucket) {
rt.RLock()
defer rt.RUnlock()
var next *routingTableNode
root := rt.root
for prefixLen := 1; prefixLen <= maxPrefixLength; prefixLen++ {
next = root.Child(id.Bit(prefixLen - 1))
if next == nil {
v, ok := root.KBucket().nodes.Get(id.RawString())
if !ok {
return
}
nd, bucket = v.Value.(*node), root.KBucket()
return
}
root = next
}
return
} | [
"func",
"(",
"rt",
"*",
"routingTable",
")",
"GetNodeKBucktByID",
"(",
"id",
"*",
"bitmap",
")",
"(",
"nd",
"*",
"node",
",",
"bucket",
"*",
"kbucket",
")",
"{",
"rt",
".",
"RLock",
"(",
")",
"\n",
"defer",
"rt",
".",
"RUnlock",
"(",
")",
"\n",
"... | // GetNodeKBucktById returns node whose id is `id` and the bucket it
// belongs to. | [
"GetNodeKBucktById",
"returns",
"node",
"whose",
"id",
"is",
"id",
"and",
"the",
"bucket",
"it",
"belongs",
"to",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/routingtable.go#L449-L471 | train |
shiyanhui/dht | routingtable.go | GetNodeByAddress | func (rt *routingTable) GetNodeByAddress(address string) (no *node, ok bool) {
rt.RLock()
defer rt.RUnlock()
v, ok := rt.cachedNodes.Get(address)
if ok {
no = v.(*node)
}
return
} | go | func (rt *routingTable) GetNodeByAddress(address string) (no *node, ok bool) {
rt.RLock()
defer rt.RUnlock()
v, ok := rt.cachedNodes.Get(address)
if ok {
no = v.(*node)
}
return
} | [
"func",
"(",
"rt",
"*",
"routingTable",
")",
"GetNodeByAddress",
"(",
"address",
"string",
")",
"(",
"no",
"*",
"node",
",",
"ok",
"bool",
")",
"{",
"rt",
".",
"RLock",
"(",
")",
"\n",
"defer",
"rt",
".",
"RUnlock",
"(",
")",
"\n",
"v",
",",
"ok"... | // GetNodeByAddress finds node by address. | [
"GetNodeByAddress",
"finds",
"node",
"by",
"address",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/routingtable.go#L474-L483 | train |
shiyanhui/dht | routingtable.go | Remove | func (rt *routingTable) Remove(id *bitmap) {
if nd, bucket := rt.GetNodeKBucktByID(id); nd != nil {
bucket.Replace(nd)
rt.cachedNodes.Delete(nd.addr.String())
rt.cachedKBuckets.Push(bucket.prefix.String(), bucket)
}
} | go | func (rt *routingTable) Remove(id *bitmap) {
if nd, bucket := rt.GetNodeKBucktByID(id); nd != nil {
bucket.Replace(nd)
rt.cachedNodes.Delete(nd.addr.String())
rt.cachedKBuckets.Push(bucket.prefix.String(), bucket)
}
} | [
"func",
"(",
"rt",
"*",
"routingTable",
")",
"Remove",
"(",
"id",
"*",
"bitmap",
")",
"{",
"if",
"nd",
",",
"bucket",
":=",
"rt",
".",
"GetNodeKBucktByID",
"(",
"id",
")",
";",
"nd",
"!=",
"nil",
"{",
"bucket",
".",
"Replace",
"(",
"nd",
")",
"\n... | // Remove deletes the node whose id is `id`. | [
"Remove",
"deletes",
"the",
"node",
"whose",
"id",
"is",
"id",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/routingtable.go#L486-L492 | train |
shiyanhui/dht | routingtable.go | Fresh | func (rt *routingTable) Fresh() {
now := time.Now()
for e := range rt.cachedKBuckets.Iter() {
bucket := e.Value.(*kbucket)
if now.Sub(bucket.LastChanged()) < rt.dht.KBucketExpiredAfter ||
bucket.nodes.Len() == 0 {
continue
}
i := 0
for e := range bucket.nodes.Iter() {
if i < rt.dht.RefreshNodeNum {
no := e.Value.(*node)
rt.dht.transactionManager.findNode(no, bucket.RandomChildID())
rt.clearQueue.PushBack(no)
}
i++
}
}
if rt.dht.IsCrawlMode() {
for e := range rt.clearQueue.Iter() {
rt.Remove(e.Value.(*node).id)
}
}
rt.clearQueue.Clear()
} | go | func (rt *routingTable) Fresh() {
now := time.Now()
for e := range rt.cachedKBuckets.Iter() {
bucket := e.Value.(*kbucket)
if now.Sub(bucket.LastChanged()) < rt.dht.KBucketExpiredAfter ||
bucket.nodes.Len() == 0 {
continue
}
i := 0
for e := range bucket.nodes.Iter() {
if i < rt.dht.RefreshNodeNum {
no := e.Value.(*node)
rt.dht.transactionManager.findNode(no, bucket.RandomChildID())
rt.clearQueue.PushBack(no)
}
i++
}
}
if rt.dht.IsCrawlMode() {
for e := range rt.clearQueue.Iter() {
rt.Remove(e.Value.(*node).id)
}
}
rt.clearQueue.Clear()
} | [
"func",
"(",
"rt",
"*",
"routingTable",
")",
"Fresh",
"(",
")",
"{",
"now",
":=",
"time",
".",
"Now",
"(",
")",
"\n",
"for",
"e",
":=",
"range",
"rt",
".",
"cachedKBuckets",
".",
"Iter",
"(",
")",
"{",
"bucket",
":=",
"e",
".",
"Value",
".",
"(... | // Fresh sends findNode to all nodes in the expired nodes. | [
"Fresh",
"sends",
"findNode",
"to",
"all",
"nodes",
"in",
"the",
"expired",
"nodes",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/routingtable.go#L503-L531 | train |
shiyanhui/dht | routingtable.go | Len | func (rt *routingTable) Len() int {
rt.RLock()
defer rt.RUnlock()
return rt.cachedNodes.Len()
} | go | func (rt *routingTable) Len() int {
rt.RLock()
defer rt.RUnlock()
return rt.cachedNodes.Len()
} | [
"func",
"(",
"rt",
"*",
"routingTable",
")",
"Len",
"(",
")",
"int",
"{",
"rt",
".",
"RLock",
"(",
")",
"\n",
"defer",
"rt",
".",
"RUnlock",
"(",
")",
"\n",
"return",
"rt",
".",
"cachedNodes",
".",
"Len",
"(",
")",
"\n",
"}"
] | // Len returns the number of nodes in table. | [
"Len",
"returns",
"the",
"number",
"of",
"nodes",
"in",
"table",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/routingtable.go#L534-L539 | train |
shiyanhui/dht | bencode.go | find | func find(data []byte, start int, target rune) (index int) {
index = bytes.IndexRune(data[start:], target)
if index != -1 {
return index + start
}
return index
} | go | func find(data []byte, start int, target rune) (index int) {
index = bytes.IndexRune(data[start:], target)
if index != -1 {
return index + start
}
return index
} | [
"func",
"find",
"(",
"data",
"[",
"]",
"byte",
",",
"start",
"int",
",",
"target",
"rune",
")",
"(",
"index",
"int",
")",
"{",
"index",
"=",
"bytes",
".",
"IndexRune",
"(",
"data",
"[",
"start",
":",
"]",
",",
"target",
")",
"\n",
"if",
"index",
... | // find returns the index of first target in data starting from `start`.
// It returns -1 if target not found. | [
"find",
"returns",
"the",
"index",
"of",
"first",
"target",
"in",
"data",
"starting",
"from",
"start",
".",
"It",
"returns",
"-",
"1",
"if",
"target",
"not",
"found",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/bencode.go#L14-L20 | train |
shiyanhui/dht | bencode.go | DecodeInt | func DecodeInt(data []byte, start int) (
result interface{}, index int, err error) {
if start >= len(data) || data[start] != 'i' {
err = errors.New("invalid int bencode")
return
}
index = find(data, start+1, 'e')
if index == -1 {
err = errors.New("':' not found when decode int")
return
}
result, err = strconv.Atoi(string(data[start+1 : index]))
if err != nil {
return
}
index++
return
} | go | func DecodeInt(data []byte, start int) (
result interface{}, index int, err error) {
if start >= len(data) || data[start] != 'i' {
err = errors.New("invalid int bencode")
return
}
index = find(data, start+1, 'e')
if index == -1 {
err = errors.New("':' not found when decode int")
return
}
result, err = strconv.Atoi(string(data[start+1 : index]))
if err != nil {
return
}
index++
return
} | [
"func",
"DecodeInt",
"(",
"data",
"[",
"]",
"byte",
",",
"start",
"int",
")",
"(",
"result",
"interface",
"{",
"}",
",",
"index",
"int",
",",
"err",
"error",
")",
"{",
"if",
"start",
">=",
"len",
"(",
"data",
")",
"||",
"data",
"[",
"start",
"]",... | // DecodeInt decodes int value in the data. | [
"DecodeInt",
"decodes",
"int",
"value",
"in",
"the",
"data",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/bencode.go#L60-L82 | train |
shiyanhui/dht | bencode.go | decodeItem | func decodeItem(data []byte, i int) (
result interface{}, index int, err error) {
var decodeFunc = []func([]byte, int) (interface{}, int, error){
DecodeString, DecodeInt, DecodeList, DecodeDict,
}
for _, f := range decodeFunc {
result, index, err = f(data, i)
if err == nil {
return
}
}
err = errors.New("invalid bencode when decode item")
return
} | go | func decodeItem(data []byte, i int) (
result interface{}, index int, err error) {
var decodeFunc = []func([]byte, int) (interface{}, int, error){
DecodeString, DecodeInt, DecodeList, DecodeDict,
}
for _, f := range decodeFunc {
result, index, err = f(data, i)
if err == nil {
return
}
}
err = errors.New("invalid bencode when decode item")
return
} | [
"func",
"decodeItem",
"(",
"data",
"[",
"]",
"byte",
",",
"i",
"int",
")",
"(",
"result",
"interface",
"{",
"}",
",",
"index",
"int",
",",
"err",
"error",
")",
"{",
"var",
"decodeFunc",
"=",
"[",
"]",
"func",
"(",
"[",
"]",
"byte",
",",
"int",
... | // decodeItem decodes an item of dict or list. | [
"decodeItem",
"decodes",
"an",
"item",
"of",
"dict",
"or",
"list",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/bencode.go#L85-L101 | train |
shiyanhui/dht | bencode.go | DecodeList | func DecodeList(data []byte, start int) (
result interface{}, index int, err error) {
if start >= len(data) || data[start] != 'l' {
err = errors.New("invalid list bencode")
return
}
var item interface{}
r := make([]interface{}, 0, 8)
index = start + 1
for index < len(data) {
char, _ := utf8.DecodeRune(data[index:])
if char == 'e' {
break
}
item, index, err = decodeItem(data, index)
if err != nil {
return
}
r = append(r, item)
}
if index == len(data) {
err = errors.New("'e' not found when decode list")
return
}
index++
result = r
return
} | go | func DecodeList(data []byte, start int) (
result interface{}, index int, err error) {
if start >= len(data) || data[start] != 'l' {
err = errors.New("invalid list bencode")
return
}
var item interface{}
r := make([]interface{}, 0, 8)
index = start + 1
for index < len(data) {
char, _ := utf8.DecodeRune(data[index:])
if char == 'e' {
break
}
item, index, err = decodeItem(data, index)
if err != nil {
return
}
r = append(r, item)
}
if index == len(data) {
err = errors.New("'e' not found when decode list")
return
}
index++
result = r
return
} | [
"func",
"DecodeList",
"(",
"data",
"[",
"]",
"byte",
",",
"start",
"int",
")",
"(",
"result",
"interface",
"{",
"}",
",",
"index",
"int",
",",
"err",
"error",
")",
"{",
"if",
"start",
">=",
"len",
"(",
"data",
")",
"||",
"data",
"[",
"start",
"]"... | // DecodeList decodes a list value. | [
"DecodeList",
"decodes",
"a",
"list",
"value",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/bencode.go#L104-L137 | train |
shiyanhui/dht | bencode.go | DecodeDict | func DecodeDict(data []byte, start int) (
result interface{}, index int, err error) {
if start >= len(data) || data[start] != 'd' {
err = errors.New("invalid dict bencode")
return
}
var item, key interface{}
r := make(map[string]interface{})
index = start + 1
for index < len(data) {
char, _ := utf8.DecodeRune(data[index:])
if char == 'e' {
break
}
if !unicode.IsDigit(char) {
err = errors.New("invalid dict bencode")
return
}
key, index, err = DecodeString(data, index)
if err != nil {
return
}
if index >= len(data) {
err = errors.New("out of range")
return
}
item, index, err = decodeItem(data, index)
if err != nil {
return
}
r[key.(string)] = item
}
if index == len(data) {
err = errors.New("'e' not found when decode dict")
return
}
index++
result = r
return
} | go | func DecodeDict(data []byte, start int) (
result interface{}, index int, err error) {
if start >= len(data) || data[start] != 'd' {
err = errors.New("invalid dict bencode")
return
}
var item, key interface{}
r := make(map[string]interface{})
index = start + 1
for index < len(data) {
char, _ := utf8.DecodeRune(data[index:])
if char == 'e' {
break
}
if !unicode.IsDigit(char) {
err = errors.New("invalid dict bencode")
return
}
key, index, err = DecodeString(data, index)
if err != nil {
return
}
if index >= len(data) {
err = errors.New("out of range")
return
}
item, index, err = decodeItem(data, index)
if err != nil {
return
}
r[key.(string)] = item
}
if index == len(data) {
err = errors.New("'e' not found when decode dict")
return
}
index++
result = r
return
} | [
"func",
"DecodeDict",
"(",
"data",
"[",
"]",
"byte",
",",
"start",
"int",
")",
"(",
"result",
"interface",
"{",
"}",
",",
"index",
"int",
",",
"err",
"error",
")",
"{",
"if",
"start",
">=",
"len",
"(",
"data",
")",
"||",
"data",
"[",
"start",
"]"... | // DecodeDict decodes a map value. | [
"DecodeDict",
"decodes",
"a",
"map",
"value",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/bencode.go#L140-L189 | train |
shiyanhui/dht | bencode.go | Decode | func Decode(data []byte) (result interface{}, err error) {
result, _, err = decodeItem(data, 0)
return
} | go | func Decode(data []byte) (result interface{}, err error) {
result, _, err = decodeItem(data, 0)
return
} | [
"func",
"Decode",
"(",
"data",
"[",
"]",
"byte",
")",
"(",
"result",
"interface",
"{",
"}",
",",
"err",
"error",
")",
"{",
"result",
",",
"_",
",",
"err",
"=",
"decodeItem",
"(",
"data",
",",
"0",
")",
"\n",
"return",
"\n",
"}"
] | // Decode decodes a bencoded string to string, int, list or map. | [
"Decode",
"decodes",
"a",
"bencoded",
"string",
"to",
"string",
"int",
"list",
"or",
"map",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/bencode.go#L192-L195 | train |
shiyanhui/dht | bencode.go | EncodeString | func EncodeString(data string) string {
return strings.Join([]string{strconv.Itoa(len(data)), data}, ":")
} | go | func EncodeString(data string) string {
return strings.Join([]string{strconv.Itoa(len(data)), data}, ":")
} | [
"func",
"EncodeString",
"(",
"data",
"string",
")",
"string",
"{",
"return",
"strings",
".",
"Join",
"(",
"[",
"]",
"string",
"{",
"strconv",
".",
"Itoa",
"(",
"len",
"(",
"data",
")",
")",
",",
"data",
"}",
",",
"\":\"",
")",
"\n",
"}"
] | // EncodeString encodes a string value. | [
"EncodeString",
"encodes",
"a",
"string",
"value",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/bencode.go#L198-L200 | train |
shiyanhui/dht | bencode.go | EncodeInt | func EncodeInt(data int) string {
return strings.Join([]string{"i", strconv.Itoa(data), "e"}, "")
} | go | func EncodeInt(data int) string {
return strings.Join([]string{"i", strconv.Itoa(data), "e"}, "")
} | [
"func",
"EncodeInt",
"(",
"data",
"int",
")",
"string",
"{",
"return",
"strings",
".",
"Join",
"(",
"[",
"]",
"string",
"{",
"\"i\"",
",",
"strconv",
".",
"Itoa",
"(",
"data",
")",
",",
"\"e\"",
"}",
",",
"\"\"",
")",
"\n",
"}"
] | // EncodeInt encodes a int value. | [
"EncodeInt",
"encodes",
"a",
"int",
"value",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/bencode.go#L203-L205 | train |
shiyanhui/dht | bencode.go | encodeItem | func encodeItem(data interface{}) (item string) {
switch v := data.(type) {
case string:
item = EncodeString(v)
case int:
item = EncodeInt(v)
case []interface{}:
item = EncodeList(v)
case map[string]interface{}:
item = EncodeDict(v)
default:
panic("invalid type when encode item")
}
return
} | go | func encodeItem(data interface{}) (item string) {
switch v := data.(type) {
case string:
item = EncodeString(v)
case int:
item = EncodeInt(v)
case []interface{}:
item = EncodeList(v)
case map[string]interface{}:
item = EncodeDict(v)
default:
panic("invalid type when encode item")
}
return
} | [
"func",
"encodeItem",
"(",
"data",
"interface",
"{",
"}",
")",
"(",
"item",
"string",
")",
"{",
"switch",
"v",
":=",
"data",
".",
"(",
"type",
")",
"{",
"case",
"string",
":",
"item",
"=",
"EncodeString",
"(",
"v",
")",
"\n",
"case",
"int",
":",
... | // EncodeItem encodes an item of dict or list. | [
"EncodeItem",
"encodes",
"an",
"item",
"of",
"dict",
"or",
"list",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/bencode.go#L208-L222 | train |
shiyanhui/dht | bencode.go | EncodeList | func EncodeList(data []interface{}) string {
result := make([]string, len(data))
for i, item := range data {
result[i] = encodeItem(item)
}
return strings.Join([]string{"l", strings.Join(result, ""), "e"}, "")
} | go | func EncodeList(data []interface{}) string {
result := make([]string, len(data))
for i, item := range data {
result[i] = encodeItem(item)
}
return strings.Join([]string{"l", strings.Join(result, ""), "e"}, "")
} | [
"func",
"EncodeList",
"(",
"data",
"[",
"]",
"interface",
"{",
"}",
")",
"string",
"{",
"result",
":=",
"make",
"(",
"[",
"]",
"string",
",",
"len",
"(",
"data",
")",
")",
"\n",
"for",
"i",
",",
"item",
":=",
"range",
"data",
"{",
"result",
"[",
... | // EncodeList encodes a list value. | [
"EncodeList",
"encodes",
"a",
"list",
"value",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/bencode.go#L225-L233 | train |
shiyanhui/dht | bencode.go | EncodeDict | func EncodeDict(data map[string]interface{}) string {
result, i := make([]string, len(data)), 0
for key, val := range data {
result[i] = strings.Join(
[]string{EncodeString(key), encodeItem(val)},
"")
i++
}
return strings.Join([]string{"d", strings.Join(result, ""), "e"}, "")
} | go | func EncodeDict(data map[string]interface{}) string {
result, i := make([]string, len(data)), 0
for key, val := range data {
result[i] = strings.Join(
[]string{EncodeString(key), encodeItem(val)},
"")
i++
}
return strings.Join([]string{"d", strings.Join(result, ""), "e"}, "")
} | [
"func",
"EncodeDict",
"(",
"data",
"map",
"[",
"string",
"]",
"interface",
"{",
"}",
")",
"string",
"{",
"result",
",",
"i",
":=",
"make",
"(",
"[",
"]",
"string",
",",
"len",
"(",
"data",
")",
")",
",",
"0",
"\n",
"for",
"key",
",",
"val",
":=... | // EncodeDict encodes a dict value. | [
"EncodeDict",
"encodes",
"a",
"dict",
"value",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/bencode.go#L236-L247 | train |
shiyanhui/dht | bencode.go | Encode | func Encode(data interface{}) string {
switch v := data.(type) {
case string:
return EncodeString(v)
case int:
return EncodeInt(v)
case []interface{}:
return EncodeList(v)
case map[string]interface{}:
return EncodeDict(v)
default:
panic("invalid type when encode")
}
} | go | func Encode(data interface{}) string {
switch v := data.(type) {
case string:
return EncodeString(v)
case int:
return EncodeInt(v)
case []interface{}:
return EncodeList(v)
case map[string]interface{}:
return EncodeDict(v)
default:
panic("invalid type when encode")
}
} | [
"func",
"Encode",
"(",
"data",
"interface",
"{",
"}",
")",
"string",
"{",
"switch",
"v",
":=",
"data",
".",
"(",
"type",
")",
"{",
"case",
"string",
":",
"return",
"EncodeString",
"(",
"v",
")",
"\n",
"case",
"int",
":",
"return",
"EncodeInt",
"(",
... | // Encode encodes a string, int, dict or list value to a bencoded string. | [
"Encode",
"encodes",
"a",
"string",
"int",
"dict",
"or",
"list",
"value",
"to",
"a",
"bencoded",
"string",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/bencode.go#L250-L263 | train |
shiyanhui/dht | container.go | Get | func (smap *syncedMap) Get(key interface{}) (val interface{}, ok bool) {
smap.RLock()
defer smap.RUnlock()
val, ok = smap.data[key]
return
} | go | func (smap *syncedMap) Get(key interface{}) (val interface{}, ok bool) {
smap.RLock()
defer smap.RUnlock()
val, ok = smap.data[key]
return
} | [
"func",
"(",
"smap",
"*",
"syncedMap",
")",
"Get",
"(",
"key",
"interface",
"{",
"}",
")",
"(",
"val",
"interface",
"{",
"}",
",",
"ok",
"bool",
")",
"{",
"smap",
".",
"RLock",
"(",
")",
"\n",
"defer",
"smap",
".",
"RUnlock",
"(",
")",
"\n",
"v... | // Get returns the value mapped to key. | [
"Get",
"returns",
"the",
"value",
"mapped",
"to",
"key",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/container.go#L28-L34 | train |
shiyanhui/dht | container.go | Has | func (smap *syncedMap) Has(key interface{}) bool {
_, ok := smap.Get(key)
return ok
} | go | func (smap *syncedMap) Has(key interface{}) bool {
_, ok := smap.Get(key)
return ok
} | [
"func",
"(",
"smap",
"*",
"syncedMap",
")",
"Has",
"(",
"key",
"interface",
"{",
"}",
")",
"bool",
"{",
"_",
",",
"ok",
":=",
"smap",
".",
"Get",
"(",
"key",
")",
"\n",
"return",
"ok",
"\n",
"}"
] | // Has returns whether the syncedMap contains the key. | [
"Has",
"returns",
"whether",
"the",
"syncedMap",
"contains",
"the",
"key",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/container.go#L37-L40 | train |
shiyanhui/dht | container.go | Delete | func (smap *syncedMap) Delete(key interface{}) {
smap.Lock()
defer smap.Unlock()
delete(smap.data, key)
} | go | func (smap *syncedMap) Delete(key interface{}) {
smap.Lock()
defer smap.Unlock()
delete(smap.data, key)
} | [
"func",
"(",
"smap",
"*",
"syncedMap",
")",
"Delete",
"(",
"key",
"interface",
"{",
"}",
")",
"{",
"smap",
".",
"Lock",
"(",
")",
"\n",
"defer",
"smap",
".",
"Unlock",
"(",
")",
"\n",
"delete",
"(",
"smap",
".",
"data",
",",
"key",
")",
"\n",
"... | // Delete deletes the key in the map. | [
"Delete",
"deletes",
"the",
"key",
"in",
"the",
"map",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/container.go#L51-L56 | train |
shiyanhui/dht | container.go | DeleteMulti | func (smap *syncedMap) DeleteMulti(keys []interface{}) {
smap.Lock()
defer smap.Unlock()
for _, key := range keys {
delete(smap.data, key)
}
} | go | func (smap *syncedMap) DeleteMulti(keys []interface{}) {
smap.Lock()
defer smap.Unlock()
for _, key := range keys {
delete(smap.data, key)
}
} | [
"func",
"(",
"smap",
"*",
"syncedMap",
")",
"DeleteMulti",
"(",
"keys",
"[",
"]",
"interface",
"{",
"}",
")",
"{",
"smap",
".",
"Lock",
"(",
")",
"\n",
"defer",
"smap",
".",
"Unlock",
"(",
")",
"\n",
"for",
"_",
",",
"key",
":=",
"range",
"keys",... | // DeleteMulti deletes keys in batch. | [
"DeleteMulti",
"deletes",
"keys",
"in",
"batch",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/container.go#L59-L66 | train |
shiyanhui/dht | container.go | Clear | func (smap *syncedMap) Clear() {
smap.Lock()
defer smap.Unlock()
smap.data = make(map[interface{}]interface{})
} | go | func (smap *syncedMap) Clear() {
smap.Lock()
defer smap.Unlock()
smap.data = make(map[interface{}]interface{})
} | [
"func",
"(",
"smap",
"*",
"syncedMap",
")",
"Clear",
"(",
")",
"{",
"smap",
".",
"Lock",
"(",
")",
"\n",
"defer",
"smap",
".",
"Unlock",
"(",
")",
"\n",
"smap",
".",
"data",
"=",
"make",
"(",
"map",
"[",
"interface",
"{",
"}",
"]",
"interface",
... | // Clear resets the data. | [
"Clear",
"resets",
"the",
"data",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/container.go#L69-L74 | train |
shiyanhui/dht | container.go | Iter | func (smap *syncedMap) Iter() <-chan mapItem {
ch := make(chan mapItem)
go func() {
smap.RLock()
for key, val := range smap.data {
ch <- mapItem{
key: key,
val: val,
}
}
smap.RUnlock()
close(ch)
}()
return ch
} | go | func (smap *syncedMap) Iter() <-chan mapItem {
ch := make(chan mapItem)
go func() {
smap.RLock()
for key, val := range smap.data {
ch <- mapItem{
key: key,
val: val,
}
}
smap.RUnlock()
close(ch)
}()
return ch
} | [
"func",
"(",
"smap",
"*",
"syncedMap",
")",
"Iter",
"(",
")",
"<-",
"chan",
"mapItem",
"{",
"ch",
":=",
"make",
"(",
"chan",
"mapItem",
")",
"\n",
"go",
"func",
"(",
")",
"{",
"smap",
".",
"RLock",
"(",
")",
"\n",
"for",
"key",
",",
"val",
":="... | // Iter returns a chan which output all items. | [
"Iter",
"returns",
"a",
"chan",
"which",
"output",
"all",
"items",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/container.go#L77-L91 | train |
shiyanhui/dht | container.go | Len | func (smap *syncedMap) Len() int {
smap.RLock()
defer smap.RUnlock()
return len(smap.data)
} | go | func (smap *syncedMap) Len() int {
smap.RLock()
defer smap.RUnlock()
return len(smap.data)
} | [
"func",
"(",
"smap",
"*",
"syncedMap",
")",
"Len",
"(",
")",
"int",
"{",
"smap",
".",
"RLock",
"(",
")",
"\n",
"defer",
"smap",
".",
"RUnlock",
"(",
")",
"\n",
"return",
"len",
"(",
"smap",
".",
"data",
")",
"\n",
"}"
] | // Len returns the length of syncedMap. | [
"Len",
"returns",
"the",
"length",
"of",
"syncedMap",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/container.go#L94-L99 | train |
shiyanhui/dht | container.go | Front | func (slist *syncedList) Front() *list.Element {
slist.RLock()
defer slist.RUnlock()
return slist.queue.Front()
} | go | func (slist *syncedList) Front() *list.Element {
slist.RLock()
defer slist.RUnlock()
return slist.queue.Front()
} | [
"func",
"(",
"slist",
"*",
"syncedList",
")",
"Front",
"(",
")",
"*",
"list",
".",
"Element",
"{",
"slist",
".",
"RLock",
"(",
")",
"\n",
"defer",
"slist",
".",
"RUnlock",
"(",
")",
"\n",
"return",
"slist",
".",
"queue",
".",
"Front",
"(",
")",
"... | // Front returns the first element of slist. | [
"Front",
"returns",
"the",
"first",
"element",
"of",
"slist",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/container.go#L116-L121 | train |
shiyanhui/dht | container.go | Back | func (slist *syncedList) Back() *list.Element {
slist.RLock()
defer slist.RUnlock()
return slist.queue.Back()
} | go | func (slist *syncedList) Back() *list.Element {
slist.RLock()
defer slist.RUnlock()
return slist.queue.Back()
} | [
"func",
"(",
"slist",
"*",
"syncedList",
")",
"Back",
"(",
")",
"*",
"list",
".",
"Element",
"{",
"slist",
".",
"RLock",
"(",
")",
"\n",
"defer",
"slist",
".",
"RUnlock",
"(",
")",
"\n",
"return",
"slist",
".",
"queue",
".",
"Back",
"(",
")",
"\n... | // Back returns the last element of slist. | [
"Back",
"returns",
"the",
"last",
"element",
"of",
"slist",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/container.go#L124-L129 | train |
shiyanhui/dht | container.go | PushFront | func (slist *syncedList) PushFront(v interface{}) *list.Element {
slist.Lock()
defer slist.Unlock()
return slist.queue.PushFront(v)
} | go | func (slist *syncedList) PushFront(v interface{}) *list.Element {
slist.Lock()
defer slist.Unlock()
return slist.queue.PushFront(v)
} | [
"func",
"(",
"slist",
"*",
"syncedList",
")",
"PushFront",
"(",
"v",
"interface",
"{",
"}",
")",
"*",
"list",
".",
"Element",
"{",
"slist",
".",
"Lock",
"(",
")",
"\n",
"defer",
"slist",
".",
"Unlock",
"(",
")",
"\n",
"return",
"slist",
".",
"queue... | // PushFront pushs an element to the head of slist. | [
"PushFront",
"pushs",
"an",
"element",
"to",
"the",
"head",
"of",
"slist",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/container.go#L132-L137 | train |
shiyanhui/dht | container.go | InsertBefore | func (slist *syncedList) InsertBefore(
v interface{}, mark *list.Element) *list.Element {
slist.Lock()
defer slist.Unlock()
return slist.queue.InsertBefore(v, mark)
} | go | func (slist *syncedList) InsertBefore(
v interface{}, mark *list.Element) *list.Element {
slist.Lock()
defer slist.Unlock()
return slist.queue.InsertBefore(v, mark)
} | [
"func",
"(",
"slist",
"*",
"syncedList",
")",
"InsertBefore",
"(",
"v",
"interface",
"{",
"}",
",",
"mark",
"*",
"list",
".",
"Element",
")",
"*",
"list",
".",
"Element",
"{",
"slist",
".",
"Lock",
"(",
")",
"\n",
"defer",
"slist",
".",
"Unlock",
"... | // InsertBefore inserts v before mark. | [
"InsertBefore",
"inserts",
"v",
"before",
"mark",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/container.go#L148-L155 | train |
shiyanhui/dht | container.go | Remove | func (slist *syncedList) Remove(e *list.Element) interface{} {
slist.Lock()
defer slist.Unlock()
return slist.queue.Remove(e)
} | go | func (slist *syncedList) Remove(e *list.Element) interface{} {
slist.Lock()
defer slist.Unlock()
return slist.queue.Remove(e)
} | [
"func",
"(",
"slist",
"*",
"syncedList",
")",
"Remove",
"(",
"e",
"*",
"list",
".",
"Element",
")",
"interface",
"{",
"}",
"{",
"slist",
".",
"Lock",
"(",
")",
"\n",
"defer",
"slist",
".",
"Unlock",
"(",
")",
"\n",
"return",
"slist",
".",
"queue",
... | // Remove removes e from the slist. | [
"Remove",
"removes",
"e",
"from",
"the",
"slist",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/container.go#L168-L173 | train |
shiyanhui/dht | container.go | Clear | func (slist *syncedList) Clear() {
slist.Lock()
defer slist.Unlock()
slist.queue.Init()
} | go | func (slist *syncedList) Clear() {
slist.Lock()
defer slist.Unlock()
slist.queue.Init()
} | [
"func",
"(",
"slist",
"*",
"syncedList",
")",
"Clear",
"(",
")",
"{",
"slist",
".",
"Lock",
"(",
")",
"\n",
"defer",
"slist",
".",
"Unlock",
"(",
")",
"\n",
"slist",
".",
"queue",
".",
"Init",
"(",
")",
"\n",
"}"
] | // Clear resets the list queue. | [
"Clear",
"resets",
"the",
"list",
"queue",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/container.go#L176-L181 | train |
shiyanhui/dht | container.go | Len | func (slist *syncedList) Len() int {
slist.RLock()
defer slist.RUnlock()
return slist.queue.Len()
} | go | func (slist *syncedList) Len() int {
slist.RLock()
defer slist.RUnlock()
return slist.queue.Len()
} | [
"func",
"(",
"slist",
"*",
"syncedList",
")",
"Len",
"(",
")",
"int",
"{",
"slist",
".",
"RLock",
"(",
")",
"\n",
"defer",
"slist",
".",
"RUnlock",
"(",
")",
"\n",
"return",
"slist",
".",
"queue",
".",
"Len",
"(",
")",
"\n",
"}"
] | // Len returns length of the slist. | [
"Len",
"returns",
"length",
"of",
"the",
"slist",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/container.go#L184-L189 | train |
shiyanhui/dht | container.go | Iter | func (slist *syncedList) Iter() <-chan *list.Element {
ch := make(chan *list.Element)
go func() {
slist.RLock()
for e := slist.queue.Front(); e != nil; e = e.Next() {
ch <- e
}
slist.RUnlock()
close(ch)
}()
return ch
} | go | func (slist *syncedList) Iter() <-chan *list.Element {
ch := make(chan *list.Element)
go func() {
slist.RLock()
for e := slist.queue.Front(); e != nil; e = e.Next() {
ch <- e
}
slist.RUnlock()
close(ch)
}()
return ch
} | [
"func",
"(",
"slist",
"*",
"syncedList",
")",
"Iter",
"(",
")",
"<-",
"chan",
"*",
"list",
".",
"Element",
"{",
"ch",
":=",
"make",
"(",
"chan",
"*",
"list",
".",
"Element",
")",
"\n",
"go",
"func",
"(",
")",
"{",
"slist",
".",
"RLock",
"(",
")... | // Iter returns a chan which output all elements. | [
"Iter",
"returns",
"a",
"chan",
"which",
"output",
"all",
"elements",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/container.go#L192-L203 | train |
shiyanhui/dht | container.go | newKeyedDeque | func newKeyedDeque() *keyedDeque {
return &keyedDeque{
RWMutex: &sync.RWMutex{},
syncedList: newSyncedList(),
index: make(map[interface{}]*list.Element),
invertedIndex: make(map[*list.Element]interface{}),
}
} | go | func newKeyedDeque() *keyedDeque {
return &keyedDeque{
RWMutex: &sync.RWMutex{},
syncedList: newSyncedList(),
index: make(map[interface{}]*list.Element),
invertedIndex: make(map[*list.Element]interface{}),
}
} | [
"func",
"newKeyedDeque",
"(",
")",
"*",
"keyedDeque",
"{",
"return",
"&",
"keyedDeque",
"{",
"RWMutex",
":",
"&",
"sync",
".",
"RWMutex",
"{",
"}",
",",
"syncedList",
":",
"newSyncedList",
"(",
")",
",",
"index",
":",
"make",
"(",
"map",
"[",
"interfac... | // newKeyedDeque returns a newKeyedDeque pointer. | [
"newKeyedDeque",
"returns",
"a",
"newKeyedDeque",
"pointer",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/container.go#L214-L221 | train |
shiyanhui/dht | container.go | Push | func (deque *keyedDeque) Push(key interface{}, val interface{}) {
deque.Lock()
defer deque.Unlock()
if e, ok := deque.index[key]; ok {
deque.syncedList.Remove(e)
}
deque.index[key] = deque.syncedList.PushBack(val)
deque.invertedIndex[deque.index[key]] = key
} | go | func (deque *keyedDeque) Push(key interface{}, val interface{}) {
deque.Lock()
defer deque.Unlock()
if e, ok := deque.index[key]; ok {
deque.syncedList.Remove(e)
}
deque.index[key] = deque.syncedList.PushBack(val)
deque.invertedIndex[deque.index[key]] = key
} | [
"func",
"(",
"deque",
"*",
"keyedDeque",
")",
"Push",
"(",
"key",
"interface",
"{",
"}",
",",
"val",
"interface",
"{",
"}",
")",
"{",
"deque",
".",
"Lock",
"(",
")",
"\n",
"defer",
"deque",
".",
"Unlock",
"(",
")",
"\n",
"if",
"e",
",",
"ok",
"... | // Push pushs a keyed-value to the end of deque. | [
"Push",
"pushs",
"a",
"keyed",
"-",
"value",
"to",
"the",
"end",
"of",
"deque",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/container.go#L224-L233 | train |
shiyanhui/dht | container.go | Get | func (deque *keyedDeque) Get(key interface{}) (*list.Element, bool) {
deque.RLock()
defer deque.RUnlock()
v, ok := deque.index[key]
return v, ok
} | go | func (deque *keyedDeque) Get(key interface{}) (*list.Element, bool) {
deque.RLock()
defer deque.RUnlock()
v, ok := deque.index[key]
return v, ok
} | [
"func",
"(",
"deque",
"*",
"keyedDeque",
")",
"Get",
"(",
"key",
"interface",
"{",
"}",
")",
"(",
"*",
"list",
".",
"Element",
",",
"bool",
")",
"{",
"deque",
".",
"RLock",
"(",
")",
"\n",
"defer",
"deque",
".",
"RUnlock",
"(",
")",
"\n",
"v",
... | // Get returns the keyed value. | [
"Get",
"returns",
"the",
"keyed",
"value",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/container.go#L236-L242 | train |
shiyanhui/dht | container.go | HasKey | func (deque *keyedDeque) HasKey(key interface{}) bool {
_, ok := deque.Get(key)
return ok
} | go | func (deque *keyedDeque) HasKey(key interface{}) bool {
_, ok := deque.Get(key)
return ok
} | [
"func",
"(",
"deque",
"*",
"keyedDeque",
")",
"HasKey",
"(",
"key",
"interface",
"{",
"}",
")",
"bool",
"{",
"_",
",",
"ok",
":=",
"deque",
".",
"Get",
"(",
"key",
")",
"\n",
"return",
"ok",
"\n",
"}"
] | // Has returns whether key already exists. | [
"Has",
"returns",
"whether",
"key",
"already",
"exists",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/container.go#L245-L248 | train |
shiyanhui/dht | container.go | Delete | func (deque *keyedDeque) Delete(key interface{}) (v interface{}) {
deque.RLock()
e, ok := deque.index[key]
deque.RUnlock()
deque.Lock()
defer deque.Unlock()
if ok {
v = deque.syncedList.Remove(e)
delete(deque.index, key)
delete(deque.invertedIndex, e)
}
return
} | go | func (deque *keyedDeque) Delete(key interface{}) (v interface{}) {
deque.RLock()
e, ok := deque.index[key]
deque.RUnlock()
deque.Lock()
defer deque.Unlock()
if ok {
v = deque.syncedList.Remove(e)
delete(deque.index, key)
delete(deque.invertedIndex, e)
}
return
} | [
"func",
"(",
"deque",
"*",
"keyedDeque",
")",
"Delete",
"(",
"key",
"interface",
"{",
"}",
")",
"(",
"v",
"interface",
"{",
"}",
")",
"{",
"deque",
".",
"RLock",
"(",
")",
"\n",
"e",
",",
"ok",
":=",
"deque",
".",
"index",
"[",
"key",
"]",
"\n"... | // Delete deletes a value named key. | [
"Delete",
"deletes",
"a",
"value",
"named",
"key",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/container.go#L251-L266 | train |
shiyanhui/dht | container.go | Remove | func (deque *keyedDeque) Remove(e *list.Element) (v interface{}) {
deque.RLock()
key, ok := deque.invertedIndex[e]
deque.RUnlock()
if ok {
v = deque.Delete(key)
}
return
} | go | func (deque *keyedDeque) Remove(e *list.Element) (v interface{}) {
deque.RLock()
key, ok := deque.invertedIndex[e]
deque.RUnlock()
if ok {
v = deque.Delete(key)
}
return
} | [
"func",
"(",
"deque",
"*",
"keyedDeque",
")",
"Remove",
"(",
"e",
"*",
"list",
".",
"Element",
")",
"(",
"v",
"interface",
"{",
"}",
")",
"{",
"deque",
".",
"RLock",
"(",
")",
"\n",
"key",
",",
"ok",
":=",
"deque",
".",
"invertedIndex",
"[",
"e",... | // Removes overwrites list.List.Remove. | [
"Removes",
"overwrites",
"list",
".",
"List",
".",
"Remove",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/container.go#L269-L279 | train |
shiyanhui/dht | container.go | Clear | func (deque *keyedDeque) Clear() {
deque.Lock()
defer deque.Unlock()
deque.syncedList.Clear()
deque.index = make(map[interface{}]*list.Element)
deque.invertedIndex = make(map[*list.Element]interface{})
} | go | func (deque *keyedDeque) Clear() {
deque.Lock()
defer deque.Unlock()
deque.syncedList.Clear()
deque.index = make(map[interface{}]*list.Element)
deque.invertedIndex = make(map[*list.Element]interface{})
} | [
"func",
"(",
"deque",
"*",
"keyedDeque",
")",
"Clear",
"(",
")",
"{",
"deque",
".",
"Lock",
"(",
")",
"\n",
"defer",
"deque",
".",
"Unlock",
"(",
")",
"\n",
"deque",
".",
"syncedList",
".",
"Clear",
"(",
")",
"\n",
"deque",
".",
"index",
"=",
"ma... | // Clear resets the deque. | [
"Clear",
"resets",
"the",
"deque",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/container.go#L282-L289 | train |
shiyanhui/dht | dht.go | NewStandardConfig | func NewStandardConfig() *Config {
return &Config{
K: 8,
KBucketSize: 8,
Network: "udp4",
Address: ":6881",
PrimeNodes: []string{
"router.bittorrent.com:6881",
"router.utorrent.com:6881",
"dht.transmissionbt.com:6881",
},
NodeExpriedAfter: time.Duration(time.Minute * 15),
KBucketExpiredAfter: time.Duration(time.Minute * 15),
CheckKBucketPeriod: time.Duration(time.Second * 30),
TokenExpiredAfter: time.Duration(time.Minute * 10),
MaxTransactionCursor: math.MaxUint32,
MaxNodes: 5000,
BlockedIPs: make([]string, 0),
BlackListMaxSize: 65536,
Try: 2,
Mode: StandardMode,
PacketJobLimit: 1024,
PacketWorkerLimit: 256,
RefreshNodeNum: 8,
}
} | go | func NewStandardConfig() *Config {
return &Config{
K: 8,
KBucketSize: 8,
Network: "udp4",
Address: ":6881",
PrimeNodes: []string{
"router.bittorrent.com:6881",
"router.utorrent.com:6881",
"dht.transmissionbt.com:6881",
},
NodeExpriedAfter: time.Duration(time.Minute * 15),
KBucketExpiredAfter: time.Duration(time.Minute * 15),
CheckKBucketPeriod: time.Duration(time.Second * 30),
TokenExpiredAfter: time.Duration(time.Minute * 10),
MaxTransactionCursor: math.MaxUint32,
MaxNodes: 5000,
BlockedIPs: make([]string, 0),
BlackListMaxSize: 65536,
Try: 2,
Mode: StandardMode,
PacketJobLimit: 1024,
PacketWorkerLimit: 256,
RefreshNodeNum: 8,
}
} | [
"func",
"NewStandardConfig",
"(",
")",
"*",
"Config",
"{",
"return",
"&",
"Config",
"{",
"K",
":",
"8",
",",
"KBucketSize",
":",
"8",
",",
"Network",
":",
"\"udp4\"",
",",
"Address",
":",
"\":6881\"",
",",
"PrimeNodes",
":",
"[",
"]",
"string",
"{",
... | // NewStandardConfig returns a Config pointer with default values. | [
"NewStandardConfig",
"returns",
"a",
"Config",
"pointer",
"with",
"default",
"values",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/dht.go#L76-L101 | train |
shiyanhui/dht | dht.go | NewCrawlConfig | func NewCrawlConfig() *Config {
config := NewStandardConfig()
config.NodeExpriedAfter = 0
config.KBucketExpiredAfter = 0
config.CheckKBucketPeriod = time.Second * 5
config.KBucketSize = math.MaxInt32
config.Mode = CrawlMode
config.RefreshNodeNum = 256
return config
} | go | func NewCrawlConfig() *Config {
config := NewStandardConfig()
config.NodeExpriedAfter = 0
config.KBucketExpiredAfter = 0
config.CheckKBucketPeriod = time.Second * 5
config.KBucketSize = math.MaxInt32
config.Mode = CrawlMode
config.RefreshNodeNum = 256
return config
} | [
"func",
"NewCrawlConfig",
"(",
")",
"*",
"Config",
"{",
"config",
":=",
"NewStandardConfig",
"(",
")",
"\n",
"config",
".",
"NodeExpriedAfter",
"=",
"0",
"\n",
"config",
".",
"KBucketExpiredAfter",
"=",
"0",
"\n",
"config",
".",
"CheckKBucketPeriod",
"=",
"t... | // NewCrawlConfig returns a config in crawling mode. | [
"NewCrawlConfig",
"returns",
"a",
"config",
"in",
"crawling",
"mode",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/dht.go#L104-L114 | train |
shiyanhui/dht | dht.go | New | func New(config *Config) *DHT {
if config == nil {
config = NewStandardConfig()
}
node, err := newNode(randomString(20), config.Network, config.Address)
if err != nil {
panic(err)
}
d := &DHT{
Config: config,
node: node,
blackList: newBlackList(config.BlackListMaxSize),
packets: make(chan packet, config.PacketJobLimit),
workerTokens: make(chan struct{}, config.PacketWorkerLimit),
}
for _, ip := range config.BlockedIPs {
d.blackList.insert(ip, -1)
}
go func() {
for _, ip := range getLocalIPs() {
d.blackList.insert(ip, -1)
}
ip, err := getRemoteIP()
if err != nil {
d.blackList.insert(ip, -1)
}
}()
return d
} | go | func New(config *Config) *DHT {
if config == nil {
config = NewStandardConfig()
}
node, err := newNode(randomString(20), config.Network, config.Address)
if err != nil {
panic(err)
}
d := &DHT{
Config: config,
node: node,
blackList: newBlackList(config.BlackListMaxSize),
packets: make(chan packet, config.PacketJobLimit),
workerTokens: make(chan struct{}, config.PacketWorkerLimit),
}
for _, ip := range config.BlockedIPs {
d.blackList.insert(ip, -1)
}
go func() {
for _, ip := range getLocalIPs() {
d.blackList.insert(ip, -1)
}
ip, err := getRemoteIP()
if err != nil {
d.blackList.insert(ip, -1)
}
}()
return d
} | [
"func",
"New",
"(",
"config",
"*",
"Config",
")",
"*",
"DHT",
"{",
"if",
"config",
"==",
"nil",
"{",
"config",
"=",
"NewStandardConfig",
"(",
")",
"\n",
"}",
"\n",
"node",
",",
"err",
":=",
"newNode",
"(",
"randomString",
"(",
"20",
")",
",",
"conf... | // New returns a DHT pointer. If config is nil, then config will be set to
// the default config. | [
"New",
"returns",
"a",
"DHT",
"pointer",
".",
"If",
"config",
"is",
"nil",
"then",
"config",
"will",
"be",
"set",
"to",
"the",
"default",
"config",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/dht.go#L133-L167 | train |
shiyanhui/dht | dht.go | init | func (dht *DHT) init() {
listener, err := net.ListenPacket(dht.Network, dht.Address)
if err != nil {
panic(err)
}
dht.conn = listener.(*net.UDPConn)
dht.routingTable = newRoutingTable(dht.KBucketSize, dht)
dht.peersManager = newPeersManager(dht)
dht.tokenManager = newTokenManager(dht.TokenExpiredAfter, dht)
dht.transactionManager = newTransactionManager(
dht.MaxTransactionCursor, dht)
go dht.transactionManager.run()
go dht.tokenManager.clear()
go dht.blackList.clear()
} | go | func (dht *DHT) init() {
listener, err := net.ListenPacket(dht.Network, dht.Address)
if err != nil {
panic(err)
}
dht.conn = listener.(*net.UDPConn)
dht.routingTable = newRoutingTable(dht.KBucketSize, dht)
dht.peersManager = newPeersManager(dht)
dht.tokenManager = newTokenManager(dht.TokenExpiredAfter, dht)
dht.transactionManager = newTransactionManager(
dht.MaxTransactionCursor, dht)
go dht.transactionManager.run()
go dht.tokenManager.clear()
go dht.blackList.clear()
} | [
"func",
"(",
"dht",
"*",
"DHT",
")",
"init",
"(",
")",
"{",
"listener",
",",
"err",
":=",
"net",
".",
"ListenPacket",
"(",
"dht",
".",
"Network",
",",
"dht",
".",
"Address",
")",
"\n",
"if",
"err",
"!=",
"nil",
"{",
"panic",
"(",
"err",
")",
"\... | // init initializes global varables. | [
"init",
"initializes",
"global",
"varables",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/dht.go#L180-L196 | train |
shiyanhui/dht | dht.go | join | func (dht *DHT) join() {
for _, addr := range dht.PrimeNodes {
raddr, err := net.ResolveUDPAddr(dht.Network, addr)
if err != nil {
continue
}
// NOTE: Temporary node has NOT node id.
dht.transactionManager.findNode(
&node{addr: raddr},
dht.node.id.RawString(),
)
}
} | go | func (dht *DHT) join() {
for _, addr := range dht.PrimeNodes {
raddr, err := net.ResolveUDPAddr(dht.Network, addr)
if err != nil {
continue
}
// NOTE: Temporary node has NOT node id.
dht.transactionManager.findNode(
&node{addr: raddr},
dht.node.id.RawString(),
)
}
} | [
"func",
"(",
"dht",
"*",
"DHT",
")",
"join",
"(",
")",
"{",
"for",
"_",
",",
"addr",
":=",
"range",
"dht",
".",
"PrimeNodes",
"{",
"raddr",
",",
"err",
":=",
"net",
".",
"ResolveUDPAddr",
"(",
"dht",
".",
"Network",
",",
"addr",
")",
"\n",
"if",
... | // join makes current node join the dht network. | [
"join",
"makes",
"current",
"node",
"join",
"the",
"dht",
"network",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/dht.go#L199-L212 | train |
shiyanhui/dht | dht.go | listen | func (dht *DHT) listen() {
go func() {
buff := make([]byte, 8192)
for {
n, raddr, err := dht.conn.ReadFromUDP(buff)
if err != nil {
continue
}
dht.packets <- packet{buff[:n], raddr}
}
}()
} | go | func (dht *DHT) listen() {
go func() {
buff := make([]byte, 8192)
for {
n, raddr, err := dht.conn.ReadFromUDP(buff)
if err != nil {
continue
}
dht.packets <- packet{buff[:n], raddr}
}
}()
} | [
"func",
"(",
"dht",
"*",
"DHT",
")",
"listen",
"(",
")",
"{",
"go",
"func",
"(",
")",
"{",
"buff",
":=",
"make",
"(",
"[",
"]",
"byte",
",",
"8192",
")",
"\n",
"for",
"{",
"n",
",",
"raddr",
",",
"err",
":=",
"dht",
".",
"conn",
".",
"ReadF... | // listen receives message from udp. | [
"listen",
"receives",
"message",
"from",
"udp",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/dht.go#L215-L227 | train |
shiyanhui/dht | dht.go | id | func (dht *DHT) id(target string) string {
if dht.IsStandardMode() || target == "" {
return dht.node.id.RawString()
}
return target[:15] + dht.node.id.RawString()[15:]
} | go | func (dht *DHT) id(target string) string {
if dht.IsStandardMode() || target == "" {
return dht.node.id.RawString()
}
return target[:15] + dht.node.id.RawString()[15:]
} | [
"func",
"(",
"dht",
"*",
"DHT",
")",
"id",
"(",
"target",
"string",
")",
"string",
"{",
"if",
"dht",
".",
"IsStandardMode",
"(",
")",
"||",
"target",
"==",
"\"\"",
"{",
"return",
"dht",
".",
"node",
".",
"id",
".",
"RawString",
"(",
")",
"\n",
"}... | // id returns a id near to target if target is not null, otherwise it returns
// the dht's node id. | [
"id",
"returns",
"a",
"id",
"near",
"to",
"target",
"if",
"target",
"is",
"not",
"null",
"otherwise",
"it",
"returns",
"the",
"dht",
"s",
"node",
"id",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/dht.go#L231-L236 | train |
shiyanhui/dht | dht.go | GetPeers | func (dht *DHT) GetPeers(infoHash string) error {
if !dht.Ready {
return ErrNotReady
}
if dht.OnGetPeersResponse == nil {
return ErrOnGetPeersResponseNotSet
}
if len(infoHash) == 40 {
data, err := hex.DecodeString(infoHash)
if err != nil {
return err
}
infoHash = string(data)
}
neighbors := dht.routingTable.GetNeighbors(
newBitmapFromString(infoHash), dht.routingTable.Len())
for _, no := range neighbors {
dht.transactionManager.getPeers(no, infoHash)
}
return nil
} | go | func (dht *DHT) GetPeers(infoHash string) error {
if !dht.Ready {
return ErrNotReady
}
if dht.OnGetPeersResponse == nil {
return ErrOnGetPeersResponseNotSet
}
if len(infoHash) == 40 {
data, err := hex.DecodeString(infoHash)
if err != nil {
return err
}
infoHash = string(data)
}
neighbors := dht.routingTable.GetNeighbors(
newBitmapFromString(infoHash), dht.routingTable.Len())
for _, no := range neighbors {
dht.transactionManager.getPeers(no, infoHash)
}
return nil
} | [
"func",
"(",
"dht",
"*",
"DHT",
")",
"GetPeers",
"(",
"infoHash",
"string",
")",
"error",
"{",
"if",
"!",
"dht",
".",
"Ready",
"{",
"return",
"ErrNotReady",
"\n",
"}",
"\n",
"if",
"dht",
".",
"OnGetPeersResponse",
"==",
"nil",
"{",
"return",
"ErrOnGetP... | // GetPeers returns peers who have announced having infoHash. | [
"GetPeers",
"returns",
"peers",
"who",
"have",
"announced",
"having",
"infoHash",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/dht.go#L239-L264 | train |
shiyanhui/dht | dht.go | Run | func (dht *DHT) Run() {
dht.init()
dht.listen()
dht.join()
dht.Ready = true
var pkt packet
tick := time.Tick(dht.CheckKBucketPeriod)
for {
select {
case pkt = <-dht.packets:
handle(dht, pkt)
case <-tick:
if dht.routingTable.Len() == 0 {
dht.join()
} else if dht.transactionManager.len() == 0 {
go dht.routingTable.Fresh()
}
}
}
} | go | func (dht *DHT) Run() {
dht.init()
dht.listen()
dht.join()
dht.Ready = true
var pkt packet
tick := time.Tick(dht.CheckKBucketPeriod)
for {
select {
case pkt = <-dht.packets:
handle(dht, pkt)
case <-tick:
if dht.routingTable.Len() == 0 {
dht.join()
} else if dht.transactionManager.len() == 0 {
go dht.routingTable.Fresh()
}
}
}
} | [
"func",
"(",
"dht",
"*",
"DHT",
")",
"Run",
"(",
")",
"{",
"dht",
".",
"init",
"(",
")",
"\n",
"dht",
".",
"listen",
"(",
")",
"\n",
"dht",
".",
"join",
"(",
")",
"\n",
"dht",
".",
"Ready",
"=",
"true",
"\n",
"var",
"pkt",
"packet",
"\n",
"... | // Run starts the dht. | [
"Run",
"starts",
"the",
"dht",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/dht.go#L267-L289 | train |
shiyanhui/dht | blacklist.go | newBlackList | func newBlackList(size int) *blackList {
return &blackList{
list: newSyncedMap(),
maxSize: size,
expiredAfter: time.Hour * 1,
}
} | go | func newBlackList(size int) *blackList {
return &blackList{
list: newSyncedMap(),
maxSize: size,
expiredAfter: time.Hour * 1,
}
} | [
"func",
"newBlackList",
"(",
"size",
"int",
")",
"*",
"blackList",
"{",
"return",
"&",
"blackList",
"{",
"list",
":",
"newSyncedMap",
"(",
")",
",",
"maxSize",
":",
"size",
",",
"expiredAfter",
":",
"time",
".",
"Hour",
"*",
"1",
",",
"}",
"\n",
"}"
... | // newBlackList returns a blackList pointer. | [
"newBlackList",
"returns",
"a",
"blackList",
"pointer",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/blacklist.go#L23-L29 | train |
shiyanhui/dht | blacklist.go | insert | func (bl *blackList) insert(ip string, port int) {
if bl.list.Len() >= bl.maxSize {
return
}
bl.list.Set(bl.genKey(ip, port), &blockedItem{
ip: ip,
port: port,
createTime: time.Now(),
})
} | go | func (bl *blackList) insert(ip string, port int) {
if bl.list.Len() >= bl.maxSize {
return
}
bl.list.Set(bl.genKey(ip, port), &blockedItem{
ip: ip,
port: port,
createTime: time.Now(),
})
} | [
"func",
"(",
"bl",
"*",
"blackList",
")",
"insert",
"(",
"ip",
"string",
",",
"port",
"int",
")",
"{",
"if",
"bl",
".",
"list",
".",
"Len",
"(",
")",
">=",
"bl",
".",
"maxSize",
"{",
"return",
"\n",
"}",
"\n",
"bl",
".",
"list",
".",
"Set",
"... | // insert adds a blocked item to the blacklist. | [
"insert",
"adds",
"a",
"blocked",
"item",
"to",
"the",
"blacklist",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/blacklist.go#L42-L52 | train |
shiyanhui/dht | blacklist.go | delete | func (bl *blackList) delete(ip string, port int) {
bl.list.Delete(bl.genKey(ip, port))
} | go | func (bl *blackList) delete(ip string, port int) {
bl.list.Delete(bl.genKey(ip, port))
} | [
"func",
"(",
"bl",
"*",
"blackList",
")",
"delete",
"(",
"ip",
"string",
",",
"port",
"int",
")",
"{",
"bl",
".",
"list",
".",
"Delete",
"(",
"bl",
".",
"genKey",
"(",
"ip",
",",
"port",
")",
")",
"\n",
"}"
] | // delete removes blocked item form the blackList. | [
"delete",
"removes",
"blocked",
"item",
"form",
"the",
"blackList",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/blacklist.go#L55-L57 | train |
shiyanhui/dht | blacklist.go | in | func (bl *blackList) in(ip string, port int) bool {
if _, ok := bl.list.Get(ip); ok {
return true
}
key := bl.genKey(ip, port)
v, ok := bl.list.Get(key)
if ok {
if time.Now().Sub(v.(*blockedItem).createTime) < bl.expiredAfter {
return true
}
bl.list.Delete(key)
}
return false
} | go | func (bl *blackList) in(ip string, port int) bool {
if _, ok := bl.list.Get(ip); ok {
return true
}
key := bl.genKey(ip, port)
v, ok := bl.list.Get(key)
if ok {
if time.Now().Sub(v.(*blockedItem).createTime) < bl.expiredAfter {
return true
}
bl.list.Delete(key)
}
return false
} | [
"func",
"(",
"bl",
"*",
"blackList",
")",
"in",
"(",
"ip",
"string",
",",
"port",
"int",
")",
"bool",
"{",
"if",
"_",
",",
"ok",
":=",
"bl",
".",
"list",
".",
"Get",
"(",
"ip",
")",
";",
"ok",
"{",
"return",
"true",
"\n",
"}",
"\n",
"key",
... | // validate checks whether ip-port pair is in the block nodes list. | [
"validate",
"checks",
"whether",
"ip",
"-",
"port",
"pair",
"is",
"in",
"the",
"block",
"nodes",
"list",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/blacklist.go#L60-L75 | train |
shiyanhui/dht | blacklist.go | clear | func (bl *blackList) clear() {
for _ = range time.Tick(time.Minute * 10) {
keys := make([]interface{}, 0, 100)
for item := range bl.list.Iter() {
if time.Now().Sub(
item.val.(*blockedItem).createTime) > bl.expiredAfter {
keys = append(keys, item.key)
}
}
bl.list.DeleteMulti(keys)
}
} | go | func (bl *blackList) clear() {
for _ = range time.Tick(time.Minute * 10) {
keys := make([]interface{}, 0, 100)
for item := range bl.list.Iter() {
if time.Now().Sub(
item.val.(*blockedItem).createTime) > bl.expiredAfter {
keys = append(keys, item.key)
}
}
bl.list.DeleteMulti(keys)
}
} | [
"func",
"(",
"bl",
"*",
"blackList",
")",
"clear",
"(",
")",
"{",
"for",
"_",
"=",
"range",
"time",
".",
"Tick",
"(",
"time",
".",
"Minute",
"*",
"10",
")",
"{",
"keys",
":=",
"make",
"(",
"[",
"]",
"interface",
"{",
"}",
",",
"0",
",",
"100"... | // clear cleans the expired items every 10 minutes. | [
"clear",
"cleans",
"the",
"expired",
"items",
"every",
"10",
"minutes",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/blacklist.go#L78-L92 | train |
shiyanhui/dht | peerwire.go | read | func read(conn *net.TCPConn, size int, data *bytes.Buffer) error {
conn.SetReadDeadline(time.Now().Add(time.Second * 15))
n, err := io.CopyN(data, conn, int64(size))
if err != nil || n != int64(size) {
return errors.New("read error")
}
return nil
} | go | func read(conn *net.TCPConn, size int, data *bytes.Buffer) error {
conn.SetReadDeadline(time.Now().Add(time.Second * 15))
n, err := io.CopyN(data, conn, int64(size))
if err != nil || n != int64(size) {
return errors.New("read error")
}
return nil
} | [
"func",
"read",
"(",
"conn",
"*",
"net",
".",
"TCPConn",
",",
"size",
"int",
",",
"data",
"*",
"bytes",
".",
"Buffer",
")",
"error",
"{",
"conn",
".",
"SetReadDeadline",
"(",
"time",
".",
"Now",
"(",
")",
".",
"Add",
"(",
"time",
".",
"Second",
"... | // read reads size-length bytes from conn to data. | [
"read",
"reads",
"size",
"-",
"length",
"bytes",
"from",
"conn",
"to",
"data",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/peerwire.go#L41-L49 | train |
shiyanhui/dht | peerwire.go | readMessage | func readMessage(conn *net.TCPConn, data *bytes.Buffer) (
length int, err error) {
if err = read(conn, 4, data); err != nil {
return
}
length = int(bytes2int(data.Next(4)))
if length == 0 {
return
}
if err = read(conn, length, data); err != nil {
return
}
return
} | go | func readMessage(conn *net.TCPConn, data *bytes.Buffer) (
length int, err error) {
if err = read(conn, 4, data); err != nil {
return
}
length = int(bytes2int(data.Next(4)))
if length == 0 {
return
}
if err = read(conn, length, data); err != nil {
return
}
return
} | [
"func",
"readMessage",
"(",
"conn",
"*",
"net",
".",
"TCPConn",
",",
"data",
"*",
"bytes",
".",
"Buffer",
")",
"(",
"length",
"int",
",",
"err",
"error",
")",
"{",
"if",
"err",
"=",
"read",
"(",
"conn",
",",
"4",
",",
"data",
")",
";",
"err",
"... | // readMessage gets a message from the tcp connection. | [
"readMessage",
"gets",
"a",
"message",
"from",
"the",
"tcp",
"connection",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/peerwire.go#L52-L68 | train |
shiyanhui/dht | peerwire.go | sendMessage | func sendMessage(conn *net.TCPConn, data []byte) error {
length := int32(len(data))
buffer := bytes.NewBuffer(nil)
binary.Write(buffer, binary.BigEndian, length)
conn.SetWriteDeadline(time.Now().Add(time.Second * 10))
_, err := conn.Write(append(buffer.Bytes(), data...))
return err
} | go | func sendMessage(conn *net.TCPConn, data []byte) error {
length := int32(len(data))
buffer := bytes.NewBuffer(nil)
binary.Write(buffer, binary.BigEndian, length)
conn.SetWriteDeadline(time.Now().Add(time.Second * 10))
_, err := conn.Write(append(buffer.Bytes(), data...))
return err
} | [
"func",
"sendMessage",
"(",
"conn",
"*",
"net",
".",
"TCPConn",
",",
"data",
"[",
"]",
"byte",
")",
"error",
"{",
"length",
":=",
"int32",
"(",
"len",
"(",
"data",
")",
")",
"\n",
"buffer",
":=",
"bytes",
".",
"NewBuffer",
"(",
"nil",
")",
"\n",
... | // sendMessage sends data to the connection. | [
"sendMessage",
"sends",
"data",
"to",
"the",
"connection",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/peerwire.go#L71-L80 | train |
shiyanhui/dht | peerwire.go | sendHandshake | func sendHandshake(conn *net.TCPConn, infoHash, peerID []byte) error {
data := make([]byte, 68)
copy(data[:28], handshakePrefix)
copy(data[28:48], infoHash)
copy(data[48:], peerID)
conn.SetWriteDeadline(time.Now().Add(time.Second * 10))
_, err := conn.Write(data)
return err
} | go | func sendHandshake(conn *net.TCPConn, infoHash, peerID []byte) error {
data := make([]byte, 68)
copy(data[:28], handshakePrefix)
copy(data[28:48], infoHash)
copy(data[48:], peerID)
conn.SetWriteDeadline(time.Now().Add(time.Second * 10))
_, err := conn.Write(data)
return err
} | [
"func",
"sendHandshake",
"(",
"conn",
"*",
"net",
".",
"TCPConn",
",",
"infoHash",
",",
"peerID",
"[",
"]",
"byte",
")",
"error",
"{",
"data",
":=",
"make",
"(",
"[",
"]",
"byte",
",",
"68",
")",
"\n",
"copy",
"(",
"data",
"[",
":",
"28",
"]",
... | // sendHandshake sends handshake message to conn. | [
"sendHandshake",
"sends",
"handshake",
"message",
"to",
"conn",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/peerwire.go#L83-L92 | train |
shiyanhui/dht | peerwire.go | onHandshake | func onHandshake(data []byte) (err error) {
if !(bytes.Equal(handshakePrefix[:20], data[:20]) && data[25]&0x10 != 0) {
err = errors.New("invalid handshake response")
}
return
} | go | func onHandshake(data []byte) (err error) {
if !(bytes.Equal(handshakePrefix[:20], data[:20]) && data[25]&0x10 != 0) {
err = errors.New("invalid handshake response")
}
return
} | [
"func",
"onHandshake",
"(",
"data",
"[",
"]",
"byte",
")",
"(",
"err",
"error",
")",
"{",
"if",
"!",
"(",
"bytes",
".",
"Equal",
"(",
"handshakePrefix",
"[",
":",
"20",
"]",
",",
"data",
"[",
":",
"20",
"]",
")",
"&&",
"data",
"[",
"25",
"]",
... | // onHandshake handles the handshake response. | [
"onHandshake",
"handles",
"the",
"handshake",
"response",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/peerwire.go#L95-L100 | train |
shiyanhui/dht | peerwire.go | sendExtHandshake | func sendExtHandshake(conn *net.TCPConn) error {
data := append(
[]byte{EXTENDED, HANDSHAKE},
Encode(map[string]interface{}{
"m": map[string]interface{}{"ut_metadata": 1},
})...,
)
return sendMessage(conn, data)
} | go | func sendExtHandshake(conn *net.TCPConn) error {
data := append(
[]byte{EXTENDED, HANDSHAKE},
Encode(map[string]interface{}{
"m": map[string]interface{}{"ut_metadata": 1},
})...,
)
return sendMessage(conn, data)
} | [
"func",
"sendExtHandshake",
"(",
"conn",
"*",
"net",
".",
"TCPConn",
")",
"error",
"{",
"data",
":=",
"append",
"(",
"[",
"]",
"byte",
"{",
"EXTENDED",
",",
"HANDSHAKE",
"}",
",",
"Encode",
"(",
"map",
"[",
"string",
"]",
"interface",
"{",
"}",
"{",
... | // sendExtHandshake requests for the ut_metadata and metadata_size. | [
"sendExtHandshake",
"requests",
"for",
"the",
"ut_metadata",
"and",
"metadata_size",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/peerwire.go#L103-L112 | train |
shiyanhui/dht | peerwire.go | getUTMetaSize | func getUTMetaSize(data []byte) (
utMetadata int, metadataSize int, err error) {
v, err := Decode(data)
if err != nil {
return
}
dict, ok := v.(map[string]interface{})
if !ok {
err = errors.New("invalid dict")
return
}
if err = ParseKeys(
dict, [][]string{{"metadata_size", "int"}, {"m", "map"}}); err != nil {
return
}
m := dict["m"].(map[string]interface{})
if err = ParseKey(m, "ut_metadata", "int"); err != nil {
return
}
utMetadata = m["ut_metadata"].(int)
metadataSize = dict["metadata_size"].(int)
if metadataSize > MaxMetadataSize {
err = errors.New("metadata_size too long")
}
return
} | go | func getUTMetaSize(data []byte) (
utMetadata int, metadataSize int, err error) {
v, err := Decode(data)
if err != nil {
return
}
dict, ok := v.(map[string]interface{})
if !ok {
err = errors.New("invalid dict")
return
}
if err = ParseKeys(
dict, [][]string{{"metadata_size", "int"}, {"m", "map"}}); err != nil {
return
}
m := dict["m"].(map[string]interface{})
if err = ParseKey(m, "ut_metadata", "int"); err != nil {
return
}
utMetadata = m["ut_metadata"].(int)
metadataSize = dict["metadata_size"].(int)
if metadataSize > MaxMetadataSize {
err = errors.New("metadata_size too long")
}
return
} | [
"func",
"getUTMetaSize",
"(",
"data",
"[",
"]",
"byte",
")",
"(",
"utMetadata",
"int",
",",
"metadataSize",
"int",
",",
"err",
"error",
")",
"{",
"v",
",",
"err",
":=",
"Decode",
"(",
"data",
")",
"\n",
"if",
"err",
"!=",
"nil",
"{",
"return",
"\n"... | // getUTMetaSize returns the ut_metadata and metadata_size. | [
"getUTMetaSize",
"returns",
"the",
"ut_metadata",
"and",
"metadata_size",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/peerwire.go#L115-L146 | train |
shiyanhui/dht | peerwire.go | Request | func (wire *Wire) Request(infoHash []byte, ip string, port int) {
wire.requests <- Request{InfoHash: infoHash, IP: ip, Port: port}
} | go | func (wire *Wire) Request(infoHash []byte, ip string, port int) {
wire.requests <- Request{InfoHash: infoHash, IP: ip, Port: port}
} | [
"func",
"(",
"wire",
"*",
"Wire",
")",
"Request",
"(",
"infoHash",
"[",
"]",
"byte",
",",
"ip",
"string",
",",
"port",
"int",
")",
"{",
"wire",
".",
"requests",
"<-",
"Request",
"{",
"InfoHash",
":",
"infoHash",
",",
"IP",
":",
"ip",
",",
"Port",
... | // Request pushes the request to the queue. | [
"Request",
"pushes",
"the",
"request",
"to",
"the",
"queue",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/peerwire.go#L185-L187 | train |
shiyanhui/dht | peerwire.go | isDone | func (wire *Wire) isDone(pieces [][]byte) bool {
for _, piece := range pieces {
if len(piece) == 0 {
return false
}
}
return true
} | go | func (wire *Wire) isDone(pieces [][]byte) bool {
for _, piece := range pieces {
if len(piece) == 0 {
return false
}
}
return true
} | [
"func",
"(",
"wire",
"*",
"Wire",
")",
"isDone",
"(",
"pieces",
"[",
"]",
"[",
"]",
"byte",
")",
"bool",
"{",
"for",
"_",
",",
"piece",
":=",
"range",
"pieces",
"{",
"if",
"len",
"(",
"piece",
")",
"==",
"0",
"{",
"return",
"false",
"\n",
"}",
... | // isDone returns whether the wire get all pieces of the metadata info. | [
"isDone",
"returns",
"whether",
"the",
"wire",
"get",
"all",
"pieces",
"of",
"the",
"metadata",
"info",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/peerwire.go#L195-L202 | train |
shiyanhui/dht | peerwire.go | Run | func (wire *Wire) Run() {
go wire.blackList.clear()
for r := range wire.requests {
wire.workerTokens <- struct{}{}
go func(r Request) {
defer func() {
<-wire.workerTokens
}()
key := strings.Join([]string{
string(r.InfoHash), genAddress(r.IP, r.Port),
}, ":")
if len(r.InfoHash) != 20 || wire.blackList.in(r.IP, r.Port) ||
wire.queue.Has(key) {
return
}
wire.fetchMetadata(r)
}(r)
}
} | go | func (wire *Wire) Run() {
go wire.blackList.clear()
for r := range wire.requests {
wire.workerTokens <- struct{}{}
go func(r Request) {
defer func() {
<-wire.workerTokens
}()
key := strings.Join([]string{
string(r.InfoHash), genAddress(r.IP, r.Port),
}, ":")
if len(r.InfoHash) != 20 || wire.blackList.in(r.IP, r.Port) ||
wire.queue.Has(key) {
return
}
wire.fetchMetadata(r)
}(r)
}
} | [
"func",
"(",
"wire",
"*",
"Wire",
")",
"Run",
"(",
")",
"{",
"go",
"wire",
".",
"blackList",
".",
"clear",
"(",
")",
"\n",
"for",
"r",
":=",
"range",
"wire",
".",
"requests",
"{",
"wire",
".",
"workerTokens",
"<-",
"struct",
"{",
"}",
"{",
"}",
... | // Run starts the peer wire protocol. | [
"Run",
"starts",
"the",
"peer",
"wire",
"protocol",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/peerwire.go#L362-L385 | train |
shiyanhui/dht | bitmap.go | newBitmap | func newBitmap(size int) *bitmap {
div, mod := size>>3, size&0x07
if mod > 0 {
div++
}
return &bitmap{size, make([]byte, div)}
} | go | func newBitmap(size int) *bitmap {
div, mod := size>>3, size&0x07
if mod > 0 {
div++
}
return &bitmap{size, make([]byte, div)}
} | [
"func",
"newBitmap",
"(",
"size",
"int",
")",
"*",
"bitmap",
"{",
"div",
",",
"mod",
":=",
"size",
">>",
"3",
",",
"size",
"&",
"0x07",
"\n",
"if",
"mod",
">",
"0",
"{",
"div",
"++",
"\n",
"}",
"\n",
"return",
"&",
"bitmap",
"{",
"size",
",",
... | // newBitmap returns a size-length bitmap pointer. | [
"newBitmap",
"returns",
"a",
"size",
"-",
"length",
"bitmap",
"pointer",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/bitmap.go#L16-L22 | train |
shiyanhui/dht | bitmap.go | newBitmapFromBytes | func newBitmapFromBytes(data []byte) *bitmap {
bitmap := newBitmap(len(data) << 3)
copy(bitmap.data, data)
return bitmap
} | go | func newBitmapFromBytes(data []byte) *bitmap {
bitmap := newBitmap(len(data) << 3)
copy(bitmap.data, data)
return bitmap
} | [
"func",
"newBitmapFromBytes",
"(",
"data",
"[",
"]",
"byte",
")",
"*",
"bitmap",
"{",
"bitmap",
":=",
"newBitmap",
"(",
"len",
"(",
"data",
")",
"<<",
"3",
")",
"\n",
"copy",
"(",
"bitmap",
".",
"data",
",",
"data",
")",
"\n",
"return",
"bitmap",
"... | // newBitmapFromBytes returns a bitmap pointer created from a byte array. | [
"newBitmapFromBytes",
"returns",
"a",
"bitmap",
"pointer",
"created",
"from",
"a",
"byte",
"array",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/bitmap.go#L49-L53 | train |
shiyanhui/dht | bitmap.go | Bit | func (bitmap *bitmap) Bit(index int) int {
if index >= bitmap.Size {
panic("index out of range")
}
div, mod := index>>3, index&0x07
return int((uint(bitmap.data[div]) & (1 << uint(7-mod))) >> uint(7-mod))
} | go | func (bitmap *bitmap) Bit(index int) int {
if index >= bitmap.Size {
panic("index out of range")
}
div, mod := index>>3, index&0x07
return int((uint(bitmap.data[div]) & (1 << uint(7-mod))) >> uint(7-mod))
} | [
"func",
"(",
"bitmap",
"*",
"bitmap",
")",
"Bit",
"(",
"index",
"int",
")",
"int",
"{",
"if",
"index",
">=",
"bitmap",
".",
"Size",
"{",
"panic",
"(",
"\"index out of range\"",
")",
"\n",
"}",
"\n",
"div",
",",
"mod",
":=",
"index",
">>",
"3",
",",... | // Bit returns the bit at index. | [
"Bit",
"returns",
"the",
"bit",
"at",
"index",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/bitmap.go#L61-L68 | train |
shiyanhui/dht | bitmap.go | set | func (bitmap *bitmap) set(index int, bit int) {
if index >= bitmap.Size {
panic("index out of range")
}
div, mod := index>>3, index&0x07
shift := byte(1 << uint(7-mod))
bitmap.data[div] &= ^shift
if bit > 0 {
bitmap.data[div] |= shift
}
} | go | func (bitmap *bitmap) set(index int, bit int) {
if index >= bitmap.Size {
panic("index out of range")
}
div, mod := index>>3, index&0x07
shift := byte(1 << uint(7-mod))
bitmap.data[div] &= ^shift
if bit > 0 {
bitmap.data[div] |= shift
}
} | [
"func",
"(",
"bitmap",
"*",
"bitmap",
")",
"set",
"(",
"index",
"int",
",",
"bit",
"int",
")",
"{",
"if",
"index",
">=",
"bitmap",
".",
"Size",
"{",
"panic",
"(",
"\"index out of range\"",
")",
"\n",
"}",
"\n",
"div",
",",
"mod",
":=",
"index",
">>... | // set sets the bit at index `index`. If bit is true, set 1, otherwise set 0. | [
"set",
"sets",
"the",
"bit",
"at",
"index",
"index",
".",
"If",
"bit",
"is",
"true",
"set",
"1",
"otherwise",
"set",
"0",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/bitmap.go#L71-L83 | train |
shiyanhui/dht | bitmap.go | Xor | func (bitmap *bitmap) Xor(other *bitmap) *bitmap {
if bitmap.Size != other.Size {
panic("size not the same")
}
distance := newBitmap(bitmap.Size)
xor(distance.data, bitmap.data, other.data)
return distance
} | go | func (bitmap *bitmap) Xor(other *bitmap) *bitmap {
if bitmap.Size != other.Size {
panic("size not the same")
}
distance := newBitmap(bitmap.Size)
xor(distance.data, bitmap.data, other.data)
return distance
} | [
"func",
"(",
"bitmap",
"*",
"bitmap",
")",
"Xor",
"(",
"other",
"*",
"bitmap",
")",
"*",
"bitmap",
"{",
"if",
"bitmap",
".",
"Size",
"!=",
"other",
".",
"Size",
"{",
"panic",
"(",
"\"size not the same\"",
")",
"\n",
"}",
"\n",
"distance",
":=",
"newB... | // Xor returns the xor value of two bitmap. | [
"Xor",
"returns",
"the",
"xor",
"value",
"of",
"two",
"bitmap",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/bitmap.go#L123-L132 | train |
shiyanhui/dht | bitmap.go | String | func (bitmap *bitmap) String() string {
div, mod := bitmap.Size>>3, bitmap.Size&0x07
buff := make([]string, div+mod)
for i := 0; i < div; i++ {
buff[i] = fmt.Sprintf("%08b", bitmap.data[i])
}
for i := div; i < div+mod; i++ {
buff[i] = fmt.Sprintf("%1b", bitmap.Bit(div*8+(i-div)))
}
return strings.Join(buff, "")
} | go | func (bitmap *bitmap) String() string {
div, mod := bitmap.Size>>3, bitmap.Size&0x07
buff := make([]string, div+mod)
for i := 0; i < div; i++ {
buff[i] = fmt.Sprintf("%08b", bitmap.data[i])
}
for i := div; i < div+mod; i++ {
buff[i] = fmt.Sprintf("%1b", bitmap.Bit(div*8+(i-div)))
}
return strings.Join(buff, "")
} | [
"func",
"(",
"bitmap",
"*",
"bitmap",
")",
"String",
"(",
")",
"string",
"{",
"div",
",",
"mod",
":=",
"bitmap",
".",
"Size",
">>",
"3",
",",
"bitmap",
".",
"Size",
"&",
"0x07",
"\n",
"buff",
":=",
"make",
"(",
"[",
"]",
"string",
",",
"div",
"... | // String returns the bit sequence string of the bitmap. | [
"String",
"returns",
"the",
"bit",
"sequence",
"string",
"of",
"the",
"bitmap",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/bitmap.go#L135-L148 | train |
shiyanhui/dht | krpc.go | newTokenManager | func newTokenManager(expiredAfter time.Duration, dht *DHT) *tokenManager {
return &tokenManager{
syncedMap: newSyncedMap(),
expiredAfter: expiredAfter,
dht: dht,
}
} | go | func newTokenManager(expiredAfter time.Duration, dht *DHT) *tokenManager {
return &tokenManager{
syncedMap: newSyncedMap(),
expiredAfter: expiredAfter,
dht: dht,
}
} | [
"func",
"newTokenManager",
"(",
"expiredAfter",
"time",
".",
"Duration",
",",
"dht",
"*",
"DHT",
")",
"*",
"tokenManager",
"{",
"return",
"&",
"tokenManager",
"{",
"syncedMap",
":",
"newSyncedMap",
"(",
")",
",",
"expiredAfter",
":",
"expiredAfter",
",",
"dh... | // newTokenManager returns a new tokenManager. | [
"newTokenManager",
"returns",
"a",
"new",
"tokenManager",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/krpc.go#L45-L51 | train |
shiyanhui/dht | krpc.go | token | func (tm *tokenManager) token(addr *net.UDPAddr) string {
v, ok := tm.Get(addr.IP.String())
tk, _ := v.(token)
if !ok || time.Now().Sub(tk.createTime) > tm.expiredAfter {
tk = token{
data: randomString(5),
createTime: time.Now(),
}
tm.Set(addr.IP.String(), tk)
}
return tk.data
} | go | func (tm *tokenManager) token(addr *net.UDPAddr) string {
v, ok := tm.Get(addr.IP.String())
tk, _ := v.(token)
if !ok || time.Now().Sub(tk.createTime) > tm.expiredAfter {
tk = token{
data: randomString(5),
createTime: time.Now(),
}
tm.Set(addr.IP.String(), tk)
}
return tk.data
} | [
"func",
"(",
"tm",
"*",
"tokenManager",
")",
"token",
"(",
"addr",
"*",
"net",
".",
"UDPAddr",
")",
"string",
"{",
"v",
",",
"ok",
":=",
"tm",
".",
"Get",
"(",
"addr",
".",
"IP",
".",
"String",
"(",
")",
")",
"\n",
"tk",
",",
"_",
":=",
"v",
... | // token returns a token. If it doesn't exist or is expired, it will add a
// new token. | [
"token",
"returns",
"a",
"token",
".",
"If",
"it",
"doesn",
"t",
"exist",
"or",
"is",
"expired",
"it",
"will",
"add",
"a",
"new",
"token",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/krpc.go#L55-L69 | train |
shiyanhui/dht | krpc.go | clear | func (tm *tokenManager) clear() {
for _ = range time.Tick(time.Minute * 3) {
keys := make([]interface{}, 0, 100)
for item := range tm.Iter() {
if time.Now().Sub(item.val.(token).createTime) > tm.expiredAfter {
keys = append(keys, item.key)
}
}
tm.DeleteMulti(keys)
}
} | go | func (tm *tokenManager) clear() {
for _ = range time.Tick(time.Minute * 3) {
keys := make([]interface{}, 0, 100)
for item := range tm.Iter() {
if time.Now().Sub(item.val.(token).createTime) > tm.expiredAfter {
keys = append(keys, item.key)
}
}
tm.DeleteMulti(keys)
}
} | [
"func",
"(",
"tm",
"*",
"tokenManager",
")",
"clear",
"(",
")",
"{",
"for",
"_",
"=",
"range",
"time",
".",
"Tick",
"(",
"time",
".",
"Minute",
"*",
"3",
")",
"{",
"keys",
":=",
"make",
"(",
"[",
"]",
"interface",
"{",
"}",
",",
"0",
",",
"10... | // clear removes expired tokens. | [
"clear",
"removes",
"expired",
"tokens",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/krpc.go#L72-L84 | train |
shiyanhui/dht | krpc.go | check | func (tm *tokenManager) check(addr *net.UDPAddr, tokenString string) bool {
key := addr.IP.String()
v, ok := tm.Get(key)
tk, _ := v.(token)
if ok {
tm.Delete(key)
}
return ok && tokenString == tk.data
} | go | func (tm *tokenManager) check(addr *net.UDPAddr, tokenString string) bool {
key := addr.IP.String()
v, ok := tm.Get(key)
tk, _ := v.(token)
if ok {
tm.Delete(key)
}
return ok && tokenString == tk.data
} | [
"func",
"(",
"tm",
"*",
"tokenManager",
")",
"check",
"(",
"addr",
"*",
"net",
".",
"UDPAddr",
",",
"tokenString",
"string",
")",
"bool",
"{",
"key",
":=",
"addr",
".",
"IP",
".",
"String",
"(",
")",
"\n",
"v",
",",
"ok",
":=",
"tm",
".",
"Get",
... | // check returns whether the token is valid. | [
"check",
"returns",
"whether",
"the",
"token",
"is",
"valid",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/krpc.go#L87-L97 | train |
shiyanhui/dht | krpc.go | makeQuery | func makeQuery(t, q string, a map[string]interface{}) map[string]interface{} {
return map[string]interface{}{
"t": t,
"y": "q",
"q": q,
"a": a,
}
} | go | func makeQuery(t, q string, a map[string]interface{}) map[string]interface{} {
return map[string]interface{}{
"t": t,
"y": "q",
"q": q,
"a": a,
}
} | [
"func",
"makeQuery",
"(",
"t",
",",
"q",
"string",
",",
"a",
"map",
"[",
"string",
"]",
"interface",
"{",
"}",
")",
"map",
"[",
"string",
"]",
"interface",
"{",
"}",
"{",
"return",
"map",
"[",
"string",
"]",
"interface",
"{",
"}",
"{",
"\"t\"",
"... | // makeQuery returns a query-formed data. | [
"makeQuery",
"returns",
"a",
"query",
"-",
"formed",
"data",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/krpc.go#L100-L107 | train |
shiyanhui/dht | krpc.go | makeError | func makeError(t string, errCode int, errMsg string) map[string]interface{} {
return map[string]interface{}{
"t": t,
"y": "e",
"e": []interface{}{errCode, errMsg},
}
} | go | func makeError(t string, errCode int, errMsg string) map[string]interface{} {
return map[string]interface{}{
"t": t,
"y": "e",
"e": []interface{}{errCode, errMsg},
}
} | [
"func",
"makeError",
"(",
"t",
"string",
",",
"errCode",
"int",
",",
"errMsg",
"string",
")",
"map",
"[",
"string",
"]",
"interface",
"{",
"}",
"{",
"return",
"map",
"[",
"string",
"]",
"interface",
"{",
"}",
"{",
"\"t\"",
":",
"t",
",",
"\"y\"",
"... | // makeError returns a err-formed data. | [
"makeError",
"returns",
"a",
"err",
"-",
"formed",
"data",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/krpc.go#L119-L125 | train |
shiyanhui/dht | krpc.go | send | func send(dht *DHT, addr *net.UDPAddr, data map[string]interface{}) error {
dht.conn.SetWriteDeadline(time.Now().Add(time.Second * 15))
_, err := dht.conn.WriteToUDP([]byte(Encode(data)), addr)
if err != nil {
dht.blackList.insert(addr.IP.String(), -1)
}
return err
} | go | func send(dht *DHT, addr *net.UDPAddr, data map[string]interface{}) error {
dht.conn.SetWriteDeadline(time.Now().Add(time.Second * 15))
_, err := dht.conn.WriteToUDP([]byte(Encode(data)), addr)
if err != nil {
dht.blackList.insert(addr.IP.String(), -1)
}
return err
} | [
"func",
"send",
"(",
"dht",
"*",
"DHT",
",",
"addr",
"*",
"net",
".",
"UDPAddr",
",",
"data",
"map",
"[",
"string",
"]",
"interface",
"{",
"}",
")",
"error",
"{",
"dht",
".",
"conn",
".",
"SetWriteDeadline",
"(",
"time",
".",
"Now",
"(",
")",
"."... | // send sends data to the udp. | [
"send",
"sends",
"data",
"to",
"the",
"udp",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/krpc.go#L128-L136 | train |
shiyanhui/dht | krpc.go | newTransactionManager | func newTransactionManager(maxCursor uint64, dht *DHT) *transactionManager {
return &transactionManager{
RWMutex: &sync.RWMutex{},
transactions: newSyncedMap(),
index: newSyncedMap(),
maxCursor: maxCursor,
queryChan: make(chan *query, 1024),
dht: dht,
}
} | go | func newTransactionManager(maxCursor uint64, dht *DHT) *transactionManager {
return &transactionManager{
RWMutex: &sync.RWMutex{},
transactions: newSyncedMap(),
index: newSyncedMap(),
maxCursor: maxCursor,
queryChan: make(chan *query, 1024),
dht: dht,
}
} | [
"func",
"newTransactionManager",
"(",
"maxCursor",
"uint64",
",",
"dht",
"*",
"DHT",
")",
"*",
"transactionManager",
"{",
"return",
"&",
"transactionManager",
"{",
"RWMutex",
":",
"&",
"sync",
".",
"RWMutex",
"{",
"}",
",",
"transactions",
":",
"newSyncedMap",... | // newTransactionManager returns new transactionManager pointer. | [
"newTransactionManager",
"returns",
"new",
"transactionManager",
"pointer",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/krpc.go#L163-L172 | train |
shiyanhui/dht | krpc.go | genTransID | func (tm *transactionManager) genTransID() string {
tm.Lock()
defer tm.Unlock()
tm.cursor = (tm.cursor + 1) % tm.maxCursor
return string(int2bytes(tm.cursor))
} | go | func (tm *transactionManager) genTransID() string {
tm.Lock()
defer tm.Unlock()
tm.cursor = (tm.cursor + 1) % tm.maxCursor
return string(int2bytes(tm.cursor))
} | [
"func",
"(",
"tm",
"*",
"transactionManager",
")",
"genTransID",
"(",
")",
"string",
"{",
"tm",
".",
"Lock",
"(",
")",
"\n",
"defer",
"tm",
".",
"Unlock",
"(",
")",
"\n",
"tm",
".",
"cursor",
"=",
"(",
"tm",
".",
"cursor",
"+",
"1",
")",
"%",
"... | // genTransID generates a transaction id and returns it. | [
"genTransID",
"generates",
"a",
"transaction",
"id",
"and",
"returns",
"it",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/krpc.go#L175-L181 | train |
shiyanhui/dht | krpc.go | newTransaction | func (tm *transactionManager) newTransaction(id string, q *query) *transaction {
return &transaction{
id: id,
query: q,
response: make(chan struct{}, tm.dht.Try+1),
}
} | go | func (tm *transactionManager) newTransaction(id string, q *query) *transaction {
return &transaction{
id: id,
query: q,
response: make(chan struct{}, tm.dht.Try+1),
}
} | [
"func",
"(",
"tm",
"*",
"transactionManager",
")",
"newTransaction",
"(",
"id",
"string",
",",
"q",
"*",
"query",
")",
"*",
"transaction",
"{",
"return",
"&",
"transaction",
"{",
"id",
":",
"id",
",",
"query",
":",
"q",
",",
"response",
":",
"make",
... | // newTransaction creates a new transaction. | [
"newTransaction",
"creates",
"a",
"new",
"transaction",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/krpc.go#L184-L190 | train |
shiyanhui/dht | krpc.go | genIndexKey | func (tm *transactionManager) genIndexKey(queryType, address string) string {
return strings.Join([]string{queryType, address}, ":")
} | go | func (tm *transactionManager) genIndexKey(queryType, address string) string {
return strings.Join([]string{queryType, address}, ":")
} | [
"func",
"(",
"tm",
"*",
"transactionManager",
")",
"genIndexKey",
"(",
"queryType",
",",
"address",
"string",
")",
"string",
"{",
"return",
"strings",
".",
"Join",
"(",
"[",
"]",
"string",
"{",
"queryType",
",",
"address",
"}",
",",
"\":\"",
")",
"\n",
... | // genIndexKey generates an indexed key which consists of queryType and
// address. | [
"genIndexKey",
"generates",
"an",
"indexed",
"key",
"which",
"consists",
"of",
"queryType",
"and",
"address",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/krpc.go#L194-L196 | train |
shiyanhui/dht | krpc.go | genIndexKeyByTrans | func (tm *transactionManager) genIndexKeyByTrans(trans *transaction) string {
return tm.genIndexKey(trans.data["q"].(string), trans.node.addr.String())
} | go | func (tm *transactionManager) genIndexKeyByTrans(trans *transaction) string {
return tm.genIndexKey(trans.data["q"].(string), trans.node.addr.String())
} | [
"func",
"(",
"tm",
"*",
"transactionManager",
")",
"genIndexKeyByTrans",
"(",
"trans",
"*",
"transaction",
")",
"string",
"{",
"return",
"tm",
".",
"genIndexKey",
"(",
"trans",
".",
"data",
"[",
"\"q\"",
"]",
".",
"(",
"string",
")",
",",
"trans",
".",
... | // genIndexKeyByTrans generates an indexed key by a transaction. | [
"genIndexKeyByTrans",
"generates",
"an",
"indexed",
"key",
"by",
"a",
"transaction",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/krpc.go#L199-L201 | train |
shiyanhui/dht | krpc.go | insert | func (tm *transactionManager) insert(trans *transaction) {
tm.Lock()
defer tm.Unlock()
tm.transactions.Set(trans.id, trans)
tm.index.Set(tm.genIndexKeyByTrans(trans), trans)
} | go | func (tm *transactionManager) insert(trans *transaction) {
tm.Lock()
defer tm.Unlock()
tm.transactions.Set(trans.id, trans)
tm.index.Set(tm.genIndexKeyByTrans(trans), trans)
} | [
"func",
"(",
"tm",
"*",
"transactionManager",
")",
"insert",
"(",
"trans",
"*",
"transaction",
")",
"{",
"tm",
".",
"Lock",
"(",
")",
"\n",
"defer",
"tm",
".",
"Unlock",
"(",
")",
"\n",
"tm",
".",
"transactions",
".",
"Set",
"(",
"trans",
".",
"id"... | // insert adds a transaction to transactionManager. | [
"insert",
"adds",
"a",
"transaction",
"to",
"transactionManager",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/krpc.go#L204-L210 | train |
shiyanhui/dht | krpc.go | delete | func (tm *transactionManager) delete(transID string) {
v, ok := tm.transactions.Get(transID)
if !ok {
return
}
tm.Lock()
defer tm.Unlock()
trans := v.(*transaction)
tm.transactions.Delete(trans.id)
tm.index.Delete(tm.genIndexKeyByTrans(trans))
} | go | func (tm *transactionManager) delete(transID string) {
v, ok := tm.transactions.Get(transID)
if !ok {
return
}
tm.Lock()
defer tm.Unlock()
trans := v.(*transaction)
tm.transactions.Delete(trans.id)
tm.index.Delete(tm.genIndexKeyByTrans(trans))
} | [
"func",
"(",
"tm",
"*",
"transactionManager",
")",
"delete",
"(",
"transID",
"string",
")",
"{",
"v",
",",
"ok",
":=",
"tm",
".",
"transactions",
".",
"Get",
"(",
"transID",
")",
"\n",
"if",
"!",
"ok",
"{",
"return",
"\n",
"}",
"\n",
"tm",
".",
"... | // delete removes a transaction from transactionManager. | [
"delete",
"removes",
"a",
"transaction",
"from",
"transactionManager",
"."
] | 1b3b78ecf279a28409577382c3ae95df5703cf50 | https://github.com/shiyanhui/dht/blob/1b3b78ecf279a28409577382c3ae95df5703cf50/krpc.go#L213-L225 | train |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.