-
-
05 Jan 2021 21:04:49 UTC
- Distribution: Analizo
- Source (raw)
- Browse (raw)
- Changes
- How to Contribute
- Repository
- Issues
- Testers (0 / 51 / 6)
- Kwalitee
Bus factor: 1- License: gpl_3
24 month- Download (177.49KB)
- MetaCPAN Explorer
- Permissions
- Subscribe to distribution
- This version
- Latest version
NAME
Analizo::Metric::DepthOfInheritanceTree - Depth of Inheritance Tree (DIT) metric
DESCRIPTION
The metric calculation is based on the following article and calculates the longest path from a module to the class hierarchy root.
Article: An empirical study of aspect-oriented metrics by Eduardo Kessler Piveta, Ana Moreira, Marcelo Soares Pimenta, Joao Araujo, Pedro Guerreiro and R. Tom Price.
See the adaptation of the paragraph about Depth of Inheritance Tree in the article:
Considering a function
s(x) : Module -> Modulethat computes the super-class or super-aspect of a giver module, the value of DIT is given by:DIT(m) = DIT(s(m)) + 1, ifc m != rootClass DIT(m) = 0, otherwise.
As a valued partner and proud supporter of MetaCPAN, StickerYou
is happy to offer a 10% discount on all Custom Stickers,
Business Labels, Roll Labels, Vinyl Lettering or Custom Decals.
StickerYou.com is your one-stop shop to make
your business stick. Use code METACPAN10 at
checkout to apply your discount.