spatialindex.java.044b

说明：  GN算法是一种经典的web社区发现算法，java语言。可用实例验证(the GN algorithm is a kind of classic web community discovery algorithm )

数据库连接池的使用步骤,比较有用，如果忘记的朋友可以看看。本人自己写的。(Database connection pool using steps, more useful, if you forget the friends can see. I wrote it myself.)

Legacy Conversions Source Code for Andriod.

利用socket技术来实现C/S模式的考试系统(examing system with sockey tecknological to implements the examing system )

近220个JAVA初学者实例源码，很简单，易懂(JAVA beginner nearly 220 examples of source code, very simple, easy to understand)

carrydrop撒钱的例程,是repastJ软件的经典教程(throw money routines，It Is a classic repastJ software tutorials)

This PAC script is invalid, because there is a missing close brace on the function FindProxyForURL().

魔方 java F2L OLL PLL 3D 动画(Cube java F2L OLL PLL 3D Animation)

说明：  java的一个爬虫抓取物流信息的小demo，本demo测试抓取快递100的物流轨迹信息(Java crawler to grab logistics information of the small demo, this demo test to grab express 100 logistics trajectory information)

说明：  实现扑克牌，一副牌中抽去大小王剩下52张（如果初练也可只用1～10这40张牌)，任意抽取4张牌（称牌组)，用加、减、乘、除（可加括号)把牌面上的数算成24。每张牌必须用一次且只能用一次，如抽出的牌是3、8、8、9，那么算式为（9-8)×8×3或3×8+（9-8)或（9- 8÷8)×3等。(In order to realize playing cards, 52 cards are removed from a deck (only 40 cards can be used for the first practice). Four cards are randomly selected (called card groups). The number on the deck is calculated as 24 by adding, subtracting, multiplying and dividing (brackets can be added). Each card must be used once and only once. If the drawn card is 3, 8, 8, 9, the formula is (9-8)*8*3 or 3*8+ (9-8) or (9-8 8)*3)