Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/1995parham/linkedlist
/ functions
Functions
59 in github.com/1995parham/linkedlist
⨍
Functions
59
◇
Types & classes
9
↓ 28 callers
Method
Insert
Insert adds an element in its sorted position (ascending order).
pkg/list/sorted.go:28
↓ 26 callers
Method
PushBack
(data T)
pkg/list/list.go:38
↓ 16 callers
Method
Collect
Collect materializes the list into a slice using slices.Collect (Go 1.23+).
pkg/list/list.go:83
↓ 10 callers
Method
Values
Values returns an iterator over all element values. This follows the slices.Values convention.
pkg/list/list.go:58
↓ 8 callers
Method
data
()
pkg/list/node.go:14
↓ 8 callers
Method
next
()
pkg/list/node.go:13
↓ 6 callers
Method
Len
()
pkg/list/list.go:23
↓ 6 callers
Method
PushFront
(data T)
pkg/list/list.go:32
↓ 6 callers
Method
setNext
(Node[T])
pkg/list/node.go:4
↓ 6 callers
Method
valid
()
pkg/list/node.go:12
↓ 4 callers
Function
Map
Map transforms each element of an iterator using the given function, returning a new iterator. This is a standalone function because Go methods cannot
pkg/list/list.go:101
↓ 3 callers
Method
Filter
(fn func(T) bool)
pkg/list/list.go:44
↓ 3 callers
Method
String
()
pkg/list/list.go:87
↓ 3 callers
Function
newNode
(data T)
pkg/list/node.go:22
↓ 2 callers
Method
All
All returns an iterator over index-value pairs. This follows the slices.All convention (Go 1.23+).
pkg/list/list.go:70
↓ 2 callers
Method
Less
(C)
pkg/list/sorted.go:11
↓ 2 callers
Method
pushNext
(last Linker[T], new Node[T])
pkg/list/node.go:11
↓ 1 callers
Method
Values
()
pkg/list/sorted.go:53
Method
All
()
pkg/list/sorted.go:57
Method
Collect
()
pkg/list/sorted.go:61
Method
Filter
(fn func(T) bool)
pkg/list/sorted.go:65
Method
Len
()
pkg/list/sorted.go:49
Method
Less
(b Int)
main.go:13
Method
Less
(b Int)
pkg/list/sorted_test.go:10
Function
New
()
pkg/list/list.go:13
Function
NewSorted
()
pkg/list/sorted.go:21
Method
String
()
pkg/list/sorted.go:69
Function
TestAll
(t *testing.T)
pkg/list/list_test.go:115
Function
TestCollect
(t *testing.T)
pkg/list/list_test.go:87
Function
TestFilter
(t *testing.T)
pkg/list/list_test.go:49
Function
TestListIsLinker
(t *testing.T)
pkg/list/list_test.go:171
Function
TestListWith2Members
(t *testing.T)
pkg/list/list_test.go:9
Function
TestListWith2MembersBack
(t *testing.T)
pkg/list/list_test.go:29
Function
TestMap
(t *testing.T)
pkg/list/list_test.go:139
Function
TestMapTypeChange
(t *testing.T)
pkg/list/list_test.go:155
Function
TestNewEndNode
(t *testing.T)
pkg/list/node_test.go:16
Function
TestNewNode
(t *testing.T)
pkg/list/node_test.go:7
Function
TestSortedFilter
(t *testing.T)
pkg/list/sorted_test.go:104
Function
TestSortedInsertAscending
(t *testing.T)
pkg/list/sorted_test.go:62
Function
TestSortedInsertDescending
(t *testing.T)
pkg/list/sorted_test.go:45
Function
TestSortedInsertDuplicates
(t *testing.T)
pkg/list/sorted_test.go:29
Function
TestSortedInsertSingle
(t *testing.T)
pkg/list/sorted_test.go:77
Function
TestSortedInsertUnordered
(t *testing.T)
pkg/list/sorted_test.go:14
Function
TestSortedString
(t *testing.T)
pkg/list/sorted_test.go:92
Function
TestString
(t *testing.T)
pkg/list/list_test.go:74
Function
TestValues
(t *testing.T)
pkg/list/list_test.go:101
Method
data
()
pkg/list/node.go:45
Method
data
()
pkg/list/node.go:72
Function
main
()
main.go:17
Function
newEndNode
()
pkg/list/node.go:53
Method
next
()
pkg/list/node.go:41
Method
next
()
pkg/list/node.go:61
Method
pushNext
(_ Linker[T], new Node[T])
pkg/list/node.go:29
Method
pushNext
(previous Linker[T], next Node[T])
pkg/list/node.go:67
Method
setNext
(node Node[T])
pkg/list/node.go:33
Method
setNext
(Node[T])
pkg/list/node.go:65
Method
setNext
(node Node[T])
pkg/list/list.go:19
Method
valid
()
pkg/list/node.go:37
Method
valid
()
pkg/list/node.go:57