未排序的列表可以包含任何想要的数据。
而未排序的集显示如下。
该操作的任务是在一个未排序的元素集合中查找特定的元素。
Its job is to find a particular element in an unsorted collection of elements.
您可以撷取一组节点，并且将它放入已排序或未排序的集合。
You can retrieve a set of nodes and put it in an ordered or unordered collection.
哪一种更好呢？，未排序的，你们已经考虑到我想说的了？
That does not assume I'm running a search it wants, which one's better?
这些运算子对未排序的序列同样能运作，但可能会产生未预期的结果。
These operators will work on unordered sequences, but they might produce unexpected results.
直到1995年发布的半本，块在箱子里还是未排序的，所以最佳适合策略还只是近似的。
Until the versions released in 1995, chunks were left unsorted within bins, so that the best-fit strategy was only approximate.
如果是一个未排序的列表，基本上我们就只能使用线性搜索了，通过遍历整个列表来查看。
If it was an unordered list, we were basically stuck with linear search. Got to walk through the whole list to see if the thing is there.
下面的示例演示一个具有未排序的源的基本方案中合并选项的行为，并将高开销函数应用于每个元素。
The following example demonstrates the behavior of merge options in a basic scenario that has an unordered source and applies an expensive function to every element.
在结构上，属性非常象子元素(未排序的)，所以类似的强制机制可以添加到gnosis . xml . validity的以后版本中。
In structure, attributes look a lot like sub-elements (unordered ones), so a similar enforcement mechanism can be added to later versions of gnosis.xml.validity.
编写一个index_function生成一个键，该键用于对未排序列表的元素进行排序。
Write an index_function that will generate a key that can be used for sorting each element of the unsorted list.
请记住，元素的次序可能与您期望的不完全一致：即使在未修饰排序成功的地方，次序与未修饰排序也不一样。
Mind you, the order of elements might not be strictly what you expect: it is not identical to an undecorated sort, even where the undecorated sort succeeds.
处理器内核随后选出未压缩的、过滤后的数据块，执行基本的数据库操作，如排序、联接和聚合。
A processor core then picks up the uncompressed, filtered data block and performs fundamental database operations such as sorts, joins, and aggregations.
最后，尽管您可能已经添加了一项新的活动，但您还需要删除未安排的活动并按照升序重新对列表排序。
Finally, although you can already add a new activity, you want to remove the unscheduled activities and re-sort the list in ascending order.
获取一个未编码的文本样例，计算文本中出现特定字母的次数，然后按频率最高到最低的顺序给字母排序。
Take a sample of unencoded text, count how many times specific letters appear in the text, and sort the letters in order from most to least frequent.
作为最佳实践，您应该尝试对interaction集进行排序，例如将未触发其他事件的简单过滤器放在前面，从而避免执行更复杂的过滤器。
As a best practice, try to order your Interaction sets such that simple filters that may not trigger are placed higher up in the order, to avoid the execution of more complex filters.
如果允许对列进行重新排序，则将冻结的列视为一组，以区别于未冻结的列。
If column reordering is enabled, the frozen columns are treated as a group distinct from the unfrozen columns.
基于未确知测度理论，建立矿山采空区的危险性等级评价和排序模型。
Based on the uncertainty measurement theory, a risk-evaluating and order-arranging model of mining underground goaf was established.
求一个未排序数组中，出现的长度最长的连续子序列长度。
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.
列出所有过去90天内未关闭的使用者本文，并依照顺位排序它们。
Lists all user stories that were not closed in the last 90 days and sorts them by rank.
列出所有未关闭的使用者本文，并依照顺位排序它们。
Lists all active user stories and sorts them by their stack rank.
当处于绑定模式时，为了能够在按绑定列对控件进行排序时保留未绑定列的值，此模式是必需的。
This is necessary to maintain the values of unbound columns in bound mode when the control is sorted by bound columns.
如需未排序之集合的详细资讯，请参阅根据名称或索引撷取的未排序节点。
For information on the unordered collection, see unordered Node Retrieval by Name or Index.
如需未排序之集合的详细资讯，请参阅根据名称或索引撷取的未排序节点。
For information on the unordered collection, see unordered Node Retrieval by Name or Index.
应用推荐