108 lines
2.9 KiB
C++
108 lines
2.9 KiB
C++
// This file Copyright © Mnemosyne LLC.
|
|
// It may be used under GPLv2 (SPDX: GPL-2.0-only), GPLv3 (SPDX: GPL-3.0-only),
|
|
// or any future license endorsed by Mnemosyne LLC.
|
|
// License text can be found in the licenses/ folder.
|
|
|
|
#include <algorithm>
|
|
#include <ctime>
|
|
#include <string_view>
|
|
#include <vector>
|
|
|
|
#include "libtransmission/transmission.h"
|
|
|
|
#include "libtransmission/magnet-metainfo.h"
|
|
#include "libtransmission/torrent.h"
|
|
#include "libtransmission/torrents.h"
|
|
#include "libtransmission/tr-assert.h"
|
|
#include "libtransmission/tr-macros.h"
|
|
|
|
namespace
|
|
{
|
|
|
|
constexpr struct
|
|
{
|
|
bool operator()(tr_sha1_digest_t const& a, tr_sha1_digest_t const& b) const
|
|
{
|
|
return a < b;
|
|
}
|
|
|
|
bool operator()(tr_torrent const* a, tr_torrent const* b) const
|
|
{
|
|
return (*this)(a->info_hash(), b->info_hash());
|
|
}
|
|
|
|
bool operator()(tr_torrent const* a, tr_sha1_digest_t const& b) const
|
|
{
|
|
return (*this)(a->info_hash(), b);
|
|
}
|
|
|
|
bool operator()(tr_sha1_digest_t const& a, tr_torrent const* b) const
|
|
{
|
|
return (*this)(a, b->info_hash());
|
|
}
|
|
} CompareTorrentByHash{};
|
|
|
|
} // namespace
|
|
|
|
tr_torrent* tr_torrents::get(std::string_view magnet_link) const
|
|
{
|
|
auto magnet = tr_magnet_metainfo{};
|
|
return magnet.parseMagnet(magnet_link) ? get(magnet.info_hash()) : nullptr;
|
|
}
|
|
|
|
tr_torrent* tr_torrents::get(tr_sha1_digest_t const& hash) const
|
|
{
|
|
auto [begin, end] = std::equal_range(std::cbegin(by_hash_), std::cend(by_hash_), hash, CompareTorrentByHash);
|
|
return begin == end ? nullptr : *begin;
|
|
}
|
|
|
|
tr_torrent* tr_torrents::find_from_obfuscated_hash(tr_sha1_digest_t const& obfuscated_hash) const
|
|
{
|
|
for (auto* const tor : *this)
|
|
{
|
|
if (tor->obfuscated_hash_equals(obfuscated_hash))
|
|
{
|
|
return tor;
|
|
}
|
|
}
|
|
|
|
return nullptr;
|
|
}
|
|
|
|
tr_torrent_id_t tr_torrents::add(tr_torrent* tor)
|
|
{
|
|
auto const id = static_cast<tr_torrent_id_t>(std::size(by_id_));
|
|
by_id_.push_back(tor);
|
|
by_hash_.insert(std::lower_bound(std::begin(by_hash_), std::end(by_hash_), tor, CompareTorrentByHash), tor);
|
|
return id;
|
|
}
|
|
|
|
void tr_torrents::remove(tr_torrent const* tor, time_t current_time)
|
|
{
|
|
TR_ASSERT(tor != nullptr);
|
|
TR_ASSERT(get(tor->id()) == tor);
|
|
|
|
by_id_[tor->id()] = nullptr;
|
|
auto const [begin, end] = std::equal_range(std::begin(by_hash_), std::end(by_hash_), tor, CompareTorrentByHash);
|
|
by_hash_.erase(begin, end);
|
|
removed_.emplace_back(tor->id(), current_time);
|
|
}
|
|
|
|
std::vector<tr_torrent_id_t> tr_torrents::removedSince(time_t timestamp) const
|
|
{
|
|
auto ids = std::vector<tr_torrent_id_t>{};
|
|
ids.reserve(std::size(removed_));
|
|
|
|
for (auto const& [id, removed_at] : removed_)
|
|
{
|
|
if (removed_at >= timestamp)
|
|
{
|
|
ids.emplace_back(id);
|
|
}
|
|
}
|
|
|
|
std::sort(std::begin(ids), std::end(ids));
|
|
ids.erase(std::unique(std::begin(ids), std::end(ids)), std::end(ids));
|
|
return ids;
|
|
}
|