swing-inspector-1.2.1

充分理解对象的创建和使用过程，并对构造器有一定的了解。(Fully understand the object to create and use the constructor I have some knowledge about.)

说明：  java code for multithreading, queue implementation using stacks and stacks using arrays

说明：  用于web编程发送短信的实现的activex的接口代码(Send text messages for web programming interface code implemented activex)

SpringCloud微服务实战-源码，对应书本章节(Spring Cloud Microservice Actual Warfare-Source Code)

jforex开发，可以通过ide实现jforex策略开发(jforex development through the usage of java ide,to replace the usage of the platform itself)

JAVA开发的聊天通讯系统, 值得学习. java聊天系统_eclipse开发_access数据库(JAVA Developer Chat communication system, it is worth learning java chat system _eclipse developed _access database)

BoneCP 是一个高性能的开源java数据库连接池实现库。它的设计初衷就是为了提高数据库连接池的性能，根据某些测试数据发现，BoneCP是最快的连接池。BoneCP很小，只有四十几K（运行时需要slf4j和guava的支持，这二者加起来就不小了），而相比之下 C3P0 要六百多K。(BoneCP is a high-performance open source java database connection pool implementation library. It' s designed to improve the performance of the database connection pool, according to some test data found, BoneCP fastest connection pool. The BoneCP small four dozen K (run-time support for slf4j and guava, both of which add up to not less), contrast C3P0 over six hundred K.)

Banker s Algorithm to protect from deadlock at process schedule.

说明：  java并发编程实战源码 附有本书所有源码，maven 导入 eclipse或idea(Java Concurrent Programming actual source code)

题目：打印出杨辉三角形（要求打印出10行题目：输入3个数a,b,c，按大小顺序输出。 题目：输入数组，最大的与第一个元素交换，最小的与最后一个元素交换，输出数组。 题目：有n个整数，使其前面各数顺序向后移m个位置，最后m个数变成最前面的m个数 题目：编写一个函数，输入n为偶数时，调用函数求1/2+1/4+...+1/n,当输入n为奇数时，调用函数1/1+1/3+...+1/n(Topic: Print out the Triangle (10 lines required to print out the Title: Enter the 3 numbers a, b, c, according to the order of output. Title: input array, the largest exchange with the first element, the smallest and the last element of the exchange, output array. Topic: There are n integers, to move back in front of the order m of the number of positions, finally becoming the foremost m m the number of number of topics: write a function, the input n is even, the call function evaluation 1/2+1/4+...+ 1/n, when the input n is odd, call the function 1/1+1/3+...+ 1/n)