Lines Matching refs:an

67 place instead of adopting an existing database implementation, please have a
133 * A **DATA** object, which encapsulates the contents of one field of an entry, i.e. a string such a…
139 * A **TAG** object, consisting of an FSS sealing tag for all data from the beginning of the file or…
245 fail, asking for an update of the software. Writers should refuse writing if
246 there's an unknown bit flag in either of these fields.
378 OBJECT_COMPRESSED_* flags is set for an object then the matching
411 a hash collision happens (in a singly linked list, with an offset of 0
415 **entry_offset** is an offset to the first ENTRY object referring to this DATA
416 object. **entry_array_offset** is an offset to an ENTRY_ARRAY object with
418 the first ENTRY object in-line is an optimization given that many DATA objects
572 Each DATA object also references an entry array chain listing all entries
575 itself, an ENTRY_ARRAY object is only needed if it is referenced by more than
602 after an object has been written are not protected by the tag. This means a
617 Given an offset to an entry all data fields are easily found by following the
623 Seeking to an entry by timestamp or sequence number (without any matches) is
636 until an entry matching all matches is found. In the worst case seeking like
640 related. Checking whether an entry matches a number of matches is efficient
642 referenced, and the number of data fields of an entry is generally small (<
654 When an entry is appended to the journal, for each of its data fields the data
665 Before writing an object, time and disk space limits should be checked and
675 strictly by time on disk, and hence should expose an OK access pattern on
688 between the previous and current entry when reading and hence should expose an