在从消息集合中分解消息之后，消息就可以重新排序到目标位置。
After breaking up the message from the message set, the message can then be reordered to the target location.
所有的排序、搜索和数字算法都可以进行并行分解(以后，像Arrays . sort这样的标准库机制将会使用fork - join框架，允许应用程序免费享有并行分解的益处)。
All sorts of sorting, searching, and numerical algorithms are amenable to parallel decomposition. in the future, standard library mechanisms like Arrays.sort .
基于分解策略，将船体曲面分段空间调度问题划分为一系列分段排序和分段填空过程。
Hull curved block spatial scheduling problem was divided into a series of block sequencing problems and block packing problems by means of decomposition strategy.
应用推荐