iridium_core 0.1.12

SQL Server-compatible Rust engine core for Iridium SQL
Documentation
use super::super::virtual_table_def;
use super::super::VirtualTable;
use crate::catalog::Catalog;
use crate::executor::context::ExecutionContext;
use crate::storage::StoredRow;
use crate::types::{DataType, Value};

pub(crate) struct SysIndexes;

impl VirtualTable for SysIndexes {
    fn definition(&self) -> crate::catalog::TableDef {
        virtual_table_def(
            "indexes",
            vec![
                ("object_id", DataType::Int, false),
                ("index_id", DataType::Int, false),
                ("name", DataType::VarChar { max_len: 128 }, false),
                ("type", DataType::TinyInt, false),
                ("type_desc", DataType::VarChar { max_len: 60 }, false),
                ("is_unique", DataType::Bit, false),
                ("data_space_id", DataType::Int, false),
                ("ignore_dup_key", DataType::Bit, false),
                ("is_primary_key", DataType::Bit, false),
                ("is_unique_constraint", DataType::Bit, false),
                ("fill_factor", DataType::TinyInt, false),
                ("is_padded", DataType::Bit, false),
                ("is_hypothetical", DataType::Bit, false),
                ("is_disabled", DataType::Bit, false),
                ("allow_row_locks", DataType::Bit, false),
                ("allow_page_locks", DataType::Bit, false),
                ("has_filter", DataType::Bit, false),
                ("filter_definition", DataType::NVarChar { max_len: 4000 }, true),
                ("is_ms_shipped", DataType::Bit, false),
                ("is_published", DataType::Bit, false),
            ],
        )
    }

    fn rows(&self, catalog: &dyn Catalog, _ctx: &ExecutionContext) -> Vec<StoredRow> {
        let tables = catalog.get_tables();
        let indexes = catalog.get_indexes();

        let mut rows: Vec<StoredRow> = indexes
            .iter()
            .map(|idx| {
                let table = tables.iter().find(|t| t.id == idx.table_id);
                let is_primary_key = table
                    .map(|t| {
                        idx.column_ids.iter().all(|&col_id| {
                            t.columns
                                .iter()
                                .find(|c| c.id == col_id)
                                .map(|c| c.primary_key)
                                .unwrap_or(false)
                        }) && t.columns.iter().filter(|c| c.primary_key).count()
                            == idx.column_ids.len()
                    })
                    .unwrap_or(false);

                let is_unique_constraint = table
                    .map(|t| {
                        idx.column_ids.iter().all(|&col_id| {
                            t.columns
                                .iter()
                                .find(|c| c.id == col_id)
                                .map(|c| c.unique)
                                .unwrap_or(false)
                        }) && t.columns.iter().filter(|c| c.unique).count() == idx.column_ids.len()
                    })
                    .unwrap_or(false);

                StoredRow {
                    values: vec![
                        Value::Int(idx.table_id as i32),
                        Value::Int(idx.id as i32),
                        Value::VarChar(idx.name.clone()),
                        Value::TinyInt(if idx.is_clustered { 1 } else { 2 }),
                        Value::VarChar(if idx.is_clustered {
                            "CLUSTERED".to_string()
                        } else {
                            "NONCLUSTERED".to_string()
                        }),
                        Value::Bit(idx.is_unique),
                        Value::Int(1),
                        Value::Bit(false), // ignore_dup_key
                        Value::Bit(is_primary_key),
                        Value::Bit(is_unique_constraint),
                        Value::TinyInt(0), // fill_factor
                        Value::Bit(false), // is_padded
                        Value::Bit(false),
                        Value::Bit(false),
                        Value::Bit(true), // allow_row_locks
                        Value::Bit(true), // allow_page_locks
                        Value::Bit(false),
                        Value::Null,
                        Value::Bit(false), // is_ms_shipped
                        Value::Bit(false), // is_published
                    ],
                    deleted: false,
                }
            })
            .collect();

        let tables_with_clustered: std::collections::HashSet<u32> = indexes
            .iter()
            .filter(|idx| idx.is_clustered)
            .map(|idx| idx.table_id)
            .collect();

        for table in tables {
            if !tables_with_clustered.contains(&table.id) {
                rows.push(StoredRow {
                    values: vec![
                        Value::Int(table.id as i32),
                        Value::Int(0),                  // heap
                        Value::Null,                    // no name for heap
                        Value::TinyInt(0),              // HEAP
                        Value::VarChar("HEAP".to_string()),
                        Value::Bit(false),
                        Value::Int(1),
                        Value::Bit(false),
                        Value::Bit(false),
                        Value::Bit(false),
                        Value::TinyInt(0),
                        Value::Bit(false),
                        Value::Bit(false),
                        Value::Bit(false),
                        Value::Bit(true),
                        Value::Bit(true),
                        Value::Bit(false),
                        Value::Null,
                        Value::Bit(false),
                        Value::Bit(false),
                    ],
                    deleted: false,
                });
            }
        }

        rows
    }
}