mirror of
https://github.com/aljazceru/turso.git
synced 2025-12-25 12:04:21 +01:00
218 lines
6.2 KiB
Rust
218 lines
6.2 KiB
Rust
//! Reference for implementation
|
|
//! https://github.com/sqlite/sqlite/blob/a80089c5167856f0aadc9c878bd65843df724c06/ext/misc/completion.c
|
|
|
|
mod keywords;
|
|
|
|
use keywords::KEYWORDS;
|
|
use limbo_ext::{register_extension, ResultCode, VTabCursor, VTabModule, VTabModuleDerive, Value};
|
|
|
|
register_extension! {
|
|
vtabs: { CompletionVTab }
|
|
}
|
|
|
|
macro_rules! try_option {
|
|
($expr:expr, $err:expr) => {
|
|
match $expr {
|
|
Some(val) => val,
|
|
None => return $err,
|
|
}
|
|
};
|
|
}
|
|
|
|
#[derive(Debug, Default, PartialEq, Clone)]
|
|
enum CompletionPhase {
|
|
#[default]
|
|
Keywords = 1,
|
|
// TODO other options now implemented for now
|
|
// Pragmas = 2,
|
|
// Functions = 3,
|
|
// Collations = 4,
|
|
// Indexes = 5,
|
|
// Triggers = 6,
|
|
// Databases = 7,
|
|
// Tables = 8, // Also VIEWs and TRIGGERs
|
|
// Columns = 9,
|
|
// Modules = 10,
|
|
Eof = 11,
|
|
}
|
|
|
|
impl Into<i64> for CompletionPhase {
|
|
fn into(self) -> i64 {
|
|
use self::CompletionPhase::*;
|
|
match self {
|
|
Keywords => 1,
|
|
// Pragmas => 2,
|
|
// Functions => 3,
|
|
// Collations => 4,
|
|
// Indexes => 5,
|
|
// Triggers => 6,
|
|
// Databases => 7,
|
|
// Tables => 8,
|
|
// Columns => 9,
|
|
// Modules => 10,
|
|
Eof => 11,
|
|
}
|
|
}
|
|
}
|
|
|
|
/// A virtual table that generates candidate completions
|
|
#[derive(Debug, Default, VTabModuleDerive)]
|
|
struct CompletionVTab {}
|
|
|
|
impl VTabModule for CompletionVTab {
|
|
type VCursor = CompletionCursor;
|
|
const NAME: &'static str = "completion";
|
|
const VTAB_KIND: limbo_ext::VTabKind = limbo_ext::VTabKind::TableValuedFunction;
|
|
type Error = ResultCode;
|
|
|
|
fn create_schema(_args: &[Value]) -> String {
|
|
"CREATE TABLE completion(
|
|
candidate TEXT,
|
|
prefix TEXT HIDDEN,
|
|
wholeline TEXT HIDDEN,
|
|
phase INT HIDDEN
|
|
)"
|
|
.to_string()
|
|
}
|
|
|
|
fn open(&self) -> Result<Self::VCursor, Self::Error> {
|
|
Ok(CompletionCursor::default())
|
|
}
|
|
|
|
fn column(cursor: &Self::VCursor, idx: u32) -> Result<Value, ResultCode> {
|
|
cursor.column(idx)
|
|
}
|
|
|
|
fn next(cursor: &mut Self::VCursor) -> ResultCode {
|
|
cursor.next()
|
|
}
|
|
|
|
fn eof(cursor: &Self::VCursor) -> bool {
|
|
cursor.eof()
|
|
}
|
|
|
|
fn filter(cursor: &mut Self::VCursor, args: &[Value]) -> ResultCode {
|
|
if args.len() == 0 || args.len() > 2 {
|
|
return ResultCode::InvalidArgs;
|
|
}
|
|
cursor.reset();
|
|
let prefix = try_option!(args[0].to_text(), ResultCode::InvalidArgs);
|
|
|
|
let wholeline = args.get(1).map(|v| v.to_text().unwrap_or("")).unwrap_or("");
|
|
|
|
cursor.line = wholeline.to_string();
|
|
cursor.prefix = prefix.to_string();
|
|
|
|
// Currently best index is not implemented so the correct arg parsing is not done here
|
|
if !cursor.line.is_empty() && cursor.prefix.is_empty() {
|
|
let mut i = cursor.line.len();
|
|
while let Some(ch) = cursor.line.chars().next() {
|
|
if i > 0 && (ch.is_alphanumeric() || ch == '_') {
|
|
i -= 1;
|
|
} else {
|
|
break;
|
|
}
|
|
}
|
|
if cursor.line.len() - i > 0 {
|
|
// TODO see if need to inclusive range
|
|
cursor.prefix = cursor.line[..i].to_string();
|
|
}
|
|
}
|
|
|
|
cursor.rowid = 0;
|
|
cursor.phase = CompletionPhase::Keywords;
|
|
|
|
Self::next(cursor)
|
|
}
|
|
}
|
|
|
|
/// The cursor for iterating over the completions
|
|
#[derive(Debug, Default)]
|
|
struct CompletionCursor {
|
|
line: String,
|
|
prefix: String,
|
|
curr_row: String,
|
|
rowid: i64,
|
|
phase: CompletionPhase,
|
|
inter_phase_counter: usize,
|
|
// stmt: Statement
|
|
// conn: Connection
|
|
}
|
|
|
|
impl CompletionCursor {
|
|
fn reset(&mut self) {
|
|
self.line.clear();
|
|
self.prefix.clear();
|
|
self.inter_phase_counter = 0;
|
|
}
|
|
}
|
|
|
|
impl VTabCursor for CompletionCursor {
|
|
type Error = ResultCode;
|
|
|
|
fn next(&mut self) -> ResultCode {
|
|
self.rowid += 1;
|
|
|
|
while self.phase != CompletionPhase::Eof {
|
|
// dbg!(&self.phase, &self.prefix, &self.curr_row);
|
|
match self.phase {
|
|
CompletionPhase::Keywords => {
|
|
if self.inter_phase_counter >= KEYWORDS.len() {
|
|
self.curr_row.clear();
|
|
self.phase = CompletionPhase::Eof;
|
|
} else {
|
|
self.curr_row.clear();
|
|
self.curr_row.push_str(KEYWORDS[self.inter_phase_counter]);
|
|
self.inter_phase_counter += 1;
|
|
}
|
|
}
|
|
// TODO implement this when db conn is available
|
|
// CompletionPhase::Databases => {
|
|
//
|
|
// // self.stmt = self.conn.prepare("PRAGMA database_list")
|
|
// curr_col = 1;
|
|
// next_phase = CompletionPhase::Tables;
|
|
// self.phase = CompletionPhase::Eof; // for now skip other phases
|
|
// }
|
|
_ => {
|
|
return ResultCode::EOF;
|
|
}
|
|
}
|
|
if self.prefix.is_empty() {
|
|
break;
|
|
}
|
|
if self.prefix.len() <= self.curr_row.len()
|
|
&& self.prefix.to_lowercase() == self.curr_row.to_lowercase()[..self.prefix.len()]
|
|
{
|
|
break;
|
|
}
|
|
}
|
|
if self.phase == CompletionPhase::Eof {
|
|
return ResultCode::EOF;
|
|
}
|
|
ResultCode::OK
|
|
}
|
|
|
|
fn eof(&self) -> bool {
|
|
self.phase == CompletionPhase::Eof
|
|
}
|
|
|
|
fn column(&self, idx: u32) -> Result<Value, Self::Error> {
|
|
let val = match idx {
|
|
0 => Value::from_text(self.curr_row.clone()), // COMPLETION_COLUMN_CANDIDATE
|
|
1 => Value::from_text(self.prefix.clone()), // COMPLETION_COLUMN_PREFIX
|
|
2 => Value::from_text(self.line.clone()), // COMPLETION_COLUMN_WHOLELINE
|
|
3 => Value::from_integer(self.phase.clone().into()), // COMPLETION_COLUMN_PHASE
|
|
_ => Value::null(),
|
|
};
|
|
Ok(val)
|
|
}
|
|
|
|
fn rowid(&self) -> i64 {
|
|
self.rowid
|
|
}
|
|
}
|
|
|
|
#[cfg(test)]
|
|
mod tests {}
|