和迭代器不同,不需要先移动指针(使用 next())来进入合法的状态。
Unlike an iterator, the cursor need not be advanced first (using next()) in order to get into a valid state.
本文给出一种特殊的自指针先入先出(FIFO)电路的设计。
A special Self-Pointer FIFO is designed with very simple architecture and the scheme removes the overhead address-pointer counting.
应用推荐