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

LuaTable.swap介绍

暂无

代码示例

代码示例来源：origin: hsllany/HtmlNative

private void siftDown(int start, int end, LuaValue cmpfunc) {
  for ( int root=start; root*2+1 <= end; ) { 
    int child = root*2+1; 
    if (child < end && compare(child, child + 1, cmpfunc))
      ++child; 
    if (compare(root, child, cmpfunc)) {
      swap(root, child);
      root = child;
    } else
      return;
  }
}

代码示例来源：origin: M66B/XPrivacyLua

private void siftDown(int start, int end, LuaValue cmpfunc) {
  for ( int root=start; root*2+1 <= end; ) { 
    int child = root*2+1; 
    if (child < end && compare(child, child + 1, cmpfunc))
      ++child; 
    if (compare(root, child, cmpfunc)) {
      swap(root, child);
      root = child;
    } else
      return;
  }
}

代码示例来源：origin: hsllany/HtmlNative

private void heapSort(int count, LuaValue cmpfunc) {
  heapify(count, cmpfunc);
  for ( int end=count-1; end>0; ) {
    swap(end, 0);
    siftDown(0, --end, cmpfunc);
  }
}

代码示例来源：origin: mirkosertic/GameComposer

private void heapSort(int count, LuaValue cmpfunc) {
  heapify(count, cmpfunc);
  for ( int end=count-1; end>0; ) {
    swap(end, 0);
    siftDown(0, --end, cmpfunc);
  }
}

代码示例来源：origin: M66B/XPrivacyLua

private void heapSort(int count, LuaValue cmpfunc) {
  heapify(count, cmpfunc);
  for ( int end=count-1; end>0; ) {
    swap(end, 0);
    siftDown(0, --end, cmpfunc);
  }
}

代码示例来源：origin: mirkosertic/GameComposer

private void siftDown(int start, int end, LuaValue cmpfunc) {
  for ( int root=start; root*2+1 <= end; ) { 
    int child = root*2+1; 
    if (child < end && compare(child, child + 1, cmpfunc))
      ++child; 
    if (compare(root, child, cmpfunc)) {
      swap(root, child);
      root = child;
    } else
      return;
  }
}