searchtablemodel.java

myjxta是用jxta开发的一个p2p通讯软件 有聊天 文件共享 视频3大功能 界面采用swing

/*
*  Copyright (c) 2001 Sun Microsystems, Inc.  All rights
*  reserved.
*
*  Redistribution and use in source and binary forms, with or without
*  modification, are permitted provided that the following conditions
*  are met:
*
*  1. Redistributions of source code must retain the above copyright
*  notice, this list of conditions and the following disclaimer.
*
*  2. Redistributions in binary form must reproduce the above copyright
*  notice, this list of conditions and the following disclaimer in
*  the documentation and/or other materials provided with the
*  distribution.
*
*  3. The end-user documentation included with the redistribution,
*  if any, must include the following acknowledgment:
*  "This product includes software developed by the
*  Sun Microsystems, Inc. for Project JXTA."
*  Alternately, this acknowledgment may appear in the software itself,
*  if and wherever such third-party acknowledgments normally appear.
*
*  4. The names "Sun", "Sun Microsystems, Inc.", "JXTA" and "Project JXTA"
*  must not be used to endorse or promote products derived from this
*  software without prior written permission. For written
*  permission, please contact Project JXTA at http://www.jxta.org.
*
*  5. Products derived from this software may not be called "JXTA",
*  nor may "JXTA" appear in their name, without prior written
*  permission of Sun.
*
*  THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
*  WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
*  OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
*  DISCLAIMED.  IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
*  ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
*  SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
*  LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
*  USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
*  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
*  OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
*  OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
*  SUCH DAMAGE.
*  ====================================================================
*
*  This software consists of voluntary contributions made by many
*  individuals on behalf of Project JXTA.  For more
*  information on Project JXTA, please see
*  <http://www.jxta.org/>.
*
*  This license is based on the BSD license adopted by the Apache Foundation.
*
*  $Id: SearchTableModel.java,v 1.4 2006/05/17 23:23:05 nano Exp $
*/

package net.jxta.myjxta.ui.model;

import net.jxta.myjxta.search.Searcher;
import net.jxta.myjxta.util.Resources;

import javax.swing.table.DefaultTableModel;
import java.util.*;

/**
 *
 * @version $Id: SearchTableModel.java,v 1.4 2006/05/17 23:23:05 nano Exp $
 *
 * @author james todd [gonzo at jxta dot org]
 */

public final class SearchTableModel
    extends DefaultTableModel {

    private static final List<String> groupColumns;
    private static final List<String> peerColumns;
    private static final List<String> contentColumns;

    private ArrayList columns = null;
    private ArrayList<Node> data = null;

    static {
        ResourceBundle strings = Resources.getStrings();

        groupColumns = new ArrayList<String>();

        groupColumns.add(strings.getString("label.search.results.name"));
        groupColumns.add(strings.getString("label.search.results.description"));

        peerColumns = new ArrayList<String>();

        peerColumns.add(strings.getString("label.search.results.name"));

        contentColumns = new ArrayList<String>();

        contentColumns.add(strings.getString("label.search.results.name"));
        contentColumns.add(strings.getString("label.search.results.type"));
        contentColumns.add(strings.getString("label.search.results.size"));
        contentColumns.add(strings.getString("label.search.results.provisioner"));
    }

    public SearchTableModel(int context) {
    	switch (context) {
    		case Searcher.GROUP:
    			this.columns = new ArrayList<String>(groupColumns);

                break;
            case Searcher.PIPE:
                this.columns = new ArrayList<String>(peerColumns);

                break;
            case Searcher.SHARE:
                this.columns = new ArrayList<String>(contentColumns);

                break;
    	}
    }

    public int getColumnCount() {
    	return this.columns.size();
    }

    public String getColumnName(int column) {
    	return (column <= getColumnCount() ?
                    (String)this.columns.get(column) : "");
    }

    public boolean isCellEditable(int row, int column) {
    	return false;
    }

    public void addRow(int context, Object data, Object[] row) {
    	boolean exists = false;
    	Node n = new Node(context, data);

    	for (Iterator d = this.data != null ?
    			this.data.iterator() : Collections.EMPTY_LIST.iterator();
    			! exists && d.hasNext(); ) {
    		if (d.next().equals(n)) {
    			exists = true;
    		}
    	}

    	if (! exists) {
    		if (this.data == null) {
    			this.data = new ArrayList<Node>();
    		}

    		this.data.add(n);

    		addRow(row);
    	}
    }

    public Object getData(int row) {
    	return (row < getDataSize() ?
                    this.data.get(row).getData() : null);
    }

    private int getDataSize() {
    	return (this.data != null ? this.data.size() : 0);
    }
}

class Node {

	private int context = -1;
	private Object data = null;

	public Node(int context, Object data) {
		this.context = context;
		this.data = data;
	}

	public int getContext() {
		return this.context;
	}

	public Object getData() {
		return this.data;
	}

	public boolean equals(Object o) {
		return (o instanceof Node &&
				((Node)o).getContext() == this.context &&
				((Node)o).getData().equals(this.data));
	}

    /**
     * hash method must be over-ridden if equals() is over-ridden.
     * The Object api says that if two objects evaulate as equal using
     * the equals() method, then their hash codes must be equal.
     * 
     * This hash method ensures that the hash codes reflect the
     * information evaluated by equals.
     *
     * @return hash code for this GroupNode.
     */
    public int hashCode() {
        return context ^ data.hashCode();
    }
}