开心e点

	private static final Pattern PATTERN_DIGI_VERSION  = Pattern.compile("([\\d\\.]+)([abp]\\d+)?");
 
        ...
 
	/**
	 * Compare two version strings, such as 1.0.0.10p7 and 1.0.0.20
	 * 
	 * @param lv, the left version string to be compared
	 * @param rv, the right version string to be compared
	 * @return, 1 if lv>rv; 0 if lv==rv; -1 if lv<rv
	 */
	public static int compareVersion( String lv, String rv ) {
		String[] lvs = lv.split("\\.");
		String[] rvs = rv.split("\\.");
 
		int lmin = Math.min(lvs.length, rvs.length);
 
		for ( int i=0; i<lmin; i++ ) {
			Matcher lmatch = PATTERN_DIGI_VERSION.matcher(lvs[i]);
			Matcher rmatch = PATTERN_DIGI_VERSION.matcher(rvs[i]);
			if ( lmatch.matches() ) {
				int lv1 = Integer.valueOf(lmatch.group(1));
				String strlv2 = lmatch.group(2);
 
				if ( rmatch.matches() ) {
					int rv1 = Integer.valueOf(rmatch.group(1));
					String strrv2 = rmatch.group(2);
 
					if ( lv1 > rv1 ) return 1;
					else if ( lv1 < rv1 ) return -1;
					else {
						// compare to minor version, such a, b, p1, p3, etc. 
						if ( strlv2 == null || strlv2.length()==0 ) {
							if ( strrv2 != null && strrv2.length() !=0 ) return -1;
						} else {
							if ( strrv2 == null || strrv2.length() == 0 ) return 1;
							else {
								String wlv = strlv2.substring(0, 1);
								int lv2 = strlv2 == null ? -1 : Integer.valueOf(strlv2.substring(1));
 
								String wrv = strrv2.substring(0, 1);
								int rv2 = strrv2 == null ? -1 : Integer.valueOf(strrv2.substring(1));
 
								// compare small version string first, such as 'a', 'b', 'p'
								if ( wlv.compareTo(wrv) > 0 ) return 1;
								else if ( wlv.compareTo(wrv) < 0 ) return -1;
								else {
									if ( lv2 > rv2 ) return 1;
									else if ( lv2 < rv2 ) return -1;
								}
							}
						}
					}
				} else {
					return 1;
				}
			} else {
				return -1;
			}
		}
 
		if ( lmin < lvs.length ) return 1;
		else if ( lmin == lvs.length && lmin == rvs.length ) return 0;
		else return -1;
	}

import java.rmi.NoSuchObjectException;
import java.rmi.Remote;
import java.rmi.RemoteException;
import java.rmi.registry.LocateRegistry;
 
public class RMITest {
 
	public void testRMIPortRelease() {
		System.out.println("Testing port release");
 
		System.out.println("Acquiring port... ");
		Remote reg = null;
		try {
			reg = LocateRegistry.createRegistry(1102);
		} catch (RemoteException ex) {
			ex.printStackTrace();
		}
 
		System.out.println("releasing port... ");
		try {
			java.rmi.server.UnicastRemoteObject.unexportObject(reg, true);
		} catch (NoSuchObjectException ex1) {
			ex1.printStackTrace();
		}
		reg = null;
	}
 
	public static void main(String[] args) {
		RMITest s = new RMITest();
		s.testRMIPortRelease();
	}
}

/*
 *      Prime.java
 *
 *      Copyright 2008 Ventrix <ventrix@gmail.com>
 *
 *      http://ventrix.nsdc.gr/code_folds/
 *
 *      This program is free software; you can redistribute it and/or modify
 *      it under the terms of the GNU General Public License as published by
 *      the Free Software Foundation; either version 2 of the License, or
 *      (at your option) any later version.
 *
 *      This program is distributed in the hope that it will be useful,
 *      but WITHOUT ANY WARRANTY; without even the implied warranty of
 *      MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *      GNU General Public License for more details.
 *
 *      You should have received a copy of the GNU General Public License
 *      along with this program; if not, write to the Free Software
 *      Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
 *      MA 02110-1301, USA.
 */  
 
import java.math.BigInteger;  
 
public class Prime {  
 
    private static long start;
    private static long end;  
 
    public static void main(String[] argv) {
        boolean isprimen;
        //http://java.sun.com/j2se/1.4.2/docs/api/java/math/BigInteger.html#isProbablePrime(int)
        //http://primes.utm.edu/lists/small/small.html
        //for i in `seq 1 1000`; do java Prime $i >> primes; done
        //cat primes | grep "is a"
        start = System.currentTimeMillis();
        try {
            BigInteger bigNumber = new BigInteger(argv[0]);
            if (bigNumber.compareTo(new BigInteger("2147483647")) == 1) {
                if (bigNumber.compareTo(new BigInteger("9223372036854775807")) == -1) {
                    Long longNumber = new Long(argv[0]);
                    bigNumber = null;
                    isprimen = isNorPrime(longNumber);
                } else {
                    isprimen = isBigPrime(bigNumber);
                }
            } else {
                bigNumber = null;
                Integer intNumber = new Integer(argv[0]);
                isprimen = isPrime(intNumber);
            }  
 
            if (isprimen) {
                System.out.println(argv[0] + " is a prime!");
            } else {
                System.out.println(argv[0] + " is NOT a prime!");
            }
            end = System.currentTimeMillis();
            System.out.println("Completed in +" + (end - start) + "ms");
        } catch (Exception e) {
            e.printStackTrace();
        }
    }  
 
    private static boolean isBigPrime(BigInteger number) {
        System.out.println("You gave me a BIG number");
        BigInteger[] remain;
        remain = number.divideAndRemainder(new BigInteger(new Integer("2").toString()));
        if (remain[1].compareTo(new BigInteger("0")) == 0) {
            return false;
        }
        remain = number.divideAndRemainder(new BigInteger(new Integer("3").toString()));
        if (remain[1].compareTo(new BigInteger("0")) == 0) {
            return false;
        }
        int y = 2;
        int x = (int) Math.sqrt(number.doubleValue());
        for (int i = 5; i <= x; i += y, y = 6 - y) {
            remain = number.divideAndRemainder(new BigInteger(new Integer(i).toString()));
            if (remain[1].compareTo(new BigInteger("0")) == 0) {
                return false;
            }
        }
        return true;
    }  
 
    private static boolean isNorPrime(Long number) {
        System.out.println("You gave me a normal number");
        if (number % 2 == 0) {
            return false;
        }
        if (number % 3 == 0) {
            return false;
        }
        int y = 2;
        int x = (int) Math.sqrt(number);
        for (int i = 5; i <= x; i += y, y = 6 - y) {
            if (number % i == 0) {
                return false;
            }
        }
        return true;
    }  
 
    private static boolean isPrime(Integer number) {
        System.out.println("You gave me a small number");
        if (number < 2) {
            return false;
        }
        if (number == 2) {
            return true;
        }
        if (number % 2 == 0) {
            return false;
        }
        if (number == 3) {
            return true;
        }
        if (number % 3 == 0) {
            return false;
        }
        int y = 2;
        int x = (int) Math.sqrt(number);
        for (int i = 5; i <= x; i += y, y = 6 - y) {
            if (number % i == 0) {
                return false;
            }
        }
        return true;
    }
}//class</ventrix@gmail.com>