亚洲av丰满熟妇在线播放,亚洲中文无码永久免,午夜亚洲AV日韩AV无码大全

LoveBNU ��六 WangBNU — Thu, 24 Aug 2006 01:38:00 GMT

�q�是一个简单的�_�糙集工�?目标是实现粗�p�集常用的算�?
一个多月前�q�个版本��开发完�?�׃��自己消极怠工现在攑և��?该收收心做正事啦.
    工程主页及下�?/span>�Q?nbsp; http://code.google.com/p/myrs/

Linux版本下蝲
    LoveBNU ��六 WangBNU 2006-08-24 09:38 发表评论

Eclipse Con2006 RCP几个有用的图�?..

LoveBNU ��六 WangBNU — Sat, 29 Apr 2006 16:14:00 GMT

1. �q�个囄��展示RCP自动生成的几个文件的调用关系

2. 看这个就知道现在Eclipse各个部分间大��了

LoveBNU ��六 WangBNU 2006-04-30 00:14 发表评论

rcp学习�W�记(-)-----�E�序框架

LoveBNU ��六 WangBNU — Mon, 27 Feb 2006 03:05:00 GMT

下面是一些rcp(Rich Client Platform) �E�序的说明笔记本,��C��来免的以后又忘了.关于如何在Eclipse里面建立rcp�E�序向导, �q�儿是一��不错的��译教程.

1. Application 作用和一般java�E�序里面的主�c�M��?它是一个rcp�E�序的入口点.必须实现 IPlatformRunnable 接口.卛_��现run()�Ҏ(gu��)��.

在这而run()�Ҏ(gu��)��和main()�Ҏ(gu��)��作用一�?

2. rcp�E�序不必全是UI�E�序,可以是非囑�Ş�E�序.

3. rcp�E�序几个�c? application <= ApplicationWorkbenchAdvisor <== ApplicationWorkbenchWindowAdvisor == Perspective

==ApplicationActionBarAdvisor == xxxPlugin

4.代码�C�Z��如下:

org.eclipsercp.hyperbola/Application
public class Application implements IPlatformRunnable {
public Object run(Object args) throws Exception {
    Display display = PlatformUI.createDisplay();
    try {
      int returnCode = PlatformUI.createAndRunWorkbench(
          display, new ApplicationWorkbenchAdvisor());
      if (returnCode == PlatformUI.RETURN_RESTART) {
        return IPlatformRunnable.EXIT_RESTART;
      return IPlatformRunnable.EXIT_OK;
    } finally {
      display.dispose();
    }
}
}

* Display 在这个类里面生成,PlatformUI�c�里面全是static�Ҏ(gu��)��,主要是生成Workbench和访问Workbench.

* new ApplicationWorkbenchAdvisor() �q�个�Ҏ(gu��)��引出下面一个类 ApplicationWorkbenchAdvisor(),

5.

public class ApplicationWorkbenchAdvisor extends WorkbenchAdvisor {

    private static final String PERSPECTIVE_ID = "rcphello.perspective";

    public WorkbenchWindowAdvisor createWorkbenchWindowAdvisor(IWorkbenchWindowConfigurer configurer) {

        return new ApplicationWorkbenchWindowAdvisor(configurer);
    }

    public String getInitialWindowPerspectiveId() {

        return PERSPECTIVE_ID;
    }
}

说明: return new ApplicationWorkbenchWindowAdvisor(configurer) 生成ApplicationWorkbenchWindowAdvisor.

     * 初始化getInitialWindowPerspectiveId() .

6.
public class ApplicationWorkbenchWindowAdvisor extends WorkbenchWindowAdvisor {

    public ApplicationWorkbenchWindowAdvisor(IWorkbenchWindowConfigurer configurer) {
        super(configurer);
    }

    public ActionBarAdvisor createActionBarAdvisor(IActionBarConfigurer configurer) {
        return new ApplicationActionBarAdvisor(configurer);
    }

    public void preWindowOpen() {
        IWorkbenchWindowConfigurer configurer = getWindowConfigurer();
        configurer.setInitialSize(new Point(400, 300));
        configurer.setShowCoolBar(false);
        configurer.setShowStatusLine(false);
        configurer.setTitle("Hello RCP");
    }
}

说明: 生成 new ApplicationActionBarAdvisor(configurer); 另外preWindowOpen() 里面做了好多讄��界面的工�?比如是否昄��

工具�?状态栏...,

7.
public class ApplicationActionBarAdvisor extends ActionBarAdvisor {

