mirror of
https://github.com/qbittorrent/qBittorrent.git
synced 2026-03-02 22:57:32 -05:00
Generalize sequential downloading #5942
Labels
No labels
Accessibility
AppImage
Bounty
Build system
CI
Can't reproduce
Code cleanup
Confirmed bug
Confirmed bug
Core
Crash
Data loss
Discussion
Docker
Documentation
Duplicate
Feature
Feature request
Feature request
Feature request
Filters
Flatpak
GUI
Has workaround
I2P
Invalid
Libtorrent
Look and feel
Meta
NSIS
Network
Not an issue
OS: *BSD
OS: Linux
OS: Windows
OS: macOS
PPA
Performance
Project management
Proxy/VPN
Qt bugs
Qt6 compat
RSS
Search engine
Security
Temp folder
Themes
Translations
Triggers
Waiting diagnosis
Waiting info
Waiting upstream
Waiting web implementation
Watched folders
WebAPI
WebUI
autoCloseOldIssue
No milestone
No project
No assignees
1 participant
Notifications
Due date
No due date set.
Dependencies
No dependencies set.
Reference
starred/qBittorrent#5942
Loading…
Add table
Add a link
Reference in a new issue
No description provided.
Delete branch "%!s()"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
Originally created by @johncf on GitHub (Aug 18, 2017).
If the set of remaining pieces can be given a probability distribution skewed towards the beginning, then it might be a better alternative to the existing "Download in sequential order" feature. Additionally, the user may be given choices to select from different "strengths" of skewing too.
(I kinda feel bad when downloading in "hard sequential" order, but I really like to take a peek at parts of videos without waiting for more than 80% to be downloaded.)
@thalieht commented on GitHub (Aug 18, 2017):
See PR #5314 and issue #182
@johncf commented on GitHub (Aug 18, 2017):
I saw the issue, but didn't see there was already a PR for it... It is also a nice alternative, but it would (or should) be having the exact same behavior as "hard sequential" if the deadlines are too short compared to the download speed. Personally, I am not interested in "streaming" a torrent in real-time. Let it take its time downloading the pieces, but at any point during the download, I simply like to have a higher proportion of data to be in a "usable" form (proximity) than the current uniformly random approach.
@xavier2k6 commented on GitHub (May 23, 2025):
ANNOUNCEMENT!
For anybody coming across this "Feature Request" & would like/love to see a potential implementation in the future!
Here are some options available to you:
Please select/click the 👍 &/or ❤
reactionsin the original/opening post of this ticket.Please feel free (If you have the "skillset") to create a "Pull Request" implementing what's being requested in this ticket.
(new/existing contributors/developers are always welcome)
DO:
DO NOT:
(These will be disregarded/hidden as "spam/abuse/off-topic" etc. as they don't provide anything constructive.)