目前仍然缺乏允许键重复的排序列表。
需求排序列表是输入进项目定界过程中的关键因素。
A list of prioritized requirements is a key input into your project scoping efforts.
MatchResult对象包含已排序列表中的所有组。
The MatchResult object contains all groups in an ordered list.
要生成章节索引，需要创建一个HTML文件，其中包含给定的所有的排序列表。
To generate the section index, we create an HTML file with an ordered list of all of the s in a given.
排序是这些方式中最常见的一种；可以对已排序列表进行二元搜索而不进行线性搜索。
Sorting is the most common of these ways; a sorted list can be binary-searched rather than linearly searched.
于是，我们得到了目前正在执行并加载了libpthreads . a库的二进制文件的排序列表。
There, now we have a nice, discrete list of binaries that are currently executing and all load libpthreads.a. Note that there are many more processes on this system than this at this time.
编写一个index_function生成一个键，该键用于对未排序列表的元素进行排序。
Write an index_function that will generate a key that can be used for sorting each element of the unsorted list.
例如，如果应用程序在列表框中显示本地化字符串的排序列表，则应用程序应执行区分区域性的排序操作。
For example, if an application displays a sorted list of localized strings in a list box, the application should perform a culture-sensitive sort.
因此，整个脚本的输出通过sort、然后通过 uniq 进行管道传输，以产生在您的 $PATH 中找到的唯一命令的字母排序列表。
Therefore, the output of the entire script is piped through sort, and then uniq to yield an alphabetized list of unique commands found in your $PATH.
然后您可以删除一个特定日期之后所有的测试计划，日志文件夹以及专题，并按照字母顺序来排序列表，以匹配RationalTestManager 中的内容。
Then delete all test plans, log folders, and suites after an appropriate date, and sort the list alphabetically to match the presentation in Rational TestManager.
因为NPSI是一个单序列列表，很容易看到DB 2如何来回切换，从表到索引、索引到表，然后以ZIPCODE次序返回行，而不需要排序。
Because the NPSI is a single ordered list, it is easy to see how DB2 could just toggle back and forth, index to table, index to table, and return rows in ZIPCODE order without sorting.
列表4显示了定义可排序列中文本样式的样式表条目。
Listing 4 shows the stylesheet entry that defines the style of the text in the sortable column.
现在，如果最适合DB2用于避免数据排序的索引不是有序列表，而是随机的，会发生什么？
Now, what happens if the index that would have been ideal for DB2 to use to avoid a data sort is not an ordered list, but rather random?
如果我们可以做排序，然后我们可以看到，如果我们分摊开支，在有序列表中搜索将会变得更高效。
If we could do sort, then we saw, if we amortized the cost, that searching is a lot more efficient if we're searching a sorted list.
如果我们可以做排序，然后我们可以看到，如果我们分摊开支，在有序列表中搜索将会变得更高效。
If we could do sort, then we saw, if we amortized the cost, that searching is a lot more efficient if we're searching a sorted list.
应用推荐