% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/40-priority_queue-queue-ops.R
\name{peek_min}
\alias{peek_min}
\title{Peek Minimum-Priority Element}
\usage{
peek_min(x)
}
\arguments{
\item{x}{A \code{priority_queue}.}
}
\value{
Element at minimum priority, or \code{NULL} when \code{x} is empty.
}
\description{
Returns the element at the minimum priority without modifying the queue.
}
\details{
Ties are stable: when multiple elements share minimum priority, this returns
the earliest element in queue order.
}
\examples{
x <- priority_queue("a", "b", "c", priorities = c(2, 1, 1))
peek_min(x)
peek_min(priority_queue())
}
