mentat/query-parser/Cargo.toml

[package]
name = "mentat_query_parser"
version = "0.0.1"
workspace = ".."

[dependencies]
combine = "2.3.2"
error-chain = "0.8.1"
matches = "0.1"

[dependencies.edn]
  path = "../edn"

[dependencies.mentat_core]
  path = "../core"

[dependencies.mentat_parser_utils]
  path = "../parser-utils"

[dependencies.mentat_query]
  path = "../query"
Create a new crate for the query parser. Fixes #138. r=rnewman Starting to work out the project layout for sub-crates. The crate inside query-parser/ is "datomish-query-parser" and the core code in src/ depends on it. 2016-12-17 02:43:47 +00:00			`[package]`
Use underscores for crate names. 2017-01-07 01:31:01 +00:00			`name = "mentat_query_parser"`
Rename to Project Mentat (query-parser). 2017-01-07 01:19:46 +00:00			`version = "0.0.1"`
Mark every project as being part of the workspace. r=nalexander This allows `cargo test --all` to work. 2017-02-20 17:35:32 +00:00			`workspace = ".."`
Implement a rudimentary Keyword struct and the beginnings of ident/entid. 2016-12-21 16:55:00 +00:00
			`[dependencies]`
Parse without copying; parse keyword maps using macros. This is a big commit, but it breaks into two conceptual pieces. The first is to "parse without copying". We replace a stream of an owned collection of edn::ValueAndSpan and instead have a stream of a borrowed collection of &edn::ValueAndSpan references. (Generally, this is represented as an iterator over a slice, but it can be over other things too.) Cloning such iterators is constant time, which improves on cloning an owned collection of edn::ValueAndSpan, which is linear time in the length of the collection and additional time depending on the complexity of the EDN values. The second conceptual piece is to parse keyword maps using a special parser and a macro to build the parser implementations. Before, we created a new edn::ValueAndSpan::Map to represent a keyword map in vector form; since we're working with &edn::ValueAndSpan references now, we can't create an &edn::ValueAndSpan reference with an appropriate lifetime. Therefore we generalize the concept of iteration slightly and turn keyword maps in map form into linear iterators by flattening the value maps. This is a potentially obscuring transformation, so we have to take care to protect against some failure cases. (See the comments and the tests in the code.) After these changes, parsing using `combine` is linear time (and reasonably fast). 2017-05-04 20:40:41 +00:00			`combine = "2.3.2"`
Review comments: downgrade to error-chain 0.8.1 for Send + Sync bound; use combine::primitive::Error. 2017-04-18 20:01:26 +00:00			`error-chain = "0.8.1"`
Parse basic :find and :where clauses. (#211) r=nalexander * Make Variable::from_symbol public. * Implement basic parsing of queries. * Use pinned dependencies the hard way to fix Travis. * Bump ordered-float dependency to 0.4.0. * Error coercions to use ?, and finishing the find interface. 2017-02-03 02:32:00 +00:00			`matches = "0.1"`
Implement parsing of simple :find expressions. (#196) r=nalexander * Test the mentat_query directory on Travis. * Export common types from edn. This allows you to write use edn::{PlainSymbol,Keyword}; instead of use edn::symbols::{PlainSymbol,Keyword}; * Add an edn::Value::is_keyword predicate. * Clean up query, preparing for query-parser. * Make EDN keywords and symbols take Into<String> arguments. * Implement parsing of simple :find lists. * Rustfmt query-parser. Split find and query. * Review comment: values_to_variables now returns a NotAVariableError on failure. * Review comment: rename gimme to to_parsed_value. * Review comment: add comments. 2017-01-25 22:06:19 +00:00
Implement a rudimentary Keyword struct and the beginnings of ident/entid. 2016-12-21 16:55:00 +00:00			`[dependencies.edn]`
			`path = "../edn"`

UUIDs and instants. Fixes #44, #45, #426, #427. (#438) r=nalexander * Pre: unused import in translate.rs. * Part 2: take a dependency on rusqlite for query arguments. * Part 1: flatten V2 schema into V1. Add UUID and URI. Bump expected ident and bootstrap datom count in tests. * Part 5: parse edn::Value::Uuid. * Part 3: extend ValueType and TypedValue to include Uuid. * Part 4: add Uuid to query arguments. * Part 6: extend db to support Uuid. * Part 8: add a tx-parser test for #f NaN and #uuid. * Part 7: parse and algebrize UUIDs in queries. * Part 1: parse #inst in EDN and throughout query engine. * Part 3: handle instants in db. * Part 2: instants never matches integers in queries. * Part 4: use DateTime for tx_instants. * Add a test for adding and querying UUIDs and instants. * Review comments. 2017-04-29 03:11:55 +00:00			`[dependencies.mentat_core]`
			`path = "../core"`

Rename parser_utils to mentat_parser_utils, clean up imports. (#234) r=vporof 2017-02-02 16:18:04 +00:00			`[dependencies.mentat_parser_utils]`
Extract assert_parses_to into a parser utility crate, r=rnewman. Fixes #200 Signed-off-by: Victor Porof <vporof@mozilla.com> 2017-02-01 08:45:55 +00:00			`path = "../parser-utils"`

Implement a rudimentary Keyword struct and the beginnings of ident/entid. 2016-12-21 16:55:00 +00:00			`[dependencies.mentat_query]`
			`path = "../query"`