yony

<c:forEach begin="1" end="${obj.portnum}" step="1" varStatus="status" > Read More

参考：http://tech.ddvip.com/2008-12/1229938115102031.html Read More

csdn1.http://blog.csdn.net/JavaAlpha/article/details/5637035 Read More

引用：http://hi.baidu.com/newjavaee/item/3be4f32060eb8b102a0f1cb4一个小东西，C/S程序中调用在线google map。不过需要用到一种技术，DJ NativeSwing 一个开源框架，很好用的。demo如下：/* * To change this template, choose Tools | Templates * and open the template in the editor. */package newgpsclientui;import chrriis.common.UIUtils;import chrriis.dj Read More

public class PriorityQ { private int maxSize; private long[] queArray; private int nItems; //constructor public PriorityQ(int s){ maxSize = s; queArray = new long[maxSize]; nItems = 0; } //insert public void insert(long item){ int j; ... Read More

public class Queue { private int maxSize;//数组大小 private long[] queArray; private int front;//队头 private int rear;//队尾 private int nItems;//数据项个数 //create Queue public Queue(int s){ maxSize = s; queArray = new long[s]; front = 0; rear = -1; ... Read More

public class StackX { private int maxSize; private char[] stackArray; private int top; //栈构造方法 public StackX(int max){ stackArray = new char[max]; top = -1; maxSize = max; } //入栈 public void push(char ch){ stackArray[++top] = ch;//top先自增1在执... Read More

SQL语句的解析过程 由于最近需要做一些sql query性能提升的研究，因此研究了一下sql语句的解决过程。在园子里看了下，大家写了很多相关的文章，大家的侧重点各有不同。本文是我在看了各种资料后手机总结的，会详细的，一步一步的讲述一个sql语句的各个关键字的解析过程，欢迎大家互相学习。SQL语句的解析顺序简单的说一个sql语句是按照如下的顺序解析的：1. FROMFROM后面的表标识了这条语句要查询的数据源。和一些子句如，（1-J1）笛卡尔积，（1-J2）ON过滤，（1-J3）添加外部列，所要应用的对象。FROM过程之后会生成一个虚拟表VT1。(1-J1)笛卡尔积这个步骤会计算两个相关联表的 Read More

package com.study.dataStructure.linearList;import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;//栈类public class StackX { private int maxSize; private char[] stackArray; private int top; public StackX(int max){ stackArray = new char[max]; ... Read More

public class StackX { private int maxSize; private long[] stackArray; private int top; public StackX(int max){ stackArray = new long[max]; top = -1;//空栈 } public void push(long j){ stackArray[++top] = j; } public long pop(){ return stac... Read More