    public ApplicationActionBarAdvisor(IActionBarConfigurer configurer) {
        super(configurer);
    }

    protected void makeActions(IWorkbenchWindow window) {
    }

    protected void fillMenuBar(IMenuManager menuBar) {
    }

}

说明:

    定义�E�序里面的动�?加到菜单和工��h��.快捷�?..�?

LoveBNU ��六 WangBNU 2006-02-27 11:05 发表评论

在Eclipse中读源代�? (V0.1)

LoveBNU ��六 WangBNU — Fri, 30 Dec 2005 16:57:00 GMT

                                                                   在Eclipse中读源代码 �?(V0.1)

Eclipse不仅是个伟大的系�l��^�?在ide斚w��,阅读java源代码时它也为我们提供了很多方便.下面列出我常用的一些阅��L��代码

的快��h��?主要快捷键和命��o在Navigate 和Search�q?个菜单里面有.我用的是Linux�?.1 ,好象3.1.1 变了一�?下面一些是代码�?br />
�ơ的阅读,没有涉及UML. 我没有用�q�source insight,据水木网友说,Eclipse 在这斚w��不差si�?呵呵.

   1.   F3

   跌��{到类,�Ҏ(gu��)��,属�?声明的地�?��好用!

   2.     F4

   打开 �cȝ��l�承�?

   3.     ctrl+T

   快速打开 �cȝ��l�承�?br />
   4.     ctrl+shift+T or ctrl+shift+H

   打开 �cȝ�� 源代�?可以模糊搜烦, �l�微之处慢慢体会.

   5.     ctrl+o

   快速打开 outline 视图,�q�带有搜索和�q��o功能,好用!

   6.     alt+ ->   alt + <-

   在前�?�~�辑�?跌��{ ,好用!

   7.     F2

   详细查看 javadoc ?

   8.

   查看一个方法调用了那些�Ҏ(gu��)��,��好用!

   9. alt+shift+h

   10. ctrl+3

�l�计源代码字�?/font>



   搜烦那个�c�L��Ҏ(gu��)��调用�?本方�?,或直接把 method �?outline 里面拖到 Call Hierarchy 里面. ��好用!

   暂时先写�q�些,以后惛_��再添�?

                                                                                        WangBNU
                                                                                                           2005.12.31

LoveBNU ��六 WangBNU 2005-12-31 00:57 发表评论

一个可以扫描电(sh��)子邮件的java�E�序

LoveBNU ��六 WangBNU — Mon, 28 Nov 2005 08:04:00 GMT

/**
    �q�个��程序用来扫描一个网��上的电(sh��)子邮件地址,用正则表辑ּ�来做.
用法如下:
1. java   MailMatch   //��试 http://www.bnu.edu.cn 上的邮�g.默认扫描师大主页.
2. java   MailMatch http://www.pku.edu.cn // 扫描后面参数上的�?sh��)子邮�g.注意http://www   一定要写全.
@version 0.1
@author   WangBNU helloquota@163.com WangBNU@gmail.com
    http://bnulinux.yeah.net
*/

import java.io.*;

public class MailMatch {
   // file 暂时�q�没有用,
   public void mailMatch(URL url ,File   file ) {

       try {
           InputStreamReader in = new InputStreamReader(url.openStream());
           StringBuffer input = new StringBuffer();
           int ch;
           while ((ch = in.read()) != -1)     input.append( (char)ch);
           // �?sh��)子邮�g的java正则表达�?�q�有改进的余�?不过大大部分email地址可以扫出来了.
           String patternString = "[\\w-]+@[\\w.]+[a-z]{2,4}";
           Pattern pattern = Pattern.compile(patternString);
           Matcher matcher = pattern.matcher(input);

           while (matcher.find() ) {
               int start = matcher.start();
               int end = matcher.end();
               String match = input.substring(start, end);
               System.out.println(match);
           }
       } catch (IOException exception) {
           exception.printStackTrace();
       } catch (PatternSyntaxException exception) {
           exception.printStackTrace();
       }
   }

   public static void main(String[] args) {
       String urlName ;
       if ( args.length >0) {
           urlName = args[0];
       }else {
           urlName = "http://www.bnu.edu.cn";
       }
       try {
       URL   url    =     new      URL( urlName);
       File     file   =    new File ( "test.txt");

       MailMatch    test = new MailMatch(   );
       test.mailMatch( url , file    );

       } catch (MalformedURLException e ){

           System.err.println(e);

       }
   }
}

LoveBNU ��六 WangBNU 2005-11-28 16:04 发表评论

全排列算�?java 实现

LoveBNU ��六 WangBNU — Wed, 21 Sep 2005 05:27:00 GMT

  1  /*
  2  * Created on Oct 22, 2004
  3  *
  4  * To change the template for this generated file go to
  5  * Window>Preferences>Java>Code Generation>Code and Comments
  6  */
  7
  8 /**
  9  * @author WangBNU helloquota@163.com My Homepage http://bnulinux.yeah.net To
10  *         change the template for this generated type comment go to
11  *         Window>Preferences>Java>Code Generation>Code and Comments
12  */
13 public class PaiLie {
14     public static void main(String args[]) {
15         int leng = args[0].length();
16         int[] a = new int[leng];
17         boolean[] c = new boolean[leng];
18         for (int i = 0; i < leng; i++) {
19             a[i] = i + 1;
20             c[i] = false;
21         }
22         int ii = findActiveM(a, c);
23
24         for (int i = 0; i < args[0].length(); i++)
25             System.out.print(a[i]);
26         System.out.println();
27
28         if (ii >= 0) {
29             do {
30                 int activeM = a[ii];
31                 if (c[ii] == false) {
32                     swapInt(a, ii, ii - 1);
33                     swapBoolean(c, ii, ii - 1);
34                 } else {
35                     swapInt(a, ii, ii + 1);
36                     swapBoolean(c, ii, ii + 1);
37                 }
38                 for (int i = 0; i < args[0].length(); i++) {
39                     System.out.print(a[i]);
40                     if (a[i] > activeM)
41                         c[i] = !c[i];
42                 }
43                 System.out.println();
44                 ii = findActiveM(a, c);
45
46             } while (ii >= 0);
47         }
48     }
49
50     /**
51      * @param aa
52      *
53      * @param a
54      * @param b
55      */
56     private static void swapInt(int[] aa, int a, int b) {
57         int temp = aa[a];
58         aa[a] = aa[b];
59         aa[b] = temp;
60     }
61
62     private static void swapBoolean(boolean[] aa, int a, int b) {
63         boolean temp = aa[a];
64         aa[a] = aa[b];
65         aa[b] = temp;
66     }
67
68     private static int findActiveM(int[] a, boolean[] c) {
69
70         int first1 = 0, first2 = 0;
71         int m = -1, n = -1;
72         for (int i = 1; i < a.length - 1; i++) {
73             if (c[i] == false) {
74                 if ((a[i] > a[i - 1]) && a[i] > first1) {
75                     first1 = a[i];
76                     m = i;
77                 }
78             } else {
79                 if ((a[i] > a[i + 1]) && a[i] > first2) {
80                     first2 = a[i];
81                     n = i;
82                 }
83             }
84         }
85         if ((c[0] == true) && (a[0] > a[1]) && (a[0] > first2)) {
86             first2 = a[0];
87             n = 0;
88         }
89         if ((c[a.length - 1] == false) && (a.length > 1)
90                 && (a[a.length - 1] > a[a.length - 2])
91                 && (a[a.length - 1] > first1)) {
92             first1 = a[a.length - 1];
93             m = a.length - 1;
94         }
95         if (first1 >= first2)
96             return m;
97         else
98             return n;
99     }
100
101 }
102

LoveBNU ��六 WangBNU 2005-09-21 13:27 发表评论

输出一个集合所有冪集的代码

LoveBNU ��六 WangBNU — Tue, 13 Sep 2005 03:07:00 GMT

public String[] getAll(int[] array) {
        int n = Array.getLength(array);
        int total = (int) Math.pow(2, n);
        Logger log = Logger.getLogger("myLog");
        log.info(" the  total :" + total);
        String[] outArray = new String[total];
        for (int i = 0; i < total; i++) {
            StringBuffer bs = new StringBuffer("");
            for (int j = 0; j < n; j++) {
                if (((i >> j) % 2) == 1) {
                    bs.append(String.valueOf(Array.get(array, j)));
                }
            }
            outArray[i] = bs.toString();
        }
        return outArray;
    }

以上代码把生成的子集存放��C��个字�W�串数组�?当集合的基数很大�?需要很�?span style="background-color: rgb(255, 165, 0);">内存, 可以�Ҏ(gu��)��需要把上面�E�序�Ҏ(gu��)��不要攑ֈ�数组�?而是边生成边使用.

LoveBNU ��六 WangBNU 2005-09-13 11:07 发表评论