pub struct Branch4<P0, P1, P2, P3, V> where
P0: Scalar,
P1: Scalar,
P2: Scalar,
P3: Scalar,
V: Value, {
pub pivots: (Option<Vec<P0>>, Option<Vec<P1>>, Option<Vec<P2>>, Option<Vec<P3>>),
pub intersections: Vec<(u32, Arc<Node4<P0, P1, P2, P3, V>>)>,
pub nodes: Vec<Arc<Node4<P0, P1, P2, P3, V>>>,
}Fields
pivots: (Option<Vec<P0>>, Option<Vec<P1>>, Option<Vec<P2>>, Option<Vec<P3>>)intersections: Vec<(u32, Arc<Node4<P0, P1, P2, P3, V>>)>nodes: Vec<Arc<Node4<P0, P1, P2, P3, V>>>Implementations
sourceimpl<P0, P1, P2, P3, V> Branch4<P0, P1, P2, P3, V> where
P0: Scalar,
P1: Scalar,
P2: Scalar,
P3: Scalar,
V: Value,
impl<P0, P1, P2, P3, V> Branch4<P0, P1, P2, P3, V> where
P0: Scalar,
P1: Scalar,
P2: Scalar,
P3: Scalar,
V: Value,
pub fn new(
pivots: (Option<Vec<P0>>, Option<Vec<P1>>, Option<Vec<P2>>, Option<Vec<P3>>),
intersections: Vec<(u32, Arc<Node4<P0, P1, P2, P3, V>>)>,
nodes: Vec<Arc<Node4<P0, P1, P2, P3, V>>>
) -> Self
pub fn build<'a>(
fields: Arc<SetupFields>,
inserts: &[((Coord<P0>, Coord<P1>, Coord<P2>, Coord<P3>), InsertValue<'a, (Coord<P0>, Coord<P1>, Coord<P2>, Coord<P3>), V>)],
next_tree: &mut TreeId,
is_rm: bool
) -> (Option<TreeRef<(Coord<P0>, Coord<P1>, Coord<P2>, Coord<P3>)>>, HashMap<TreeId, Arc<Mutex<Tree4<P0, P1, P2, P3, V>>>>)
Trait Implementations
sourceimpl<P0, P1, P2, P3, V> CountBytes for Branch4<P0, P1, P2, P3, V> where
P0: Scalar,
P1: Scalar,
P2: Scalar,
P3: Scalar,
V: Value,
impl<P0, P1, P2, P3, V> CountBytes for Branch4<P0, P1, P2, P3, V> where
P0: Scalar,
P1: Scalar,
P2: Scalar,
P3: Scalar,
V: Value,
sourcefn count_bytes(&self) -> usize
fn count_bytes(&self) -> usize
Return the number of bytes that the serialization would require.
sourcefn count_from_bytes(_src: &[u8]) -> Result<usize, Error>
fn count_from_bytes(_src: &[u8]) -> Result<usize, Error>
Return how many bytes from buf would be required to deserialize Self.
sourcefn count_from_bytes_more(
buf: &[u8]
) -> Result<Option<usize>, Box<dyn Error + Send + Sync + 'static, Global>>
fn count_from_bytes_more(
buf: &[u8]
) -> Result<Option<usize>, Box<dyn Error + Send + Sync + 'static, Global>>
Return how many bytes from buf would be required to deserialize Self,
where if there are not enough bytes in buf to know how many bytes would
be required, you will receive None or otherwise Some(nbytes). Read more
sourceimpl<P0: Debug, P1: Debug, P2: Debug, P3: Debug, V: Debug> Debug for Branch4<P0, P1, P2, P3, V> where
P0: Scalar,
P1: Scalar,
P2: Scalar,
P3: Scalar,
V: Value,
impl<P0: Debug, P1: Debug, P2: Debug, P3: Debug, V: Debug> Debug for Branch4<P0, P1, P2, P3, V> where
P0: Scalar,
P1: Scalar,
P2: Scalar,
P3: Scalar,
V: Value,
sourceimpl<P0: PartialEq, P1: PartialEq, P2: PartialEq, P3: PartialEq, V: PartialEq> PartialEq<Branch4<P0, P1, P2, P3, V>> for Branch4<P0, P1, P2, P3, V> where
P0: Scalar,
P1: Scalar,
P2: Scalar,
P3: Scalar,
V: Value,
impl<P0: PartialEq, P1: PartialEq, P2: PartialEq, P3: PartialEq, V: PartialEq> PartialEq<Branch4<P0, P1, P2, P3, V>> for Branch4<P0, P1, P2, P3, V> where
P0: Scalar,
P1: Scalar,
P2: Scalar,
P3: Scalar,
V: Value,
impl<P0, P1, P2, P3, V> StructuralPartialEq for Branch4<P0, P1, P2, P3, V> where
P0: Scalar,
P1: Scalar,
P2: Scalar,
P3: Scalar,
V: Value,
Auto Trait Implementations
impl<P0, P1, P2, P3, V> RefUnwindSafe for Branch4<P0, P1, P2, P3, V> where
P0: RefUnwindSafe,
P1: RefUnwindSafe,
P2: RefUnwindSafe,
P3: RefUnwindSafe,
V: RefUnwindSafe,
impl<P0, P1, P2, P3, V> Send for Branch4<P0, P1, P2, P3, V>
impl<P0, P1, P2, P3, V> Sync for Branch4<P0, P1, P2, P3, V>
impl<P0, P1, P2, P3, V> Unpin for Branch4<P0, P1, P2, P3, V> where
P0: Unpin,
P1: Unpin,
P2: Unpin,
P3: Unpin,
impl<P0, P1, P2, P3, V> UnwindSafe for Branch4<P0, P1, P2, P3, V> where
P0: UnwindSafe + RefUnwindSafe,
P1: UnwindSafe + RefUnwindSafe,
P2: UnwindSafe + RefUnwindSafe,
P3: UnwindSafe + RefUnwindSafe,
V: RefUnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more