代码搜索:comparable
找到约 1,342 项符合「comparable」的源代码
代码结果 1,342
www.eeworm.com/read/332899/12718229
java ex29.java
// holding/Ex29.java
// TIJ4 Chapter Holding, Exercise 29, page 427
/* Fill a PriorityQueue (using offer()) with Double values created using
* java.util.Random, then remove the elements using poll(
www.eeworm.com/read/144633/12779435
java pairnode.java
package DataStructures;
/**
* Public class for use with PairHeap. It is public
* only to allow references to be sent to decreaseKey.
* It has no public methods or members.
www.eeworm.com/read/243813/12915266
java max.java
// Max.java: Find a maximum object
public class Max
{
// Return the maximum between two objects
public static Comparable max(Comparable o1, Comparable o2)
{
if (o1.compareTo(o2) > 0)
www.eeworm.com/read/243813/12915662
java testinterface.java
// TestInterface.java: Use the Comparable interface
// and the generic max method to find max objects
public class TestInterface
{
// Main method
public static void main(String[] args)
{
www.eeworm.com/read/240991/13180475
java mpair.java
import java.util.*;
/**
* MPair类实现了Map.Entry
*/
class MPair implements Map.Entry,Comparable{
Object key, value; //key和value分别用来存放Map中的key和value
MPair(Object k,Object v){
key =
www.eeworm.com/read/139028/13193088
java mergesort.java
package Strategy;
import java.lang.Comparable;
public class Mergesort extends SortStrategy
{
private static void mergeSort(Comparable [] a,Comparable [] tmpArray,int left,int right)
{
if
www.eeworm.com/read/139028/13193096
java heapsort.java
package Strategy;
import java.lang.Comparable;
public class HeapSort extends SortStrategy
{
private static int leftChild(int i)
{
return 2*i + 1;
}
private static void percDown(Compa
www.eeworm.com/read/139028/13193103
java binsort.java
package Strategy;
import java.io.*;
import java.lang.Comparable;
public class BinSort extends SortStrategy
{
public void sort(Comparable [] a)
{
int j;
for(int p = 1;p
www.eeworm.com/read/139028/13193114
java selectionsort.java
package Strategy;
import java.lang.Comparable;
public class SelectionSort extends SortStrategy
{
/** sort the array a using the selection sort method */
private void swap(Comparable [] a,
www.eeworm.com/read/139028/13193122
java sortstrategy.java
package Strategy;
import java.lang.Comparable;
abstract public class SortStrategy
{
public abstract void sort(Comparable [] a);
private String[] back = null;;
public void printInfor