org.jruby.util.Qsort.swap()方法的使用及代码示例

x33g5p2x  于2022-01-29 转载在 其他  
字(2.2k)|赞(0)|评价(0)|浏览(132)

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

Qsort.swap介绍

暂无

代码示例

代码示例来源:origin: org.jruby/jruby-core

if (c == 0) {
    if (i > lo) {
      swap(a, lo++, i);
    } else {
      lo++;
  swap(a, i, j);
    swap(a, lo++, i);
  } else {
    lo++;
  swap(a, i, j);
swap(a, lo1++, c--);

代码示例来源:origin: org.kill-bill.billing/killbill-osgi-bundles-jruby

if (c == 0) {
    if (i > lo) {
      swap(a, lo++, i);
    } else {
      lo++;
  swap(a, i, j);
    swap(a, lo++, i);
  } else {
    lo++;
  swap(a, i, j);
swap(a, lo1++, c--);

代码示例来源:origin: org.jruby/jruby-complete

if (c == 0) {
    if (i > lo) {
      swap(a, lo++, i);
    } else {
      lo++;
  swap(a, i, j);
    swap(a, lo++, i);
  } else {
    lo++;
  swap(a, i, j);
swap(a, lo1++, c--);

代码示例来源:origin: com.ning.billing/killbill-osgi-bundles-jruby

if (c == 0) {
    if (i > lo) {
      swap(a, lo++, i);
    } else {
      lo++;
  swap(a, i, j);
    swap(a, lo++, i);
  } else {
    lo++;
  swap(a, i, j);
swap(a, lo1++, c--);

代码示例来源:origin: org.jruby/jruby-complete

private static boolean revtest(Object[] a, int lo, int hi, Comparator c) {
  for (int i = lo + 1; i < hi - 2; ++i) {
    if (c.compare(a[i], a[i + 1]) < 0) {
      return false;
    }
  }
  // reverse the entire area of the array selected if it's reversed.
  int i = lo;
  int j = hi - 1;
  while (i < j) {
    swap(a, i++, j--);
  }
  endTest(a, lo, hi, c);
  return true;
}

代码示例来源:origin: com.ning.billing/killbill-osgi-bundles-jruby

private static boolean revtest(Object[] a, int lo, int hi, Comparator c) {
  for (int i = lo + 1; i < hi - 2; ++i) {
    if (c.compare(a[i], a[i + 1]) < 0) {
      return false;
    }
  }
  // reverse the entire area of the array selected if it's reversed.
  int i = lo;
  int j = hi - 1;
  while (i < j) {
    swap(a, i++, j--);
  }
  endTest(a, lo, hi, c);
  return true;
}

代码示例来源:origin: org.jruby/jruby-core

private static boolean revtest(Object[] a, int lo, int hi, Comparator c) {
  for (int i = lo + 1; i < hi - 2; ++i) {
    if (c.compare(a[i], a[i + 1]) < 0) {
      return false;
    }
  }
  // reverse the entire area of the array selected if it's reversed.
  int i = lo;
  int j = hi - 1;
  while (i < j) {
    swap(a, i++, j--);
  }
  endTest(a, lo, hi, c);
  return true;
}

代码示例来源:origin: org.kill-bill.billing/killbill-osgi-bundles-jruby

private static boolean revtest(Object[] a, int lo, int hi, Comparator c) {
  for (int i = lo + 1; i < hi - 2; ++i) {
    if (c.compare(a[i], a[i + 1]) < 0) {
      return false;
    }
  }
  // reverse the entire area of the array selected if it's reversed.
  int i = lo;
  int j = hi - 1;
  while (i < j) {
    swap(a, i++, j--);
  }
  endTest(a, lo, hi, c);
  return true;
}

相关文章