arvidn/torrent-tools

Stars
10
Rank 1,807,489 (Top 36 %)
Language
C++
License
BSD 3-Clause "New...
Created over 3 years ago
Updated over 2 years ago

arvidn/torrent-tools

arvidn

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

tools for creating, inspecting and modifying torrent files

libtorrent

an efficient feature complete C++ bittorrent implementation

struct_layout

tool to show the structure layout of types in your C/C++ program, highlighting padding

btfs

a user space file system for efficiently downloading and seeding torrents

access_profiler

a tool to count accesses to member variables in c++ programs

libtorrent-webui

a WebUI implementation for libtorrent based clients

utrack

fast UDP bittorrent tracker

libsimulator

libsimulator is a library for building discrete event simulations, implementing the ``boost.asio`` API.

bdecode

an efficient bdecoder / parser

libtorrent-daemon

a bittorrent client for servers

try_signal

Turns signals within a scope into c++ exceptions

peer_ordering

This is a simple simulation of peer connections in a bittorrent swarm, illustrating the potential performance issues (peer clustering) of widely used first-come-first-serve logic for accepting incoming connections as well as a solution to that problem.

bittorrent-trace

A tool to reconstruct and analyze bittorrent stream from a packet capture

inline-namespace-abi-versioning

Example and test of an approach to gradually introduce proper ABI versioning with inline namespaces in a library

libtorrent-fuzz

fuzzing infrastructure for libtorrent

torrent-analyzer

A tool to run statistics analysis on a set of .torrent files

bittorrent-multi-have

a bittorrent extension proposal

moving_average

an implementation of integer moving average algorithm

conan-boost-build-gen

a conan generator for boost-build

hash_complete_prefix

Experiment to count "complete bit prefixes" of output from various hashes, given complete bit prefix inputs. A complete bit prefix is a number of bits in the prefix of the digest where every bit combination is present in the set of digests.