Download JAR files tagged by lock with all dependencies

缓存快速使用相关，可自动从配置中心获取缓存服务器信息，底层实现目前为redis，目前设置了默认序列化策略为json， 提供了易用和更强大的api，同时集成了多级缓存功能，用户可通过注解实现多级缓存功能，提供分布式锁实现 Cache fast usage related, can automatically obtain cache server information from the configuration center, the bottom implementation is redis, the default serialization policy is set to json. Provides an easy to use and more powerful api, while integrating multi-level caching capabilities, users can realize multi-level caching capabilities through annotations, providing distributed lock implementation

JAX-RS generic providers, authenticators and logging filters, an auto-returning pool implementation based on Apache Commons Pooling, a wrapper around Apache Commons Configuration, various assertions for JSON and XML, a Read-Multi-Write lock, Hamcrest Matchers extensions for streams, and many other utilities for handling text, streams, lists, maps, etc. In addition, provides an AWS Cognito SRP filter for JAX-RS and a CLI for it.

manage jar dependencies for gems and keep track which jar was already loaded using maven artifact coordinates. it warns on version conflicts and loads only ONE jar assuming the first one is compatible to the second one otherwise your project needs to lock down the right version by providing a Jars.lock file.

JAX-RS generic providers, authenticators and logging filters, an auto-returning pool implementation based on Apache Commons Pooling, a wrapper around Apache Commons Configuration to make it look like a map, various assertions for JSON and XML, a Read-Multi-Write lock, Hamcrest Matchers extensions for streams, and many other utilities for handling text, streams, lists, maps, etc. In addition, provides an AWS Cognito SRP filter for JAX-RS and a CLI for it, see generate-aws-cognito-srp-authenticator profile for generating it.

An low latency, lock free, primitive bounded blocking queue backed by an int[]. This class mimics the interface of {@linkplain java.util.concurrent.BlockingQueue BlockingQueue}, however works with primitive ints rather than objects, so is unable to actually implement the BlockingQueue. This class takes advantage of the Unsafe.putOrderedObject, which allows us to create non-blocking code with guaranteed writes. These writes will not be re-orderd by instruction reordering. Under the covers it uses the faster store-store barrier, rather than the the slower store-load barrier, which is used when doing a volatile write. One of the trade off with this improved performance is we are limited to a single producer, single consumer.