这与实际的资源查阅处理序不同，在该处理序中，子项目可存取每个父项目中所定义的任何资源，并递迴地向上搜寻。
This is different than the actual resource lookup process, where a child element can access any of the resources defined in each parent element, searching recursively upwards.
如果没找到，就在直接基类中找，依此类推，沿着类的继承链向上寻找，直至函数找到或者最后一个也被搜寻过为止。
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.
应用推荐