代码搜索：comparable
找到约 1,342 项符合「comparable」的源代码
代码结果 1,342
www.eeworm.com/read/169058/9883962
java comparablepet.java
//: generics/ComparablePet.java
public class ComparablePet
implements Comparable {
public int compareTo(ComparablePet arg) { return 0; }
} ///:~
www.eeworm.com/read/362258/10008633
java huffmannode.java
package wlf;
/**
* 哈夫曼节点类，元素类型为Char
*/
import java.io.Serializable;
public class HuffmanNode extends BinaryNode
implements Comparable,Serializable
{
/**
www.eeworm.com/read/362232/10011595
txt 集合类.txt
Java中的容器，接口都是由一些接口，抽象类及它们的实现类所组成。而它们全部封装在java.util
包中。
1：Collection接口。
大多数的集合都实现了此接口，它基本方法是add（没有get()方法，实现类中可能有如Arrylist)，添加一对象。添加成功则返回true ,否则返回false。这是与Map不同的地方。还有一些常用的方法如iter ...
www.eeworm.com/read/361342/10057171
java mergesort.java
package firstproblem;
/**
* MergeSort用于归并排序
* @author 何腾飞
*
*/
public class MergeSort {
public static void mergeSort(Comparable []a){
Comparable []b = new Comparable[a.length];
int s
www.eeworm.com/read/360848/10075293
java splaytreenode.java
/*********************** SplayTreeNode.java ***********************/
public class SplayTreeNode {
protected T el;
protected SplayTreeNode left, right, parent
www.eeworm.com/read/281000/10273467
cpp fig12_05.cpp
template
class SplayTree
{
public:
SplayTree( )
{
nullNode = new BinaryNode;
nullNode->left = nullNode->right = nullNode;
root = nullNod
www.eeworm.com/read/281000/10273483
cpp fig07_14.cpp
/**
* Quicksort algorithm (driver).
*/
template
void quicksort( vector & a )
{
quicksort( a, 0, a.size( ) - 1 );
}
www.eeworm.com/read/281000/10273509
cpp fig06_14.cpp
explicit BinaryHeap( const vector & items )
: array( items.size( ) + 10 ), currentSize( items.size( ) )
{
for( int i = 0; i < items.size( ); i++ )
arr
www.eeworm.com/read/281000/10273516
cpp fig04_40.cpp
struct AvlNode
{
Comparable element;
AvlNode *left;
AvlNode *right;
int height;
AvlNode( const Comparable & theElement, AvlNode *l
www.eeworm.com/read/281000/10273533
cpp fig04_16.cpp
template
class BinarySearchTree
{
public:
BinarySearchTree( );
BinarySearchTree( const BinarySearchTree & rhs );
~BinarySearchTree( );
const Comparable