3 changed files with 186 additions and 142 deletions
@ -1,2 +1,3 @@ |
|||||||
/target |
/target |
||||||
/test_cache |
/test_cache |
||||||
|
/example_cache |
||||||
|
|||||||
@ -1,141 +1,150 @@ |
|||||||
///! Some utility functions
|
///! Some utility functions
|
||||||
|
|
||||||
use std::collections::{HashMap, HashSet}; |
use std::collections::{HashMap, HashSet}; |
||||||
use std::sync::{Arc, Mutex}; |
use std::sync::{Arc, Mutex}; |
||||||
use std::hash::Hash; |
use std::hash::Hash; |
||||||
|
use std::io::{stdin, stdout, Read, Write}; |
||||||
use minidom::Element; |
|
||||||
|
use minidom::Element; |
||||||
use crate::traits::CompleteCalendar; |
|
||||||
use crate::traits::DavCalendar; |
use crate::traits::CompleteCalendar; |
||||||
use crate::calendar::CalendarId; |
use crate::traits::DavCalendar; |
||||||
use crate::Item; |
use crate::calendar::CalendarId; |
||||||
use crate::item::SyncStatus; |
use crate::Item; |
||||||
|
use crate::item::SyncStatus; |
||||||
/// Walks an XML tree and returns every element that has the given name
|
|
||||||
pub fn find_elems<S: AsRef<str>>(root: &Element, searched_name: S) -> Vec<&Element> { |
/// Walks an XML tree and returns every element that has the given name
|
||||||
let searched_name = searched_name.as_ref(); |
pub fn find_elems<S: AsRef<str>>(root: &Element, searched_name: S) -> Vec<&Element> { |
||||||
let mut elems: Vec<&Element> = Vec::new(); |
let searched_name = searched_name.as_ref(); |
||||||
|
let mut elems: Vec<&Element> = Vec::new(); |
||||||
for el in root.children() { |
|
||||||
if el.name() == searched_name { |
for el in root.children() { |
||||||
elems.push(el); |
if el.name() == searched_name { |
||||||
} else { |
elems.push(el); |
||||||
let ret = find_elems(el, searched_name); |
} else { |
||||||
elems.extend(ret); |
let ret = find_elems(el, searched_name); |
||||||
} |
elems.extend(ret); |
||||||
} |
} |
||||||
elems |
} |
||||||
} |
elems |
||||||
|
} |
||||||
/// Walks an XML tree until it finds an elements with the given name
|
|
||||||
pub fn find_elem<S: AsRef<str>>(root: &Element, searched_name: S) -> Option<&Element> { |
/// Walks an XML tree until it finds an elements with the given name
|
||||||
let searched_name = searched_name.as_ref(); |
pub fn find_elem<S: AsRef<str>>(root: &Element, searched_name: S) -> Option<&Element> { |
||||||
if root.name() == searched_name { |
let searched_name = searched_name.as_ref(); |
||||||
return Some(root); |
if root.name() == searched_name { |
||||||
} |
return Some(root); |
||||||
|
} |
||||||
for el in root.children() { |
|
||||||
if el.name() == searched_name { |
for el in root.children() { |
||||||
return Some(el); |
if el.name() == searched_name { |
||||||
} else { |
return Some(el); |
||||||
let ret = find_elem(el, searched_name); |
} else { |
||||||
if ret.is_some() { |
let ret = find_elem(el, searched_name); |
||||||
return ret; |
if ret.is_some() { |
||||||
} |
return ret; |
||||||
} |
} |
||||||
} |
} |
||||||
None |
} |
||||||
} |
None |
||||||
|
} |
||||||
|
|
||||||
pub fn print_xml(element: &Element) { |
|
||||||
use std::io::Write; |
pub fn print_xml(element: &Element) { |
||||||
let mut writer = std::io::stdout(); |
let mut writer = std::io::stdout(); |
||||||
|
|
||||||
let mut xml_writer = minidom::quick_xml::Writer::new_with_indent( |
let mut xml_writer = minidom::quick_xml::Writer::new_with_indent( |
||||||
std::io::stdout(), |
std::io::stdout(), |
||||||
0x20, 4 |
0x20, 4 |
||||||
); |
); |
||||||
let _ = element.to_writer(&mut xml_writer); |
let _ = element.to_writer(&mut xml_writer); |
||||||
let _ = writer.write(&[0x0a]); |
let _ = writer.write(&[0x0a]); |
||||||
} |
} |
||||||
|
|
||||||
/// A debug utility that pretty-prints calendars
|
/// A debug utility that pretty-prints calendars
|
||||||
pub async fn print_calendar_list<C>(cals: &HashMap<CalendarId, Arc<Mutex<C>>>) |
pub async fn print_calendar_list<C>(cals: &HashMap<CalendarId, Arc<Mutex<C>>>) |
||||||
where |
where |
||||||
C: CompleteCalendar, |
C: CompleteCalendar, |
||||||
{ |
{ |
||||||
for (id, cal) in cals { |
for (id, cal) in cals { |
||||||
println!("CAL {} ({})", cal.lock().unwrap().name(), id); |
println!("CAL {} ({})", cal.lock().unwrap().name(), id); |
||||||
match cal.lock().unwrap().get_items().await { |
match cal.lock().unwrap().get_items().await { |
||||||
Err(_err) => continue, |
Err(_err) => continue, |
||||||
Ok(map) => { |
Ok(map) => { |
||||||
for (_, item) in map { |
for (_, item) in map { |
||||||
print_task(item); |
print_task(item); |
||||||
} |
} |
||||||
}, |
}, |
||||||
} |
} |
||||||
} |
} |
||||||
} |
} |
||||||
|
|
||||||
/// A debug utility that pretty-prints calendars
|
/// A debug utility that pretty-prints calendars
|
||||||
pub async fn print_dav_calendar_list<C>(cals: &HashMap<CalendarId, Arc<Mutex<C>>>) |
pub async fn print_dav_calendar_list<C>(cals: &HashMap<CalendarId, Arc<Mutex<C>>>) |
||||||
where |
where |
||||||
C: DavCalendar, |
C: DavCalendar, |
||||||
{ |
{ |
||||||
for (id, cal) in cals { |
for (id, cal) in cals { |
||||||
println!("CAL {} ({})", cal.lock().unwrap().name(), id); |
println!("CAL {} ({})", cal.lock().unwrap().name(), id); |
||||||
match cal.lock().unwrap().get_item_version_tags().await { |
match cal.lock().unwrap().get_item_version_tags().await { |
||||||
Err(_err) => continue, |
Err(_err) => continue, |
||||||
Ok(map) => { |
Ok(map) => { |
||||||
for (id, version_tag) in map { |
for (id, version_tag) in map { |
||||||
println!(" * {} (version {:?})", id, version_tag); |
println!(" * {} (version {:?})", id, version_tag); |
||||||
} |
} |
||||||
}, |
}, |
||||||
} |
} |
||||||
} |
} |
||||||
} |
} |
||||||
|
|
||||||
pub fn print_task(item: &Item) { |
pub fn print_task(item: &Item) { |
||||||
match item { |
match item { |
||||||
Item::Task(task) => { |
Item::Task(task) => { |
||||||
let completion = if task.completed() { "✓" } else { " " }; |
let completion = if task.completed() { "✓" } else { " " }; |
||||||
let sync = match task.sync_status() { |
let sync = match task.sync_status() { |
||||||
SyncStatus::NotSynced => ".", |
SyncStatus::NotSynced => ".", |
||||||
SyncStatus::Synced(_) => "=", |
SyncStatus::Synced(_) => "=", |
||||||
SyncStatus::LocallyModified(_) => "~", |
SyncStatus::LocallyModified(_) => "~", |
||||||
SyncStatus::LocallyDeleted(_) => "x", |
SyncStatus::LocallyDeleted(_) => "x", |
||||||
}; |
}; |
||||||
println!(" {}{} {}\t{}", completion, sync, task.name(), task.id()); |
println!(" {}{} {}\t{}", completion, sync, task.name(), task.id()); |
||||||
}, |
}, |
||||||
_ => return, |
_ => return, |
||||||
} |
} |
||||||
} |
} |
||||||
|
|
||||||
|
|
||||||
/// Compare keys of two hashmaps for equality
|
/// Compare keys of two hashmaps for equality
|
||||||
pub fn keys_are_the_same<T, U, V>(left: &HashMap<T, U>, right: &HashMap<T, V>) -> bool |
pub fn keys_are_the_same<T, U, V>(left: &HashMap<T, U>, right: &HashMap<T, V>) -> bool |
||||||
where |
where |
||||||
T: Hash + Eq + Clone + std::fmt::Display, |
T: Hash + Eq + Clone + std::fmt::Display, |
||||||
{ |
{ |
||||||
if left.len() != right.len() { |
if left.len() != right.len() { |
||||||
log::debug!("Count of keys mismatch: {} and {}", left.len(), right.len()); |
log::debug!("Count of keys mismatch: {} and {}", left.len(), right.len()); |
||||||
return false; |
return false; |
||||||
} |
} |
||||||
|
|
||||||
let keys_l: HashSet<T> = left.keys().cloned().collect(); |
let keys_l: HashSet<T> = left.keys().cloned().collect(); |
||||||
let keys_r: HashSet<T> = right.keys().cloned().collect(); |
let keys_r: HashSet<T> = right.keys().cloned().collect(); |
||||||
let result = keys_l == keys_r; |
let result = keys_l == keys_r; |
||||||
if result == false { |
if result == false { |
||||||
log::debug!("Keys of a map mismatch"); |
log::debug!("Keys of a map mismatch"); |
||||||
for key in keys_l { |
for key in keys_l { |
||||||
log::debug!(" left: {}", key); |
log::debug!(" left: {}", key); |
||||||
} |
} |
||||||
log::debug!("RIGHT:"); |
log::debug!("RIGHT:"); |
||||||
for key in keys_r { |
for key in keys_r { |
||||||
log::debug!(" right: {}", key); |
log::debug!(" right: {}", key); |
||||||
} |
} |
||||||
} |
} |
||||||
result |
result |
||||||
} |
} |
||||||
|
|
||||||
|
|
||||||
|
/// Wait for the user to press enter
|
||||||
|
pub fn pause() { |
||||||
|
let mut stdout = stdout(); |
||||||
|
stdout.write_all(b"Press Enter to continue...").unwrap(); |
||||||
|
stdout.flush().unwrap(); |
||||||
|
stdin().read_exact(&mut [0]).unwrap(); |
||||||
|
} |
||||||
|
|||||||
Loading…
Reference in new issue