A scalable web crawler framework for Java.
A tiny IoC container refer to Spring.
Netty learning.
Jsoup学习笔记。添加了部分学习代码和注释。
When jsoup meets XPath.
Hello world using all 23 kinds of GoF design patterns.
A simple unrecursive DNS server. It can easily be configured to intercept some kind of request to...
fork of pdnsd https://gitorious.org/pdnsd
Binary distribution backup of blackhole
An enhanced toolkit of Mybatis to simplify development
@zhangjinzhu 这样的话可以是可以,但是不方便,比如我要买两个车次,就得分开两个时间订,唯一方便的估计是黄牛吧
不按照队列来做,而是限定时间之前提交的订单都平等处理,避免出现峰值; 买票只选出发和目的地,不能选车次,或者给出所有可能路线,让用户选择优先顺序,尽可能保证到达; 最后系统统一计算出一个最优解,放票之后再进行通知。 好处是尽可能利用运力,不浪费时间,杜绝黄牛,缺点是不透明,没人信。