tee() splits a stream into two branches. It seems straightforward, but the implementation requires buffering: if one branch is read faster than the other, the data must be held somewhere until the slower branch catches up.
Is it something like this?
，详情可参考51吃瓜
alloca which can allocate on the stack. Microsoft's C compiler also supports alloca but calls it _alloca
[&:first-child]:overflow-hidden [&:first-child]:max-h-full"