發(fā)現(xiàn)比較經(jīng)典的注釋
// This algorithm can't optimize by searching from both ends since we
    該算法不能通過雙端搜索來優(yōu)化，因?yàn)槲覀?
// don't have backpointers on fibers. I'm trying to see how far we can get
    不要在fibers上有反向指針。 我想看看我們能走多遠(yuǎn)
// with that model. If it ends up not being worth the tradeoffs, we can
    xxx 如果最終需要為此付出代價，我們可以
// add it later.
    以后添加它
// Even with a two ended optimization, we'd want to optimize for the case
    即使是雙端優(yōu)化，我們也要針對這種情況進(jìn)行優(yōu)化
// where there are few changes and brute force the comparison instead of
    哪里有一些變化和暴力比較而不是
// going for the Map. It'd like to explore hitting that path first in
    去拿Map。 它想要先探索這條路徑
// forward-only mode and only go for the Map once we notice that we need
    僅向前模式，只有當(dāng)我們注意到我們需要的時候才去找Map
// lots of look ahead. This doesn't handle reversal as well as two ended
    要向前看。 這并不能像處理兩個端點(diǎn)那樣處理反轉(zhuǎn)
// search but that's unusual. Besides, for the two ended optimization to
    搜索，但這是不尋常的。 此外，對兩端進(jìn)行了優(yōu)化
// work on Iterables, we'd need to copy the whole set.
    對于可迭代對象，我們需要復(fù)制整個集合。
// In this first iteration, we'll just live with hitting the bad case
    在第一次迭代中，我們將只處理這種糟糕的情況
// (adding everything to a Map) in for every insert/move.
    (添加一切到一個Map中)在每次插入/移動。
// If you change this code, also update reconcileChildrenIterator() which
    如果您更改了這段代碼，還需要更新reconcileChildrenIterator() 方法
// uses the same algorithm.
    使用相同的算法。