pub struct PackedRTree { /* private fields */ }Expand description
Packed Hilbert R-Tree
Implementations§
Source§impl PackedRTree
impl PackedRTree
pub const DEFAULT_NODE_SIZE: u16 = 16
pub fn build( nodes: &[NodeItem], extent: &NodeItem, node_size: u16, ) -> Result<PackedRTree, Error>
pub fn from_buf( data: impl Read, num_items: usize, node_size: u16, ) -> Result<PackedRTree, Error>
pub async fn from_http<T: AsyncHttpRangeClient>( client: &mut AsyncBufferedHttpRangeClient<T>, index_begin: usize, num_items: usize, node_size: u16, ) -> Result<PackedRTree, Error>
Sourcepub fn search(&self, query: Query) -> Result<Vec<SearchResultItem>, Error>
pub fn search(&self, query: Query) -> Result<Vec<SearchResultItem>, Error>
Search the R-Tree using a specific query type
Sourcepub fn stream_search<R: Read + Seek>(
data: &mut R,
num_items: usize,
node_size: u16,
query: Query,
) -> Result<Vec<SearchResultItem>, Error>
pub fn stream_search<R: Read + Seek>( data: &mut R, num_items: usize, node_size: u16, query: Query, ) -> Result<Vec<SearchResultItem>, Error>
Search the R-Tree using a specific query type with streaming
pub fn size(&self) -> usize
pub fn index_size(num_items: usize, node_size: u16) -> usize
pub fn extent(&self) -> NodeItem
pub async fn http_stream_search<T: AsyncHttpRangeClient>( client: &mut AsyncBufferedHttpRangeClient<T>, index_begin: usize, attr_index_size: usize, num_items: usize, branching_factor: u16, query: Query, combine_request_threshold: usize, ) -> Result<Vec<HttpSearchResultItem>, Error>
Auto Trait Implementations§
impl Freeze for PackedRTree
impl RefUnwindSafe for PackedRTree
impl Send for PackedRTree
impl Sync for PackedRTree
impl Unpin for PackedRTree
impl UnsafeUnpin for PackedRTree
impl UnwindSafe for PackedRTree
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more