Changes between Version 13 and Version 14 of Dependency/Functions

Timestamp:

May 9, 2013, 3:51:51 PM (12 years ago)

Author:

manualwiki

Comment:

--

Dependency/Functions

@@ -17 +17 @@
 that the program looks for loops on the given level, and returns with paths of cycles.
 
-In case of vast databases, dependencies can be very complex, and hard to represent. To avoid producing useless, huge dependency graphs, we provide some options that you can use for narrowing down the result. For instance, you can reduce the graph to only contain the cycles, or you can exclude the standard OTP modules from the result. Also, you can ask to only cover dependencies starting from given function(s) or module(s).
+In case of vast databases, dependencies can be very complex, and hard to represent. To avoid producing useless, huge dependency graphs, we provide some options that you can use for narrowing down the result. For instance, you can reduce the graph to only contain the cycles, or you can exclude the standard OTP modules from the result. You can also specify a list of entities, called exceptions, that should be excluded from the analysis. Additionally, you can specify a list of those entities, called leaves, which should be included in the analysis, but their children should not (and consequently the children become exceptions).  Also, you can ask to only cover dependencies starting from given function(s) or module(s).
 
 === Visualisation
@@ -108 +108 @@
 
 {{{#!erlang
-ri:draw_dep([{level, func}, {gnode, "lists:hd/1"}]).
+ri:draw_dep([{level, func}, {gnode, ["lists:hd/1"]}]).
 }}}
 
 {{{#!erlang
-ri:draw_dep([{level, mod},{gnode, {'$gn', module, 4}}]).
+ ri:draw_dep([{level, mod},{gnode, [ri, ris]}]).
 }}}
 
 {{{#!erlang
-ri:draw_dep([{type, cycles}, {level, func}, {gnode, {'$gn', func, 36}}]).
+ri:draw_dep([{type, all}, {level, func}, {gnode, ["ri:q/1"]}, {otp, true}]).
 }}}
+
+{{{#!erlang
+ri:draw_dep([{type, all}, {level, mod}, {otp, true}, {exception, [ri, ris]}, {leaves, [reflib_ui]}]).
+}}}