An Example - Documenting a Library Module
Author(s): Manuel Hermenegildo.
A simple example of the use of lpdoc is this manual, which can be built in the doc directory of the lpdoc distribution. Other examples of manuals generated using lpdoc can be found in the Ciao system and preprocessor doc directories (i.e., most of the Ciao manuals are generated using lpdoc). Some simpler examples can be found in the examples directory of the lpdoc distribution. In particular, the chapter following this one contains the documentation generated automatically for the module defined by file examples/example_module.pl (which for simplicity contains only assertions, i.e., no actual code) and which is included in source form below. Comparing this code with the output in the following chapter illustrates the use and some of the capabilities of lpdoc:
%% The module headers produce documentation on the module interface
%% Exported predicates (+ properties and types) are documented by default
:- module(example_module,
[bar/1,baz/1,aorb/1,tree_of/2,list_or_aorb/2,q/2,r/1, p/1, p/5, u/3,
long/1, w/1, mytype/1, t/5, s/1, q/1],
[assertions,basicmodes,fsyntax,regtypes,hiord,nativeprops]).
%% We import two types: list/1 and list/2 (now in basic_props, which is
%% exported by default from assertions).
%% We reexport list/1
:- reexport(library(engine(basic_props)),[ list/1 ]).
:- use_module(library(lists), [length/2]).
%:- use_module(bar).
:- ensure_loaded(foo).
%% "doc" declarations provide additional information
:- doc(title,"Auto Documenter Output for the Example Module").
:- doc(author,"Anonymous Author 1").
:- doc(author,"Anonymous Author 2").
:- doc(summary,"This is a brief summary description of the module
or file. In this case the file is a library.").
:- doc(module,"This is where general comments on the file go. In
this case the file is a library which contains some assertion examples
for testing the @em{automatic documentation system}. ").
%% An example of a comment documenting a bug
:- doc(bug,"Library is hard to execute: no actual code!").
%% Standard declarations are documented with the corresponding predicate
:- data r/1.
:- dynamic q/2.
:- multifile p/3.
:- dynamic p/3.
:- meta_predicate p(?,:,?).
%% Uncommenting this would make these not appear in the documentation
%% :- doc(hide,[bar/1,baz/1]).
%% This is a type definition in Prolog syntax: declaration and code
:- true regtype bar(X) # "@var{X} is an acceptable kind of bar.".
bar(night).
bar(day).
%% This is another type definition in Prolog syntax, with no comment.
:- true regtype baz/1.
baz(a).
baz(b).
%% Two type definitions in 'typedef' syntax (will be expanded to code as above)
%% :- typedef aorb ::= ^a;^b.
%% :- typedef listof_or_aorb(X) ::= list(X);aorb.
%% Using functional notation:
:- regtype aorb/1.
aorb := a.
aorb := b.
%% Should use the other function syntax which uses *first argument* for return
:- regtype tree_of/2.
tree_of(_) := void.
tree_of(T) := tree(~call(T),~tree_of(T),~tree_of(T)).
%% tree_of(_, void).
%% tree_of(T, tree(X,L,R)) :-
%% T(X),
%% tree_of(T,L),
%% tree_of(T,R).
:- regtype list_or_aorb/2.
list_or_aorb(T) := ~list(T).
list_or_aorb(_T) := ~aorb.
%% This is a property definition
%% This comment appears only in the place where the property itself
%% is documented.
:- doc(long/1,"This is a property, describing a list that is longish.
The definition is:
@includedef{long/1}
").
%% The comment here will be used to document any predicate which has an
%% assertion which uses the property
:- prop long(L) # "@var{L} is rather long.".
long(L) :-
length(L,N),
N>100.
%% Now, a series of assertions:
%%
%% This declares the entry mode of this exported predicate (i.e.,
%% how it is called from outside).
:- entry p/3 : gnd * var * var.
%% This describes all the calls
:- calls p/3 : foo * bar * baz.
foo(_).
%% This describes the successes (for a given type of calls)
:- success p/3 : int * int * var => int * int * gnd.
%% This describes a global property (for a given type of calls)
:- comp p/3 : int * int * var + not_fails.
:- doc(p/3,"A @bf{general comment} on the predicate." ).
%% Documenting some typical usages of the predicate
:- pred p/3
: int * int * var
=> int * int * list
+ (iso,not_fails)
# "This mode is nice.".
:- pred p(Preds,Value,Assoc)
: var * var * list
=> int * int * list
+ not_fails # "This mode is also nice.".
:- pred p/3
=> list * int * list
+ (not_fails,not_fails)
# "Just playing around.".
:- pred q(A)
: list(A)
=> (list(A),gnd(A))
+ not_fails
# "Foo".
:- pred q(A)
# "Not a bad use at all.".
:- pred q/2
: var * {gnd,int}
=> {gnd,int} * int.
:- pred q/2
:: int * list
# "Non-moded types are best used this way.".
q(_).
:- pred p/1 : var => list.
p(_).
:- pred r(A)
: list(A)
=> (list(A,int),gnd(A))
+ not_fails
# "This uses parametric types".
:- doc(doinclude,s/1). %% Forces documentation even if not exported
:- pred s(A)
: list(A)
=> (list(A),gnd(A))
+ not_fails.
s(_).
:- doc(doinclude,[list/2,list/1]). %% Forces (local) documentation even if
%% not exported
:- modedef og(A)
=> gnd(A)
# "This is a @em{mode} definition: the output is ground.".
:- doc(doinclude,og/2).
:- modedef og(A,T)
:: T(A)
=> gnd(A)
# "This is a @em{parametric mode definition}.".
:- pred t(+A,-B,?C,@D,og(E))
:: list * list * int * int * list
: long(B)
=> (gnd(C),gnd(A))
+ not_fails
# "This predicate uses @em{modes} extensively.".
t(_, _, _, _, _).
%% Some other miscellaneous assertions:
%% Check is default assertion status anyway...
:- check pred u(+,-,og).
:- check pred u(int,list(mytype),int).
u(_, _, _).
%% “true” status is normally compiler output
:- true pred w(+list(mytype)).
mytype(_).
w(_).
:- doc(doinclude,is/2).
:- trust pred is(Num,Expr) : arithexpression(Expr) => num(Num)
# "Typical way to describe/document an external predicate (e.g.,
written in C).".
:- doc(doinclude,p/5).
:- pred p(og(int),in,@list(int),-,+A) + steps_lb(1+length(A)).
p(_, _, _, _, _) :- _ is 1.
%% Version information. The ciao.el emacs mode allows automatic maintenance
