Struct TileDBArray 

pub struct TileDBArray { /* private fields */ }

A TileDB array supporting dense and sparse storage.

Data is organized into tiles for efficient I/O. Dense arrays store all cells within dimension bounds; sparse arrays store only occupied cells with explicit coordinates.

Implementations

impl TileDBArray

pub fn create( schema: ArraySchema, config: TileDBConfig, ) -> Result<Self, TileDBError>

Create a new TileDB array from a schema.

pub fn schema(&self) -> &ArraySchema

Return the schema of this array.

pub fn config(&self) -> &TileDBConfig

Return the config of this array.

pub fn write_dense( &mut self, data: &[f64], subarray: &[(usize, usize)], ) -> Result<(), TileDBError>

Write data to a dense subarray.

data contains the values to write in row-major order. subarray defines the range for each dimension as (start, end) inclusive.

pub fn read_dense( &self, subarray: &[(usize, usize)], ) -> Result<Vec<f64>, TileDBError>

Read data from a dense subarray.

subarray defines the range for each dimension as (start, end) inclusive. Returns data in row-major order.

pub fn write_sparse( &mut self, coords: &[Vec<f64>], values: &[f64], ) -> Result<(), TileDBError>

Write sparse data to the array.

coords is a slice of coordinate vectors (one per dimension). values contains the attribute values for each coordinate tuple.

pub fn read_sparse( &self, query_range: &[(f64, f64)], ) -> Result<(Vec<Vec<f64>>, Vec<f64>), TileDBError>

Read sparse data within a range query.

query_range defines the (min, max) range for each dimension. Returns (coordinates, values) for all cells within the range.

pub fn num_cells(&self) -> usize

Return the number of non-empty cells in the array.

pub fn total_capacity(&self) -> usize

Return the total capacity of the dense array.

pub fn tile_info(&self) -> Vec<(String, usize, usize)>

Return the tile information for each dimension.

Trait Implementations

impl Debug for TileDBArray

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.