There is a basic construction in category theory which I've only just recently become acquainted with, that is the comma category.
It seems to be a quite basic construction for which, however, I've seen really few "real life" examples.
I know the slice, coslice and arrow categories are particular cases of a comma category. This is in MacLane, or in the wikipedia article. In that article there are also the examples of pointed sets or graphs, which are of a more concrete nature.
I'm asking, then, for more examples of this construction in mathematics. Examples of (co)slice categories are also welcome.
Here's one example I've come up with. The completion of a metric space $M$ consists of a pair $(\overline{M},i)$ where $\overline{M}$ is a complete metric space and $i:M\to \overline{M}$ is a uniformly continuous function which satisfies the following universal property: if $N$ is another complete metric space and $g:M\to N$ is a uniformly continuous function, then there exists a unique uniformly continuous function $h:\overline{M}\to N$ such that the following diagram commutes:

I claim this completion is an initial object in a suitable comma category. Consider the functors
where $\mathbf{Met_u}$ is the category of metric spaces with uniformly continuous functions and $\mathbf{CompMet_u}$ is the category of complete metric spaces with uniformly continuous functions. The functor $F$ is such that $F(\star)=M$ where $\star$ is the sole object of $\mathbf{1}$, and $U$ is the inclusion functor.
Then an initial object of $(F\downarrow U)$ is exactly a completion of $M$.
Bonus question: is this approach to the completion not interesting/not useful? I ask this because it seems the categorial approach to completions has nothing to do with comma categories. (I can see, though, that the universal property of this completion can also be seen as an adjunction).
One example of a comma category $(F \downarrow G)$, I think of it as "simplified" comma category but I don't think that's a commonly used term, is what you get when you take $F: A \to C$ to be the selection functor (i.e. $A = \textbf{1}$).
More concretely, if $G:\textbf{Group} \to \textbf{Set}$ is the forgetful functor mapping a group to its underlying set and $F: \textbf{1} \to \textbf{Set}$ is the selection functor selecting a set $S$ then you get the category $(S \downarrow G)$ where the objects are pairs $(f,Y)$ where $f:S \to Y$ is a morphism in $\textbf{Set}$ and $Y = G(X)$ is the underlying set of some group $X$. The morphisms $(f,Y) \to (f^\prime, Y^\prime)$ are induced by group homomorphisms $\varphi : X \to X^\prime$ such that $G(\varphi) \circ f = f^\prime$.
You can use this category to define the free group over a set $S$, namely, it is a group $F$ such that $(f,G(F))$ is an initial object in $(S \downarrow G)$.
Hope this serves as an example. As for the bonus question: I'll have to pass on that.