use crate::model::BlankNode; use crate::model::Triple; use crate::sparql::algebra::*; use crate::sparql::plan::*; use crate::store::encoded::EncodedQuadsStore; use crate::store::numeric_encoder::*; use crate::Result; use chrono::prelude::*; use language_tags::LanguageTag; use num_traits::identities::Zero; use num_traits::FromPrimitive; use num_traits::One; use num_traits::ToPrimitive; use ordered_float::OrderedFloat; use regex::RegexBuilder; use rust_decimal::Decimal; use std::cmp::Ordering; use std::collections::BTreeMap; use std::collections::HashSet; use std::iter::once; use std::iter::Iterator; use std::str::FromStr; use std::sync::Arc; use std::sync::Mutex; use uuid::Uuid; const REGEX_SIZE_LIMIT: usize = 1_000_000; type EncodedTuplesIterator<'a> = Box> + 'a>; pub struct SimpleEvaluator { store: Arc, bnodes_map: Arc>>, } impl Clone for SimpleEvaluator { fn clone(&self) -> Self { Self { store: self.store.clone(), bnodes_map: self.bnodes_map.clone(), } } } impl SimpleEvaluator { pub fn new(store: Arc) -> Self { Self { store, bnodes_map: Arc::new(Mutex::new(BTreeMap::default())), } } pub fn evaluate_select_plan<'a>( &'a self, plan: &'a PlanNode, variables: &[Variable], ) -> Result> { let iter = self.eval_plan(plan, vec![None; variables.len()]); Ok(QueryResult::Bindings( self.decode_bindings(iter, variables.to_vec()), )) } pub fn evaluate_ask_plan<'a>(&'a self, plan: &'a PlanNode) -> Result> { match self.eval_plan(plan, vec![]).next() { Some(Ok(_)) => Ok(QueryResult::Boolean(true)), Some(Err(error)) => Err(error), None => Ok(QueryResult::Boolean(false)), } } pub fn evaluate_construct_plan<'a>( &'a self, plan: &'a PlanNode, construct: &'a [TripleTemplate], ) -> Result> { Ok(QueryResult::Graph(Box::new(ConstructIterator { store: self.store.clone(), iter: self.eval_plan(plan, vec![]), template: construct, buffered_results: Vec::default(), bnodes: Vec::default(), }))) } pub fn evaluate_describe_plan<'a>(&'a self, plan: &'a PlanNode) -> Result> { Ok(QueryResult::Graph(Box::new(DescribeIterator { store: self.store.clone(), iter: self.eval_plan(plan, vec![]), quads_iters: Vec::default(), }))) } fn eval_plan<'a>(&self, node: &'a PlanNode, from: EncodedTuple) -> EncodedTuplesIterator<'a> { match node { PlanNode::Init => Box::new(once(Ok(from))), PlanNode::StaticBindings { tuples } => Box::new(tuples.iter().cloned().map(Ok)), PlanNode::QuadPatternJoin { child, subject, predicate, object, graph_name, } => { let eval = self.clone(); Box::new( self.eval_plan(&*child, from) .flat_map(move |tuple| match tuple { Ok(tuple) => { let mut iter = eval.store.quads_for_pattern( get_pattern_value(&subject, &tuple), get_pattern_value(&predicate, &tuple), get_pattern_value(&object, &tuple), get_pattern_value(&graph_name, &tuple), ); if subject.is_var() && subject == predicate { iter = Box::new(iter.filter(|quad| match quad { Err(_) => true, Ok(quad) => quad.subject == quad.predicate, })) } if subject.is_var() && subject == object { iter = Box::new(iter.filter(|quad| match quad { Err(_) => true, Ok(quad) => quad.subject == quad.object, })) } if predicate.is_var() && predicate == object { iter = Box::new(iter.filter(|quad| match quad { Err(_) => true, Ok(quad) => quad.predicate == quad.object, })) } if graph_name.is_var() { iter = Box::new(iter.filter(|quad| match quad { Err(_) => true, Ok(quad) => quad.graph_name != ENCODED_DEFAULT_GRAPH, })); if graph_name == subject { iter = Box::new(iter.filter(|quad| match quad { Err(_) => true, Ok(quad) => quad.graph_name == quad.subject, })) } if graph_name == predicate { iter = Box::new(iter.filter(|quad| match quad { Err(_) => true, Ok(quad) => quad.graph_name == quad.predicate, })) } if graph_name == object { iter = Box::new(iter.filter(|quad| match quad { Err(_) => true, Ok(quad) => quad.graph_name == quad.object, })) } } let iter: EncodedTuplesIterator<'_> = Box::new(iter.map(move |quad| { let quad = quad?; let mut new_tuple = tuple.clone(); put_pattern_value(&subject, quad.subject, &mut new_tuple); put_pattern_value( &predicate, quad.predicate, &mut new_tuple, ); put_pattern_value(&object, quad.object, &mut new_tuple); put_pattern_value( &graph_name, quad.graph_name, &mut new_tuple, ); Ok(new_tuple) })); iter } Err(error) => Box::new(once(Err(error))), }), ) } PlanNode::Join { left, right } => { //TODO: very dumb implementation let left_iter = self.eval_plan(&*left, from.clone()); let mut left_values = Vec::with_capacity(left_iter.size_hint().0); let mut errors = Vec::default(); for result in left_iter { match result { Ok(result) => { left_values.push(result); } Err(error) => errors.push(Err(error)), } } Box::new(JoinIterator { left: left_values, right_iter: self.eval_plan(&*right, from), buffered_results: errors, }) } PlanNode::LeftJoin { left, right, possible_problem_vars, } => { let problem_vars = bind_variables_in_set(&from, &possible_problem_vars); let mut filtered_from = from.clone(); unbind_variables(&mut filtered_from, &problem_vars); let iter = LeftJoinIterator { eval: self.clone(), right_plan: &*right, left_iter: self.eval_plan(&*left, filtered_from), current_right_iter: None, }; if problem_vars.is_empty() { Box::new(iter) } else { Box::new(BadLeftJoinIterator { input: from, iter, problem_vars, }) } } PlanNode::Filter { child, expression } => { let eval = self.clone(); Box::new(self.eval_plan(&*child, from).filter(move |tuple| { match tuple { Ok(tuple) => eval .eval_expression(&expression, tuple) .and_then(|term| eval.to_bool(term)) .unwrap_or(false), Err(_) => true, } })) } PlanNode::Union { entry, children } => Box::new(UnionIterator { eval: self.clone(), children_plan: &children, input_iter: self.eval_plan(&*entry, from), current_iters: Vec::default(), }), PlanNode::Extend { child, position, expression, } => { let eval = self.clone(); Box::new( self.eval_plan(&*child, from) .filter_map(move |tuple| match tuple { Ok(mut tuple) => { put_value( *position, eval.eval_expression(&expression, &tuple)?, &mut tuple, ); Some(Ok(tuple)) } Err(error) => Some(Err(error)), }), ) } PlanNode::Sort { child, by } => { let iter = self.eval_plan(&*child, from); let mut values = Vec::with_capacity(iter.size_hint().0); let mut errors = Vec::default(); for result in iter { match result { Ok(result) => { values.push(result); } Err(error) => errors.push(Err(error)), } } values.sort_unstable_by(|a, b| { for comp in by { match comp { Comparator::Asc(expression) => { match self.cmp_according_to_expression(a, b, &expression) { Ordering::Greater => return Ordering::Greater, Ordering::Less => return Ordering::Less, Ordering::Equal => (), } } Comparator::Desc(expression) => { match self.cmp_according_to_expression(a, b, &expression) { Ordering::Greater => return Ordering::Less, Ordering::Less => return Ordering::Greater, Ordering::Equal => (), } } } } Ordering::Equal }); Box::new(errors.into_iter().chain(values.into_iter().map(Ok))) } PlanNode::HashDeduplicate { child } => { let iter = self.eval_plan(&*child, from); let already_seen = HashSet::with_capacity(iter.size_hint().0); Box::new(HashDeduplicateIterator { iter, already_seen }) } PlanNode::Skip { child, count } => Box::new(self.eval_plan(&*child, from).skip(*count)), PlanNode::Limit { child, count } => { Box::new(self.eval_plan(&*child, from).take(*count)) } PlanNode::Project { child, mapping } => { Box::new(self.eval_plan(&*child, from).map(move |tuple| { let tuple = tuple?; let mut new_tuple = Vec::with_capacity(mapping.len()); for key in mapping { new_tuple.push(tuple[*key]); } Ok(new_tuple) })) } } } fn eval_expression( &self, expression: &PlanExpression, tuple: &[Option], ) -> Option { match expression { PlanExpression::Constant(t) => Some(*t), PlanExpression::Variable(v) => get_tuple_value(*v, tuple), PlanExpression::Or(a, b) => match self.to_bool(self.eval_expression(a, tuple)?) { Some(true) => Some(true.into()), Some(false) => self.eval_expression(b, tuple), None => match self.to_bool(self.eval_expression(b, tuple)?) { Some(true) => Some(true.into()), _ => None, }, }, PlanExpression::And(a, b) => match self.to_bool(self.eval_expression(a, tuple)?) { Some(true) => self.eval_expression(b, tuple), Some(false) => Some(false.into()), None => match self.to_bool(self.eval_expression(b, tuple)?) { Some(false) => Some(false.into()), _ => None, }, }, PlanExpression::Equal(a, b) => { let a = self.eval_expression(a, tuple)?; let b = self.eval_expression(b, tuple)?; Some(self.equals(a, b).into()) } PlanExpression::NotEqual(a, b) => { let a = self.eval_expression(a, tuple)?; let b = self.eval_expression(b, tuple)?; Some(self.not_equals(a, b).into()) } PlanExpression::Greater(a, b) => Some( (self.partial_cmp_literals( self.eval_expression(a, tuple)?, self.eval_expression(b, tuple)?, )? == Ordering::Greater) .into(), ), PlanExpression::GreaterOrEq(a, b) => Some( match self.partial_cmp_literals( self.eval_expression(a, tuple)?, self.eval_expression(b, tuple)?, )? { Ordering::Greater | Ordering::Equal => true, Ordering::Less => false, } .into(), ), PlanExpression::Lower(a, b) => Some( (self.partial_cmp_literals( self.eval_expression(a, tuple)?, self.eval_expression(b, tuple)?, )? == Ordering::Less) .into(), ), PlanExpression::LowerOrEq(a, b) => Some( match self.partial_cmp_literals( self.eval_expression(a, tuple)?, self.eval_expression(b, tuple)?, )? { Ordering::Less | Ordering::Equal => true, Ordering::Greater => false, } .into(), ), PlanExpression::In(e, l) => { let needed = self.eval_expression(e, tuple)?; let mut error = false; for possible in l { if let Some(possible) = self.eval_expression(possible, tuple) { if self.equals(needed, possible) { return Some(true.into()); } } else { error = true; } } if error { None } else { Some(false.into()) } } PlanExpression::Add(a, b) => Some(match self.parse_numeric_operands(a, b, tuple)? { NumericBinaryOperands::Float(v1, v2) => (v1 + v2).into(), NumericBinaryOperands::Double(v1, v2) => (v1 + v2).into(), NumericBinaryOperands::Integer(v1, v2) => (v1 + v2).into(), NumericBinaryOperands::Decimal(v1, v2) => (v1 + v2).into(), }), PlanExpression::Sub(a, b) => Some(match self.parse_numeric_operands(a, b, tuple)? { NumericBinaryOperands::Float(v1, v2) => (v1 - v2).into(), NumericBinaryOperands::Double(v1, v2) => (v1 - v2).into(), NumericBinaryOperands::Integer(v1, v2) => (v1 - v2).into(), NumericBinaryOperands::Decimal(v1, v2) => (v1 - v2).into(), }), PlanExpression::Mul(a, b) => Some(match self.parse_numeric_operands(a, b, tuple)? { NumericBinaryOperands::Float(v1, v2) => (v1 * v2).into(), NumericBinaryOperands::Double(v1, v2) => (v1 * v2).into(), NumericBinaryOperands::Integer(v1, v2) => (v1 * v2).into(), NumericBinaryOperands::Decimal(v1, v2) => (v1 * v2).into(), }), PlanExpression::Div(a, b) => Some(match self.parse_numeric_operands(a, b, tuple)? { NumericBinaryOperands::Float(v1, v2) => (v1 / v2).into(), NumericBinaryOperands::Double(v1, v2) => (v1 / v2).into(), NumericBinaryOperands::Integer(v1, v2) => (v1 / v2).into(), NumericBinaryOperands::Decimal(v1, v2) => (v1 / v2).into(), }), PlanExpression::UnaryPlus(e) => match self.eval_expression(e, tuple)? { EncodedTerm::FloatLiteral(value) => Some((*value).into()), EncodedTerm::DoubleLiteral(value) => Some((*value).into()), EncodedTerm::IntegerLiteral(value) => Some((value).into()), EncodedTerm::DecimalLiteral(value) => Some((value).into()), _ => None, }, PlanExpression::UnaryMinus(e) => match self.eval_expression(e, tuple)? { EncodedTerm::FloatLiteral(value) => Some((-*value).into()), EncodedTerm::DoubleLiteral(value) => Some((-*value).into()), EncodedTerm::IntegerLiteral(value) => Some((-value).into()), EncodedTerm::DecimalLiteral(value) => Some((-value).into()), _ => None, }, PlanExpression::UnaryNot(e) => self .to_bool(self.eval_expression(e, tuple)?) .map(|v| (!v).into()), PlanExpression::Str(e) => Some(EncodedTerm::SimpleLiteral { value_id: self.to_string_id(self.eval_expression(e, tuple)?)?, }), PlanExpression::Lang(e) => match self.eval_expression(e, tuple)? { EncodedTerm::LangStringLiteral { language_id, .. } => { Some(EncodedTerm::SimpleLiteral { value_id: language_id, }) } e if e.is_literal() => Some(ENCODED_EMPTY_SIMPLE_LITERAL), _ => None, }, PlanExpression::Datatype(e) => self.eval_expression(e, tuple)?.datatype(), PlanExpression::Bound(v) => Some(has_tuple_value(*v, tuple).into()), PlanExpression::IRI(e) => match self.eval_expression(e, tuple)? { EncodedTerm::NamedNode { iri_id } => Some(EncodedTerm::NamedNode { iri_id }), EncodedTerm::SimpleLiteral { value_id } | EncodedTerm::StringLiteral { value_id } => { Some(EncodedTerm::NamedNode { iri_id: value_id }) } _ => None, }, PlanExpression::BNode(id) => match id { Some(id) => match self.eval_expression(id, tuple)? { EncodedTerm::SimpleLiteral { value_id } | EncodedTerm::StringLiteral { value_id } => Some( self.bnodes_map .lock() .ok()? .entry(value_id) .or_insert_with(BlankNode::default) .clone() .into(), ), _ => None, }, None => Some(BlankNode::default().into()), }, PlanExpression::UUID() => Some(EncodedTerm::NamedNode { iri_id: self .store .insert_str(&Uuid::new_v4().to_urn().to_string()) .ok()?, }), PlanExpression::StrUUID() => Some(EncodedTerm::SimpleLiteral { value_id: self .store .insert_str(&Uuid::new_v4().to_simple().to_string()) .ok()?, }), PlanExpression::Coalesce(l) => { for e in l { if let Some(result) = self.eval_expression(e, tuple) { return Some(result); } } None } PlanExpression::If(a, b, c) => { if self.to_bool(self.eval_expression(a, tuple)?)? { self.eval_expression(b, tuple) } else { self.eval_expression(c, tuple) } } PlanExpression::StrLang(lexical_form, lang_tag) => { Some(EncodedTerm::LangStringLiteral { value_id: self .to_simple_string_id(self.eval_expression(lexical_form, tuple)?)?, language_id: self .to_simple_string_id(self.eval_expression(lang_tag, tuple)?)?, }) } PlanExpression::SameTerm(a, b) => { Some((self.eval_expression(a, tuple)? == self.eval_expression(b, tuple)?).into()) } PlanExpression::IsIRI(e) => { Some(self.eval_expression(e, tuple)?.is_named_node().into()) } PlanExpression::IsBlank(e) => { Some(self.eval_expression(e, tuple)?.is_blank_node().into()) } PlanExpression::IsLiteral(e) => { Some(self.eval_expression(e, tuple)?.is_literal().into()) } PlanExpression::IsNumeric(e) => Some( match self.eval_expression(e, tuple)? { EncodedTerm::FloatLiteral(_) | EncodedTerm::DoubleLiteral(_) | EncodedTerm::IntegerLiteral(_) | EncodedTerm::DecimalLiteral(_) => true, _ => false, } .into(), ), PlanExpression::LangMatches(language_tag, language_range) => { let language_tag = self.to_simple_string(self.eval_expression(language_tag, tuple)?)?; let language_range = self.to_simple_string(self.eval_expression(language_range, tuple)?)?; Some( if language_range == "*" { !language_tag.is_empty() } else { LanguageTag::from_str(&language_range) .ok()? .matches(&LanguageTag::from_str(&language_tag).ok()?) } .into(), ) } PlanExpression::Regex(text, pattern, flags) => { // TODO Avoid to compile the regex each time let pattern = self.to_simple_string(self.eval_expression(pattern, tuple)?)?; let mut regex_builder = RegexBuilder::new(&pattern); regex_builder.size_limit(REGEX_SIZE_LIMIT); if let Some(flags) = flags { let flags = self.to_simple_string(self.eval_expression(flags, tuple)?)?; for flag in flags.chars() { match flag { 's' => { regex_builder.dot_matches_new_line(true); } 'm' => { regex_builder.multi_line(true); } 'i' => { regex_builder.case_insensitive(true); } 'x' => { regex_builder.ignore_whitespace(true); } 'q' => (), //TODO: implement _ => (), } } } let regex = regex_builder.build().ok()?; let text = self.to_string(self.eval_expression(text, tuple)?)?; Some(regex.is_match(&text).into()) } PlanExpression::BooleanCast(e) => match self.eval_expression(e, tuple)? { EncodedTerm::BooleanLiteral(value) => Some(value.into()), EncodedTerm::SimpleLiteral { value_id } | EncodedTerm::StringLiteral { value_id } => { match &*self.store.get_str(value_id).ok()? { "true" | "1" => Some(true.into()), "false" | "0" => Some(false.into()), _ => None, } } _ => None, }, PlanExpression::DoubleCast(e) => match self.eval_expression(e, tuple)? { EncodedTerm::FloatLiteral(value) => Some(value.to_f64()?.into()), EncodedTerm::DoubleLiteral(value) => Some(value.to_f64()?.into()), EncodedTerm::IntegerLiteral(value) => Some(value.to_f64()?.into()), EncodedTerm::DecimalLiteral(value) => Some(value.to_f64()?.into()), EncodedTerm::BooleanLiteral(value) => { Some(if value { 1. as f64 } else { 0. }.into()) } EncodedTerm::SimpleLiteral { value_id } | EncodedTerm::StringLiteral { value_id } => Some(EncodedTerm::DoubleLiteral( OrderedFloat(self.store.get_str(value_id).ok()?.parse().ok()?), )), _ => None, }, PlanExpression::FloatCast(e) => match self.eval_expression(e, tuple)? { EncodedTerm::FloatLiteral(value) => Some(value.to_f32()?.into()), EncodedTerm::DoubleLiteral(value) => Some(value.to_f32()?.into()), EncodedTerm::IntegerLiteral(value) => Some(value.to_f32()?.into()), EncodedTerm::DecimalLiteral(value) => Some(value.to_f32()?.into()), EncodedTerm::BooleanLiteral(value) => { Some(if value { 1. as f32 } else { 0. }.into()) } EncodedTerm::SimpleLiteral { value_id } | EncodedTerm::StringLiteral { value_id } => Some(EncodedTerm::FloatLiteral( OrderedFloat(self.store.get_str(value_id).ok()?.parse().ok()?), )), _ => None, }, PlanExpression::IntegerCast(e) => match self.eval_expression(e, tuple)? { EncodedTerm::FloatLiteral(value) => Some(value.to_i128()?.into()), EncodedTerm::DoubleLiteral(value) => Some(value.to_i128()?.into()), EncodedTerm::IntegerLiteral(value) => Some(value.to_i128()?.into()), EncodedTerm::DecimalLiteral(value) => Some(value.to_i128()?.into()), EncodedTerm::BooleanLiteral(value) => Some(if value { 1 } else { 0 }.into()), EncodedTerm::SimpleLiteral { value_id } | EncodedTerm::StringLiteral { value_id } => Some(EncodedTerm::IntegerLiteral( self.store.get_str(value_id).ok()?.parse().ok()?, )), _ => None, }, PlanExpression::DecimalCast(e) => match self.eval_expression(e, tuple)? { EncodedTerm::FloatLiteral(value) => Some(Decimal::from_f32(*value)?.into()), EncodedTerm::DoubleLiteral(value) => Some(Decimal::from_f64(*value)?.into()), EncodedTerm::IntegerLiteral(value) => Some(Decimal::from_i128(value)?.into()), EncodedTerm::DecimalLiteral(value) => Some(value.into()), EncodedTerm::BooleanLiteral(value) => Some( if value { Decimal::one() } else { Decimal::zero() } .into(), ), EncodedTerm::SimpleLiteral { value_id } | EncodedTerm::StringLiteral { value_id } => Some(EncodedTerm::DecimalLiteral( self.store.get_str(value_id).ok()?.parse().ok()?, )), _ => None, }, PlanExpression::DateCast(e) => match self.eval_expression(e, tuple)? { EncodedTerm::NaiveDate(value) => Some(value.into()), EncodedTerm::DateTime(value) => Some(value.date().naive_utc().into()), //TODO: use date with timezone EncodedTerm::NaiveDateTime(value) => Some(value.date().into()), EncodedTerm::SimpleLiteral { value_id } | EncodedTerm::StringLiteral { value_id } => { let value = self.store.get_str(value_id).ok()?; Some(NaiveDate::parse_from_str(&value, "%Y-%m-%d").ok()?.into()) } _ => None, }, PlanExpression::TimeCast(e) => match self.eval_expression(e, tuple)? { EncodedTerm::NaiveTime(value) => Some(value.into()), EncodedTerm::DateTime(value) => Some(value.time().into()), EncodedTerm::NaiveDateTime(value) => Some(value.time().into()), EncodedTerm::SimpleLiteral { value_id } | EncodedTerm::StringLiteral { value_id } => { let value = self.store.get_str(value_id).ok()?; Some(NaiveTime::parse_from_str(&value, "%H:%M:%S").ok()?.into()) } _ => None, }, PlanExpression::DateTimeCast(e) => match self.eval_expression(e, tuple)? { EncodedTerm::DateTime(value) => Some(value.into()), EncodedTerm::NaiveDateTime(value) => Some(value.into()), EncodedTerm::SimpleLiteral { value_id } | EncodedTerm::StringLiteral { value_id } => { let value = self.store.get_str(value_id).ok()?; Some(match DateTime::parse_from_rfc3339(&value) { Ok(value) => value.into(), Err(_) => NaiveDateTime::parse_from_str(&value, "%Y-%m-%dT%H:%M:%S") .ok()? .into(), }) } _ => None, }, PlanExpression::StringCast(e) => Some(EncodedTerm::StringLiteral { value_id: self.to_string_id(self.eval_expression(e, tuple)?)?, }), } } fn to_bool(&self, term: EncodedTerm) -> Option { match term { EncodedTerm::BooleanLiteral(value) => Some(value), EncodedTerm::SimpleLiteral { .. } => Some(term != ENCODED_EMPTY_SIMPLE_LITERAL), EncodedTerm::StringLiteral { .. } => Some(term != ENCODED_EMPTY_STRING_LITERAL), EncodedTerm::FloatLiteral(value) => Some(!value.is_zero()), EncodedTerm::DoubleLiteral(value) => Some(!value.is_zero()), EncodedTerm::IntegerLiteral(value) => Some(!value.is_zero()), EncodedTerm::DecimalLiteral(value) => Some(!value.is_zero()), _ => None, } } fn to_string_id(&self, term: EncodedTerm) -> Option { match term { EncodedTerm::DefaultGraph {} => None, EncodedTerm::NamedNode { iri_id } => Some(iri_id), EncodedTerm::BlankNode(_) => None, EncodedTerm::SimpleLiteral { value_id } | EncodedTerm::StringLiteral { value_id } | EncodedTerm::LangStringLiteral { value_id, .. } | EncodedTerm::TypedLiteral { value_id, .. } => Some(value_id), EncodedTerm::BooleanLiteral(value) => self .store .insert_str(if value { "true" } else { "false" }) .ok(), EncodedTerm::FloatLiteral(value) => self.store.insert_str(&value.to_string()).ok(), EncodedTerm::DoubleLiteral(value) => self.store.insert_str(&value.to_string()).ok(), EncodedTerm::IntegerLiteral(value) => self.store.insert_str(&value.to_string()).ok(), EncodedTerm::DecimalLiteral(value) => self.store.insert_str(&value.to_string()).ok(), EncodedTerm::NaiveDate(value) => self.store.insert_str(&value.to_string()).ok(), EncodedTerm::NaiveTime(value) => self.store.insert_str(&value.to_string()).ok(), EncodedTerm::DateTime(value) => self.store.insert_str(&value.to_string()).ok(), EncodedTerm::NaiveDateTime(value) => self.store.insert_str(&value.to_string()).ok(), } } fn to_simple_string(&self, term: EncodedTerm) -> Option { if let EncodedTerm::SimpleLiteral { value_id } = term { self.store.get_str(value_id).ok() } else { None } } fn to_simple_string_id(&self, term: EncodedTerm) -> Option { if let EncodedTerm::SimpleLiteral { value_id } = term { Some(value_id) } else { None } } fn to_string(&self, term: EncodedTerm) -> Option { match term { EncodedTerm::SimpleLiteral { value_id } | EncodedTerm::StringLiteral { value_id } | EncodedTerm::LangStringLiteral { value_id, .. } => self.store.get_str(value_id).ok(), _ => None, } } fn parse_numeric_operands( &self, e1: &PlanExpression, e2: &PlanExpression, tuple: &[Option], ) -> Option { match ( self.eval_expression(&e1, tuple)?, self.eval_expression(&e2, tuple)?, ) { (EncodedTerm::FloatLiteral(v1), EncodedTerm::FloatLiteral(v2)) => { Some(NumericBinaryOperands::Float(*v1, v2.to_f32()?)) } (EncodedTerm::FloatLiteral(v1), EncodedTerm::DoubleLiteral(v2)) => { Some(NumericBinaryOperands::Double(v1.to_f64()?, *v2)) } (EncodedTerm::FloatLiteral(v1), EncodedTerm::IntegerLiteral(v2)) => { Some(NumericBinaryOperands::Float(*v1, v2.to_f32()?)) } (EncodedTerm::FloatLiteral(v1), EncodedTerm::DecimalLiteral(v2)) => { Some(NumericBinaryOperands::Float(*v1, v2.to_f32()?)) } (EncodedTerm::DoubleLiteral(v1), EncodedTerm::FloatLiteral(v2)) => { Some(NumericBinaryOperands::Double(*v1, v2.to_f64()?)) } (EncodedTerm::DoubleLiteral(v1), EncodedTerm::DoubleLiteral(v2)) => { Some(NumericBinaryOperands::Double(*v1, *v2)) } (EncodedTerm::DoubleLiteral(v1), EncodedTerm::IntegerLiteral(v2)) => { Some(NumericBinaryOperands::Double(*v1, v2.to_f64()?)) } (EncodedTerm::DoubleLiteral(v1), EncodedTerm::DecimalLiteral(v2)) => { Some(NumericBinaryOperands::Double(*v1, v2.to_f64()?)) } (EncodedTerm::IntegerLiteral(v1), EncodedTerm::FloatLiteral(v2)) => { Some(NumericBinaryOperands::Float(v1.to_f32()?, *v2)) } (EncodedTerm::IntegerLiteral(v1), EncodedTerm::DoubleLiteral(v2)) => { Some(NumericBinaryOperands::Double(v1.to_f64()?, *v2)) } (EncodedTerm::IntegerLiteral(v1), EncodedTerm::IntegerLiteral(v2)) => { Some(NumericBinaryOperands::Integer(v1, v2)) } (EncodedTerm::IntegerLiteral(v1), EncodedTerm::DecimalLiteral(v2)) => { Some(NumericBinaryOperands::Decimal(Decimal::from_i128(v1)?, v2)) } (EncodedTerm::DecimalLiteral(v1), EncodedTerm::FloatLiteral(v2)) => { Some(NumericBinaryOperands::Float(v1.to_f32()?, *v2)) } (EncodedTerm::DecimalLiteral(v1), EncodedTerm::DoubleLiteral(v2)) => { Some(NumericBinaryOperands::Double(v1.to_f64()?, *v2)) } (EncodedTerm::DecimalLiteral(v1), EncodedTerm::IntegerLiteral(v2)) => { Some(NumericBinaryOperands::Decimal(v1, Decimal::from_i128(v2)?)) } (EncodedTerm::DecimalLiteral(v1), EncodedTerm::DecimalLiteral(v2)) => { Some(NumericBinaryOperands::Decimal(v1, v2)) } _ => None, } } fn decode_bindings<'a>( &self, iter: EncodedTuplesIterator<'a>, variables: Vec, ) -> BindingsIterator<'a> { let store = self.store.clone(); BindingsIterator::new( variables, Box::new(iter.map(move |values| { let encoder = store.encoder(); values? .into_iter() .map(|value| { Ok(match value { Some(term) => Some(encoder.decode_term(term)?), None => None, }) }) .collect() })), ) } fn equals(&self, a: EncodedTerm, b: EncodedTerm) -> bool { (a == b || self.partial_cmp_literals(a, b) == Some(Ordering::Equal)) } fn not_equals(&self, a: EncodedTerm, b: EncodedTerm) -> bool { (a != b && self.partial_cmp_literals(a, b) != Some(Ordering::Equal)) } fn cmp_according_to_expression( &self, tuple_a: &[Option], tuple_b: &[Option], expression: &PlanExpression, ) -> Ordering { match ( self.eval_expression(expression, tuple_a), self.eval_expression(expression, tuple_b), ) { (Some(a), Some(b)) => match a { EncodedTerm::BlankNode(a) => { if let EncodedTerm::BlankNode(b) = b { a.cmp(&b) } else { Ordering::Less } } EncodedTerm::NamedNode { iri_id: a } => match b { EncodedTerm::NamedNode { iri_id: b } => { self.compare_str_ids(a, b).unwrap_or(Ordering::Equal) } EncodedTerm::BlankNode(_) => Ordering::Greater, _ => Ordering::Less, }, a => match b { EncodedTerm::NamedNode { .. } | EncodedTerm::BlankNode(_) => Ordering::Greater, b => self.partial_cmp_literals(a, b).unwrap_or(Ordering::Equal), }, }, (Some(_), None) => Ordering::Greater, (None, Some(_)) => Ordering::Less, (None, None) => Ordering::Equal, } } fn partial_cmp_literals(&self, a: EncodedTerm, b: EncodedTerm) -> Option { match a { EncodedTerm::SimpleLiteral { value_id: a } | EncodedTerm::StringLiteral { value_id: a } => match b { EncodedTerm::SimpleLiteral { value_id: b } | EncodedTerm::StringLiteral { value_id: b } => self.compare_str_ids(a, b), _ => None, }, EncodedTerm::FloatLiteral(a) => match b { EncodedTerm::FloatLiteral(b) => (*a).partial_cmp(&*b), EncodedTerm::DoubleLiteral(b) => a.to_f64()?.partial_cmp(&*b), EncodedTerm::IntegerLiteral(b) => (*a).partial_cmp(&b.to_f32()?), EncodedTerm::DecimalLiteral(b) => (*a).partial_cmp(&b.to_f32()?), _ => None, }, EncodedTerm::DoubleLiteral(a) => match b { EncodedTerm::FloatLiteral(b) => (*a).partial_cmp(&b.to_f64()?), EncodedTerm::DoubleLiteral(b) => (*a).partial_cmp(&*b), EncodedTerm::IntegerLiteral(b) => (*a).partial_cmp(&b.to_f64()?), EncodedTerm::DecimalLiteral(b) => (*a).partial_cmp(&b.to_f64()?), _ => None, }, EncodedTerm::IntegerLiteral(a) => match b { EncodedTerm::FloatLiteral(b) => a.to_f32()?.partial_cmp(&*b), EncodedTerm::DoubleLiteral(b) => a.to_f64()?.partial_cmp(&*b), EncodedTerm::IntegerLiteral(b) => a.partial_cmp(&b), EncodedTerm::DecimalLiteral(b) => Decimal::from_i128(a)?.partial_cmp(&b), _ => None, }, EncodedTerm::DecimalLiteral(a) => match b { EncodedTerm::FloatLiteral(b) => a.to_f32()?.partial_cmp(&*b), EncodedTerm::DoubleLiteral(b) => a.to_f64()?.partial_cmp(&*b), EncodedTerm::IntegerLiteral(b) => a.partial_cmp(&Decimal::from_i128(b)?), EncodedTerm::DecimalLiteral(b) => a.partial_cmp(&b), _ => None, }, EncodedTerm::NaiveDate(a) => if let EncodedTerm::NaiveDate(ref b) = b { a.partial_cmp(b) } else { None }, EncodedTerm::NaiveTime(a) => if let EncodedTerm::NaiveTime(ref b) = b { a.partial_cmp(b) } else { None }, EncodedTerm::DateTime(a) => if let EncodedTerm::DateTime(ref b) = b { a.partial_cmp(b) } else { None }, EncodedTerm::NaiveDateTime(a) => if let EncodedTerm::NaiveDateTime(ref b) = b { a.partial_cmp(b) } else { None }, _ => None, } } fn compare_str_ids(&self, a: u64, b: u64) -> Option { if let (Ok(a), Ok(b)) = (self.store.get_str(a), self.store.get_str(b)) { Some(a.cmp(&b)) } else { None } } } enum NumericBinaryOperands { Float(f32, f32), Double(f64, f64), Integer(i128, i128), Decimal(Decimal, Decimal), } fn get_tuple_value(variable: usize, tuple: &[Option]) -> Option { if variable < tuple.len() { tuple[variable] } else { None } } fn has_tuple_value(variable: usize, tuple: &[Option]) -> bool { if variable < tuple.len() { tuple[variable].is_some() } else { false } } fn get_pattern_value( selector: &PatternValue, tuple: &[Option], ) -> Option { match selector { PatternValue::Constant(term) => Some(*term), PatternValue::Variable(v) => get_tuple_value(*v, tuple), } } fn put_pattern_value(selector: &PatternValue, value: EncodedTerm, tuple: &mut EncodedTuple) { match selector { PatternValue::Constant(_) => (), PatternValue::Variable(v) => put_value(*v, value, tuple), } } fn put_value(position: usize, value: EncodedTerm, tuple: &mut EncodedTuple) { if position < tuple.len() { tuple[position] = Some(value) } else { if position > tuple.len() { tuple.resize(position, None); } tuple.push(Some(value)) } } fn bind_variables_in_set(binding: &[Option], set: &[usize]) -> Vec { set.into_iter() .cloned() .filter(|key| *key < binding.len() && binding[*key].is_some()) .collect() } fn unbind_variables(binding: &mut [Option], variables: &[usize]) { for var in variables { if *var < binding.len() { binding[*var] = None } } } fn combine_tuples(a: &[Option], b: &[Option]) -> Option { if a.len() < b.len() { let mut result = b.to_owned(); for (key, a_value) in a.into_iter().enumerate() { if let Some(a_value) = a_value { match b[key] { Some(ref b_value) => { if a_value != b_value { return None; } } None => result[key] = Some(*a_value), } } } Some(result) } else { let mut result = a.to_owned(); for (key, b_value) in b.into_iter().enumerate() { if let Some(b_value) = b_value { match a[key] { Some(ref a_value) => { if a_value != b_value { return None; } } None => result[key] = Some(*b_value), } } } Some(result) } } struct JoinIterator<'a> { left: Vec, right_iter: EncodedTuplesIterator<'a>, buffered_results: Vec>, } impl<'a> Iterator for JoinIterator<'a> { type Item = Result; fn next(&mut self) -> Option> { if let Some(result) = self.buffered_results.pop() { return Some(result); } let right_tuple = match self.right_iter.next()? { Ok(right_tuple) => right_tuple, Err(error) => return Some(Err(error)), }; for left_tuple in &self.left { if let Some(result_tuple) = combine_tuples(left_tuple, &right_tuple) { self.buffered_results.push(Ok(result_tuple)) } } self.next() } } struct LeftJoinIterator<'a, S: EncodedQuadsStore> { eval: SimpleEvaluator, right_plan: &'a PlanNode, left_iter: EncodedTuplesIterator<'a>, current_right_iter: Option>, } impl<'a, S: EncodedQuadsStore> Iterator for LeftJoinIterator<'a, S> { type Item = Result; fn next(&mut self) -> Option> { if let Some(ref mut right_iter) = self.current_right_iter { if let Some(tuple) = right_iter.next() { return Some(tuple); } } match self.left_iter.next()? { Ok(left_tuple) => { let mut right_iter = self.eval.eval_plan(self.right_plan, left_tuple.clone()); match right_iter.next() { Some(right_tuple) => { self.current_right_iter = Some(right_iter); Some(right_tuple) } None => Some(Ok(left_tuple)), } } Err(error) => Some(Err(error)), } } } struct BadLeftJoinIterator<'a, S: EncodedQuadsStore> { input: EncodedTuple, iter: LeftJoinIterator<'a, S>, problem_vars: Vec, } impl<'a, S: EncodedQuadsStore> Iterator for BadLeftJoinIterator<'a, S> { type Item = Result; fn next(&mut self) -> Option> { loop { match self.iter.next()? { Ok(mut tuple) => { let mut conflict = false; for problem_var in &self.problem_vars { if let Some(input_value) = self.input[*problem_var] { if let Some(result_value) = get_tuple_value(*problem_var, &tuple) { if input_value != result_value { conflict = true; continue; //Binding conflict } } else { put_value(*problem_var, input_value, &mut tuple); } } } if !conflict { return Some(Ok(tuple)); } } Err(error) => return Some(Err(error)), } } } } struct UnionIterator<'a, S: EncodedQuadsStore> { eval: SimpleEvaluator, children_plan: &'a Vec, input_iter: EncodedTuplesIterator<'a>, current_iters: Vec>, } impl<'a, S: EncodedQuadsStore> Iterator for UnionIterator<'a, S> { type Item = Result; fn next(&mut self) -> Option> { while let Some(mut iter) = self.current_iters.pop() { if let Some(tuple) = iter.next() { self.current_iters.push(iter); return Some(tuple); } } match self.input_iter.next()? { Ok(input_tuple) => { for plan in self.children_plan { self.current_iters .push(self.eval.eval_plan(plan, input_tuple.clone())); } } Err(error) => return Some(Err(error)), } self.next() } } struct HashDeduplicateIterator<'a> { iter: EncodedTuplesIterator<'a>, already_seen: HashSet, } impl<'a> Iterator for HashDeduplicateIterator<'a> { type Item = Result; fn next(&mut self) -> Option> { match self.iter.next()? { Ok(tuple) => { if self.already_seen.insert(tuple.clone()) { Some(Ok(tuple)) } else { self.next() } } Err(error) => Some(Err(error)), } } } struct ConstructIterator<'a, S: EncodedQuadsStore> { store: Arc, iter: EncodedTuplesIterator<'a>, template: &'a [TripleTemplate], buffered_results: Vec>, bnodes: Vec, } impl<'a, S: EncodedQuadsStore> Iterator for ConstructIterator<'a, S> { type Item = Result; fn next(&mut self) -> Option> { if let Some(result) = self.buffered_results.pop() { return Some(result); } { let tuple = match self.iter.next()? { Ok(tuple) => tuple, Err(error) => return Some(Err(error)), }; let encoder = self.store.encoder(); for template in self.template { if let (Some(subject), Some(predicate), Some(object)) = ( get_triple_template_value(&template.subject, &tuple, &mut self.bnodes), get_triple_template_value(&template.predicate, &tuple, &mut self.bnodes), get_triple_template_value(&template.object, &tuple, &mut self.bnodes), ) { self.buffered_results .push(decode_triple(&encoder, subject, predicate, object)); } else { self.buffered_results.clear(); //No match, we do not output any triple for this row break; } } self.bnodes.clear(); //We do not reuse old bnodes } self.next() } } fn get_triple_template_value( selector: &TripleTemplateValue, tuple: &[Option], bnodes: &mut Vec, ) -> Option { match selector { TripleTemplateValue::Constant(term) => Some(*term), TripleTemplateValue::Variable(v) => get_tuple_value(*v, tuple), TripleTemplateValue::BlankNode(id) => { //TODO use resize_with while *id >= tuple.len() { bnodes.push(BlankNode::default()) } tuple[*id] } } } fn decode_triple( encoder: &Encoder, subject: EncodedTerm, predicate: EncodedTerm, object: EncodedTerm, ) -> Result { Ok(Triple::new( encoder.decode_named_or_blank_node(subject)?, encoder.decode_named_node(predicate)?, encoder.decode_term(object)?, )) } struct DescribeIterator<'a, S: EncodedQuadsStore> { store: Arc, iter: EncodedTuplesIterator<'a>, quads_iters: Vec, } impl<'a, S: EncodedQuadsStore> Iterator for DescribeIterator<'a, S> { type Item = Result; fn next(&mut self) -> Option> { while let Some(mut quads_iter) = self.quads_iters.pop() { if let Some(quad) = quads_iter.next() { self.quads_iters.push(quads_iter); return Some(quad.and_then(|quad| self.store.encoder().decode_triple(&quad))); } } let tuple = match self.iter.next()? { Ok(tuple) => tuple, Err(error) => return Some(Err(error)), }; let mut error_to_return = None; for subject in tuple { if let Some(subject) = subject { match self.store.quads_for_subject(subject) { Ok(quads_iter) => self.quads_iters.push(quads_iter), Err(error) => { error_to_return = Some(error); } } } } if let Some(error) = error_to_return { Some(Err(error)) } else { self.next() } } }