same elements</li>
<li><a href="qset_r.c#setlarger_quick">qh_setlarger_quick</a> return
True if newsize fits in quick memory </li>
<li><a href="qset_r.c#setreplace">qh_setreplace</a>
replace one element with another in a set</li>
<li><a href="qset_r.c#setunique">qh_setunique</a> add an
element if it is not already in a set </li>
</ul>

<h3><a href="qh-set_r.htm#TOC">&#187;</a><a name="scheck">Check and print functions</a></h3>
<ul>
<li><a href="qset_r.c#setcheck">qh_setcheck</a> check a
set for validity </l