pub mod search;
mod field;
mod operation;
mod option;
mod row_fragment;
mod serial;
pub use field::Field;
pub use idx_binary::{self, anyhow, AvltrieeIter, FileMmap, IdxBinary, IdxFile};
pub use operation::*;
pub use option::DataOption;
pub use row_fragment::RowFragment;
pub use search::{Condition, Order, OrderKey, Search};
pub use uuid::Uuid;
use std::{
cmp::Ordering,
collections::{BTreeSet, HashMap},
fs, io,
path::{Path, PathBuf},
sync::{Arc, RwLock},
time::{SystemTime, UNIX_EPOCH},
};
use anyhow::Result;
use serial::SerialNumber;
pub type RowSet = BTreeSet<u32>;
pub fn create_uuid() -> u128 {
Uuid::new_v4().as_u128()
}
pub fn uuid_string(uuid: u128) -> String {
Uuid::from_u128(uuid).to_string()
}
pub struct Data {
fields_dir: PathBuf,
serial: Arc<RwLock<SerialNumber>>,
uuid: Option<Arc<RwLock<IdxFile<u128>>>>,
activity: Option<Arc<RwLock<IdxFile<u8>>>>,
term_begin: Option<Arc<RwLock<IdxFile<u64>>>>,
term_end: Option<Arc<RwLock<IdxFile<u64>>>>,
last_updated: Option<Arc<RwLock<IdxFile<u64>>>>,
fields_cache: HashMap<String, Arc<RwLock<Field>>>,
}
impl Data {
pub fn new<P: AsRef<Path>>(dir: P, option: DataOption) -> io::Result<Self> {
let dir = dir.as_ref();
if !dir.exists() {
fs::create_dir_all(dir)?;
}
let mut fields_cache = HashMap::new();
let mut fields_dir = dir.to_path_buf();
fields_dir.push("fields");
if fields_dir.exists() {
for d in fields_dir.read_dir()? {
let d = d?;
if d.file_type()?.is_dir() {
if let Some(fname) = d.file_name().to_str() {
let field = Field::new(d.path())?;
fields_cache
.entry(String::from(fname))
.or_insert(Arc::new(RwLock::new(field)));
}
}
}
}
Ok(Self {
fields_dir,
serial: Arc::new(RwLock::new(SerialNumber::new({
let mut path = dir.to_path_buf();
path.push("serial");
path
})?)),
uuid: if option.uuid {
Some(Arc::new(RwLock::new(IdxFile::new({
let mut path = dir.to_path_buf();
path.push("uuid.i");
path
})?)))
} else {
None
},
activity: if option.activity {
Some(Arc::new(RwLock::new(IdxFile::new({
let mut path = dir.to_path_buf();
path.push("activity.i");
path
})?)))
} else {
None
},
term_begin: if option.term {
Some(Arc::new(RwLock::new(IdxFile::new({
let mut path = dir.to_path_buf();
path.push("term_begin.i");
path
})?)))
} else {
None
},
term_end: if option.term {
Some(Arc::new(RwLock::new(IdxFile::new({
let mut path = dir.to_path_buf();
path.push("term_end.i");
path
})?)))
} else {
None
},
last_updated: if option.last_updated {
Some(Arc::new(RwLock::new(IdxFile::new({
let mut path = dir.to_path_buf();
path.push("last_updated.i");
path
})?)))
} else {
None
},
fields_cache,
})
}
pub fn exists(&self, row: u32) -> bool {
self.serial.read().unwrap().value(row) != None
}
pub fn serial(&self, row: u32) -> u32 {
if let Some(v) = self.serial.read().unwrap().value(row) {
*v
} else {
0
}
}
pub fn uuid(&self, row: u32) -> Option<u128> {
if let Some(ref uuid) = self.uuid {
if let Some(v) = uuid.read().unwrap().value(row) {
return Some(*v);
}
}
None
}
pub fn uuid_string(&self, row: u32) -> Option<String> {
if let Some(ref uuid) = self.uuid {
if let Some(v) = uuid.read().unwrap().value(row) {
return Some(uuid::Uuid::from_u128(*v).to_string());
}
}
None
}
pub fn activity(&self, row: u32) -> Option<Activity> {
if let Some(ref activity) = self.activity {
if let Some(v) = activity.read().unwrap().value(row) {
return Some(if *v != 0 {
Activity::Active
} else {
Activity::Inactive
});
}
}
None
}
pub fn term_begin(&self, row: u32) -> Option<u64> {
if let Some(ref f) = self.term_begin {
if let Some(v) = f.read().unwrap().value(row) {
return Some(*v);
}
}
None
}
pub fn term_end(&self, row: u32) -> Option<u64> {
if let Some(ref f) = self.term_end {
if let Some(v) = f.read().unwrap().value(row) {
return Some(*v);
}
}
None
}
pub fn last_updated(&self, row: u32) -> Option<u64> {
if let Some(ref f) = self.last_updated {
if let Some(v) = f.read().unwrap().value(row) {
return Some(*v);
}
}
None
}
pub fn field_names(&self) -> Vec<&String> {
self.fields_cache.iter().map(|(key, _)| key).collect()
}
pub fn field_bytes(&self, row: u32, name: &str) -> &[u8] {
if let Some(f) = self.field(name) {
if let Some(v) = f.read().unwrap().bytes(row) {
v
} else {
b""
}
} else {
b""
}
}
pub fn field_num(&self, row: u32, name: &str) -> f64 {
if let Some(f) = self.field(name) {
if let Some(f) = f.read().unwrap().num(row) {
f
} else {
0.0
}
} else {
0.0
}
}
pub fn update(&mut self, operation: &Operation) -> Result<u32> {
match operation {
Operation::New(r) => {
self.create_row(&r.activity, &r.term_begin, &r.term_end, &r.fields)
}
Operation::Update { row, record } => {
let row = *row;
self.update_row(
row,
&record.activity,
&record.term_begin,
&record.term_end,
&record.fields,
)?;
Ok(row)
}
Operation::Delete { row } => {
self.delete(*row)?;
Ok(0)
}
}
}
pub fn update_field(&mut self, row: u32, field_name: &str, cont: &[u8]) -> Result<()> {
let field = if self.fields_cache.contains_key(field_name) {
self.fields_cache.get_mut(field_name).unwrap()
} else {
self.create_field(field_name)?
};
field.write().unwrap().update(row, cont)?;
Ok(())
}
pub fn create_row(
&mut self,
activity: &Activity,
term_begin: &Term,
term_end: &Term,
fields: &Vec<KeyValue>,
) -> Result<u32> {
let row = self.serial.write().unwrap().next_row()?;
if let Some(ref uuid) = self.uuid {
uuid.write().unwrap().update(row, create_uuid())?; }
self.update_common(row, activity, term_begin, term_end, fields)
}
pub fn update_row(
&mut self,
row: u32,
activity: &Activity,
term_begin: &Term,
term_end: &Term,
fields: &Vec<KeyValue>,
) -> Result<()> {
if self.exists(row) {
self.update_common(row, activity, term_begin, term_end, fields)?;
}
Ok(())
}
fn field(&self, name: &str) -> Option<&Arc<RwLock<Field>>> {
self.fields_cache.get(name)
}
fn load_fields(&mut self) -> io::Result<()> {
if self.fields_dir.exists() {
for p in self.fields_dir.read_dir()? {
let p = p?;
let path = p.path();
if path.is_dir() {
if let Some(str_fname) = p.file_name().to_str() {
if !self.fields_cache.contains_key(str_fname) {
let field = Field::new(path)?;
self.fields_cache
.entry(String::from(str_fname))
.or_insert(Arc::new(RwLock::new(field)));
}
}
}
}
}
Ok(())
}
fn update_common(
&mut self,
row: u32,
activity: &Activity,
term_begin: &Term,
term_end: &Term,
fields: &Vec<KeyValue>,
) -> Result<u32> {
if let Some(ref f) = self.activity {
f.write().unwrap().update(row, *activity as u8)?;
}
if let Some(ref f) = self.term_begin {
f.write().unwrap().update(
row,
if let Term::Overwrite(term) = term_begin {
*term
} else {
SystemTime::now().duration_since(UNIX_EPOCH)?.as_secs()
},
)?;
}
if let Some(ref f) = self.term_end {
f.write().unwrap().update(
row,
if let Term::Overwrite(term) = term_end {
*term
} else {
0
},
)?;
}
for kv in fields.iter() {
let field = if self.fields_cache.contains_key(&kv.key) {
self.fields_cache.get_mut(&kv.key).unwrap()
} else {
self.create_field(&kv.key)?
};
field.write().unwrap().update(row, &kv.value)?;
}
if let Some(ref f) = self.last_updated {
Ok(f.write()
.unwrap()
.update(row, SystemTime::now().duration_since(UNIX_EPOCH)?.as_secs())?)
} else {
Ok(row)
}
}
fn delete(&mut self, row: u32) -> io::Result<()> {
if self.exists(row) {
self.serial.write().unwrap().delete(row)?;
if let Some(ref f) = self.uuid {
f.write().unwrap().delete(row)?;
}
if let Some(ref f) = self.activity {
f.write().unwrap().delete(row)?;
}
if let Some(ref f) = self.term_begin {
f.write().unwrap().delete(row)?;
}
if let Some(ref f) = self.term_end {
f.write().unwrap().delete(row)?;
}
if let Some(ref f) = self.last_updated {
f.write().unwrap().delete(row)?;
}
self.load_fields()?;
for (_, v) in self.fields_cache.iter() {
v.write().unwrap().delete(row)?;
}
}
Ok(())
}
fn create_field(&mut self, field_name: &str) -> io::Result<&mut Arc<RwLock<Field>>> {
let mut fields_dir = self.fields_dir.clone();
fields_dir.push(field_name);
fs::create_dir_all(&fields_dir)?;
if fields_dir.exists() {
let field = Field::new(fields_dir)?;
self.fields_cache
.entry(String::from(field_name))
.or_insert(Arc::new(RwLock::new(field)));
}
Ok(self.fields_cache.get_mut(field_name).unwrap())
}
pub fn all(&self) -> RowSet {
self.serial
.read()
.unwrap()
.iter()
.map(|r| r.row())
.collect()
}
pub fn begin_search(&self) -> Search {
Search::new(self)
}
pub fn search_field(&self, field_name: impl Into<String>, condition: search::Field) -> Search {
Search::new(self).search_field(field_name, condition)
}
pub fn search_activity(&self, condition: Activity) -> Search {
Search::new(self).search_activity(condition)
}
pub fn search_term(&self, condition: search::Term) -> Search {
Search::new(self).search_term(condition)
}
pub fn search_row(&self, condition: search::Number) -> Search {
Search::new(self).search_row(condition)
}
pub fn search_default(&self) -> Result<Search, std::time::SystemTimeError> {
Search::new(self).search_default()
}
pub fn sort(&self, rows: RowSet, orders: &[Order]) -> Vec<u32> {
let mut sub_orders = vec![];
for i in 1..orders.len() {
sub_orders.push(&orders[i]);
}
match &orders[0] {
Order::Asc(key) => self.sort_with_key(rows, key, sub_orders),
Order::Desc(key) => self.sort_with_key_desc(rows, key, sub_orders),
}
}
fn subsort(&self, tmp: Vec<u32>, sub_orders: &[&Order]) -> Vec<u32> {
let mut tmp = tmp;
tmp.sort_by(|a, b| {
for i in 0..sub_orders.len() {
match sub_orders[i] {
Order::Asc(order_key) => match order_key {
OrderKey::Serial => {
return self
.serial
.read()
.unwrap()
.value(*a)
.unwrap()
.cmp(self.serial.read().unwrap().value(*b).unwrap());
}
OrderKey::Row => return a.cmp(b),
OrderKey::TermBegin => {
if let Some(ref f) = self.term_begin {
let ord = f
.read()
.unwrap()
.value(*a)
.unwrap()
.cmp(f.read().unwrap().value(*b).unwrap());
if ord != Ordering::Equal {
return ord;
}
}
}
OrderKey::TermEnd => {
if let Some(ref f) = self.term_end {
let ord = f
.read()
.unwrap()
.value(*a)
.unwrap()
.cmp(f.read().unwrap().value(*b).unwrap());
if ord != Ordering::Equal {
return ord;
}
}
}
OrderKey::LastUpdated => {
if let Some(ref f) = self.last_updated {
let ord = f
.read()
.unwrap()
.value(*a)
.unwrap()
.cmp(f.read().unwrap().value(*b).unwrap());
if ord != Ordering::Equal {
return ord;
}
}
}
OrderKey::Field(field_name) => {
if let Some(field) = self.field(&field_name) {
let ord = idx_binary::compare(
field.read().unwrap().bytes(*a).unwrap(),
field.read().unwrap().bytes(*b).unwrap(),
);
if ord != Ordering::Equal {
return ord;
}
}
}
},
Order::Desc(order_key) => match order_key {
OrderKey::Serial => {
return self
.serial
.read()
.unwrap()
.value(*b)
.unwrap()
.cmp(self.serial.read().unwrap().value(*a).unwrap());
}
OrderKey::Row => {
return b.cmp(a);
}
OrderKey::TermBegin => {
if let Some(ref f) = self.term_begin {
let ord = f
.read()
.unwrap()
.value(*b)
.unwrap()
.cmp(f.read().unwrap().value(*a).unwrap());
if ord != Ordering::Equal {
return ord;
}
}
}
OrderKey::TermEnd => {
if let Some(ref f) = self.term_end {
let ord = f
.read()
.unwrap()
.value(*b)
.unwrap()
.cmp(f.read().unwrap().value(*a).unwrap());
if ord != Ordering::Equal {
return ord;
}
}
}
OrderKey::LastUpdated => {
if let Some(ref f) = self.last_updated {
let ord = f
.read()
.unwrap()
.value(*b)
.unwrap()
.cmp(f.read().unwrap().value(*a).unwrap());
if ord != Ordering::Equal {
return ord;
}
}
}
OrderKey::Field(field_name) => {
if let Some(field) = self.field(&field_name) {
let ord = idx_binary::compare(
field.read().unwrap().bytes(*b).unwrap(),
field.read().unwrap().bytes(*a).unwrap(),
);
if ord != Ordering::Equal {
return ord;
}
}
}
},
}
}
Ordering::Equal
});
tmp
}
fn sort_with_iter<T>(
&self,
rows: RowSet,
iter: &mut AvltrieeIter<T>,
sub_orders: Vec<&Order>,
) -> Vec<u32>
where
T: PartialEq,
{
let mut ret = Vec::new();
if sub_orders.len() == 0 {
for row in iter {
let row = row.row();
if rows.contains(&row) {
ret.push(row);
}
}
} else {
let mut before: Option<&T> = None;
let mut tmp: Vec<u32> = Vec::new();
for row in iter {
let r = row.row();
if rows.contains(&r) {
let value = row.value();
if let Some(before) = before {
if before.ne(value) {
if tmp.len() <= 1 {
ret.extend(tmp);
} else {
let tmp = self.subsort(tmp, &mut sub_orders.clone());
ret.extend(tmp);
}
tmp = vec![];
}
} else {
ret.extend(tmp);
tmp = vec![];
}
tmp.push(r);
before = Some(value);
}
}
if tmp.len() <= 1 {
ret.extend(tmp);
} else {
let tmp = self.subsort(tmp, &mut sub_orders.clone());
ret.extend(tmp);
}
}
ret
}
fn sort_with_key(&self, rows: RowSet, key: &OrderKey, sub_orders: Vec<&Order>) -> Vec<u32> {
match key {
OrderKey::Serial => {
self.sort_with_iter(rows, &mut self.serial.read().unwrap().iter(), vec![])
}
OrderKey::Row => rows.iter().map(|&x| x).collect::<Vec<u32>>(),
OrderKey::TermBegin => {
if let Some(ref f) = self.term_begin {
self.sort_with_iter(rows, &mut f.read().unwrap().iter(), sub_orders)
} else {
rows.iter().map(|&x| x).collect::<Vec<u32>>()
}
}
OrderKey::TermEnd => {
if let Some(ref f) = self.term_end {
self.sort_with_iter(rows, &mut f.read().unwrap().iter(), sub_orders)
} else {
rows.iter().map(|&x| x).collect::<Vec<u32>>()
}
}
OrderKey::LastUpdated => {
if let Some(ref f) = self.term_end {
self.sort_with_iter(rows, &mut f.read().unwrap().iter(), sub_orders)
} else {
rows.iter().map(|&x| x).collect::<Vec<u32>>()
}
}
OrderKey::Field(field_name) => {
if let Some(field) = self.field(&field_name) {
self.sort_with_iter(rows, &mut field.read().unwrap().iter(), sub_orders)
} else {
rows.into_iter().collect()
}
}
}
}
fn sort_with_key_desc(
&self,
rows: RowSet,
key: &OrderKey,
sub_orders: Vec<&Order>,
) -> Vec<u32> {
match key {
OrderKey::Serial => {
self.sort_with_iter(rows, &mut self.serial.read().unwrap().desc_iter(), vec![])
}
OrderKey::Row => rows.iter().rev().map(|&x| x).collect::<Vec<u32>>(),
OrderKey::TermBegin => {
if let Some(ref f) = self.term_begin {
self.sort_with_iter(rows, &mut f.read().unwrap().desc_iter(), sub_orders)
} else {
rows.iter().rev().map(|&x| x).collect::<Vec<u32>>()
}
}
OrderKey::TermEnd => {
if let Some(ref f) = self.term_end {
self.sort_with_iter(rows, &mut f.read().unwrap().desc_iter(), sub_orders)
} else {
rows.iter().rev().map(|&x| x).collect::<Vec<u32>>()
}
}
OrderKey::LastUpdated => {
if let Some(ref f) = self.last_updated {
self.sort_with_iter(rows, &mut f.read().unwrap().desc_iter(), sub_orders)
} else {
rows.iter().rev().map(|&x| x).collect::<Vec<u32>>()
}
}
OrderKey::Field(field_name) => {
if let Some(field) = self.field(&field_name) {
self.sort_with_iter(rows, &mut field.read().unwrap().desc_iter(), sub_orders)
} else {
rows.into_iter().collect()
}
}
}
}
}