The HalsteadMetrics routine computes Maurice Halstead's software science metrics for each procedure or module contained in the parameter prc. Altogether, there are six metrics, all of which are functions of the following four variables:

n1 = the number of unique operators

n2 = the number of unique operands

N1 = the total number of operators

N2 = the total number of operands

The six software science metrics include:

Vocabulary: $n=\mathrm{n1}+\mathrm{n2}$   (the total number of unique operators and operands)

Length: $N=\mathrm{N1}+\mathrm{N2}$   (the sum of all occurrences of operators and operands)

Volume: $V=N{\log }_2\left(n\right)$   (quantifies the total size of a given procedure)

Program Difficulty: $\mathrm{D}=\frac{\mathrm{n1}\mathrm{N2}}{2\mathrm{n2}}$   (reflects the effort required to understand, code, and maintain a given procedure)

Language Level: $L=\frac{V}{{\mathrm{D}}^2}$   (indicates how well a programmer uses features of the language)

Effort: $E=\mathrm{D}V$   (indicates a level of program complexity in units of time that it takes to write, modify, or maintain a piece of code)

The summarize option (sm) controls how the result is returned.

If the summarize option is omitted (or is given as summarize=false), the result returned is an Array which tabulates the six Halstead metrics along with the operator/operand counts for each procedure and module contained in the parameter prc.

To force the display of large Arrays, you can increase the rtablesize setting using the interface function.

If given as summarize=true, the result returned is an expression sequence containing a row Vector and a listlist structure. The row Vector stores the six Halstead metrics and the listlist structure stores the operator/operand counts. For this case, the metrics are computed just once and take into account all procedures and modules contained in prc.

The condition summarize=true can be abbreviated as summarize.

$\mathrm{with}\left(\mathrm{SoftwareMetrics}\right)\:$

sieve := proc(n::integer)
    local i, k, flags, count, twice_i;
    count := 0;
    for i from 2 to n do flags[i] := true end do;
    for i from 2 to n do
        if flags[i] then
            twice_i := 2*i;
            for k from twice_i by i to n do flags[k] := false end do;
            count := count+1;
        end if;
    end do;
    count;
end proc:

$\mathrm{HalsteadMetrics}\left('\mathrm{sieve}'\right)$

$\left[\begin{array}{ccc}& \mathrm{Halstead\text{'}s\; Metrics}& \mathrm{Operator/Operand\; Count}\\ & \mathrm{[n,N,V,D,L,E]}& \mathrm{[[n1,N1],[n2,N2]]}\\ \mathrm{sieve}& \left[\begin{array}{cccccc}13& 19& 70.30835462& 1.800000000& 21.70010945& 126.5550383\end{array}\right]& \left[\left[3\,7\right]\,\left[10\,12\right]\right]\end{array}\right]$

$\mathrm{HalsteadMetrics}\left('\mathrm{sieve}'\,'\mathrm{summarize}'\right)$

$\left[\begin{array}{cccccc}13& 19& 70.30835462& 1.800000000& 21.70010945& 126.5550383\end{array}\right],\left[\left[3\,7\right]\,\left[10\,12\right]\right]$

$\mathrm{HalsteadMetrics}\left(\left['\mathrm{dsolve}'\,'\mathrm{`dsolve/numeric`}'\right]\right)$

$\left[\begin{array}{ccc}& \mathrm{Halstead\text{'}s\; Metrics}& \mathrm{Operator/Operand\; Count}\\ & \mathrm{[n,N,V,D,L,E]}& \mathrm{[[n1,N1],[n2,N2]]}\\ \mathrm{dsolve}& \left[\begin{array}{cccccc}162& 428& 3141.455801& 44.03846154& 1.619819699& 138344.8805\end{array}\right]& \left[\left[45\,199\right]\,\left[117\,229\right]\right]\\ \mathrm{dsolve/numeric}& \left[\begin{array}{cccccc}580& 2865& 26300.43954& 150.8699187& 1.155467392& 3.967945175\times {10}^6\end{array}\right]& \left[\left[88\,1178\right]\,\left[492\,1687\right]\right]\end{array}\right]$

$\mathrm{HalsteadMetrics}\left('\mathrm{CurveFitting}'\right)$

$\mathrm{HalsteadMetrics}\left('\mathrm{CurveFitting}'\,'\mathrm{summarize}'\right)$

$\left[\begin{array}{cccccc}492& 2947& 26353.59024& 174.3000000& 0.8674511254& 4.593430779\times {10}^6\end{array}\right],\left[\left[82\,1204\right]\,\left[410\,1743\right]\right]$