pub fn insert(&mut self, mut rect: Vec<f64>, item: &T) -> bool {
        let rect_ptr = rect.as_mut_ptr();
        let item_ptr: *const c_void = item as *const _ as *const c_void;
        unsafe { rtree_insert(self.rtree, rect_ptr, item_ptr) }
    }
// rtree_insert inserts an item into the rtree. This operation performs a copy
// of the data that is pointed to in the second and third arguments. The R-tree
// expects a rectangle, which is an array of doubles, that has the first N
// values as the minimum corner of the rect, and the next N values as the
// maximum corner of the rect, where N is the number of dimensions provided
// to rtree_new().
// Returns false if the system is out of memory.
rtree_insert inserts an item into the rtree. This operation performs a copy
of the data that is pointed to in the second and third arguments. The R-tree
expects a rectangle, which is an array of doubles, that has the first N
values as the minimum corner of the rect, and the next N values as the
maximum corner of the rect, where N is the number of dimensions provided
to rtree_new().
Returns false if the system is out of memory.
rtree_insert inserts an item into the rtree . This operation performs a copy of the data that is pointed to in the second and third arguments . The R - tree expects a rectangle which is an array of doubles that has the first N values as the minimum corner of the rect and the next N values as the maximum corner of the rect where N is the number of dimensions provided to rtree_new () . Returns false if the system is out of memory .
pub fn insert(&mut self, mut rect: Vec<f64>, item: &T) -> bool {
        let rect_ptr = rect.as_mut_ptr();
        let item_ptr: *const c_void = item as *const _ as *const c_void;
        unsafe { rtree_insert(self.rtree, rect_ptr, item_ptr) }
    }
pub fn insert ( & mut self , mut rect : Vec < f64 > , item : & T ) -> bool { let rect_ptr = rect . as_mut_ptr ( ) ; let item_ptr : * const c_void = item as * const _ as * const c_void ; unsafe { rtree_insert ( self . rtree , rect_ptr , item_ptr ) } }
rtree_insert inserts an item into the rtree.
rtree_insert inserts an item into the rtree .
&mut self
rect
Vec<f64>
item
&T