Download JAR files tagged by input with all dependencies

日志模块，集成log4j2, 提供工具类可静态打印日志, 业务可import通用日志配置(中间件配置和业务基础配置)开箱即用， 另外还提供http接口出入参打印和rpc提供者和消费者的出入参打印(有开关可以热启动和热关闭，同时可在线修改日志级别)， traceId在日志中进行输出以及普通文件日志之外的结构化日志( 供运维采集分析可视化)，提供全链路信息（包括tid）跨线程跨线程池的能力 Log module, integrates log4j2, provides tool classes that can print logs statically, business can import common log configurations (middleware configuration and business basic configuration) out of the box, and also provides http interface input and output parameter printing and rpc providers and consumers. Input and output parameter printing (there is a switch for hot start and hot shutdown, and the log level can be modified online), traceId is output in the log and structured logs other than ordinary file logs (for operation and maintenance collection and analysis visualization). The ability to provide full link information (including tid) across threads across thread pools.

This open source software is a reference implementation, consisting of software and related files, for the OMG specification called the Semantics of a Foundational Subset for Executable UML Models (fUML). The reference implementation is intended to implement the execution semantics of UML activity models, accepting an XMI file from a conformant UML model as its input and providing an execution trace of the selected activity model(s) as its output. The core execution engine, which is directly generated from the normative syntactic and semantic models for fUML, may also be used as a library implementation of fUML in other software.

scala-tptp-parser is a library for parsing the input languages of the TPTP infrastructure for knowledge representation and reasoning. The package contains a data structure for the abstract syntax tree (AST) of the parsed input as well as the parser for the different language of the TPTP, see http://tptp.org for details. In particular, parser are available for: - THF (TH0/TH1): Monomorphic and polymorphic higher-order logic, - TFF (TF0/TF1): Monomorphic and polymorphic typed first-order logic, including extended TFF (TFX), - FOF: Untyped first-order logic, - TCF: Typed clause-normal form, - CNF: (Untyped) clause-normal form, and - TPI: TPTP Process Instruction language. The parser was initially based on v7.4.0.3 of the TPTP syntax BNF (http://tptp.org/TPTP/SyntaxBNF.html), but is continuously updated to keep track of TPTP language updates.

Pdf2Dom is a PDF parser that converts the documents to a HTML DOM representation. The obtained DOM tree may be then serialized to a HTML file or further processed. The inline CSS definitions contained in the resulting document are used for making the HTML page as similar as possible to the PDF input. A command-line utility for converting the PDF documents to HTML is included in the distribution package. Pdf2Dom may be also used as an independent Java library with a standard DOM interface for your DOM-based applications or as an alternative parser for the CSSBox rendering engine in order to add the PDF processing capability to CSSBox.

The Attribution Maven Plugin is a tool for producing information about a project's dependencies, in a way that can be consumed by external reporting tools. It currently leverages the Maven Project Info Reports Plugin (https://maven.apache.org/components/plugins/maven-project-info-reports-plugin/) to obtain all of a project's data, and then output the information to an XML file, such as: target/attribution.xml. This plugin came from the need to get some of the same information produced by the Maven Project Info Reports Plugin, and have it ready to be consumed by tools which may require input in a certain format, such as a CSV. By producing an attribution XML file, scripts can be created to translate the data into these other consumable formats.

Simple Validation Parent Project: This is a simple library for quickly adding validation code to Swing user-interfaces. It handles validating user input when the user changes a component's value, showing error messages and decorating components to indicate which component is the source of the problem. It contains a large number of built-in validators to handle most common situations, such as validating numbers, email addresses, urls and so forth.

Suji is a converter library from Japanese number notation to numerical value, and from numerical notation to Japanese Kansuji notation. Converter.values(src) to convert from Japanese number notation to numerical value: Japanese number notation can include Kansuji. The String "１つの価格が二兆30万五千十7円になります。" will be converted to two BigDecimal, 1 and 2000000005017. And also, 打率は三割二部五厘です。 will be a 0.325. The return value is a list of Suji Numeral objects. If the input string has no number notation, Suji returns a empty list. The Numeral object has three methods: value(), begin(), and end(): value(): a BigDecimal instance of a numerical value for the number notation. begin(): the begin index (int) of the found number notation at the input string. end(): the end index (int) of the found number notation. Converter.kansujis(src) to convert from numeric notation to Japanese Kansuji notation: The String 20兆30万五千十7円になります。 will be converted to the Kansuji string, 二十兆三十万五千十七. The boolean flag one is interpreted as whether to display the first character 一 or not. The output of Converter.kansujis('1000万', true) will be converted to 一千万, and the output of Converter.kansujis('1000万', false) will be converted to 千万. Note that kansujis does not support numerical notation after the decimal point. If the input string is 32.01, the output will 三十二, not 三十二割一厘. The return value is a list of Kansuji objects. If the input string has no number notation, Suji returns a empty list. The Kansuji object has three methods: value(), begin(), and end(): value(): a String instance of a Kansuji notation. begin(): the begin index (int) of the found number notation at the input string. end(): the end index (int) of the found number notation. Suji is a one-pass parser. That is, Suji parse a source text from the head to the end only once.

Tool used to analyze a set of classes and determine on what other classes they directly or indirectly depend. Typically this tool is used to compute the necessary and sufficient set of classes to include in a JAR file, for use in the class path of a client or service, or for use in the codebase of a client or service. The tool starts with a set of "root" classes and recursively computes a dependency graph, finding all of the classes referenced directly by the root classes, finding all of the classes referenced in turn by those classes, and so on, until no new classes are found or until classes that are not of interest are found. The normal output of the tool is a list of all of the classes in the dependency graph. The output from this command can be used as input to the jar tool, to create a JAR file containing precisely those classes.