A hypervisor manages system virtual machines, giving each guest a virtual machine interface while controlling its use of physical resources. It mediates facilities such as processor execution, computer memory and devices so that several guest operating systems can share a host. Hardware-assisted execution can run many guest instructions directly while retaining control over privileged operations.^[ref]

For example, a guest's apparent physical address need not identify the same physical storage as the identical address in another guest. Separate mappings preserve their distinct computer memory contents. The hypervisor must also schedule execution and enforce device-access rules. Providing a separate guest operating-system kernel distinguishes this interface from ordinary software containers sharing the host operating-system kernel.

Viral budding is a mode of particle assembly and release in which a host membrane curves around viral components and becomes the viral envelope of a departing virion. It connects the assembly of internal viral structures to organization of the membrane at the release site. The envelope is consequently derived from a particular cellular membrane region, rather than added later as an unrelated coat.^[ref]

A 1978 experiment used polarized epithelial cells grown as monolayers. Influenza particles budded from the apical surface, while vesicular stomatitis virus acquired its envelope from the basolateral surface. Those contrasting locations within the same type of cell made viral release a probe of membrane organization.^[ref]

The example separates three measurable events: producing viral components, assembling a particle and releasing it at a particular surface. More components inside a biological cell do not automatically demonstrate more released virions. Likewise, a change in release location need not mean that the viral genome changed. Structural and molecular measurements must be connected to the particular step being tested.

The vesicle lumen is the enclosed interior of a vesicle, separated from the cytosol by its lipid bilayer. It can contain dissolved cargo, ions and portions of membrane proteins facing inward. In a synaptic vesicle, for example, the neurotransmitter is stored in the vesicle lumen before exocytosis.

Membrane topology makes this interior useful to track. When a vesicle buds from the endoplasmic reticulum, its vesicle lumen derives from the interior of the endoplasmic reticulum; fusion with the Golgi apparatus delivers the cargo into the next lumen without exposing it to the cytosol. When a secretory vesicle undergoes exocytosis, the vesicle lumen opens to the extracellular space. Thus an enclosed compartment can transport material through a biological cell while keeping it on the same side of a cell membrane throughout.^[ref]

A version-control commit records an identifiable revision together with history metadata. In Git, a commit names a tree snapshot and parent commits, alongside author/committer information and a message. An initial commit has no parent; an ordinary commit has one, while a merge can have several.^[ref]

The parent links form a commit graph, allowing a tool to compare revisions and traverse ancestry. Rewriting a commit's recorded content or metadata creates a different commit object rather than silently modifying the old one. A commit identifies the recorded source snapshot; reproducing a calculation also requires external data, selected dependencies and execution settings that were not necessarily stored in that snapshot.

A version-control branch names a line of development that can progress alongside another. In Git, a branch is a movable reference to a commit; it does not require an independent copy of every file. New commits normally advance the currently checked-out branch while older commits remain part of its ancestry.^[ref]

For example, two branch names can initially reference the same commit. Committing a change on one moves that reference and leaves the other at its old commit. Their shared history is represented once in the commit graph. Deleting a branch name therefore removes a reference rather than automatically erasing every commit it once named; reachability from other references and later storage management determine which objects remain available.

Version-control merging combines development histories and their changes into a result intended to preserve both lines of work. In Git, a usual three-way merge compares two branch tips with a common base. Independent edits may combine automatically; overlapping or incompatible edits can produce a merge conflict requiring a decision.^[ref]

If one tip is already an ancestor of the other, a fast-forward can move the branch reference without creating a separate merge commit. Otherwise a merge commit can record the combined snapshot and both parents. A textually clean merge can still be semantically wrong: one branch can change a function's contract while another adds a caller using the old contract. Testing and review of the combined result remain distinct from resolving text conflicts.

Git is a distributed version control system whose history records version-control snapshots linked by version-control commits. A local repository can contain history and support comparisons and new version-control commits without a connection to a central server. Version-control branches name movable tips of that history.^[ref]

