Skip to content

Latest commit

 

History

History
82 lines (48 loc) · 2.94 KB

releaseNotes.md

File metadata and controls

82 lines (48 loc) · 2.94 KB

Release Notes

0.1.1

Bugfixes

  • classes referenced in an array typed parameter of an annotation where not recognized as a dependency. This is fixed.

  • static methods that get referenced didn't create the appropriate dependency riy#53

New Features

  • Degraph is now available from Maven Central, so if you are using it as a library you can specify it in your ´build.gradle´ file or ´pom.xml´ or whatever. The maven syntax for the dependency you need for tests is:

       <dependency>
     <groupId>de.schauderhaft.degraph</groupId>
     <artifactId>degraph-check</artifactId>
     <version>0.1.1</version>
   </dependency>

  • ´.printTo("somepath.graphml")´ you can create a graphml diagram on test failure.

0.1.0

Bugfixes

  • in the previous releases Degraph used DependencyFinder for analyzing dependencies. Unfortunately this missed many dependencies based on java language features post 1.5. I switched to ASM, which finds many more dependencies. Hopefully all, but to be honest: I can't really tell. Bug reports are highly welcome.

New Features

  • Split into three modules:

    • core contains the main logic and algorithm. Use this when you want to build your own stuff based on 'my' algorithms

    • app contains the command line application. Also contains the parser for the configuration files

    • check contains the DSL for testing dependencies in your tests

    Since I strongly believe that a package should exist only in one module, some package names had to change as well.

  • you now can define and test dependency constraints using Java http://schauder.github.io/degraph/documentation.html for details

0.0.4

Bugfixes

  • in previous releases dependencies only used inside a method didn't get picked up by Degraph. This is now fixed.

New Features

0.0.3

includes & excludes now use the ant like syntax used for slicing. This makes them easier to use. They loose some of the theoretical power, but that was of little use for this purpose anyway.

Edges have now smooth corners making following them with the eye easier.

For each slicing a check for circular dependencies is implemented. If a cycle is found all dependencies contributing to that circle get colored red. For each slicing there is at most one circle detected. So after breaking that circle Degraph might confront you with another one. This is a easy to implement solution for the final goal of marking a small as possible set of edges to break in order to get a directed acylcic graph for all slicings

-g option removed

0.0.2

Configuration files introduced. Thereby achieving a usable way to define slices. See https://github.com/schauder/degraph/wiki/Configuration-File-Format for usage

Graph now has nice colors

0.0.1

Basic graph creation