Assistant Secretary Posner said the State Department expects to issue,by year's end, a new list of countries of particular concern on religious freedom, which would be subject to possible U.S.sanctions.

VOA: standard.2009.10.26

So in the end,the canon is a list of the winners in the historical debate to define orthodox Christianity.

所以最后，正典书目只是赢家的清单,他们在这场定义东正教的历史争论中胜出。

耶鲁公开课 - 新约课程节选

We find ourselves easily intimidated by a list of famous names and end up not thinking for ourselves.

我们才惊觉自己很容易受到盛名的威吓,结果忘记为我们自己多想想。

耶鲁公开课 - 政治哲学导论课程节选

So, at the end of the class on Friday, we saw that list of eight steps that you always need to go through when you draw a Lewis structure.

在上周五的课的最后，我们看到了一张,包括八个步骤的流程表。

麻省理工公开课 - 化学原理课程节选

So it's now pointing to the end of the list.

现在它指向列表的末尾。

哈佛公开课 - 计算机科学课程节选

The easy thing to do would be the following: start at the front end of the list, check the first element. If it's the thing I'm looking for, I'm done. It's there. If not, move on to the next element. And keep doing that.

从数组的第一个元素开始：,如果这是目标元素那么结束,如果不是的话就继续比较下面的元素，并一直这么比较下去,但如果，在某一点我发现我要寻找的数字。

麻省理工公开课 - 计算机科学及编程导论课程节选

Let's check it out. I've written a little bit of a test script here, so if we test cell sort, and I've written this so that it's going to print out what the list is at the end of each round, OK.

我们来检查检查，我写了一个小测试脚本,我写这个脚本来测试单元排序，它能够打印出每一轮结束后,链表的是什么样子的。

麻省理工公开课 - 计算机科学及编程导论课程节选

It says while the index is smaller than the size - of the list, I'm not at the end of the list and I don't have an answer yet, check.

当然是如果我还没检索到目标数的话,因此我会去看看是不是,这里真的看不情。

麻省理工公开课 - 计算机科学及编程导论课程节选

Append sticks the list on the end of the list, append flattens it, one level of course.

因此串联加操作符和append方法，是不同的，Append方法把一个数组。

麻省理工公开课 - 计算机科学及编程导论课程节选

That isn't there. So it couldn't do it, so instead that's what append is for, is to stick things on to the end of the list.

也就是说不存在，因此没法进行指向绑定的，更改，因此这个命令并不像append那样，会在list的最后添加元素。

麻省理工公开课 - 计算机科学及编程导论课程节选

I'll let you just grok it but you can see it's basically doing what I did over there. Setting up two indices for the two sub-list,it's just walking down, finding the smallest element, putting it into a new list. When it gets to the end of one of the lists, it skips to the next part, and only one of these two pieces will get called because only one of them is going to have things leftovers.

你们可以大体的浏览一下,但是它们基本就是我在那里所做的事情,为两个子列表设置了两个指针,指针顺着列表走下去，找到最小的元素,把它放入到一个新的列表中去,当它走到一个列表的尾部时,它会跳到下部分去,两部分中只有一个会被执行,因为只有一个会有元素剩余。

麻省理工公开课 - 计算机科学及编程导论课程节选