Suppose two collaborators start at the same version-control commit and each records a different change. Their new version-control commits share a parent in the commit graph. Exchanging repository objects makes both histories available; version-control merging can then combine their work, possibly exposing a merge conflict. The stored version-control snapshot identifies recorded file contents, while external datasets and installed software dependencies still need their own reproducibility record.

A V4L2 plane descriptor is a v4l2_plane structure describing one image memory plane in the V4L2 multi-planar API. The containing v4l2_buffer refers to an array of these descriptors. Each descriptor records storage capacity, occupied extent and the V4L2 plane data offset; its storage reference depends on the selected input-output method.^[ref]

The two structures use length for different quantities. The container's length counts descriptor-array elements; a plane descriptor's length counts bytes. Neither is automatically the active image extent. For a stipulated two-plane NV12M buffer, suppose the plane capacities are 8192 and 4096 bytes, with occupied extents 7000 and 3500 bytes and zero data offsets. Then the container describes two planes, storage capacity totals 12288 bytes, and occupied data total 10500 bytes. These are three different measurements of the same buffer.

For capture, the device driver supplies the occupied extent and data offset; for output, the application supplies them. A consumer combines those values with the negotiated pixel format and framebuffer stride. Describing two planes does not imply two colour components: NV12M has a luma plane and another containing both colour-difference components.

A descriptor describes access to image storage; it does not itself contain an image-sized copy. Two equal descriptor counts can therefore describe different allocations, different component arrangements or different amounts of valid data. The video buffer payload and its layout must be interpreted separately.

A surrogate pair is the two-code unit representation used by UTF-16 for a Unicode scalar value above U+FFFF. The high surrogate lies in D800–DBFF and the low surrogate in DC00–DFFF, written in hexadecimal. They encode one value together; neither surrogate alone is a Unicode scalar value.^[ref]

For numerical units $H,L$, the decoded value isThus D83D DE00 gives U+1F600. Swapping the units or discarding one half breaks that encoding. A string operation specified in code units must therefore account for pairs when it intends to preserve complete code points; a grapheme cluster can require still more units.

A URL scheme is the leading component before :, selecting a family of interpretation and processing rules. For example, https is the scheme of https://example.org/a. Scheme syntax begins with an ASCII letter and then permits letters, digits, plus, hyphen and period. Comparison is case-insensitive, and standard serialization uses lowercase.^[ref]

The scheme does not imply that every URL names a remote server. Compare https://example.org/a with data:text/plain,hello: both have schemes, but the second example carries data in its own spelling rather than naming an HTTPS host. A URL parser must apply the appropriate rules rather than demand a host and port for every case.

The colon also separates a scheme from a familiar relative-path interpretation. The text a:b is parsed as a URL with scheme a, whereas ./a:b can be a Relative URL reference. Adding the initial dot and slash therefore changes the syntactic role of the colon-containing text.

Scheme-specific defaults matter too: omitting port 443 when serializing an HTTPS URL reflects that scheme's default, not a rule that all numerical ports are redundant.^[ref]

A URL parser is a procedure that turns input text, and sometimes a base URL, into a structured URL record or a failure. The record separates components such as scheme, host, path, query string and fragment identifier. URL serialization converts that structured result back into text; it is a different operation from retrieving the identified resource.^[ref]

For a worked example, parsing https://EXAMPLE.org:443/a and serializing the result yields https://example.org/a. The host is normalized and the default port omitted. Successful parsing did not test whether the server exists, whether access is permitted or what content would be returned.

Failure also differs from a recoverable validation issue. The WHATWG algorithms can flag some nonconforming input while still producing a record, so an implementation should specify whether it reports validation diagnostics, a usable result or both. A regular expression recognizing one tidy address format is not automatically an implementation of the full parser.

A practical reproducibility check compares parsed fields and the serialized output under a stated parsing model. The WHATWG model and generic RFC syntax serve related purposes but should not be silently treated as identical grammars.