Search Results for "packages"

...The dependencies between packages need not be defined explicitly. These general dependency rules are based on common design practices what is reflected in preserved package names: "api", "common", "impl" and "factory". As an integral part of CODERU there is a tool checking your code for rules conformance. See coderu rule description on http://coderu.org .

Jadecy (Java Dependencies and Cycles) is a Java library to compute dependencies (elements depended on, or depending), strongly connected components, and cycles, in general directed graphs, or classes or packages dependencies graphs parsed from class files (major version <= 52, else does best effort). It uses Tarjan's algorithm for SCCs computation, and Johnson's algorithm for exhaustive cycles computation, with continuations instead of recursion, which allows to handle large graphs (< 2^31 vertices). Since version 1.1, can also compute shortest cycles covering all edges of SCCs. ...

How good is your software? jmove eases the understanding and valuation of the design and architecture of complex software written in java. It provides dependency analysis, metrics, design rule checking and impact analysis.

JavacTo is a prototype tool designed to evaluate the need and value of translating java code into another programming language. An ideal language for translation is a language that supports the concept of packages, classes, interfaces, and enums as well as built-in memory garbage collection. Languages such as C# and D, are well suited as a translation “To” language. Eclipse project provided to get started. Three visitor classes provided to learn how to use JavacTo and write visitor classes. Vistor javadocs available at: http://docs.oracle.com/javase/8/docs/jdk/api/javac/tree/index.html

[This project is frozen, but has an offspring with more features: https://github.com/jeffhain/jadecy ] JCycles provides treatments to compute cycles, or just strongly connected components, in directed graphs in general, or in classes or packages dependencies graphs parsed from class files (major version <= 51, else does best effort). It uses Tarjan's algorithm for SCCs, and Johnson's for cycles, with continuations instead of recursion, which allows to handle large graphs (< Integer.MAX_VALUE vertices). Requires Java 5 or later.

...It uses the StarUML as a KDM (Knowledge Discovery MetaModel) framework for existing systems. The module provides an incremental reverse engineering for C++ code with a set of configurable options, such as using namespaces or folder as packages, create attributes for relations or handle properties as relations,...

Eclipse Plug-In that determines the Minimal Access Modifier of Java types and methods project and computes the software metrics Inappropriate Generosity with Accessibility of Types (IGAT) and Inappropriate Generosity with Accessibility of Methods (IGAM). The Minimal Access Modifier of a Java type or type member is the most restrictive access modifier that is able to allow all actual usages of the particular type or member from inside a given code base (normally the entire source code of...

Its an Eclipse 3.5 Plugin. It can be used to find linear paths for unit testing of any method. The linear path covers all the child methods and till leaf level of the hierarchy. The packages which should be covered in the path can be controlled.