f69cddf2cc
## Summary - Adds KOReader progress sync integration, allowing CrossPoint to sync reading positions with other KOReader-compatible devices - Stores credentials securely with XOR obfuscation - Uses KOReader's partial MD5 document hashing for cross-device book matching - Syncs position via percentage with estimated XPath for compatibility # Features - Settings: KOReader Username, Password, and Authenticate options - Sync from chapters menu: "Sync Progress" option appears when credentials are configured - Bidirectional sync: Can apply remote progress or upload local progress --------- Co-authored-by: Dave Allie <dave@daveallie.com>
46 lines
1.5 KiB
C++
46 lines
1.5 KiB
C++
#pragma once
|
|
#include <string>
|
|
|
|
/**
|
|
* Calculate KOReader document ID (partial MD5 hash).
|
|
*
|
|
* KOReader identifies documents using a partial MD5 hash of the file content.
|
|
* The algorithm reads 1024 bytes at specific offsets and computes the MD5 hash
|
|
* of the concatenated data.
|
|
*
|
|
* Offsets are calculated as: 1024 << (2*i) for i = -1 to 10
|
|
* Producing: 256, 1024, 4096, 16384, 65536, 262144, 1048576, 4194304,
|
|
* 16777216, 67108864, 268435456, 1073741824 bytes
|
|
*
|
|
* If an offset is beyond the file size, it is skipped.
|
|
*/
|
|
class KOReaderDocumentId {
|
|
public:
|
|
/**
|
|
* Calculate the KOReader document hash for a file (binary/content-based).
|
|
*
|
|
* @param filePath Path to the file (typically an EPUB)
|
|
* @return 32-character lowercase hex string, or empty string on failure
|
|
*/
|
|
static std::string calculate(const std::string& filePath);
|
|
|
|
/**
|
|
* Calculate document hash from filename only (filename-based sync mode).
|
|
* This is simpler and works when files have the same name across devices.
|
|
*
|
|
* @param filePath Path to the file (only the filename portion is used)
|
|
* @return 32-character lowercase hex MD5 of the filename
|
|
*/
|
|
static std::string calculateFromFilename(const std::string& filePath);
|
|
|
|
private:
|
|
// Size of each chunk to read at each offset
|
|
static constexpr size_t CHUNK_SIZE = 1024;
|
|
|
|
// Number of offsets to try (i = -1 to 10, so 12 offsets)
|
|
static constexpr int OFFSET_COUNT = 12;
|
|
|
|
// Calculate offset for index i: 1024 << (2*i)
|
|
static size_t getOffset(int i);
|
|
};
|