本文整理了Java中org.mozilla.javascript.NativeArray.heapsort()方法的一些代码示例，展示了NativeArray.heapsort()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。NativeArray.heapsort()方法的具体详情如下：
包路径：org.mozilla.javascript.NativeArray
类名称：NativeArray
方法名：heapsort

NativeArray.heapsort介绍

[英]Heapsort implementation. See "Introduction to Algorithms" by Cormen, Leiserson, Rivest for details. Adjusted for zero based indexes.
[中]Heapsort实现。有关详细信息，请参阅Rivest Leiserson Cormen的“算法简介”。针对基于零的索引进行了调整。

代码示例

代码示例来源：origin: rhino/js

if (na.denseOnly) {
  int ilength = (int) length;
  heapsort(cx, scope, na.dense, ilength, compare, cmpBuf);
  return thisObj;
heapsort(cx, scope, working, ilength, compare, cmpBuf);

代码示例来源：origin: com.sun.phobos/phobos-rhino

heapsort(cx, scope, working, ilength, compare, cmpBuf);