Thus, the data in the (i,j)th element of the table will be cellfuncs[j](messages).
因此,此表的第 (i,j) 个元素内的数据将会是 cellfuncs[j](messages)。
The thead element has a single child node, tr, with three children - all th elements.
thead元素只有一个子节点tr,后者有三个子节点—所有th元素。
The result is a new array, where the i-th element is the result of applying the function to the i-th element of the original array.
结果是一个新数组,其中的第i个元素就是将此函数应用到原始数组的第i个元素后的结果。
Right, so s of i saying, given the list, look at the i'th element, true is it the same thing?
第2个元素,看他们是不是相等呢?,如果他们相等,好,把答案设置为?
Lisp The problem with that technique, while it's very general, is how long does it take me to find the i'th element of the list?
很多编程语言包括,都是用了这种技术,这个问题就是,当数组很大的时候?
Well I have to go to the zero-th element, and say OK, gee, to get to the next element, I've got to jump this here. And to get to the next element, I've got to jump to here, and to get to the next element, I've got to jump to here, until I get there.
再回到第0个元素,好的,然后找下一个元素,跳转到这里,然后再下一个元素,跳到了这里,然后再下一个元素,直到我找到那个元素,这样,我有方法来保存变长的元素。
应用推荐