每个小块便是相应层的指针数组的直接索引：最左边的小块指向第一层节点，第二个小块指向第二层的节点，依此类推。
Each chunk is a direct index to the pointer array of the corresponding level: the first left-hand-side chunk to the first-level nodes, the second chunk to the nodes of the second level, and so on.
接下来是代码执行，可能是直接执行，也可能过一段时间之后执行，其执行结果又作为另一请求的一部分被发往这个世界的另一参与者，以此类推。
This is followed, either directly or after some time has passed, by execution of code - as part of which a request might be sent to yet another part of the universe, and so on.
如果没找到，就在直接基类中找，依此类推，沿着类的继承链向上寻找，直至函数找到或者最后一个也被搜寻过为止。
If it is not found, look in the immediate base class and continue up the chain of classes until either the function is found or the last class is searched.
应用推荐