Struct gix_object::Data

pub struct Data<'a> {
    pub kind: Kind,
    pub data: &'a [u8],
}

A borrowed object using a slice as backing buffer, or in other words a bytes buffer that knows the kind of object it represents.

Fields

kind: Kind

kind of object

data: &'a [u8]

decoded, decompressed data, owned by a backing store.

Implementations

impl Data<'_>

pub fn verify_checksum(&self, desired: &oid) -> Result<(), Error>

Compute the checksum of self and compare it with the desired hash. If the hashes do not match, an Error is returned, containing the actual hash of self.

impl<'a> Data<'a>

pub fn new(kind: Kind, data: &'a [u8]) -> Data<'a>

Constructs a new data object from kind and data.

pub fn decode(&self) -> Result<ObjectRef<'a>, Error>

Decodes the data in the backing slice into a ObjectRef, allowing to access all of its data conveniently. The cost of parsing an object is negligible.

Note that mutable, decoded objects can be created from Data using crate::ObjectRef::into_owned().

pub fn try_into_tree_iter(self) -> Option<TreeRefIter<'a>>

Returns this object as tree iterator to parse entries one at a time to avoid allocations, or None if this is not a tree object.

pub fn try_into_commit_iter(self) -> Option<CommitRefIter<'a>>

Returns this object as commit iterator to parse tokens one at a time to avoid allocations, or None if this is not a commit object.

pub fn try_into_tag_iter(self) -> Option<TagRefIter<'a>>

Returns this object as tag iterator to parse tokens one at a time to avoid allocations, or None if this is not a tag object.

Trait Implementations

impl<'a> Clone for Data<'a>

fn clone(&self) -> Data<'a>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'a> Debug for Data<'a>

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

Formats the value using the given formatter.

impl<'a> Hash for Data<'a>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a> Ord for Data<'a>

fn cmp(&self, other: &Data<'a>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized + PartialOrd,

Restrict a value to a certain interval.

impl<'a> PartialEq for Data<'a>

fn eq(&self, other: &Data<'a>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'a> PartialOrd for Data<'a>

fn partial_cmp(&self, other: &Data<'a>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<'a> Copy for Data<'a>

impl<'a> Eq for Data<'a>

impl<'a> StructuralPartialEq for Data<'a>