|
|
@ -1,30 +1,29 @@ |
|
|
|
#[macro_use] |
|
|
|
#[macro_use] |
|
|
|
extern crate serde_json; |
|
|
|
|
|
|
|
#[macro_use] |
|
|
|
|
|
|
|
extern crate log; |
|
|
|
extern crate log; |
|
|
|
|
|
|
|
#[macro_use] |
|
|
|
|
|
|
|
extern crate serde_json; |
|
|
|
|
|
|
|
|
|
|
|
use std::borrow::Cow; |
|
|
|
use std::borrow::Cow; |
|
|
|
use std::collections::HashMap; |
|
|
|
use std::collections::HashMap; |
|
|
|
|
|
|
|
use std::fs::OpenOptions; |
|
|
|
|
|
|
|
use std::io::{BufReader, BufWriter}; |
|
|
|
|
|
|
|
use std::path::{Path, PathBuf}; |
|
|
|
|
|
|
|
|
|
|
|
use itertools::Itertools; |
|
|
|
use itertools::Itertools; |
|
|
|
use serde::{Deserialize, Serialize}; |
|
|
|
use serde::{Deserialize, Serialize}; |
|
|
|
use thiserror::Error; |
|
|
|
use thiserror::Error; |
|
|
|
|
|
|
|
|
|
|
|
use crate::model::{PropertyModel, RelationModel}; |
|
|
|
|
|
|
|
use cool::{map_drain_filter, KVVecToKeysOrValues}; |
|
|
|
use cool::{map_drain_filter, KVVecToKeysOrValues}; |
|
|
|
|
|
|
|
pub use data::TypedValue; |
|
|
|
use id::next_id; |
|
|
|
use id::next_id; |
|
|
|
pub use id::ID; |
|
|
|
pub use id::ID; |
|
|
|
use insert::InsertObj; |
|
|
|
use insert::InsertObj; |
|
|
|
use insert::InsertValue; |
|
|
|
use insert::InsertValue; |
|
|
|
|
|
|
|
pub use model::DataType; |
|
|
|
use model::ObjectModel; |
|
|
|
use model::ObjectModel; |
|
|
|
|
|
|
|
|
|
|
|
use crate::data::Object; |
|
|
|
use crate::model::{PropertyModel, RelationModel}; |
|
|
|
use crate::update::{UpdateObj, UpsertValue}; |
|
|
|
use crate::update::{UpdateObj, UpsertValue}; |
|
|
|
pub use data::TypedValue; |
|
|
|
|
|
|
|
pub use model::DataType; |
|
|
|
|
|
|
|
use std::path::{PathBuf, Path}; |
|
|
|
|
|
|
|
use std::fs::OpenOptions; |
|
|
|
|
|
|
|
use std::io::{BufReader, BufWriter}; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
mod cool; |
|
|
|
mod cool; |
|
|
|
pub mod data; |
|
|
|
pub mod data; |
|
|
@ -63,14 +62,14 @@ pub struct Storage { |
|
|
|
#[derive(Debug, Clone)] |
|
|
|
#[derive(Debug, Clone)] |
|
|
|
pub struct StoreOpts { |
|
|
|
pub struct StoreOpts { |
|
|
|
file: Option<PathBuf>, |
|
|
|
file: Option<PathBuf>, |
|
|
|
file_format: FileEncoding |
|
|
|
file_format: FileEncoding, |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
impl Default for StoreOpts { |
|
|
|
impl Default for StoreOpts { |
|
|
|
fn default() -> Self { |
|
|
|
fn default() -> Self { |
|
|
|
Self { |
|
|
|
Self { |
|
|
|
file: None, |
|
|
|
file: None, |
|
|
|
file_format: FileEncoding::JSON |
|
|
|
file_format: FileEncoding::JSON, |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
@ -103,29 +102,39 @@ impl Storage { |
|
|
|
Self::default() |
|
|
|
Self::default() |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
pub fn new_json(file : impl AsRef<Path>) -> Self { |
|
|
|
/// Create a new instance backed by a JSON file. The file is created if needed.
|
|
|
|
|
|
|
|
/// The backing file can be read or edited by any text editor.
|
|
|
|
|
|
|
|
pub fn new_json(file: impl AsRef<Path>) -> Result<Self, StorageError> { |
|
|
|
let mut s = Self::new(); |
|
|
|
let mut s = Self::new(); |
|
|
|
s.opts.file_format = FileEncoding::JSON; |
|
|
|
s.opts.file_format = FileEncoding::JSON; |
|
|
|
s.opts.file = Some(file.as_ref().to_path_buf()); |
|
|
|
s.opts.file = Some(file.as_ref().to_path_buf()); |
|
|
|
s |
|
|
|
s.load()?; |
|
|
|
|
|
|
|
Ok(s) |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
pub fn new_bincode(file : impl AsRef<Path>) -> Self { |
|
|
|
/// Create a new instance backed by a BinCode file. The file is created if needed.
|
|
|
|
|
|
|
|
/// This format has higher data density and faster save/load times,
|
|
|
|
|
|
|
|
/// but cannot be easily read outside yopa.
|
|
|
|
|
|
|
|
pub fn new_bincode(file: impl AsRef<Path>) -> Result<Self, StorageError> { |
|
|
|
let mut s = Self::new(); |
|
|
|
let mut s = Self::new(); |
|
|
|
s.opts.file_format = FileEncoding::BINCODE; |
|
|
|
s.opts.file_format = FileEncoding::BINCODE; |
|
|
|
s.opts.file = Some(file.as_ref().to_path_buf()); |
|
|
|
s.opts.file = Some(file.as_ref().to_path_buf()); |
|
|
|
s |
|
|
|
s.load()?; |
|
|
|
|
|
|
|
Ok(s) |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Set backing file and its encoding
|
|
|
|
pub fn set_file(&mut self, file: impl AsRef<Path>, format: FileEncoding) { |
|
|
|
pub fn set_file(&mut self, file: impl AsRef<Path>, format: FileEncoding) { |
|
|
|
self.opts.file_format = format; |
|
|
|
self.opts.file_format = format; |
|
|
|
self.opts.file = Some(file.as_ref().to_path_buf()); |
|
|
|
self.opts.file = Some(file.as_ref().to_path_buf()); |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Unset backing file
|
|
|
|
pub fn unset_file(&mut self) { |
|
|
|
pub fn unset_file(&mut self) { |
|
|
|
self.opts.file = None; |
|
|
|
self.opts.file = None; |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Manually load from the backing file.
|
|
|
|
pub fn load(&mut self) -> Result<(), StorageError> { |
|
|
|
pub fn load(&mut self) -> Result<(), StorageError> { |
|
|
|
match &self.opts.file { |
|
|
|
match &self.opts.file { |
|
|
|
None => { |
|
|
|
None => { |
|
|
@ -136,7 +145,7 @@ impl Storage { |
|
|
|
|
|
|
|
|
|
|
|
if !path.exists() { |
|
|
|
if !path.exists() { |
|
|
|
warn!("File does not exist, skip load."); |
|
|
|
warn!("File does not exist, skip load."); |
|
|
|
return Ok(()) |
|
|
|
return Ok(()); |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
let f = OpenOptions::new().read(true).open(&path)?; |
|
|
|
let f = OpenOptions::new().read(true).open(&path)?; |
|
|
@ -144,12 +153,8 @@ impl Storage { |
|
|
|
let reader = BufReader::new(f); |
|
|
|
let reader = BufReader::new(f); |
|
|
|
|
|
|
|
|
|
|
|
let parsed: Self = match self.opts.file_format { |
|
|
|
let parsed: Self = match self.opts.file_format { |
|
|
|
FileEncoding::JSON => { |
|
|
|
FileEncoding::JSON => serde_json::from_reader(reader)?, |
|
|
|
serde_json::from_reader(reader)? |
|
|
|
FileEncoding::BINCODE => bincode::deserialize_from(reader)?, |
|
|
|
} |
|
|
|
|
|
|
|
FileEncoding::BINCODE => { |
|
|
|
|
|
|
|
bincode::deserialize_from(reader)? |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
}; |
|
|
|
}; |
|
|
|
|
|
|
|
|
|
|
|
let opts = std::mem::replace(&mut self.opts, StoreOpts::default()); |
|
|
|
let opts = std::mem::replace(&mut self.opts, StoreOpts::default()); |
|
|
@ -161,6 +166,8 @@ impl Storage { |
|
|
|
Ok(()) |
|
|
|
Ok(()) |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Persist to the backing file.
|
|
|
|
|
|
|
|
/// This must be called after each transaction that should be saved.
|
|
|
|
pub fn persist(&mut self) -> Result<(), StorageError> { |
|
|
|
pub fn persist(&mut self) -> Result<(), StorageError> { |
|
|
|
match &self.opts.file { |
|
|
|
match &self.opts.file { |
|
|
|
None => { |
|
|
|
None => { |
|
|
@ -170,16 +177,18 @@ impl Storage { |
|
|
|
Some(path) => { |
|
|
|
Some(path) => { |
|
|
|
debug!("Persist to: {}", path.display()); |
|
|
|
debug!("Persist to: {}", path.display()); |
|
|
|
|
|
|
|
|
|
|
|
let f = OpenOptions::new().write(true).create(true).truncate(true).open(&path)?; |
|
|
|
let f = OpenOptions::new() |
|
|
|
|
|
|
|
.write(true) |
|
|
|
|
|
|
|
.create(true) |
|
|
|
|
|
|
|
.truncate(true) |
|
|
|
|
|
|
|
.open(&path)?; |
|
|
|
let writer = BufWriter::new(f); |
|
|
|
let writer = BufWriter::new(f); |
|
|
|
|
|
|
|
|
|
|
|
match self.opts.file_format { |
|
|
|
match self.opts.file_format { |
|
|
|
FileEncoding::JSON => { |
|
|
|
FileEncoding::JSON => { |
|
|
|
serde_json::to_writer(writer, self)?; |
|
|
|
serde_json::to_writer(writer, self)?; |
|
|
|
} |
|
|
|
} |
|
|
|
FileEncoding::BINCODE => { |
|
|
|
FileEncoding::BINCODE => bincode::serialize_into(writer, self)?, |
|
|
|
bincode::serialize_into(writer, self)? |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
}; |
|
|
|
}; |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
@ -187,7 +196,190 @@ impl Storage { |
|
|
|
Ok(()) |
|
|
|
Ok(()) |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
/// Define a data object
|
|
|
|
/// Get textual description of a model (of any kind), suitable for error messages or logging
|
|
|
|
|
|
|
|
pub fn describe_model(&self, id: ID) -> String { |
|
|
|
|
|
|
|
if let Some(x) = self.obj_models.get(&id) { |
|
|
|
|
|
|
|
x.to_string() |
|
|
|
|
|
|
|
} else if let Some(x) = self.rel_models.get(&id) { |
|
|
|
|
|
|
|
x.to_string() |
|
|
|
|
|
|
|
} else if let Some(x) = self.prop_models.get(&id) { |
|
|
|
|
|
|
|
x.to_string() |
|
|
|
|
|
|
|
} else { |
|
|
|
|
|
|
|
id.to_string() |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Get model name. Accepts ID of object, relation or property models.
|
|
|
|
|
|
|
|
pub fn get_model_name(&self, id: ID) -> &str { |
|
|
|
|
|
|
|
if let Some(x) = self.obj_models.get(&id) { |
|
|
|
|
|
|
|
&x.name |
|
|
|
|
|
|
|
} else if let Some(x) = self.rel_models.get(&id) { |
|
|
|
|
|
|
|
&x.name |
|
|
|
|
|
|
|
} else if let Some(x) = self.prop_models.get(&id) { |
|
|
|
|
|
|
|
&x.name |
|
|
|
|
|
|
|
} else { |
|
|
|
|
|
|
|
"???" |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//region Model queries
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Iterate all object models
|
|
|
|
|
|
|
|
pub fn get_object_models(&self) -> impl Iterator<Item = &ObjectModel> { |
|
|
|
|
|
|
|
self.obj_models.values() |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Get an object model by ID
|
|
|
|
|
|
|
|
pub fn get_object_model(&self, model_id: ID) -> Option<&ObjectModel> { |
|
|
|
|
|
|
|
self.obj_models.get(&model_id) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Get a relation model by ID
|
|
|
|
|
|
|
|
pub fn get_relation_model(&self, model_id: ID) -> Option<&RelationModel> { |
|
|
|
|
|
|
|
self.rel_models.get(&model_id) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Get a property model by ID
|
|
|
|
|
|
|
|
pub fn get_property_model(&self, model_id: ID) -> Option<&PropertyModel> { |
|
|
|
|
|
|
|
self.prop_models.get(&model_id) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Get all property models grouped by the parent object ID.
|
|
|
|
|
|
|
|
pub fn get_grouped_prop_models(&self) -> HashMap<ID, Vec<&PropertyModel>> { |
|
|
|
|
|
|
|
self.prop_models |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.into_group_map_by(|model| model.object) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Get property models belonging to a group of parent IDs,
|
|
|
|
|
|
|
|
/// grouped by the parent ID.
|
|
|
|
|
|
|
|
pub fn get_grouped_prop_models_for_parents( |
|
|
|
|
|
|
|
&self, |
|
|
|
|
|
|
|
parent_model_ids: Vec<ID>, |
|
|
|
|
|
|
|
) -> HashMap<ID, Vec<&PropertyModel>> { |
|
|
|
|
|
|
|
self.prop_models |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.filter(|p| parent_model_ids.contains(&p.object)) |
|
|
|
|
|
|
|
.into_group_map_by(|model| model.object) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Iterate relation models attached to an object model
|
|
|
|
|
|
|
|
pub fn get_relation_models_for_object_model( |
|
|
|
|
|
|
|
&self, |
|
|
|
|
|
|
|
model_id: ID, |
|
|
|
|
|
|
|
) -> impl Iterator<Item = &RelationModel> { |
|
|
|
|
|
|
|
self.rel_models |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.filter(move |model| model.object == model_id) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Iterate property models attached to an object or relation model
|
|
|
|
|
|
|
|
pub fn get_property_models_for_parents( |
|
|
|
|
|
|
|
&self, |
|
|
|
|
|
|
|
parents: Vec<ID>, |
|
|
|
|
|
|
|
) -> impl Iterator<Item = &PropertyModel> { |
|
|
|
|
|
|
|
self.prop_models |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.filter(move |model| parents.contains(&model.object)) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Get all relation models, grouped by their source object model ID
|
|
|
|
|
|
|
|
pub fn get_grouped_relation_models(&self) -> HashMap<ID, Vec<&RelationModel>> { |
|
|
|
|
|
|
|
self.rel_models |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.into_group_map_by(|model| model.object) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Get reciprocal relation models, grouped by their destination model ID
|
|
|
|
|
|
|
|
pub fn get_grouped_reciprocal_relation_models(&self) -> HashMap<ID, Vec<&RelationModel>> { |
|
|
|
|
|
|
|
self.rel_models |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.into_group_map_by(|model| model.related) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//endregion Model queries
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//region Data queries
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Get all relation for an object
|
|
|
|
|
|
|
|
pub fn get_relations_for_object(&self, object_id: ID) -> impl Iterator<Item = &data::Relation> { |
|
|
|
|
|
|
|
self.relations |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.filter(move |rel| rel.object == object_id) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Get all reciprocal relation for an object
|
|
|
|
|
|
|
|
pub fn get_reciprocal_relations_for_object( |
|
|
|
|
|
|
|
&self, |
|
|
|
|
|
|
|
object_id: ID, |
|
|
|
|
|
|
|
) -> impl Iterator<Item = &data::Relation> { |
|
|
|
|
|
|
|
self.relations |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.filter(move |rel| rel.related == object_id) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Get values attached to a parent object or relation
|
|
|
|
|
|
|
|
pub fn get_values_for_object(&self, object_id: ID) -> impl Iterator<Item = &data::Value> { |
|
|
|
|
|
|
|
self.values |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.filter(move |prop| prop.object == object_id) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Get values belonging to a list of objects or relations,
|
|
|
|
|
|
|
|
/// grouped by the parent entity ID.
|
|
|
|
|
|
|
|
pub fn get_grouped_values_for_objects( |
|
|
|
|
|
|
|
&self, |
|
|
|
|
|
|
|
parents: Vec<ID>, |
|
|
|
|
|
|
|
) -> HashMap<ID, Vec<&data::Value>> { |
|
|
|
|
|
|
|
self.values |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.filter(move |prop| parents.contains(&prop.object)) |
|
|
|
|
|
|
|
.into_group_map_by(|model| model.object) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Get all objects belonging to a model.
|
|
|
|
|
|
|
|
///
|
|
|
|
|
|
|
|
/// Use `get_objects_of_types` to specify more than one model
|
|
|
|
|
|
|
|
pub fn get_objects_of_type(&self, model_id: ID) -> impl Iterator<Item = &data::Object> { |
|
|
|
|
|
|
|
self.objects |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.filter(move |object| object.model == model_id) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Get all objects belonging to one of several models
|
|
|
|
|
|
|
|
pub fn get_objects_of_types(&self, model_ids: Vec<ID>) -> impl Iterator<Item = &data::Object> { |
|
|
|
|
|
|
|
self.objects |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.filter(move |object| model_ids.contains(&object.model)) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Get all objects, grouped by their model ID
|
|
|
|
|
|
|
|
pub fn get_grouped_objects(&self) -> HashMap<ID, Vec<&data::Object>> { |
|
|
|
|
|
|
|
self.objects |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.into_group_map_by(|object| object.model) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Get object by ID
|
|
|
|
|
|
|
|
pub fn get_object(&self, id: ID) -> Option<&data::Object> { |
|
|
|
|
|
|
|
self.objects.get(&id) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Get value by ID
|
|
|
|
|
|
|
|
pub fn get_value(&self, id: ID) -> Option<&data::Value> { |
|
|
|
|
|
|
|
self.values.get(&id) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Get relation by ID
|
|
|
|
|
|
|
|
pub fn get_relation(&self, id: ID) -> Option<&data::Relation> { |
|
|
|
|
|
|
|
self.relations.get(&id) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//endregion Data queries
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//region Model editing
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Define an object model
|
|
|
|
pub fn define_object(&mut self, mut tpl: model::ObjectModel) -> Result<ID, StorageError> { |
|
|
|
pub fn define_object(&mut self, mut tpl: model::ObjectModel) -> Result<ID, StorageError> { |
|
|
|
if tpl.name.is_empty() { |
|
|
|
if tpl.name.is_empty() { |
|
|
|
return Err(StorageError::ConstraintViolation( |
|
|
|
return Err(StorageError::ConstraintViolation( |
|
|
@ -213,7 +405,7 @@ impl Storage { |
|
|
|
Ok(id) |
|
|
|
Ok(id) |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
/// Define a relation between two data objects
|
|
|
|
/// Define an object relation model
|
|
|
|
pub fn define_relation(&mut self, mut rel: model::RelationModel) -> Result<ID, StorageError> { |
|
|
|
pub fn define_relation(&mut self, mut rel: model::RelationModel) -> Result<ID, StorageError> { |
|
|
|
if rel.name.is_empty() || rel.reciprocal_name.is_empty() { |
|
|
|
if rel.name.is_empty() || rel.reciprocal_name.is_empty() { |
|
|
|
return Err(StorageError::ConstraintViolation( |
|
|
|
return Err(StorageError::ConstraintViolation( |
|
|
@ -262,7 +454,7 @@ impl Storage { |
|
|
|
Ok(id) |
|
|
|
Ok(id) |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
/// Define a property attached to an object or a relation
|
|
|
|
/// Define a property model, attached to an object or a relation
|
|
|
|
pub fn define_property(&mut self, mut prop: model::PropertyModel) -> Result<ID, StorageError> { |
|
|
|
pub fn define_property(&mut self, mut prop: model::PropertyModel) -> Result<ID, StorageError> { |
|
|
|
if prop.name.is_empty() { |
|
|
|
if prop.name.is_empty() { |
|
|
|
return Err(StorageError::ConstraintViolation( |
|
|
|
return Err(StorageError::ConstraintViolation( |
|
|
@ -301,7 +493,7 @@ impl Storage { |
|
|
|
Err(_) => { |
|
|
|
Err(_) => { |
|
|
|
return Err(StorageError::NotExist( |
|
|
|
return Err(StorageError::NotExist( |
|
|
|
format!("default value {:?} has invalid type", prop.default).into(), |
|
|
|
format!("default value {:?} has invalid type", prop.default).into(), |
|
|
|
)) |
|
|
|
)); |
|
|
|
} |
|
|
|
} |
|
|
|
}; |
|
|
|
}; |
|
|
|
|
|
|
|
|
|
|
@ -316,10 +508,10 @@ impl Storage { |
|
|
|
Ok(id) |
|
|
|
Ok(id) |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
/// Delete an object definition and associated data
|
|
|
|
/// Undefine an object model, its properties and relations. Deletes all associated data.
|
|
|
|
pub fn undefine_object(&mut self, id: ID) -> Result<ObjectModel, StorageError> { |
|
|
|
pub fn undefine_object(&mut self, id: ID) -> Result<ObjectModel, StorageError> { |
|
|
|
return if let Some(t) = self.obj_models.remove(&id) { |
|
|
|
return if let Some(model) = self.obj_models.remove(&id) { |
|
|
|
debug!("Undefine object model \"{}\"", t.name); |
|
|
|
debug!("Undefine object model \"{}\"", model.name); |
|
|
|
// Remove relation templates
|
|
|
|
// Remove relation templates
|
|
|
|
let removed_relation_ids = map_drain_filter(&mut self.rel_models, |_k, v| { |
|
|
|
let removed_relation_ids = map_drain_filter(&mut self.rel_models, |_k, v| { |
|
|
|
v.object == id || v.related == id |
|
|
|
v.object == id || v.related == id |
|
|
@ -352,7 +544,7 @@ impl Storage { |
|
|
|
|
|
|
|
|
|
|
|
// Related object remain untouched, so there can be a problem with orphans. This is up to the application to deal with.
|
|
|
|
// Related object remain untouched, so there can be a problem with orphans. This is up to the application to deal with.
|
|
|
|
|
|
|
|
|
|
|
|
Ok(t) |
|
|
|
Ok(model) |
|
|
|
} else { |
|
|
|
} else { |
|
|
|
Err(StorageError::NotExist( |
|
|
|
Err(StorageError::NotExist( |
|
|
|
format!("object model {}", id).into(), |
|
|
|
format!("object model {}", id).into(), |
|
|
@ -360,10 +552,10 @@ impl Storage { |
|
|
|
}; |
|
|
|
}; |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
/// Delete a relation definition and associated data
|
|
|
|
/// Undefine a relation model and its properties. Deletes all associated data.
|
|
|
|
pub fn undefine_relation(&mut self, id: ID) -> Result<model::RelationModel, StorageError> { |
|
|
|
pub fn undefine_relation(&mut self, id: ID) -> Result<model::RelationModel, StorageError> { |
|
|
|
return if let Some(t) = self.rel_models.remove(&id) { |
|
|
|
return if let Some(model) = self.rel_models.remove(&id) { |
|
|
|
debug!("Undefine relation model \"{}\"", t.name); |
|
|
|
debug!("Undefine relation model \"{}\"", model.name); |
|
|
|
|
|
|
|
|
|
|
|
// Remove relations
|
|
|
|
// Remove relations
|
|
|
|
let removed = map_drain_filter(&mut self.relations, |_k, v| v.model == id); |
|
|
|
let removed = map_drain_filter(&mut self.relations, |_k, v| v.model == id); |
|
|
@ -384,7 +576,7 @@ impl Storage { |
|
|
|
|
|
|
|
|
|
|
|
// Related object remain untouched, so there can be a problem with orphans. This is up to the application to deal with.
|
|
|
|
// Related object remain untouched, so there can be a problem with orphans. This is up to the application to deal with.
|
|
|
|
|
|
|
|
|
|
|
|
Ok(t) |
|
|
|
Ok(model) |
|
|
|
} else { |
|
|
|
} else { |
|
|
|
Err(StorageError::NotExist( |
|
|
|
Err(StorageError::NotExist( |
|
|
|
format!("relation model {}", id).into(), |
|
|
|
format!("relation model {}", id).into(), |
|
|
@ -392,7 +584,7 @@ impl Storage { |
|
|
|
}; |
|
|
|
}; |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
/// Delete a property definition and associated data
|
|
|
|
/// Undefine a property model and delete associated data
|
|
|
|
pub fn undefine_property(&mut self, id: ID) -> Result<model::PropertyModel, StorageError> { |
|
|
|
pub fn undefine_property(&mut self, id: ID) -> Result<model::PropertyModel, StorageError> { |
|
|
|
return if let Some(t) = self.prop_models.remove(&id) { |
|
|
|
return if let Some(t) = self.prop_models.remove(&id) { |
|
|
|
debug!("Undefine property model \"{}\"", t.name); |
|
|
|
debug!("Undefine property model \"{}\"", t.name); |
|
|
@ -408,33 +600,124 @@ impl Storage { |
|
|
|
}; |
|
|
|
}; |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
pub fn describe_model(&self, id: ID) -> String { |
|
|
|
/// Update an object model, matched by its ID
|
|
|
|
if let Some(x) = self.obj_models.get(&id) { |
|
|
|
pub fn update_object_model(&mut self, model: ObjectModel) -> Result<(), StorageError> { |
|
|
|
x.to_string() |
|
|
|
if model.name.is_empty() { |
|
|
|
} else if let Some(x) = self.rel_models.get(&id) { |
|
|
|
return Err(StorageError::ConstraintViolation( |
|
|
|
x.to_string() |
|
|
|
format!("Model name must not be empty.").into(), |
|
|
|
} else if let Some(x) = self.prop_models.get(&id) { |
|
|
|
)); |
|
|
|
x.to_string() |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
if !self.obj_models.contains_key(&model.id) { |
|
|
|
|
|
|
|
return Err(StorageError::NotExist( |
|
|
|
|
|
|
|
format!("Object model ID {} does not exist.", model.id).into(), |
|
|
|
|
|
|
|
)); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
if let Some(conflict) = self |
|
|
|
|
|
|
|
.obj_models |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.find(|m| m.id != model.id && m.name == model.name) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
return Err(StorageError::ConstraintViolation( |
|
|
|
|
|
|
|
format!("Object {} already has the name {}", conflict.id, model.name).into(), |
|
|
|
|
|
|
|
)); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
self.obj_models.insert(model.id, model); |
|
|
|
|
|
|
|
Ok(()) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Update a relation model, matched by its ID
|
|
|
|
|
|
|
|
pub fn update_relation_model(&mut self, mut rel: RelationModel) -> Result<(), StorageError> { |
|
|
|
|
|
|
|
if rel.name.is_empty() || rel.reciprocal_name.is_empty() { |
|
|
|
|
|
|
|
return Err(StorageError::ConstraintViolation( |
|
|
|
|
|
|
|
format!("Relation names must not be empty.").into(), |
|
|
|
|
|
|
|
)); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
// Object and Related can't be changed, so we re-fill them from the existing model
|
|
|
|
|
|
|
|
if let Some(existing) = self.rel_models.get(&rel.id) { |
|
|
|
|
|
|
|
rel.object = existing.object; |
|
|
|
|
|
|
|
rel.related = existing.related; |
|
|
|
} else { |
|
|
|
} else { |
|
|
|
id.to_string() |
|
|
|
return Err(StorageError::NotExist( |
|
|
|
|
|
|
|
format!("Relation model ID {} does not exist.", rel.id).into(), |
|
|
|
|
|
|
|
)); |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
// Difficult checks ...
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
// yes this is stupid and inefficient and slow and
|
|
|
|
|
|
|
|
if let Some((_, colliding)) = self.rel_models.iter().find(|(_, other)| { |
|
|
|
|
|
|
|
(other.name == rel.name && other.object == rel.object && rel.id != other.id) // Exact match
|
|
|
|
|
|
|
|
|| (other.name == rel.reciprocal_name && other.object == rel.related && rel.id != other.id) // Our reciprocal name collides with related's own relation name
|
|
|
|
|
|
|
|
|| (other.reciprocal_name == rel.name && other.related == rel.object && rel.id != other.id) // Our name name collides with a reciprocal name on the other relation
|
|
|
|
|
|
|
|
|| (other.reciprocal_name == rel.reciprocal_name && other.related == rel.related && rel.id != other.id) // Reciprocal names collide for the same destination
|
|
|
|
|
|
|
|
}) { |
|
|
|
|
|
|
|
return Err(StorageError::ConstraintViolation( |
|
|
|
|
|
|
|
format!("name collision (\"{}\" / \"{}\") with existing relation (\"{}\" / \"{}\")", |
|
|
|
|
|
|
|
rel.name, rel.reciprocal_name, |
|
|
|
|
|
|
|
colliding.name, colliding.reciprocal_name |
|
|
|
|
|
|
|
).into())); |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
pub fn get_model_name(&self, id: ID) -> &str { |
|
|
|
self.rel_models.insert(rel.id, rel); |
|
|
|
if let Some(x) = self.obj_models.get(&id) { |
|
|
|
Ok(()) |
|
|
|
&x.name |
|
|
|
} |
|
|
|
} else if let Some(x) = self.rel_models.get(&id) { |
|
|
|
|
|
|
|
&x.name |
|
|
|
/// Update a property model, matched by its ID
|
|
|
|
} else if let Some(x) = self.prop_models.get(&id) { |
|
|
|
pub fn update_property_model(&mut self, mut prop: PropertyModel) -> Result<(), StorageError> { |
|
|
|
&x.name |
|
|
|
if prop.name.is_empty() { |
|
|
|
|
|
|
|
return Err(StorageError::ConstraintViolation( |
|
|
|
|
|
|
|
format!("Property name must not be empty.").into(), |
|
|
|
|
|
|
|
)); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
// Object can't be changed, so we re-fill them from the existing model
|
|
|
|
|
|
|
|
if let Some(existing) = self.prop_models.get(&prop.id) { |
|
|
|
|
|
|
|
prop.object = existing.object; |
|
|
|
} else { |
|
|
|
} else { |
|
|
|
"???" |
|
|
|
return Err(StorageError::NotExist( |
|
|
|
|
|
|
|
format!("Property model ID {} does not exist.", prop.id).into(), |
|
|
|
|
|
|
|
)); |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
if self |
|
|
|
|
|
|
|
.prop_models |
|
|
|
|
|
|
|
.iter() |
|
|
|
|
|
|
|
.find(|(_, t)| t.object == prop.object && t.name == prop.name && t.id != prop.id) |
|
|
|
|
|
|
|
.is_some() |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
return Err(StorageError::ConstraintViolation( |
|
|
|
|
|
|
|
format!( |
|
|
|
|
|
|
|
"property with the name \"{}\" already exists on {}", |
|
|
|
|
|
|
|
prop.name, |
|
|
|
|
|
|
|
self.describe_model(prop.object) |
|
|
|
|
|
|
|
) |
|
|
|
|
|
|
|
.into(), |
|
|
|
|
|
|
|
)); |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
// DATA
|
|
|
|
// Ensure the default type is compatible
|
|
|
|
|
|
|
|
prop.default = match prop.default.clone().cast_to(prop.data_type) { |
|
|
|
|
|
|
|
Ok(v) => v, |
|
|
|
|
|
|
|
Err(_) => { |
|
|
|
|
|
|
|
return Err(StorageError::NotExist( |
|
|
|
|
|
|
|
format!("default value {:?} has invalid type", prop.default).into(), |
|
|
|
|
|
|
|
)); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
}; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
self.prop_models.insert(prop.id, prop); |
|
|
|
|
|
|
|
Ok(()) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//endregion Model editing
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//region Data editing
|
|
|
|
|
|
|
|
|
|
|
|
/// Insert object with relations, validating the data model constraints
|
|
|
|
/// Insert a data object with properties and relations, validating the data model constraints
|
|
|
|
pub fn insert_object(&mut self, insobj: InsertObj) -> Result<ID, StorageError> { |
|
|
|
pub fn insert_object(&mut self, insobj: InsertObj) -> Result<ID, StorageError> { |
|
|
|
let obj_model_id = insobj.model; |
|
|
|
let obj_model_id = insobj.model; |
|
|
|
debug!("Insert object {:?}", insobj); |
|
|
|
debug!("Insert object {:?}", insobj); |
|
|
@ -444,7 +727,7 @@ impl Storage { |
|
|
|
None => { |
|
|
|
None => { |
|
|
|
return Err(StorageError::NotExist( |
|
|
|
return Err(StorageError::NotExist( |
|
|
|
format!("object model {}", obj_model_id).into(), |
|
|
|
format!("object model {}", obj_model_id).into(), |
|
|
|
)) |
|
|
|
)); |
|
|
|
} |
|
|
|
} |
|
|
|
}; |
|
|
|
}; |
|
|
|
|
|
|
|
|
|
|
@ -600,117 +883,11 @@ impl Storage { |
|
|
|
Ok(object_id) |
|
|
|
Ok(object_id) |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
// Reading
|
|
|
|
/// Update an existing object and its values, relations and their values.
|
|
|
|
pub fn get_object_models(&self) -> impl Iterator<Item = &ObjectModel> { |
|
|
|
///
|
|
|
|
self.obj_models.values() |
|
|
|
/// The existing data is synchronized to match the new data, that is, relations and values
|
|
|
|
} |
|
|
|
/// not specified will be deleted, these with matching IDs will be
|
|
|
|
|
|
|
|
/// overwritten, and ones without an ID will be created and assigned a unique ID.
|
|
|
|
pub fn get_object_model(&self, id: ID) -> Option<&ObjectModel> { |
|
|
|
|
|
|
|
self.obj_models.get(&id) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
pub fn get_relation_model(&self, id: ID) -> Option<&RelationModel> { |
|
|
|
|
|
|
|
self.rel_models.get(&id) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
pub fn get_property_model(&self, id: ID) -> Option<&PropertyModel> { |
|
|
|
|
|
|
|
self.prop_models.get(&id) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
pub fn get_grouped_prop_models(&self) -> HashMap<ID, Vec<&PropertyModel>> { |
|
|
|
|
|
|
|
self.prop_models |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.into_group_map_by(|model| model.object) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
pub fn get_grouped_prop_models_for_parents( |
|
|
|
|
|
|
|
&self, |
|
|
|
|
|
|
|
parents: Vec<ID>, |
|
|
|
|
|
|
|
) -> HashMap<ID, Vec<&PropertyModel>> { |
|
|
|
|
|
|
|
self.prop_models |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.filter(|p| parents.contains(&p.object)) |
|
|
|
|
|
|
|
.into_group_map_by(|model| model.object) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
pub fn get_relations_for_object(&self, object_id: ID) -> impl Iterator<Item = &data::Relation> { |
|
|
|
|
|
|
|
self.relations |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.filter(move |rel| rel.object == object_id) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
pub fn get_reciprocal_relations_for_object( |
|
|
|
|
|
|
|
&self, |
|
|
|
|
|
|
|
object_id: ID, |
|
|
|
|
|
|
|
) -> impl Iterator<Item = &data::Relation> { |
|
|
|
|
|
|
|
self.relations |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.filter(move |rel| rel.related == object_id) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
pub fn get_values_for_object(&self, object_id: ID) -> impl Iterator<Item = &data::Value> { |
|
|
|
|
|
|
|
self.values |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.filter(move |prop| prop.object == object_id) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
pub fn get_grouped_values_for_objects( |
|
|
|
|
|
|
|
&self, |
|
|
|
|
|
|
|
parents: Vec<ID>, |
|
|
|
|
|
|
|
) -> HashMap<ID, Vec<&data::Value>> { |
|
|
|
|
|
|
|
self.values |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.filter(move |prop| parents.contains(&prop.object)) |
|
|
|
|
|
|
|
.into_group_map_by(|model| model.object) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
pub fn get_relation_models_for_object_model( |
|
|
|
|
|
|
|
&self, |
|
|
|
|
|
|
|
model_id: ID, |
|
|
|
|
|
|
|
) -> impl Iterator<Item = &RelationModel> { |
|
|
|
|
|
|
|
self.rel_models |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.filter(move |model| model.object == model_id) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
pub fn get_property_models_for_parents( |
|
|
|
|
|
|
|
&self, |
|
|
|
|
|
|
|
parents: Vec<ID>, |
|
|
|
|
|
|
|
) -> impl Iterator<Item = &PropertyModel> { |
|
|
|
|
|
|
|
self.prop_models |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.filter(move |model| parents.contains(&model.object)) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
pub fn get_objects_of_type(&self, model_ids: Vec<ID>) -> impl Iterator<Item = &data::Object> { |
|
|
|
|
|
|
|
self.objects |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.filter(move |object| model_ids.contains(&object.model)) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
pub fn get_grouped_objects(&self) -> HashMap<ID, Vec<&Object>> { |
|
|
|
|
|
|
|
self.objects |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.into_group_map_by(|object| object.model) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
pub fn get_grouped_relation_models(&self) -> HashMap<ID, Vec<&RelationModel>> { |
|
|
|
|
|
|
|
self.rel_models |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.into_group_map_by(|model| model.object) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
pub fn get_grouped_reciprocal_relation_models(&self) -> HashMap<ID, Vec<&RelationModel>> { |
|
|
|
|
|
|
|
self.rel_models |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.into_group_map_by(|model| model.related) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
pub fn get_object(&self, id: ID) -> Option<&Object> { |
|
|
|
|
|
|
|
self.objects.get(&id) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
// Updates
|
|
|
|
|
|
|
|
pub fn update_object(&mut self, updobj: UpdateObj) -> Result<(), StorageError> { |
|
|
|
pub fn update_object(&mut self, updobj: UpdateObj) -> Result<(), StorageError> { |
|
|
|
let old_object = self.objects.get(&updobj.id).ok_or_else(|| { |
|
|
|
let old_object = self.objects.get(&updobj.id).ok_or_else(|| { |
|
|
|
StorageError::ConstraintViolation(format!("Object does not exist").into()) |
|
|
|
StorageError::ConstraintViolation(format!("Object does not exist").into()) |
|
|
@ -725,7 +902,7 @@ impl Storage { |
|
|
|
None => { |
|
|
|
None => { |
|
|
|
return Err(StorageError::NotExist( |
|
|
|
return Err(StorageError::NotExist( |
|
|
|
format!("object model {}", updated_object_model_id).into(), |
|
|
|
format!("object model {}", updated_object_model_id).into(), |
|
|
|
)) |
|
|
|
)); |
|
|
|
} |
|
|
|
} |
|
|
|
}; |
|
|
|
}; |
|
|
|
|
|
|
|
|
|
|
@ -937,116 +1114,6 @@ impl Storage { |
|
|
|
Ok(()) |
|
|
|
Ok(()) |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
pub fn update_object_model(&mut self, model: ObjectModel) -> Result<(), StorageError> { |
|
|
|
|
|
|
|
if model.name.is_empty() { |
|
|
|
|
|
|
|
return Err(StorageError::ConstraintViolation( |
|
|
|
|
|
|
|
format!("Model name must not be empty.").into(), |
|
|
|
|
|
|
|
)); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
if !self.obj_models.contains_key(&model.id) { |
|
|
|
|
|
|
|
return Err(StorageError::NotExist( |
|
|
|
|
|
|
|
format!("Object model ID {} does not exist.", model.id).into(), |
|
|
|
|
|
|
|
)); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
if let Some(conflict) = self |
|
|
|
|
|
|
|
.obj_models |
|
|
|
|
|
|
|
.values() |
|
|
|
|
|
|
|
.find(|m| m.id != model.id && m.name == model.name) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
return Err(StorageError::ConstraintViolation( |
|
|
|
|
|
|
|
format!("Object {} already has the name {}", conflict.id, model.name).into(), |
|
|
|
|
|
|
|
)); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
self.obj_models.insert(model.id, model); |
|
|
|
|
|
|
|
Ok(()) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
pub fn update_relation_model(&mut self, mut rel: RelationModel) -> Result<(), StorageError> { |
|
|
|
|
|
|
|
if rel.name.is_empty() || rel.reciprocal_name.is_empty() { |
|
|
|
|
|
|
|
return Err(StorageError::ConstraintViolation( |
|
|
|
|
|
|
|
format!("Relation names must not be empty.").into(), |
|
|
|
|
|
|
|
)); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
// Object and Related can't be changed, so we re-fill them from the existing model
|
|
|
|
|
|
|
|
if let Some(existing) = self.rel_models.get(&rel.id) { |
|
|
|
|
|
|
|
rel.object = existing.object; |
|
|
|
|
|
|
|
rel.related = existing.related; |
|
|
|
|
|
|
|
} else { |
|
|
|
|
|
|
|
return Err(StorageError::NotExist( |
|
|
|
|
|
|
|
format!("Relation model ID {} does not exist.", rel.id).into(), |
|
|
|
|
|
|
|
)); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
// Difficult checks ...
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
// yes this is stupid and inefficient and slow and
|
|
|
|
|
|
|
|
if let Some((_, colliding)) = self.rel_models.iter().find(|(_, other)| { |
|
|
|
|
|
|
|
(other.name == rel.name && other.object == rel.object && rel.id != other.id) // Exact match
|
|
|
|
|
|
|
|
|| (other.name == rel.reciprocal_name && other.object == rel.related && rel.id != other.id) // Our reciprocal name collides with related's own relation name
|
|
|
|
|
|
|
|
|| (other.reciprocal_name == rel.name && other.related == rel.object && rel.id != other.id) // Our name name collides with a reciprocal name on the other relation
|
|
|
|
|
|
|
|
|| (other.reciprocal_name == rel.reciprocal_name && other.related == rel.related && rel.id != other.id) // Reciprocal names collide for the same destination
|
|
|
|
|
|
|
|
}) { |
|
|
|
|
|
|
|
return Err(StorageError::ConstraintViolation( |
|
|
|
|
|
|
|
format!("name collision (\"{}\" / \"{}\") with existing relation (\"{}\" / \"{}\")", |
|
|
|
|
|
|
|
rel.name, rel.reciprocal_name, |
|
|
|
|
|
|
|
colliding.name, colliding.reciprocal_name |
|
|
|
|
|
|
|
).into())); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
self.rel_models.insert(rel.id, rel); |
|
|
|
|
|
|
|
Ok(()) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
pub fn update_property_model(&mut self, mut prop: PropertyModel) -> Result<(), StorageError> { |
|
|
|
|
|
|
|
if prop.name.is_empty() { |
|
|
|
|
|
|
|
return Err(StorageError::ConstraintViolation( |
|
|
|
|
|
|
|
format!("Property name must not be empty.").into(), |
|
|
|
|
|
|
|
)); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
// Object can't be changed, so we re-fill them from the existing model
|
|
|
|
|
|
|
|
if let Some(existing) = self.prop_models.get(&prop.id) { |
|
|
|
|
|
|
|
prop.object = existing.object; |
|
|
|
|
|
|
|
} else { |
|
|
|
|
|
|
|
return Err(StorageError::NotExist( |
|
|
|
|
|
|
|
format!("Property model ID {} does not exist.", prop.id).into(), |
|
|
|
|
|
|
|
)); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
if self |
|
|
|
|
|
|
|
.prop_models |
|
|
|
|
|
|
|
.iter() |
|
|
|
|
|
|
|
.find(|(_, t)| t.object == prop.object && t.name == prop.name && t.id != prop.id) |
|
|
|
|
|
|
|
.is_some() |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
return Err(StorageError::ConstraintViolation( |
|
|
|
|
|
|
|
format!( |
|
|
|
|
|
|
|
"property with the name \"{}\" already exists on {}", |
|
|
|
|
|
|
|
prop.name, |
|
|
|
|
|
|
|
self.describe_model(prop.object) |
|
|
|
|
|
|
|
) |
|
|
|
|
|
|
|
.into(), |
|
|
|
|
|
|
|
)); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
// Ensure the default type is compatible
|
|
|
|
|
|
|
|
prop.default = match prop.default.clone().cast_to(prop.data_type) { |
|
|
|
|
|
|
|
Ok(v) => v, |
|
|
|
|
|
|
|
Err(_) => { |
|
|
|
|
|
|
|
return Err(StorageError::NotExist( |
|
|
|
|
|
|
|
format!("default value {:?} has invalid type", prop.default).into(), |
|
|
|
|
|
|
|
)) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
}; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
self.prop_models.insert(prop.id, prop); |
|
|
|
|
|
|
|
Ok(()) |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/// Delete an object and associated data
|
|
|
|
/// Delete an object and associated data
|
|
|
|
pub fn delete_object(&mut self, id: ID) -> Result<data::Object, StorageError> { |
|
|
|
pub fn delete_object(&mut self, id: ID) -> Result<data::Object, StorageError> { |
|
|
|
return if let Some(t) = self.objects.remove(&id) { |
|
|
|
return if let Some(t) = self.objects.remove(&id) { |
|
|
@ -1069,4 +1136,6 @@ impl Storage { |
|
|
|
Err(StorageError::NotExist(format!("object {}", id).into())) |
|
|
|
Err(StorageError::NotExist(format!("object {}", id).into())) |
|
|
|
}; |
|
|
|
}; |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//endregion Data editing
|
|
|
|
} |
|
|
|
} |
|
|
|