Returns a value indicating the <quote>cost</quote> of inserting the new

entry into a particular branch of the tree. Items will be inserted

down the path of least <function>penalty</function> in the tree.

Values returned by <function>penalty</function> should be non-negative.

If a negative value is returned, it will be treated as zero.

</para>

<para>

if (giststate->penaltyFn[attno].fn_strict== FALSE||

(isNullOrig== FALSE&&isNullAdd== FALSE))

{

FunctionCall3Coll(&giststate->penaltyFn[attno],

giststate->supportCollation[attno],

PointerGetDatum(orig),

PointerGetDatum(add),

PointerGetDatum(&penalty));

if (isnan(penalty)||penalty<0.0)

penalty=0.0;

}

elseif (isNullOrig&&isNullAdd)

penalty=0.0;

penalty=1e10;/* try to preventto mix null and non-null

penalty=1e10;/* try to preventmixing null and non-null

returnpenalty;

}