Struct TreeEntry 

pub struct TreeEntry { /* private fields */ }

A single entry inside a Tree.

An entry is the basic building block of a directory listing. It pairs a name with a kind (blob or subtree) and a hash that points to the actual content.

Validation

The name must be non‑empty and ≤ MAX_NAME_LENGTH.

Example

use libvctrl_handler::{Hash, TreeEntry, EntryKind};

let hash = Hash::from_bytes(&[0x11; 64]).unwrap();

// A file entry.
let file = TreeEntry::new("src/main.rs".into(), EntryKind::Blob, hash)
    .expect("valid entry");
assert_eq!(file.name(), "src/main.rs");
assert_eq!(file.kind(), EntryKind::Blob);
assert_eq!(file.hash().as_bytes().len(), 64);

// An empty name is rejected.
assert!(TreeEntry::new("".into(), EntryKind::Blob, hash).is_err());

Implementations

impl TreeEntry

pub fn new( name: String, kind: EntryKind, hash: Hash, ) -> Result<Self, VctrlError>

Creates a new TreeEntry after validating the name.

Errors

Returns VctrlError::InvalidName if name is empty or too long.

pub fn name(&self) -> &str

Returns the name of the entry.

pub const fn kind(&self) -> EntryKind

Returns the kind of the entry (blob or tree).

pub const fn hash(&self) -> &Hash

Returns the hash of the entry (points to a Blob or another Tree).

Trait Implementations

impl Clone for TreeEntry

fn clone(&self) -> TreeEntry

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TreeEntry

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

Formats the value using the given formatter.

impl Eq for TreeEntry

impl PartialEq for TreeEntry

fn eq(&self, other: &TreeEntry) -> bool

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for TreeEntry