Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/Go-Learning-Land/Go-Learning-Archive
/ functions
Functions
5,073 in github.com/Go-Learning-Land/Go-Learning-Archive
⨍
Functions
5,073
◇
Types & classes
815
↓ 2,561 callers
Method
Println
(args ...interface{})
GolangBasics/learngo/x-tba/tictactoe-experiments/06-refactor/logger.go:25
↓ 1,434 callers
Method
Printf
(fmt string, args ...interface{})
GolangBasics/learngo/x-tba/tictactoe-experiments/06-refactor/logger.go:21
↓ 884 callers
Method
Put
(key interface{}, value interface{})
GolangDataStructuresAndAlgorithms/Golang Data Structures/maps/maps.go:22
↓ 530 callers
Function
$
()
GolangBooks/blackhatGo/ch-4/credential_harvester/public/index_files/jquery.min.js:35
↓ 356 callers
Method
Size
()
GolangDataStructuresAndAlgorithms/Golang Data Structures/containers/containers.go:21
↓ 280 callers
Method
Value
Value returns the current element's value. Does not modify the state of the iterator.
GolangDataStructuresAndAlgorithms/Golang Data Structures/containers/iterator.go:49
↓ 280 callers
Function
t
()
GolangBooks/blackhatGo/ch-4/credential_harvester/public/index_files/jquery-ui-1.10.4.custom.min.js:36
↓ 253 callers
Method
Add
(elements ...interface{})
GolangDataStructuresAndAlgorithms/Golang Data Structures/sets/sets.go:16
↓ 244 callers
Method
Next
Next moves the iterator to the next element and returns true if there was a next element in the container. If Next() returns true, then next element's
GolangDataStructuresAndAlgorithms/Golang Data Structures/containers/iterator.go:45
↓ 242 callers
Method
Print
()
GolangDesignPatterns/refactoringGuru/bridge/computer.go:4
↓ 206 callers
Method
Index
Index returns the current element's index. Does not modify the state of the iterator.
GolangDataStructuresAndAlgorithms/Golang Data Structures/containers/iterator.go:21
↓ 205 callers
Method
Enqueue
(value interface{})
GolangDataStructuresAndAlgorithms/Golang Data Structures/queues/queues.go:17
↓ 180 callers
Function
e
(t)
GolangBooks/blackhatGo/ch-4/credential_harvester/public/index_files/jquery-ui-1.10.4.custom.min.js:36
↓ 175 callers
Function
assertValidTreeNode
(t *testing.T, node *Node, expectedEntries int, expectedChildren int, keys []int, hasParent bool)
GolangDataStructuresAndAlgorithms/Golang Data Structures/trees/btree/btree_test.go:1052
↓ 163 callers
Method
Push
(value interface{})
GolangDataStructuresAndAlgorithms/Golang Data Structures/stacks/stacks.go:16
↓ 158 callers
Method
Close
()
GolangBooks/blackhatGo/ch-6/smb/smb/session.go:332
↓ 156 callers
Method
Remove
(key interface{})
GolangDataStructuresAndAlgorithms/Golang Data Structures/maps/maps.go:24
↓ 138 callers
Method
Add
(values ...interface{})
GolangDataStructuresAndAlgorithms/Golang Data Structures/lists/lists.go:21
↓ 135 callers
Method
New
create the map of integer and bool
GolangDataStructuresAndAlgorithms/Learn-Data-Structures-and-Algorithms-with-Golang/Chapter03/set.go:16
↓ 132 callers
Method
Get
(key interface{})
GolangDataStructuresAndAlgorithms/Golang Data Structures/maps/maps.go:23
↓ 130 callers
Method
Key
Key returns the current element's key. Does not modify the state of the iterator.
GolangDataStructuresAndAlgorithms/Golang Data Structures/containers/iterator.go:53
↓ 110 callers
Function
f
()
GolangBooks/blackhatGo/ch-4/credential_harvester/public/index_files/jstz.min.js:35
↓ 106 callers
Method
Values
()
GolangDataStructuresAndAlgorithms/Golang Data Structures/containers/containers.go:23
↓ 96 callers
Method
Prev
Prev moves the iterator to the previous element and returns true if there was a previous element in the container. If Prev() returns true, then previo
GolangDataStructuresAndAlgorithms/Golang Data Structures/containers/iterator.go:115
↓ 84 callers
Method
height
()
GolangDataStructuresAndAlgorithms/Golang Data Structures/trees/btree/btree.go:236
↓ 83 callers
Method
Empty
()
GolangDataStructuresAndAlgorithms/Golang Data Structures/containers/containers.go:20
↓ 82 callers
Method
End
End moves the iterator past the last element (one-past-the-end). Call Prev() to fetch the last element if any.
GolangDataStructuresAndAlgorithms/Golang Data Structures/containers/iterator.go:119
↓ 73 callers
Method
Contains
(elements ...interface{})
GolangDataStructuresAndAlgorithms/Golang Data Structures/sets/sets.go:18
↓ 73 callers
Method
remove
(key interface{}, qp **Node)
GolangDataStructuresAndAlgorithms/Golang Data Structures/trees/avltree/avltree.go:257
↓ 72 callers
Method
Clear
()
GolangDataStructuresAndAlgorithms/Golang Data Structures/containers/containers.go:22
↓ 70 callers
Method
get
(key string)
GolangDesignPatterns/refactoringGuru/strategy/cache.go:32
↓ 69 callers
Method
Get
(index int)
GolangDataStructuresAndAlgorithms/Golang Data Structures/lists/lists.go:19
↓ 67 callers
Method
Begin
Begin resets the iterator to its initial state (one-before-first) Call Next() to fetch the first element if any.
GolangDataStructuresAndAlgorithms/Golang Data Structures/containers/iterator.go:57
↓ 64 callers
Method
String
()
GolangDataStructuresAndAlgorithms/Golang Data Structures/containers/containers.go:24
↓ 63 callers
Function
assertValidTree
(t *testing.T, tree *Tree, expectedSize int)
GolangDataStructuresAndAlgorithms/Golang Data Structures/trees/btree/btree_test.go:1046
↓ 57 callers
Method
NextTo
NextTo moves the iterator to the next element from current position that satisfies the condition given by the passed function, and returns true if the
GolangDataStructuresAndAlgorithms/Golang Data Structures/containers/iterator.go:68
↓ 54 callers
Function
NewWithIntComparator
NewWithIntComparator instantiates a B-tree with the order (maximum number of children) and the IntComparator, i.e. keys are of type int.
GolangDataStructuresAndAlgorithms/Golang Data Structures/trees/btree/btree.go:60
↓ 50 callers
Function
i
(t,i)
GolangBooks/blackhatGo/ch-4/credential_harvester/public/index_files/jquery-ui-1.10.4.custom.min.js:36
↓ 49 callers
Function
New
New instantiates a new list and adds the passed values, if any, to the list
GolangDataStructuresAndAlgorithms/Golang Data Structures/lists/doublylinkedlist/doublylinkedlist.go:37
↓ 49 callers
Function
New
New instantiates a new empty set and adds the passed values, if any, to the set
GolangDataStructuresAndAlgorithms/Golang Data Structures/sets/linkedhashset/linkedhashset.go:35
↓ 48 callers
Function
New
New instantiates a new list and adds the passed values, if any, to the list Take a look at the this: https://stackoverflow.com/a/23669857/6946237
GolangDataStructuresAndAlgorithms/Golang Data Structures/lists/arraylist/arraylist.go:36
↓ 48 callers
Method
PrevTo
PrevTo moves the iterator to the previous element from current position that satisfies the condition given by the passed function, and returns true if
GolangDataStructuresAndAlgorithms/Golang Data Structures/containers/iterator.go:130
↓ 45 callers
Method
Debug
(msg string, err error)
GolangBooks/blackhatGo/ch-6/smb/smb/session.go:87
↓ 45 callers
Method
Keys
()
GolangDataStructuresAndAlgorithms/Golang Data Structures/maps/maps.go:25
↓ 44 callers
Method
Dequeue
()
GolangDataStructuresAndAlgorithms/Golang Data Structures/queues/queues.go:18
↓ 43 callers
Function
n
(a,b)
GolangBooks/blackhatGo/ch-4/credential_harvester/public/index_files/jquery.min.js:34
↓ 42 callers
Function
New
New instantiates a new list and adds the passed values, if any, to the list
GolangDataStructuresAndAlgorithms/Golang Data Structures/lists/singlylinkedlist/singlylinkedlist.go:36
↓ 41 callers
Method
Fields
Fields returns all the field names. The names can be used to query the Record.
GolangBasics/learngo/logparser/v5/pipe/recordshare.go:36
↓ 41 callers
Function
New
New instantiates a linked-hash-map.
GolangDataStructuresAndAlgorithms/Golang Data Structures/maps/linkedhashmap/linkedhashmap.go:31
↓ 40 callers
Method
Sort
(comparator utils.Comparator)
GolangDataStructuresAndAlgorithms/Golang Data Structures/lists/lists.go:23
↓ 39 callers
Method
split
(node *Node)
GolangDataStructuresAndAlgorithms/Golang Data Structures/trees/btree/btree.go:346
↓ 38 callers
Method
First
First moves the iterator to the first element and returns true if there was a first element in the container. If First() returns true, then first elem
GolangDataStructuresAndAlgorithms/Golang Data Structures/containers/iterator.go:62
↓ 38 callers
Function
NewWithIntComparator
NewWithIntComparator instantiates an AVL tree with the IntComparator, i.e. keys are of type int.
GolangDataStructuresAndAlgorithms/Golang Data Structures/trees/avltree/avltree.go:43
↓ 38 callers
Method
on
()
GolangDesignPatterns/refactoringGuru/command/device.go:4
↓ 37 callers
Method
add
(data T)
GolangBooks/masteringGo/ch13/structures.go:18
↓ 36 callers
Function
NewWithIntComparator
NewWithIntComparator instantiates a red-black tree with the IntComparator, i.e. keys are of type int.
GolangDataStructuresAndAlgorithms/Golang Data Structures/trees/redblacktree/redblacktree.go:52
↓ 36 callers
Method
Parse
Parse the next record from the source.
GolangBasics/learngo/logparser/v6/logly/parse/parser.go:16
↓ 35 callers
Method
Error
Implement error interface
GolangBooks/masteringGo/ch04/errorInt.go:17
↓ 35 callers
Method
Write
Write writes data to Stdout.
GolangBooks/blackhatGo/ch-2/io-example/main.go:22
↓ 33 callers
Method
Err
Err returns the first error that was encountered.
GolangBasics/learngo/logparser/v6/logly/parse/parser.go:22
↓ 32 callers
Method
Pop
()
GolangDataStructuresAndAlgorithms/Golang Data Structures/stacks/stacks.go:17
↓ 31 callers
Function
NewWithStringComparator
NewWithStringComparator instantiates a new empty set with the StringComparator, i.e. keys are of type string.
GolangDataStructuresAndAlgorithms/Golang Data Structures/sets/treeset/treeset.go:50
↓ 31 callers
Method
ToJSON
ToJSON outputs the JSON representation of containers's elements.
GolangDataStructuresAndAlgorithms/Golang Data Structures/containers/serialization.go:10
↓ 30 callers
Method
FromJSON
FromJSON populates containers's elements from the input JSON representation.
GolangDataStructuresAndAlgorithms/Golang Data Structures/containers/serialization.go:18
↓ 30 callers
Function
s
(t,i,n,s)
GolangBooks/blackhatGo/ch-4/credential_harvester/public/index_files/jquery-ui-1.10.4.custom.min.js:36
↓ 29 callers
Method
Error
()
GolangBasics/GoByExample/022Error.go:23
↓ 29 callers
Method
Last
Last moves the iterator to the last element and returns true if there was a last element in the container. If Last() returns true, then last element's
GolangDataStructuresAndAlgorithms/Golang Data Structures/containers/iterator.go:124
↓ 29 callers
Function
NewWith
NewWith instantiates a bidirectional map.
GolangDataStructuresAndAlgorithms/Golang Data Structures/maps/treebidimap/treebidimap.go:45
↓ 28 callers
Function
New
New instantiates a new empty queue with the specified size of maximum number of elements that it can hold. This max size of the buffer cannot be chang
GolangDataStructuresAndAlgorithms/Golang Data Structures/queues/circularbuffer/circularbuffer.go:36
↓ 28 callers
Function
NewWithIntComparator
NewWithIntComparator instantiates a tree map with the IntComparator, i.e. keys are of type int.
GolangDataStructuresAndAlgorithms/Golang Data Structures/maps/treemap/treemap.go:36
↓ 28 callers
Method
Set
(index int, value interface{})
GolangDataStructuresAndAlgorithms/Golang Data Structures/lists/lists.go:26
↓ 28 callers
Method
Write
(p []byte)
GolangBooks/masteringGo/ch06/ioInterface.go:27
↓ 27 callers
Function
New
New instantiates a new empty set and adds the passed values, if any, to the set
GolangDataStructuresAndAlgorithms/Golang Data Structures/sets/hashset/hashset.go:29
↓ 27 callers
Function
NewWith
NewWith instantiates a new empty queue with the custom comparator.
GolangDataStructuresAndAlgorithms/Golang Data Structures/queues/priorityqueue/priorityqueue.go:36
↓ 27 callers
Method
Peek
()
GolangDataStructuresAndAlgorithms/Golang Data Structures/queues/queues.go:19
↓ 26 callers
Function
New
New instantiates a new empty queue
GolangDataStructuresAndAlgorithms/Golang Data Structures/queues/arrayqueue/arrayqueue.go:29
↓ 26 callers
Function
New
New instantiates a new empty stack
GolangDataStructuresAndAlgorithms/Golang Data Structures/stacks/arraystack/arraystack.go:28
↓ 25 callers
Method
Iterator
Iterator returns a stateful iterator whose elements are key/value pairs.
GolangDataStructuresAndAlgorithms/Golang Data Structures/maps/linkedhashmap/iterator.go:22
↓ 25 callers
Method
Iterator
Iterator returns a stateful iterator whose elements are key/value pairs.
GolangDataStructuresAndAlgorithms/Golang Data Structures/maps/treemap/iterator.go:21
↓ 25 callers
Method
Iterator
Iterator holding the iterator's state
GolangDataStructuresAndAlgorithms/Golang Data Structures/sets/treeset/iterator.go:23
↓ 25 callers
Method
Read
Read reads data from stdin.
GolangBooks/blackhatGo/ch-2/io-example/main.go:13
↓ 25 callers
Method
Remove
(elements ...interface{})
GolangDataStructuresAndAlgorithms/Golang Data Structures/sets/sets.go:17
↓ 24 callers
Method
Do
(args *Args, reply *int)
GolangBooks/handsOnSoftwareArch/Chapter05/rpc_server.go:17
↓ 24 callers
Method
Iterator
Iterator returns a stateful iterator whose elements are key/value pairs.
GolangDataStructuresAndAlgorithms/Golang Data Structures/maps/treebidimap/iterator.go:21
↓ 24 callers
Method
next
()
GolangBasics/learngo/x-tba/tictactoe-experiments/05-with-pointers/main.go:168
↓ 24 callers
Function
rotl16
(x uint16, b uint)
GolangBooks/blackhatGo/ch-11/rc2-brute/rc2/rc2.go:83
↓ 23 callers
Method
Iterator
Iterator returns a stateful iterator whose elements are key/value pairs.
GolangDataStructuresAndAlgorithms/Golang Data Structures/trees/avltree/iterator.go:26
↓ 23 callers
Method
Iterator
Iterator returns a stateful iterator whose elements are key/value pairs.
GolangDataStructuresAndAlgorithms/Golang Data Structures/trees/btree/iterator.go:27
↓ 23 callers
Method
Iterator
Iterator returns a stateful iterator whose elements are key/value pairs.
GolangDataStructuresAndAlgorithms/Golang Data Structures/trees/redblacktree/iterator.go:26
↓ 22 callers
Method
Find
Find passes each element of the container to the given function and returns the first (key,value) for which the function is true or nil,nil otherwise
GolangDataStructuresAndAlgorithms/Golang Data Structures/containers/enumerable.go:56
↓ 21 callers
Method
All
All passes each element of the container to the given function and returns true if the function returns true for all elements.
GolangDataStructuresAndAlgorithms/Golang Data Structures/containers/enumerable.go:51
↓ 21 callers
Method
Iterator
Iterator returns a stateful iterator whose values can be fetched by an index.
GolangDataStructuresAndAlgorithms/Golang Data Structures/sets/linkedhashset/iterator.go:21
↓ 21 callers
Function
nodeColor
(node *Node)
GolangDataStructuresAndAlgorithms/Golang Data Structures/trees/redblacktree/redblacktree.go:543
↓ 21 callers
Function
oa
(a)
GolangBooks/blackhatGo/ch-4/credential_harvester/public/index_files/jquery.min.js:34
↓ 20 callers
Method
Iterator
Iterator returns a stateful iterator whose values can be fetched by an index.
GolangDataStructuresAndAlgorithms/Golang Data Structures/lists/doublylinkedlist/iterator.go:20
↓ 20 callers
Method
Iterator
Iterator returns a stateful iterator whose values can be fetched by an index.
GolangDataStructuresAndAlgorithms/Golang Data Structures/lists/arraylist/iterator.go:19
↓ 20 callers
Function
New
New instantiates a new empty queue
GolangDataStructuresAndAlgorithms/Golang Data Structures/queues/linkedlistqueue/linkedlistqueue.go:29
↓ 20 callers
Function
NewWithIntComparator
NewWithIntComparator instantiates a new empty heap with the IntComparator, i.e. elements are of type int.
GolangDataStructuresAndAlgorithms/Golang Data Structures/trees/binaryheap/binaryheap.go:37
↓ 20 callers
Function
NewWithIntComparator
NewWithIntComparator instantiates a new empty set with the IntComparator, i.e. keys are of type int.
GolangDataStructuresAndAlgorithms/Golang Data Structures/sets/treeset/treeset.go:41
↓ 19 callers
Function
New
New nnstantiates a new empty stack
GolangDataStructuresAndAlgorithms/Golang Data Structures/stacks/linkedliststack/linkedliststack.go:28
next →
1–100 of 5,073, ranked by callers