pub struct OwnedDataChunk { /* private fields */ }
Expand description
represents an owned chunk of data
Implementations§
Source§impl OwnedDataChunk
impl OwnedDataChunk
pub fn data_ref(&self) -> &[u8] ⓘ
pub fn hash_ref(&self) -> &Hash
pub fn hash(&self) -> Arc<Hash>
Sourcepub const fn from_parts(data: Bytes, hash: Arc<Hash>) -> Self
pub const fn from_parts(data: Bytes, hash: Arc<Hash>) -> Self
Creates an OwnedDataChunk
from its constituent parts
§Safety
hash
must be the hash ofdata
- use
from_data()
if you cannot ensure this
pub fn from_data_and_hash<D>(data: D, hash: Arc<Hash>) -> Self
Sourcepub fn from_bytes(data: Bytes) -> Result<Self>
pub fn from_bytes(data: Bytes) -> Result<Self>
calculates the hash of data
and returns an OwnedDataChunk
Trait Implementations§
Source§impl Clone for OwnedDataChunk
impl Clone for OwnedDataChunk
Source§fn clone(&self) -> OwnedDataChunk
fn clone(&self) -> OwnedDataChunk
Returns a copy of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moreSource§impl DataChunk for OwnedDataChunk
impl DataChunk for OwnedDataChunk
Source§fn into_owned(self) -> Self
fn into_owned(self) -> Self
Transforms this chunk into an OwnedDataChunk
fn data_ref(&self) -> &[u8] ⓘ
fn hash_ref(&self) -> &Hash
fn hash(&self) -> Arc<Hash>
fn encrypt(&self) -> Result<EncryptedDataChunk>
fn decrypt(&self, key: &[u8]) -> Result<SerializedDataChunk>
fn borrow(&self) -> BorrowedDataChunk<'_>
fn serialize(&self) -> Result<SerializedDataChunk>
fn try_as<T: Archive>(self) -> Result<TypedDataChunk<Self, T>>
Source§impl Debug for OwnedDataChunk
impl Debug for OwnedDataChunk
Source§impl Hash for OwnedDataChunk
impl Hash for OwnedDataChunk
Source§impl Ord for OwnedDataChunk
impl Ord for OwnedDataChunk
Source§fn cmp(&self, other: &OwnedDataChunk) -> Ordering
fn cmp(&self, other: &OwnedDataChunk) -> Ordering
1.21.0 · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Compares and returns the maximum of two values. Read more
Source§impl PartialEq for OwnedDataChunk
impl PartialEq for OwnedDataChunk
Source§impl PartialOrd for OwnedDataChunk
impl PartialOrd for OwnedDataChunk
impl Eq for OwnedDataChunk
impl StructuralPartialEq for OwnedDataChunk
Auto Trait Implementations§
impl !Freeze for OwnedDataChunk
impl RefUnwindSafe for OwnedDataChunk
impl Send for OwnedDataChunk
impl Sync for OwnedDataChunk
impl Unpin for OwnedDataChunk
impl UnwindSafe for OwnedDataChunk
Blanket Implementations§
Source§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
Source§type ArchivedMetadata = ()
type ArchivedMetadata = ()
The archived version of the pointer metadata for this type.
Source§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Converts some archived metadata to the pointer metadata for itself.
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
Source§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
Returns the layout of the type.
Source§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
Source§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
Returns whether the given value has been niched. Read more
Source§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
Writes data to
out
indicating that a T
is niched.