16e9740d8a
* Pre: Implement batch [a v] pair lookup.
* Pre: Add InternSet for sharing ref-counted handles to large values.
* Pre: Derive more for Entity.
* Pre: Return DB from creating; return TxReport from transact.
I explicitly am not supporting opening existing databases yet, let
alone upgrading databases from earlier versions. That can follow fast
once basic transactions are supported.
* Pre: Parse string temporary ID entities; remove ValueOrLookupRef.
This adds TempId entities, but we can't disambiguate String temporary
IDs from values without the use of the schema, so there's no new value
branch. Similarly, we can't disambiguate lookup-ref values from two
element list values without a schema, so we remove this entirely.
We'll handle the ambiguity later in the transactor.
* Persist partitions to SQL store; allocate transaction ID. (#186)
* Post: Test upserting with vectors.
This converts an existing test to EDN:
84a80f40f5/test/datomish/db_test.cljc (L193).
* Implement tempid upsert resolution algorithm. (#184)
* Post: Separate Tx out of DB.
This is very preliminary, since we don't have a real connection type
to manage transactions and their metadata yet.
* Post: Comment on implementation choices in the transactor.
* Review comment: Put long use lists on separate lines.
* Review comment: Accept String: Borrow<S> instead of just String.
* Review comment: Address nits.
87 lines
2.7 KiB
Rust
87 lines
2.7 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.
|
|
|
|
#[macro_use]
|
|
extern crate error_chain;
|
|
extern crate itertools;
|
|
#[macro_use]
|
|
extern crate lazy_static;
|
|
extern crate rusqlite;
|
|
extern crate time;
|
|
|
|
extern crate tabwriter;
|
|
|
|
extern crate edn;
|
|
extern crate mentat_core;
|
|
extern crate mentat_tx;
|
|
extern crate mentat_tx_parser;
|
|
|
|
use itertools::Itertools;
|
|
use std::iter::repeat;
|
|
|
|
pub mod db;
|
|
mod bootstrap;
|
|
mod debug;
|
|
mod entids;
|
|
mod errors;
|
|
mod schema;
|
|
mod types;
|
|
mod internal_types;
|
|
mod upsert_resolution;
|
|
mod values;
|
|
mod tx;
|
|
|
|
pub use types::DB;
|
|
|
|
use edn::symbols;
|
|
|
|
// TODO: replace with sqlite3_limit. #288.
|
|
pub const SQLITE_MAX_VARIABLE_NUMBER: usize = 999;
|
|
|
|
pub fn to_namespaced_keyword(s: &str) -> Option<symbols::NamespacedKeyword> {
|
|
let splits = [':', '/'];
|
|
let mut i = s.split(&splits[..]);
|
|
match (i.next(), i.next(), i.next(), i.next()) {
|
|
(Some(""), Some(namespace), Some(name), None) => Some(symbols::NamespacedKeyword::new(namespace, name)),
|
|
_ => None
|
|
}
|
|
}
|
|
|
|
/// Prepare an SQL `VALUES` block, like (?, ?, ?), (?, ?, ?).
|
|
///
|
|
/// The number of values per tuple determines `(?, ?, ?)`. The number of tuples determines `(...), (...)`.
|
|
///
|
|
/// # Examples
|
|
///
|
|
/// ```rust
|
|
/// # use mentat_db::{repeat_values};
|
|
/// assert_eq!(repeat_values(1, 3), "(?), (?), (?)".to_string());
|
|
/// assert_eq!(repeat_values(3, 1), "(?, ?, ?)".to_string());
|
|
/// assert_eq!(repeat_values(2, 2), "(?, ?), (?, ?)".to_string());
|
|
/// ```
|
|
pub fn repeat_values(values_per_tuple: usize, tuples: usize) -> String {
|
|
assert!(values_per_tuple >= 1);
|
|
assert!(tuples >= 1);
|
|
assert!(values_per_tuple * tuples < SQLITE_MAX_VARIABLE_NUMBER, "Too many values: {} * {} >= {}", values_per_tuple, tuples, SQLITE_MAX_VARIABLE_NUMBER);
|
|
// Like "(?, ?, ?)".
|
|
let inner = format!("({})", repeat("?").take(values_per_tuple).join(", "));
|
|
// Like "(?, ?, ?), (?, ?, ?)".
|
|
let values: String = repeat(inner).take(tuples).join(", ");
|
|
values
|
|
}
|
|
|
|
/// Return the current time in milliseconds after the Unix epoch according to the local clock.
|
|
///
|
|
/// Compare `Date.now()` in JavaScript, `System.currentTimeMillis` in Java.
|
|
pub fn now() -> i64 {
|
|
let now = time::get_time();
|
|
(now.sec as i64 * 1_000) + (now.nsec as i64 / (1_000_000))
|
|
}
|