anki/rslib/src/search/mod.rs

// Copyright: Ankitects Pty Ltd and contributors
// License: GNU AGPL, version 3 or later; http://www.gnu.org/licenses/agpl.html

mod cards;
mod notes;
mod parser;
mod sqlwriter;
mod writer;

pub use cards::SortMode;
pub use parser::{
    parse as parse_search, Node, PropertyKind, RatingKind, SearchNode, StateKind, TemplateKind,
};
pub use writer::{concatenate_searches, replace_search_term, write_nodes, BoolSeparator};
NF: add AGPL licence missing in some file I noticed it when I looked at some files now used in AnkiDroid, wanting to be sure we clearly indicate that we have AGPLv3 code linked in the app 2021-01-31 21:50:21 +01:00			`// Copyright: Ankitects Pty Ltd and contributors`
			`// License: GNU AGPL, version 3 or later; http://www.gnu.org/licenses/agpl.html`

prototype of integration no ordering yet, and no tests 2020-03-19 23:20:47 +01:00			`mod cards;`
add note searching 2020-03-21 00:00:05 +01:00			`mod notes;`
basic search parsing 2020-03-15 10:11:45 +01:00			`mod parser;`
prototype of integration no ordering yet, and no tests 2020-03-19 23:20:47 +01:00			`mod sqlwriter;`
Fix format and tests 2020-12-22 11:32:53 +01:00			`mod writer;`
prototype of integration no ordering yet, and no tests 2020-03-19 23:20:47 +01:00
start work on field changes, and add search_cards to col 2020-04-14 08:47:26 +02:00			`pub use cards::SortMode;`
more search bikeshedding While implementing the overdue search, I realised it would be nice to be able to construct a search string with OR and NOT searches without having to construct each part individually with build_search_string(). Changes: - Extends SearchTerm to support a text search, which will be parsed by the backend. This allows us to do things like wrap text in a group or NOT node. - Because SearchTerm->Node conversion can now fail with a parsing error, it's switched over to TryFrom - Switch concatenate_searches and replace_search_term to use SearchTerms, so that they too don't require separate string building steps. - Remove the unused normalize_search() - Remove negate_search, as this is now an operation on a Node, and users can wrap their search in SearchTerm(negated=...) - Remove the match_any and negate args from build_search_string Having done all this work, I've just realised that perhaps the original JSON idea was more feasible than I first thought - if we wrote it out to a string and re-parsed it, we would be able to leverage the existing checks that occur at parsing stage. 2021-02-11 08:11:17 +01:00			`pub use parser::{`
			`parse as parse_search, Node, PropertyKind, RatingKind, SearchNode, StateKind, TemplateKind,`
Add native enum for concatenate_search's separator 2021-01-07 12:50:57 +01:00			`};`
more search bikeshedding While implementing the overdue search, I realised it would be nice to be able to construct a search string with OR and NOT searches without having to construct each part individually with build_search_string(). Changes: - Extends SearchTerm to support a text search, which will be parsed by the backend. This allows us to do things like wrap text in a group or NOT node. - Because SearchTerm->Node conversion can now fail with a parsing error, it's switched over to TryFrom - Switch concatenate_searches and replace_search_term to use SearchTerms, so that they too don't require separate string building steps. - Remove the unused normalize_search() - Remove negate_search, as this is now an operation on a Node, and users can wrap their search in SearchTerm(negated=...) - Remove the match_any and negate args from build_search_string Having done all this work, I've just realised that perhaps the original JSON idea was more feasible than I first thought - if we wrote it out to a string and re-parsed it, we would be able to leverage the existing checks that occur at parsing stage. 2021-02-11 08:11:17 +01:00			`pub use writer::{concatenate_searches, replace_search_term, write_nodes, BoolSeparator};`