|
|
@ -16,7 +16,7 @@ use std::{
|
|
|
|
pub struct DupeMap
|
|
|
|
pub struct DupeMap
|
|
|
|
{
|
|
|
|
{
|
|
|
|
iteration: HashSet<hash::Sha256Hash>, // What we calculate
|
|
|
|
iteration: HashSet<hash::Sha256Hash>, // What we calculate
|
|
|
|
table: HashMap<PathBuf, hash::Sha256Hash>, // What we save and load
|
|
|
|
table: HashMap<PathBuf, (hash::Sha256Hash, bool)>, // What we save and load, and if it's transient (ignored in calculate)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/// Do we care about windows? nah
|
|
|
|
/// Do we care about windows? nah
|
|
|
@ -55,20 +55,68 @@ impl DupeMap
|
|
|
|
/// # Returns
|
|
|
|
/// # Returns
|
|
|
|
///
|
|
|
|
///
|
|
|
|
/// True if caching was okay, false if key already added.
|
|
|
|
/// True if caching was okay, false if key already added.
|
|
|
|
|
|
|
|
///
|
|
|
|
|
|
|
|
/// # Notes
|
|
|
|
|
|
|
|
///
|
|
|
|
|
|
|
|
/// If value is added and is transient, it is counted as not existing.
|
|
|
|
pub fn cache<T: AsRef<Path>>(&mut self, id: T, hash: hash::Sha256Hash) -> bool
|
|
|
|
pub fn cache<T: AsRef<Path>>(&mut self, id: T, hash: hash::Sha256Hash) -> bool
|
|
|
|
|
|
|
|
{
|
|
|
|
|
|
|
|
if self.table.contains_key(id.as_ref()) {
|
|
|
|
|
|
|
|
if let Some((got_hash, trans @ true)) = self.table.get_mut(id.as_ref()) {
|
|
|
|
|
|
|
|
*trans = false;
|
|
|
|
|
|
|
|
*got_hash = hash;
|
|
|
|
|
|
|
|
true
|
|
|
|
|
|
|
|
} else {
|
|
|
|
|
|
|
|
false
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
} else {
|
|
|
|
|
|
|
|
self.table.insert(id.as_ref().to_owned(), (hash, false));
|
|
|
|
|
|
|
|
true
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Cache this path's hash as transient.
|
|
|
|
|
|
|
|
/// Transient means it is ignored in calculations but is still saved.
|
|
|
|
|
|
|
|
///
|
|
|
|
|
|
|
|
/// # Returns
|
|
|
|
|
|
|
|
///
|
|
|
|
|
|
|
|
/// True if caching was okay, false if already added (transient or not).
|
|
|
|
|
|
|
|
pub fn cache_trans<T: AsRef<Path>>(&mut self, id: T, hash: hash::Sha256Hash) -> bool
|
|
|
|
{
|
|
|
|
{
|
|
|
|
if self.table.contains_key(id.as_ref()) {
|
|
|
|
if self.table.contains_key(id.as_ref()) {
|
|
|
|
false
|
|
|
|
false
|
|
|
|
} else {
|
|
|
|
} else {
|
|
|
|
self.table.insert(id.as_ref().to_owned(), hash);
|
|
|
|
self.table.insert(id.as_ref().to_owned(), (hash,true));
|
|
|
|
true
|
|
|
|
true
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Get a mutable reference to the transience of this path, if it is added
|
|
|
|
|
|
|
|
pub fn transience_mut<T: AsRef<Path>>(&mut self, id: T) -> Option<&mut bool>
|
|
|
|
|
|
|
|
{
|
|
|
|
|
|
|
|
match self.table.get_mut(id.as_ref()) {
|
|
|
|
|
|
|
|
Some((_, trans)) => Some(trans),
|
|
|
|
|
|
|
|
_ => None,
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Get the transience of this path, if it is added
|
|
|
|
|
|
|
|
pub fn transience<T: AsRef<Path>>(&self, id: T) -> Option<bool>
|
|
|
|
|
|
|
|
{
|
|
|
|
|
|
|
|
if let Some((_, trans)) = self.table.get(id.as_ref()) {
|
|
|
|
|
|
|
|
Some(*trans)
|
|
|
|
|
|
|
|
} else {
|
|
|
|
|
|
|
|
None
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/// Look for path `id` in cache.
|
|
|
|
/// Look for path `id` in cache.
|
|
|
|
pub fn get_cache<T: AsRef<Path>>(&self, id: T) -> Option<&hash::Sha256Hash>
|
|
|
|
pub fn get_cache<T: AsRef<Path>>(&self, id: T) -> Option<&hash::Sha256Hash>
|
|
|
|
{
|
|
|
|
{
|
|
|
|
self.table.get(id.as_ref())
|
|
|
|
match self.table.get(id.as_ref()) {
|
|
|
|
|
|
|
|
Some((hash, false)) => Some(hash),
|
|
|
|
|
|
|
|
_ => None
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/// Try to add to store. True if adding was oke, false if already exists.
|
|
|
|
/// Try to add to store. True if adding was oke, false if already exists.
|
|
|
@ -86,7 +134,7 @@ impl DupeMap
|
|
|
|
pub fn save<W: Write>(&self, to: &mut W) -> io::Result<usize>
|
|
|
|
pub fn save<W: Write>(&self, to: &mut W) -> io::Result<usize>
|
|
|
|
{
|
|
|
|
{
|
|
|
|
let mut done=0;
|
|
|
|
let mut done=0;
|
|
|
|
for (path, hash) in self.table.iter()
|
|
|
|
for (path, (hash, _)) in self.table.iter()
|
|
|
|
{
|
|
|
|
{
|
|
|
|
let path = path_bytes(path.as_ref());
|
|
|
|
let path = path_bytes(path.as_ref());
|
|
|
|
let hash: &[u8] = hash.as_ref();
|
|
|
|
let hash: &[u8] = hash.as_ref();
|
|
|
@ -107,7 +155,7 @@ impl DupeMap
|
|
|
|
use tokio::prelude::*;
|
|
|
|
use tokio::prelude::*;
|
|
|
|
|
|
|
|
|
|
|
|
let mut done=0;
|
|
|
|
let mut done=0;
|
|
|
|
for (path, hash) in self.table.iter()
|
|
|
|
for (path, (hash, _)) in self.table.iter()
|
|
|
|
{
|
|
|
|
{
|
|
|
|
let path = path_bytes(path.as_ref());
|
|
|
|
let path = path_bytes(path.as_ref());
|
|
|
|
let hash: &[u8] = hash.as_ref();
|
|
|
|
let hash: &[u8] = hash.as_ref();
|
|
|
@ -122,7 +170,7 @@ impl DupeMap
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/// Load from file.
|
|
|
|
/// Load from file.
|
|
|
|
pub fn load<R: Read>(&mut self, from: &mut R) -> io::Result<usize>
|
|
|
|
pub fn load<R: Read>(&mut self, from: &mut R, trans: bool) -> io::Result<usize>
|
|
|
|
{
|
|
|
|
{
|
|
|
|
let mut done=0;
|
|
|
|
let mut done=0;
|
|
|
|
let mut read;
|
|
|
|
let mut read;
|
|
|
@ -138,7 +186,9 @@ impl DupeMap
|
|
|
|
let path = bytes_path(&path[..]);
|
|
|
|
let path = bytes_path(&path[..]);
|
|
|
|
if from.read(&mut hash_buffer[..])? == hash::SHA256_SIZE
|
|
|
|
if from.read(&mut hash_buffer[..])? == hash::SHA256_SIZE
|
|
|
|
{
|
|
|
|
{
|
|
|
|
if self.cache(path, hash::Sha256Hash::new(hash_buffer)) {
|
|
|
|
if !trans && self.cache(path, hash::Sha256Hash::new(hash_buffer)) {
|
|
|
|
|
|
|
|
done +=1;
|
|
|
|
|
|
|
|
} else if trans && self.cache_trans(path, hash::Sha256Hash::new(hash_buffer)) {
|
|
|
|
done +=1;
|
|
|
|
done +=1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
@ -151,7 +201,7 @@ impl DupeMap
|
|
|
|
|
|
|
|
|
|
|
|
/// Load from file.
|
|
|
|
/// Load from file.
|
|
|
|
#[cfg(feature="threads")]
|
|
|
|
#[cfg(feature="threads")]
|
|
|
|
pub async fn load_async<R>(&mut self, from: &mut R) -> io::Result<usize>
|
|
|
|
pub async fn load_async<R>(&mut self, from: &mut R, trans: bool) -> io::Result<usize>
|
|
|
|
where R: tokio::io::AsyncRead + std::marker::Send + std::marker::Sync + std::marker::Unpin
|
|
|
|
where R: tokio::io::AsyncRead + std::marker::Send + std::marker::Sync + std::marker::Unpin
|
|
|
|
{
|
|
|
|
{
|
|
|
|
use tokio::prelude::*;
|
|
|
|
use tokio::prelude::*;
|
|
|
@ -170,7 +220,9 @@ impl DupeMap
|
|
|
|
let path = bytes_path(&path[..]);
|
|
|
|
let path = bytes_path(&path[..]);
|
|
|
|
if from.read(&mut hash_buffer[..]).await? == hash::SHA256_SIZE
|
|
|
|
if from.read(&mut hash_buffer[..]).await? == hash::SHA256_SIZE
|
|
|
|
{
|
|
|
|
{
|
|
|
|
if self.cache(path, hash::Sha256Hash::new(hash_buffer)) {
|
|
|
|
if !trans && self.cache(path, hash::Sha256Hash::new(hash_buffer)) {
|
|
|
|
|
|
|
|
done +=1;
|
|
|
|
|
|
|
|
} else if trans && self.cache_trans(path, hash::Sha256Hash::new(hash_buffer)) {
|
|
|
|
done +=1;
|
|
|
|
done +=1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|