1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
|
impl crate::Bundle {
/// Find an object with the given [`ObjectId`][gix_hash::ObjectId] and place its data into `out`.
///
/// [`cache`][crate::cache::DecodeEntry] is used to accelerate the lookup.
///
/// **Note** that ref deltas are automatically resolved within this pack only, which makes this implementation unusable
/// for thin packs, which by now are expected to be resolved already.
pub fn find<'a>(
&self,
id: impl AsRef<gix_hash::oid>,
out: &'a mut Vec<u8>,
cache: &mut impl crate::cache::DecodeEntry,
) -> Result<Option<(gix_object::Data<'a>, crate::data::entry::Location)>, crate::data::decode::Error> {
let idx = match self.index.lookup(id) {
Some(idx) => idx,
None => return Ok(None),
};
self.get_object_by_index(idx, out, cache).map(Some)
}
/// Special-use function to get an object given an index previously returned from
/// `internal_find_pack_index`.
///
/// # Panics
///
/// If `index` is out of bounds.
pub fn get_object_by_index<'a>(
&self,
idx: u32,
out: &'a mut Vec<u8>,
cache: &mut impl crate::cache::DecodeEntry,
) -> Result<(gix_object::Data<'a>, crate::data::entry::Location), crate::data::decode::Error> {
let ofs = self.index.pack_offset_at_index(idx);
let pack_entry = self.pack.entry(ofs);
let header_size = pack_entry.header_size();
self.pack
.decode_entry(
pack_entry,
out,
|id, _out| {
self.index.lookup(id).map(|idx| {
crate::data::decode::entry::ResolvedBase::InPack(
self.pack.entry(self.index.pack_offset_at_index(idx)),
)
})
},
cache,
)
.map(move |r| {
(
gix_object::Data {
kind: r.kind,
data: out.as_slice(),
},
crate::data::entry::Location {
pack_id: self.pack.id,
pack_offset: ofs,
entry_size: r.compressed_size + header_size,
},
)
})
}
}
|
