227 lines
8.3 KiB
Rust
227 lines
8.3 KiB
Rust
// Copyright 2016 Mozilla
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 (the "License"); you may not use
|
|
// this file except in compliance with the License. You may obtain a copy of the
|
|
// License at http://www.apache.org/licenses/LICENSE-2.0
|
|
// Unless required by applicable law or agreed to in writing, software distributed
|
|
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
|
|
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
|
|
// specific language governing permissions and limitations under the License.
|
|
|
|
#![allow(dead_code)]
|
|
|
|
//! Types used only within the transactor. These should not be exposed outside of this crate.
|
|
|
|
use std::collections::{
|
|
BTreeMap,
|
|
BTreeSet,
|
|
HashMap,
|
|
};
|
|
|
|
use core_traits::{
|
|
Attribute,
|
|
Entid,
|
|
KnownEntid,
|
|
TypedValue,
|
|
ValueType,
|
|
};
|
|
|
|
use mentat_core::util::Either;
|
|
|
|
use edn;
|
|
use edn::{
|
|
SpannedValue,
|
|
ValueAndSpan,
|
|
ValueRc,
|
|
};
|
|
use edn::entities;
|
|
use edn::entities::{
|
|
EntityPlace,
|
|
OpType,
|
|
TempId,
|
|
TxFunction,
|
|
};
|
|
|
|
use db_traits::errors as errors;
|
|
use db_traits::errors::{
|
|
DbErrorKind,
|
|
Result,
|
|
};
|
|
use schema::{
|
|
SchemaTypeChecking,
|
|
};
|
|
use types::{
|
|
AVMap,
|
|
AVPair,
|
|
Schema,
|
|
TransactableValue,
|
|
};
|
|
|
|
impl TransactableValue for ValueAndSpan {
|
|
fn into_typed_value(self, schema: &Schema, value_type: ValueType) -> Result<TypedValue> {
|
|
schema.to_typed_value(&self, value_type)
|
|
}
|
|
|
|
fn into_entity_place(self) -> Result<EntityPlace<Self>> {
|
|
use self::SpannedValue::*;
|
|
match self.inner {
|
|
Integer(v) => Ok(EntityPlace::Entid(entities::EntidOrIdent::Entid(v))),
|
|
Keyword(v) => {
|
|
if v.is_namespaced() {
|
|
Ok(EntityPlace::Entid(entities::EntidOrIdent::Ident(v)))
|
|
} else {
|
|
// We only allow namespaced idents.
|
|
bail!(DbErrorKind::InputError(errors::InputError::BadEntityPlace))
|
|
}
|
|
},
|
|
Text(v) => Ok(EntityPlace::TempId(TempId::External(v).into())),
|
|
List(ls) => {
|
|
let mut it = ls.iter();
|
|
match (it.next().map(|x| &x.inner), it.next(), it.next(), it.next()) {
|
|
// Like "(transaction-id)".
|
|
(Some(&PlainSymbol(ref op)), None, None, None) => {
|
|
Ok(EntityPlace::TxFunction(TxFunction { op: op.clone() }))
|
|
},
|
|
// Like "(lookup-ref)".
|
|
(Some(&PlainSymbol(edn::PlainSymbol(ref s))), Some(a), Some(v), None) if s == "lookup-ref" => {
|
|
match a.clone().into_entity_place()? {
|
|
EntityPlace::Entid(a) => Ok(EntityPlace::LookupRef(entities::LookupRef { a: entities::AttributePlace::Entid(a), v: v.clone() })),
|
|
EntityPlace::TempId(_) |
|
|
EntityPlace::TxFunction(_) |
|
|
EntityPlace::LookupRef(_) => bail!(DbErrorKind::InputError(errors::InputError::BadEntityPlace)),
|
|
}
|
|
},
|
|
_ => bail!(DbErrorKind::InputError(errors::InputError::BadEntityPlace)),
|
|
}
|
|
},
|
|
Nil |
|
|
Boolean(_) |
|
|
Instant(_) |
|
|
BigInteger(_) |
|
|
Float(_) |
|
|
Uuid(_) |
|
|
PlainSymbol(_) |
|
|
NamespacedSymbol(_) |
|
|
Vector(_) |
|
|
Set(_) |
|
|
Map(_) => bail!(DbErrorKind::InputError(errors::InputError::BadEntityPlace)),
|
|
}
|
|
}
|
|
|
|
fn as_tempid(&self) -> Option<TempId> {
|
|
self.inner.as_text().cloned().map(TempId::External).map(|v| v.into())
|
|
}
|
|
}
|
|
|
|
impl TransactableValue for TypedValue {
|
|
fn into_typed_value(self, _schema: &Schema, value_type: ValueType) -> Result<TypedValue> {
|
|
if self.value_type() != value_type {
|
|
bail!(DbErrorKind::BadValuePair(format!("{:?}", self), value_type));
|
|
}
|
|
Ok(self)
|
|
}
|
|
|
|
fn into_entity_place(self) -> Result<EntityPlace<Self>> {
|
|
match self {
|
|
TypedValue::Ref(x) => Ok(EntityPlace::Entid(entities::EntidOrIdent::Entid(x))),
|
|
TypedValue::Keyword(x) => Ok(EntityPlace::Entid(entities::EntidOrIdent::Ident((*x).clone()))),
|
|
TypedValue::String(x) => Ok(EntityPlace::TempId(TempId::External((*x).clone()).into())),
|
|
TypedValue::Boolean(_) |
|
|
TypedValue::Long(_) |
|
|
TypedValue::Double(_) |
|
|
TypedValue::Instant(_) |
|
|
TypedValue::Uuid(_) => bail!(DbErrorKind::InputError(errors::InputError::BadEntityPlace)),
|
|
}
|
|
}
|
|
|
|
fn as_tempid(&self) -> Option<TempId> {
|
|
match self {
|
|
&TypedValue::String(ref s) => Some(TempId::External((**s).clone()).into()),
|
|
_ => None,
|
|
}
|
|
}
|
|
}
|
|
|
|
#[derive(Clone, Debug, Eq, Hash, Ord, PartialOrd, PartialEq)]
|
|
pub enum Term<E, V> {
|
|
AddOrRetract(OpType, E, Entid, V),
|
|
}
|
|
|
|
use self::Either::*;
|
|
|
|
pub type KnownEntidOr<T> = Either<KnownEntid, T>;
|
|
pub type TypedValueOr<T> = Either<TypedValue, T>;
|
|
|
|
pub type TempIdHandle = ValueRc<TempId>;
|
|
pub type TempIdMap = HashMap<TempIdHandle, KnownEntid>;
|
|
|
|
pub type LookupRef = ValueRc<AVPair>;
|
|
|
|
/// Internal representation of an entid on its way to resolution. We either have the simple case (a
|
|
/// numeric entid), a lookup-ref that still needs to be resolved (an atomized [a v] pair), or a temp
|
|
/// ID that needs to be upserted or allocated (an atomized tempid).
|
|
#[derive(Clone,Debug,Eq,Hash,Ord,PartialOrd,PartialEq)]
|
|
pub enum LookupRefOrTempId {
|
|
LookupRef(LookupRef),
|
|
TempId(TempIdHandle)
|
|
}
|
|
|
|
pub type TermWithTempIdsAndLookupRefs = Term<KnownEntidOr<LookupRefOrTempId>, TypedValueOr<LookupRefOrTempId>>;
|
|
pub type TermWithTempIds = Term<KnownEntidOr<TempIdHandle>, TypedValueOr<TempIdHandle>>;
|
|
pub type TermWithoutTempIds = Term<KnownEntid, TypedValue>;
|
|
pub type Population = Vec<TermWithTempIds>;
|
|
|
|
impl TermWithTempIds {
|
|
// These have no tempids by definition, and just need to be unwrapped. This operation might
|
|
// also be called "lowering" or "level lowering", but the concept of "unwrapping" is common in
|
|
// Rust and seems appropriate here.
|
|
pub(crate) fn unwrap(self) -> TermWithoutTempIds {
|
|
match self {
|
|
Term::AddOrRetract(op, Left(n), a, Left(v)) => Term::AddOrRetract(op, n, a, v),
|
|
_ => unreachable!(),
|
|
}
|
|
}
|
|
}
|
|
|
|
impl TermWithoutTempIds {
|
|
pub(crate) fn rewrap<A, B>(self) -> Term<KnownEntidOr<A>, TypedValueOr<B>> {
|
|
match self {
|
|
Term::AddOrRetract(op, n, a, v) => Term::AddOrRetract(op, Left(n), a, Left(v))
|
|
}
|
|
}
|
|
}
|
|
|
|
/// Given a `KnownEntidOr` or a `TypedValueOr`, replace any internal `LookupRef` with the entid from
|
|
/// the given map. Fail if any `LookupRef` cannot be replaced.
|
|
///
|
|
/// `lift` allows to specify how the entid found is mapped into the output type. (This could
|
|
/// also be an `Into` or `From` requirement.)
|
|
///
|
|
/// The reason for this awkward expression is that we're parameterizing over the _type constructor_
|
|
/// (`EntidOr` or `TypedValueOr`), which is not trivial to express in Rust. This only works because
|
|
/// they're both the same `Result<...>` type with different parameterizations.
|
|
pub fn replace_lookup_ref<T, U>(lookup_map: &AVMap, desired_or: Either<T, LookupRefOrTempId>, lift: U) -> errors::Result<Either<T, TempIdHandle>> where U: FnOnce(Entid) -> T {
|
|
match desired_or {
|
|
Left(desired) => Ok(Left(desired)), // N.b., must unwrap here -- the ::Left types are different!
|
|
Right(other) => {
|
|
match other {
|
|
LookupRefOrTempId::TempId(t) => Ok(Right(t)),
|
|
LookupRefOrTempId::LookupRef(av) => lookup_map.get(&*av)
|
|
.map(|x| lift(*x)).map(Left)
|
|
// XXX TODO: fix this error kind!
|
|
.ok_or_else(|| DbErrorKind::UnrecognizedIdent(format!("couldn't lookup [a v]: {:?}", (*av).clone())).into()),
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
#[derive(Clone, Debug, Default)]
|
|
pub(crate) struct AddAndRetract {
|
|
pub(crate) add: BTreeSet<TypedValue>,
|
|
pub(crate) retract: BTreeSet<TypedValue>,
|
|
}
|
|
|
|
// A trie-like structure mapping a -> e -> v that prefix compresses and makes uniqueness constraint
|
|
// checking more efficient. BTree* for deterministic errors.
|
|
pub(crate) type AEVTrie<'schema> = BTreeMap<(Entid, &'schema Attribute), BTreeMap<Entid, AddAndRetract>>;
|