/dports/math/igraph/igraph-0.9.5/tests/unit/ |
H A D | igraph_realize_degree_sequence.out | 4 Largest: 21 Largest: 38 Largest: 58 Largest: 87 Largest: 116 Largest: 189 Largest: 215 Largest: 249 Largest: 284 Largest: [all …]
|
/dports/net/ooni-mini/probe-engine-0.23.0/vendor/github.com/lucas-clemente/quic-go/internal/wire/ |
H A D | ack_frame_test.go | 111 {Largest: 98, Smallest: 98}, 112 {Largest: 95, Smallest: 94}, 296 {Smallest: 8, Largest: 8}, 297 {Smallest: 5, Largest: 6}, 298 {Smallest: 1, Largest: 3}, 351 {Smallest: 4, Largest: 3}, 360 {Smallest: 2, Largest: 2}, 361 {Smallest: 6, Largest: 7}, 370 {Smallest: 5, Largest: 7}, 371 {Smallest: 2, Largest: 5}, [all …]
|
H A D | ack_frame.go | 67 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largestAcked}) 89 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largest}) 143 largestAcked := f.AckRanges[0].Largest 185 return 0, uint64(f.AckRanges[0].Largest - f.AckRanges[0].Smallest) 187 return uint64(f.AckRanges[i-1].Smallest - f.AckRanges[i].Largest - 2), 188 uint64(f.AckRanges[i].Largest - f.AckRanges[i].Smallest) 203 if ackRange.Smallest > ackRange.Largest { 217 if lastAckRange.Smallest <= ackRange.Largest+1 { 227 return f.AckRanges[0].Largest 245 return p <= f.AckRanges[i].Largest
|
/dports/security/xray-core/Xray-core-1.5.0/vendor/github.com/lucas-clemente/quic-go/internal/wire/ |
H A D | ack_frame_test.go | 111 {Largest: 98, Smallest: 98}, 112 {Largest: 95, Smallest: 94}, 296 {Smallest: 8, Largest: 8}, 297 {Smallest: 5, Largest: 6}, 298 {Smallest: 1, Largest: 3}, 351 {Smallest: 4, Largest: 3}, 360 {Smallest: 2, Largest: 2}, 361 {Smallest: 6, Largest: 7}, 370 {Smallest: 5, Largest: 7}, 371 {Smallest: 2, Largest: 5}, [all …]
|
H A D | ack_frame.go | 68 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largestAcked}) 90 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largest}) 144 largestAcked := f.AckRanges[0].Largest 186 return 0, uint64(f.AckRanges[0].Largest - f.AckRanges[0].Smallest) 188 return uint64(f.AckRanges[i-1].Smallest - f.AckRanges[i].Largest - 2), 189 uint64(f.AckRanges[i].Largest - f.AckRanges[i].Smallest) 204 if ackRange.Smallest > ackRange.Largest { 218 if lastAckRange.Smallest <= ackRange.Largest+1 { 228 return f.AckRanges[0].Largest 246 return p <= f.AckRanges[i].Largest
|
/dports/dns/nextdns/nextdns-1.32.2/vendor/github.com/lucas-clemente/quic-go/internal/wire/ |
H A D | ack_frame_test.go | 111 {Largest: 98, Smallest: 98}, 112 {Largest: 95, Smallest: 94}, 296 {Smallest: 8, Largest: 8}, 297 {Smallest: 5, Largest: 6}, 298 {Smallest: 1, Largest: 3}, 351 {Smallest: 4, Largest: 3}, 360 {Smallest: 2, Largest: 2}, 361 {Smallest: 6, Largest: 7}, 370 {Smallest: 5, Largest: 7}, 371 {Smallest: 2, Largest: 5}, [all …]
|
H A D | ack_frame.go | 68 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largestAcked}) 90 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largest}) 144 largestAcked := f.AckRanges[0].Largest 186 return 0, uint64(f.AckRanges[0].Largest - f.AckRanges[0].Smallest) 188 return uint64(f.AckRanges[i-1].Smallest - f.AckRanges[i].Largest - 2), 189 uint64(f.AckRanges[i].Largest - f.AckRanges[i].Smallest) 204 if ackRange.Smallest > ackRange.Largest { 218 if lastAckRange.Smallest <= ackRange.Largest+1 { 228 return f.AckRanges[0].Largest 246 return p <= f.AckRanges[i].Largest
|
/dports/net-im/dendrite/dendrite-0.5.1/vendor/github.com/lucas-clemente/quic-go/internal/wire/ |
H A D | ack_frame_test.go | 111 {Largest: 98, Smallest: 98}, 112 {Largest: 95, Smallest: 94}, 296 {Smallest: 8, Largest: 8}, 297 {Smallest: 5, Largest: 6}, 298 {Smallest: 1, Largest: 3}, 351 {Smallest: 4, Largest: 3}, 360 {Smallest: 2, Largest: 2}, 361 {Smallest: 6, Largest: 7}, 370 {Smallest: 5, Largest: 7}, 371 {Smallest: 2, Largest: 5}, [all …]
|
H A D | ack_frame.go | 68 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largestAcked}) 90 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largest}) 144 largestAcked := f.AckRanges[0].Largest 186 return 0, uint64(f.AckRanges[0].Largest - f.AckRanges[0].Smallest) 188 return uint64(f.AckRanges[i-1].Smallest - f.AckRanges[i].Largest - 2), 189 uint64(f.AckRanges[i].Largest - f.AckRanges[i].Smallest) 204 if ackRange.Smallest > ackRange.Largest { 218 if lastAckRange.Smallest <= ackRange.Largest+1 { 228 return f.AckRanges[0].Largest 246 return p <= f.AckRanges[i].Largest
|
/dports/net/v2ray/v2ray-core-4.36.2/vendor/github.com/lucas-clemente/quic-go/internal/wire/ |
H A D | ack_frame_test.go | 111 {Largest: 98, Smallest: 98}, 112 {Largest: 95, Smallest: 94}, 296 {Smallest: 8, Largest: 8}, 297 {Smallest: 5, Largest: 6}, 298 {Smallest: 1, Largest: 3}, 351 {Smallest: 4, Largest: 3}, 360 {Smallest: 2, Largest: 2}, 361 {Smallest: 6, Largest: 7}, 370 {Smallest: 5, Largest: 7}, 371 {Smallest: 2, Largest: 5}, [all …]
|
H A D | ack_frame.go | 67 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largestAcked}) 89 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largest}) 143 largestAcked := f.AckRanges[0].Largest 185 return 0, uint64(f.AckRanges[0].Largest - f.AckRanges[0].Smallest) 187 return uint64(f.AckRanges[i-1].Smallest - f.AckRanges[i].Largest - 2), 188 uint64(f.AckRanges[i].Largest - f.AckRanges[i].Smallest) 203 if ackRange.Smallest > ackRange.Largest { 217 if lastAckRange.Smallest <= ackRange.Largest+1 { 227 return f.AckRanges[0].Largest 245 return p <= f.AckRanges[i].Largest
|
/dports/net/ooni-probe-cli/probe-cli-3.10.1/vendor/github.com/lucas-clemente/quic-go/internal/wire/ |
H A D | ack_frame_test.go | 111 {Largest: 98, Smallest: 98}, 112 {Largest: 95, Smallest: 94}, 296 {Smallest: 8, Largest: 8}, 297 {Smallest: 5, Largest: 6}, 298 {Smallest: 1, Largest: 3}, 351 {Smallest: 4, Largest: 3}, 360 {Smallest: 2, Largest: 2}, 361 {Smallest: 6, Largest: 7}, 370 {Smallest: 5, Largest: 7}, 371 {Smallest: 2, Largest: 5}, [all …]
|
H A D | ack_frame.go | 68 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largestAcked}) 90 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largest}) 144 largestAcked := f.AckRanges[0].Largest 186 return 0, uint64(f.AckRanges[0].Largest - f.AckRanges[0].Smallest) 188 return uint64(f.AckRanges[i-1].Smallest - f.AckRanges[i].Largest - 2), 189 uint64(f.AckRanges[i].Largest - f.AckRanges[i].Smallest) 204 if ackRange.Smallest > ackRange.Largest { 218 if lastAckRange.Smallest <= ackRange.Largest+1 { 228 return f.AckRanges[0].Largest 246 return p <= f.AckRanges[i].Largest
|
/dports/net/storj/storj-1.45.3/vendor/github.com/lucas-clemente/quic-go/internal/wire/ |
H A D | ack_frame_test.go | 111 {Largest: 98, Smallest: 98}, 112 {Largest: 95, Smallest: 94}, 296 {Smallest: 8, Largest: 8}, 297 {Smallest: 5, Largest: 6}, 298 {Smallest: 1, Largest: 3}, 351 {Smallest: 4, Largest: 3}, 360 {Smallest: 2, Largest: 2}, 361 {Smallest: 6, Largest: 7}, 370 {Smallest: 5, Largest: 7}, 371 {Smallest: 2, Largest: 5}, [all …]
|
H A D | ack_frame.go | 68 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largestAcked}) 90 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largest}) 144 largestAcked := f.AckRanges[0].Largest 186 return 0, uint64(f.AckRanges[0].Largest - f.AckRanges[0].Smallest) 188 return uint64(f.AckRanges[i-1].Smallest - f.AckRanges[i].Largest - 2), 189 uint64(f.AckRanges[i].Largest - f.AckRanges[i].Smallest) 204 if ackRange.Smallest > ackRange.Largest { 218 if lastAckRange.Smallest <= ackRange.Largest+1 { 228 return f.AckRanges[0].Largest 246 return p <= f.AckRanges[i].Largest
|
/dports/devel/mutagen/mutagen-0.11.8/vendor/github.com/lucas-clemente/quic-go/internal/wire/ |
H A D | ack_frame_test.go | 110 {Largest: 98, Smallest: 98}, 111 {Largest: 95, Smallest: 94}, 264 {Smallest: 8, Largest: 8}, 265 {Smallest: 5, Largest: 6}, 266 {Smallest: 1, Largest: 3}, 321 {Smallest: 4, Largest: 3}, 330 {Smallest: 2, Largest: 2}, 331 {Smallest: 6, Largest: 7}, 340 {Smallest: 5, Largest: 7}, 341 {Smallest: 2, Largest: 5}, [all …]
|
H A D | ack_frame.go | 59 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largestAcked}) 81 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largest}) 124 largestAcked := f.AckRanges[0].Largest 161 return 0, uint64(f.AckRanges[0].Largest - f.AckRanges[0].Smallest) 163 return uint64(f.AckRanges[i-1].Smallest - f.AckRanges[i].Largest - 2), 164 uint64(f.AckRanges[i].Largest - f.AckRanges[i].Smallest) 179 if ackRange.Smallest > ackRange.Largest { 193 if lastAckRange.Smallest <= ackRange.Largest+1 { 203 return f.AckRanges[0].Largest 221 return p <= f.AckRanges[i].Largest
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/docs/speed/metrics_changelog/ |
H A D | lcp.md | 1 # Largest Contentful Paint Changelog 3 This is a list of changes to [Largest Contentful Paint](https://web.dev/lcp). 6 …* Metric definition improvement: [Largest Contentful Paint ignores paints with opacity 0](2020_08_… 8 …* Metric definition improvement: [Largest Contentful Paint measurement stops at first input or scr… 9 …* Metric definition improvement: [Largest Contentful Paint properly accounts for visual size of ba… 11 …* Metric definition improvement: [Largest Text Paint correctly reported while largest image is loa… 15 …* Experimental metric exposed via API: [Largest Contentful Paint](https://web.dev/lcp/) available …
|
/dports/devel/rabs/rabs-2.19.5/src/ |
H A D | targetqueue.c | 100 int Largest = Index; in targetqueue_next() local 102 …if (Left < QueueTop && QueueHeap[Left] && QueueHeap[Left]->QueuePriority > QueueHeap[Largest]->Que… in targetqueue_next() 103 Largest = Left; in targetqueue_next() 105 …if (Right < QueueTop && QueueHeap[Right] && QueueHeap[Right]->QueuePriority > QueueHeap[Largest]->… in targetqueue_next() 106 Largest = Right; in targetqueue_next() 108 if (Largest != Index) { in targetqueue_next() 109 target_t *Parent = QueueHeap[Largest]; in targetqueue_next() 112 Index = Largest; in targetqueue_next()
|
/dports/devel/mutagen/mutagen-0.11.8/vendor/github.com/lucas-clemente/quic-go/internal/ackhandler/ |
H A D | sent_packet_handler_test.go | 197 {Smallest: 6, Largest: 9}, 198 {Smallest: 1, Largest: 3}, 214 {Smallest: 9, Largest: 9}, 215 {Smallest: 6, Largest: 7}, 216 {Smallest: 3, Largest: 3}, 217 {Smallest: 1, Largest: 1}, 227 {Smallest: 4, Largest: 6}, 228 {Smallest: 1, Largest: 2}, 243 {Smallest: 4, Largest: 6}, 384 {Smallest: 7, Largest: 7}, [all …]
|
/dports/net/ooni-probe-cli/probe-cli-3.10.1/vendor/github.com/ooni/psiphon/oopsi/github.com/Psiphon-Labs/quic-go/internal/wire/ |
H A D | ack_frame.go | 65 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largestAcked}) 87 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largest}) 130 largestAcked := f.AckRanges[0].Largest 167 return 0, uint64(f.AckRanges[0].Largest - f.AckRanges[0].Smallest) 169 return uint64(f.AckRanges[i-1].Smallest - f.AckRanges[i].Largest - 2), 170 uint64(f.AckRanges[i].Largest - f.AckRanges[i].Smallest) 185 if ackRange.Smallest > ackRange.Largest { 199 if lastAckRange.Smallest <= ackRange.Largest+1 { 209 return f.AckRanges[0].Largest 227 return p <= f.AckRanges[i].Largest
|
/dports/net/ooni-probe-cli/probe-cli-3.10.1/vendor/github.com/ooni/psiphon/oopsi/github.com/Psiphon-Labs/psiphon-tunnel-core/psiphon/common/quic/gquic-go/internal/wire/ |
H A D | ack_frame.go | 64 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largestAcked}) 86 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largest}) 137 largestAcked := f.AckRanges[0].Largest 174 return 0, uint64(f.AckRanges[0].Largest - f.AckRanges[0].Smallest) 176 return uint64(f.AckRanges[i-1].Smallest - f.AckRanges[i].Largest - 2), 177 uint64(f.AckRanges[i].Largest - f.AckRanges[i].Smallest) 192 if ackRange.Smallest > ackRange.Largest { 206 if lastAckRange.Smallest <= ackRange.Largest+1 { 216 return f.AckRanges[0].Largest 234 return p <= f.AckRanges[i].Largest
|
/dports/net/ooni-mini/probe-engine-0.23.0/vendor/github.com/ooni/psiphon/oopsi/github.com/Psiphon-Labs/psiphon-tunnel-core/psiphon/common/quic/gquic-go/internal/wire/ |
H A D | ack_frame.go | 64 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largestAcked}) 86 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largest}) 137 largestAcked := f.AckRanges[0].Largest 174 return 0, uint64(f.AckRanges[0].Largest - f.AckRanges[0].Smallest) 176 return uint64(f.AckRanges[i-1].Smallest - f.AckRanges[i].Largest - 2), 177 uint64(f.AckRanges[i].Largest - f.AckRanges[i].Smallest) 192 if ackRange.Smallest > ackRange.Largest { 206 if lastAckRange.Smallest <= ackRange.Largest+1 { 216 return f.AckRanges[0].Largest 234 return p <= f.AckRanges[i].Largest
|
/dports/net/ooni-mini/probe-engine-0.23.0/vendor/github.com/ooni/psiphon/oopsi/github.com/Psiphon-Labs/quic-go/internal/wire/ |
H A D | ack_frame.go | 65 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largestAcked}) 87 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largest}) 130 largestAcked := f.AckRanges[0].Largest 167 return 0, uint64(f.AckRanges[0].Largest - f.AckRanges[0].Smallest) 169 return uint64(f.AckRanges[i-1].Smallest - f.AckRanges[i].Largest - 2), 170 uint64(f.AckRanges[i].Largest - f.AckRanges[i].Smallest) 185 if ackRange.Smallest > ackRange.Largest { 199 if lastAckRange.Smallest <= ackRange.Largest+1 { 209 return f.AckRanges[0].Largest 227 return p <= f.AckRanges[i].Largest
|
/dports/net/syncthing/syncthing-1.18.1/syncthing/vendor/github.com/lucas-clemente/quic-go/internal/wire/ |
H A D | ack_frame.go | 67 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largestAcked}) 89 frame.AckRanges = append(frame.AckRanges, AckRange{Smallest: smallest, Largest: largest}) 143 largestAcked := f.AckRanges[0].Largest 185 return 0, uint64(f.AckRanges[0].Largest - f.AckRanges[0].Smallest) 187 return uint64(f.AckRanges[i-1].Smallest - f.AckRanges[i].Largest - 2), 188 uint64(f.AckRanges[i].Largest - f.AckRanges[i].Smallest) 203 if ackRange.Smallest > ackRange.Largest { 217 if lastAckRange.Smallest <= ackRange.Largest+1 { 227 return f.AckRanges[0].Largest 245 return p <= f.AckRanges[i].Largest
|