@@ -63,18 +63,61 @@ numberOfTypeParameters
63
63
| internal/bytealg.HashStrRev | 0 | T | interface { string \| []uint8 } |
64
64
| internal/bytealg.IndexRabinKarp | 0 | T | interface { string \| []uint8 } |
65
65
| internal/bytealg.LastIndexRabinKarp | 0 | T | interface { string \| []uint8 } |
66
+ | internal/poll.ignoringEINTR2 | 0 | T | interface { } |
66
67
| internal/runtime/atomic.Pointer.CompareAndSwap | 0 | T | interface { } |
67
68
| internal/runtime/atomic.Pointer.CompareAndSwapNoWB | 0 | T | interface { } |
68
69
| internal/runtime/atomic.Pointer.Load | 0 | T | interface { } |
69
70
| internal/runtime/atomic.Pointer.Store | 0 | T | interface { } |
70
71
| internal/runtime/atomic.Pointer.StoreNoWB | 0 | T | interface { } |
72
+ | internal/sync.HashTrieMap.All | 0 | K | comparable |
73
+ | internal/sync.HashTrieMap.All | 1 | V | interface { } |
74
+ | internal/sync.HashTrieMap.CompareAndDelete | 0 | K | comparable |
75
+ | internal/sync.HashTrieMap.CompareAndDelete | 1 | V | interface { } |
76
+ | internal/sync.HashTrieMap.CompareAndSwap | 0 | K | comparable |
77
+ | internal/sync.HashTrieMap.CompareAndSwap | 1 | V | interface { } |
78
+ | internal/sync.HashTrieMap.Delete | 0 | K | comparable |
79
+ | internal/sync.HashTrieMap.Load | 0 | K | comparable |
80
+ | internal/sync.HashTrieMap.Load | 1 | V | interface { } |
81
+ | internal/sync.HashTrieMap.LoadAndDelete | 0 | K | comparable |
82
+ | internal/sync.HashTrieMap.LoadAndDelete | 1 | V | interface { } |
83
+ | internal/sync.HashTrieMap.LoadOrStore | 0 | K | comparable |
84
+ | internal/sync.HashTrieMap.LoadOrStore | 1 | V | interface { } |
85
+ | internal/sync.HashTrieMap.Range | 0 | K | comparable |
86
+ | internal/sync.HashTrieMap.Range | 1 | V | interface { } |
87
+ | internal/sync.HashTrieMap.Store | 0 | K | comparable |
88
+ | internal/sync.HashTrieMap.Store | 1 | V | interface { } |
89
+ | internal/sync.HashTrieMap.Swap | 0 | K | comparable |
90
+ | internal/sync.HashTrieMap.Swap | 1 | V | interface { } |
91
+ | internal/sync.HashTrieMap.find | 0 | K | comparable |
92
+ | internal/sync.HashTrieMap.find | 1 | V | interface { } |
93
+ | internal/sync.HashTrieMap.iter | 0 | K | comparable |
94
+ | internal/sync.HashTrieMap.iter | 1 | V | interface { } |
95
+ | internal/sync.entry | 0 | K | comparable |
96
+ | internal/sync.entry.compareAndDelete | 0 | K | comparable |
97
+ | internal/sync.entry.compareAndDelete | 1 | V | interface { } |
98
+ | internal/sync.entry.compareAndSwap | 0 | K | comparable |
99
+ | internal/sync.entry.compareAndSwap | 1 | V | interface { } |
100
+ | internal/sync.entry.loadAndDelete | 0 | K | comparable |
101
+ | internal/sync.entry.loadAndDelete | 1 | V | interface { } |
102
+ | internal/sync.entry.lookup | 0 | K | comparable |
103
+ | internal/sync.entry.lookup | 1 | V | interface { } |
104
+ | internal/sync.entry.lookupWithValue | 0 | K | comparable |
105
+ | internal/sync.entry.lookupWithValue | 1 | V | interface { } |
106
+ | internal/sync.entry.swap | 0 | K | comparable |
107
+ | internal/sync.entry.swap | 1 | V | interface { } |
108
+ | internal/sync.newEntryNode | 0 | K | comparable |
109
+ | internal/sync.newEntryNode | 1 | V | interface { } |
71
110
| iter.Pull | 0 | V | interface { } |
72
111
| iter.Pull2 | 0 | K | interface { } |
73
112
| iter.Pull2 | 1 | V | interface { } |
74
113
| iter.Seq | 0 | V | interface { } |
75
114
| iter.Seq2 | 0 | K | interface { } |
76
115
| iter.Seq2 | 1 | V | interface { } |
116
+ | os.doInRoot | 0 | T | interface { } |
117
+ | os.ignoringEINTR2 | 0 | T | interface { } |
77
118
| reflect.rangeNum | 1 | N | interface { int64 \| uint64 } |
119
+ | runtime.AddCleanup | 0 | T | interface { } |
120
+ | runtime.AddCleanup | 1 | S | interface { } |
78
121
| runtime.fandbits | 0 | F | floaty |
79
122
| runtime.fmax | 0 | F | floaty |
80
123
| runtime.fmin | 0 | F | floaty |
0 commit comments