Camel case requestStrategy package

This commit is contained in:
Matt Joiner 2023-04-22 16:07:07 +10:00
parent 79ab1ffe2b
commit a4989ec165
No known key found for this signature in database
GPG Key ID: 6B990B8185E7F782
9 changed files with 19 additions and 19 deletions

View File

@ -1,4 +1,4 @@
package request_strategy
package requestStrategy
import (
"github.com/ajwerner/btree"

View File

@ -1,4 +1,4 @@
package request_strategy
package requestStrategy
import (
"bytes"

View File

@ -1,7 +1,7 @@
package request_strategy
package requestStrategy
import (
"github.com/anacrolix/torrent/typed-roaring"
typedRoaring "github.com/anacrolix/torrent/typed-roaring"
)
type PeerRequestState struct {

View File

@ -1,4 +1,4 @@
package request_strategy
package requestStrategy
import "github.com/anacrolix/torrent/metainfo"

View File

@ -1,4 +1,4 @@
package request_strategy
package requestStrategy
import (
"testing"

View File

@ -1,4 +1,4 @@
package request_strategy
package requestStrategy
type ChunksIterFunc func(func(ChunkIndex))

View File

@ -1,4 +1,4 @@
package request_strategy
package requestStrategy
import (
"github.com/tidwall/btree"

View File

@ -1,4 +1,4 @@
package request_strategy
package requestStrategy
type Torrent interface {
IgnorePiece(int) bool

View File

@ -13,8 +13,8 @@ import (
"github.com/anacrolix/multiless"
"github.com/lispad/go-generics-tools/binheap"
"github.com/anacrolix/torrent/request-strategy"
"github.com/anacrolix/torrent/typed-roaring"
requestStrategy "github.com/anacrolix/torrent/request-strategy"
typedRoaring "github.com/anacrolix/torrent/typed-roaring"
)
type (
@ -23,8 +23,8 @@ type (
maxRequests = int
)
func (t *Torrent) requestStrategyPieceOrderState(i int) request_strategy.PieceRequestOrderState {
return request_strategy.PieceRequestOrderState{
func (t *Torrent) requestStrategyPieceOrderState(i int) requestStrategy.PieceRequestOrderState {
return requestStrategy.PieceRequestOrderState{
Priority: t.piece(i).purePriority(),
Partial: t.piecePartiallyDownloaded(i),
Availability: t.piece(i).availability(),
@ -70,14 +70,14 @@ func (p *peerId) GobDecode(b []byte) error {
}
type (
RequestIndex = request_strategy.RequestIndex
chunkIndexType = request_strategy.ChunkIndex
RequestIndex = requestStrategy.RequestIndex
chunkIndexType = requestStrategy.ChunkIndex
)
type desiredPeerRequests struct {
requestIndexes []RequestIndex
peer *Peer
pieceStates []request_strategy.PieceRequestOrderState
pieceStates []requestStrategy.PieceRequestOrderState
}
func (p *desiredPeerRequests) Len() int {
@ -204,10 +204,10 @@ func (p *Peer) getDesiredRequestState() (desired desiredRequestState) {
}
// Caller-provided allocation for roaring bitmap iteration.
var it typedRoaring.Iterator[RequestIndex]
request_strategy.GetRequestablePieces(
requestStrategy.GetRequestablePieces(
input,
t.getPieceRequestOrder(),
func(ih InfoHash, pieceIndex int, pieceExtra request_strategy.PieceRequestOrderState) {
func(ih InfoHash, pieceIndex int, pieceExtra requestStrategy.PieceRequestOrderState) {
if ih != t.infoHash {
return
}
@ -216,7 +216,7 @@ func (p *Peer) getDesiredRequestState() (desired desiredRequestState) {
}
requestHeap.pieceStates[pieceIndex] = pieceExtra
allowedFast := p.peerAllowedFast.Contains(pieceIndex)
t.iterUndirtiedRequestIndexesInPiece(&it, pieceIndex, func(r request_strategy.RequestIndex) {
t.iterUndirtiedRequestIndexesInPiece(&it, pieceIndex, func(r requestStrategy.RequestIndex) {
if !allowedFast {
// We must signal interest to request this. TODO: We could set interested if the
// peers pieces (minus the allowed fast set) overlap with our missing pieces if