Merge branch 'loadlib'

docs/AllClasses.html

@@ -20,7 +20,9 @@ <h1 class="allitems">All Classes, Interfaces, Objects and Records</h1>
 <tr class="list">
 <td class="itemname"><a class="bold" href="primesieve.primesieve_iterator.html">primesieve_iterator</a></td>
 <td class="itemunit"><a class="bold" href="primesieve.html">primesieve</a></td>
-<td class="itemdesc"><p>&nbsp;</p></td>
+<td class="itemdesc"><p><i>primesieve_iterator</i> allows to easily iterate over primes both forwards and backwards. Generating the first prime has a complexity of <i>O(r log log r)</i> operations with <i>r = n&circ;0.5</i>, after that any additional prime is generated in amortized <i>O(log n log log n)</i> operations. The memory usage is about <i>PrimePi(n&circ;0.5) * 8</i> bytes.
+
+<p>The <i>primesieve_iterator.pas</i> example shows how to use <i>primesieve_iterator</i>. If any error occurs <i>primesieve_next_prime()</i> and <i>primesieve_prev_prime()</i> return <i>PRIMESIEVE_ERROR</i>. Furthermore <i>primesieve_iterator.is_error</i> is initialized to 0 and set to 1 if any error occurs.</p></td>
 </tr>
 </table>
 <hr><span class="appinfo"><em>Generated by <a  href="https://github.com/pasdoc/pasdoc/wiki">PasDoc 0.15.0</a>. </em>

docs/AllConstants.html

@@ -20,17 +20,17 @@ <h1 class="allitems">All Constants</h1>
 <tr class="list">
 <td class="itemname"><a class="bold" href="primesieve.html#INT16_PRIMES">INT16_PRIMES</a></td>
 <td class="itemunit"><a class="bold" href="primesieve.html">primesieve</a></td>
-<td class="itemdesc"><p>Generate primes of int16_t type</p></td>
+<td class="itemdesc"><p>Generate primes of Int16 (c int16_t) type</p></td>
 </tr>
 <tr class="list2">
 <td class="itemname"><a class="bold" href="primesieve.html#INT32_PRIMES">INT32_PRIMES</a></td>
 <td class="itemunit"><a class="bold" href="primesieve.html">primesieve</a></td>
-<td class="itemdesc"><p>Generate primes of int32_t type</p></td>
+<td class="itemdesc"><p>Generate primes of Int32 (c int32_t) type</p></td>
 </tr>
 <tr class="list">
 <td class="itemname"><a class="bold" href="primesieve.html#INT64_PRIMES">INT64_PRIMES</a></td>
 <td class="itemunit"><a class="bold" href="primesieve.html">primesieve</a></td>
-<td class="itemdesc"><p>Generate primes of int64_t type</p></td>
+<td class="itemdesc"><p>Generate primes of Int64 (c int64_t) type</p></td>
 </tr>
 <tr class="list2">
 <td class="itemname"><a class="bold" href="primesieve.html#INT_PRIMES">INT_PRIMES</a></td>
@@ -55,17 +55,17 @@ <h1 class="allitems">All Constants</h1>
 <tr class="list2">
 <td class="itemname"><a class="bold" href="primesieve.html#UINT16_PRIMES">UINT16_PRIMES</a></td>
 <td class="itemunit"><a class="bold" href="primesieve.html">primesieve</a></td>
-<td class="itemdesc"><p>Generate primes of uint16_t type</p></td>
+<td class="itemdesc"><p>Generate primes of UInt16 (c uint16_t) type</p></td>
 </tr>
 <tr class="list">
 <td class="itemname"><a class="bold" href="primesieve.html#UINT32_PRIMES">UINT32_PRIMES</a></td>
 <td class="itemunit"><a class="bold" href="primesieve.html">primesieve</a></td>
-<td class="itemdesc"><p>Generate primes of uint32_t type</p></td>
+<td class="itemdesc"><p>Generate primes of UInt32 (c uint32_t) type</p></td>
 </tr>
 <tr class="list2">
 <td class="itemname"><a class="bold" href="primesieve.html#UINT64_PRIMES">UINT64_PRIMES</a></td>
 <td class="itemunit"><a class="bold" href="primesieve.html">primesieve</a></td>
-<td class="itemdesc"><p>Generate primes of uint64_t type</p></td>
+<td class="itemdesc"><p>Generate primes of UInt64 (c uint64_t) type</p></td>
 </tr>
 <tr class="list">
 <td class="itemname"><a class="bold" href="primesieve.html#UINT_PRIMES">UINT_PRIMES</a></td>
@@ -90,12 +90,12 @@ <h1 class="allitems">All Constants</h1>
 <tr class="list">
 <td class="itemname"><a class="bold" href="primesieve.html#_PRIMESIEVE_ERROR">_PRIMESIEVE_ERROR</a></td>
 <td class="itemunit"><a class="bold" href="primesieve.html">primesieve</a></td>
-<td class="itemdesc"><p>primesieve functions return PRIMESIEVE_ERROR (UINT64_MAX) if any error occurs.</p></td>
+<td class="itemdesc"><p>primesieve functions return <i>PRIMESIEVE_ERROR (UINT64_MAX)</i> if any error occurs.</p></td>
 </tr>
 <tr class="list2">
 <td class="itemname"><a class="bold" href="primesieve.html#_PRIMESIEVE_PAS_VERSION">_PRIMESIEVE_PAS_VERSION</a></td>
 <td class="itemunit"><a class="bold" href="primesieve.html">primesieve</a></td>
-<td class="itemdesc"><p>&nbsp;</p></td>
+<td class="itemdesc"><p>Pascal API version</p></td>
 </tr>
 <tr class="list">
 <td class="itemname"><a class="bold" href="primesieve.html#_PRIMESIEVE_VERSION">_PRIMESIEVE_VERSION</a></td>

docs/AllFunctions.html

@@ -27,14 +27,14 @@ <h1 class="allitems">All Functions and Procedures</h1>
 <td class="itemunit"><a class="bold" href="primesieve.html">primesieve</a></td>
 <td class="itemdesc"><p>Get the next prime.
 
-<p>Returns UINT64_MAX if next prime &gt; 2&circ;64.</p></td>
+<p>Returns <i>UINT64_MAX</i> if next <i>prime &gt; 2&circ;64</i>.</p></td>
 </tr>
 <tr class="list">
 <td class="itemname"><a class="bold" href="primesieve.html#primesieve_prev_prime">primesieve_prev_prime</a></td>
 <td class="itemunit"><a class="bold" href="primesieve.html">primesieve</a></td>
 <td class="itemdesc"><p>Get the previous prime.
 
-<p>primesieve_prev_prime(n) returns 0 for n &lt;= 2. Note that primesieve_next_prime() runs up to 2x faster than primesieve_prev_prime(). Hence if the same algorithm can be written using either primesieve_prev_prime() or primesieve_next_prime() it is preferable to use primesieve_next_prime().</p></td>
+<p><i>primesieve_prev_prime(n)</i> returns 0 for <i>n &lt;= 2</i>. Note that <i>primesieve_next_prime()</i> runs up to 2x faster than <i>primesieve_prev_prime()</i>. Hence if the same algorithm can be written using either <i>primesieve_prev_prime()</i> or <i>primesieve_next_prime()</i> it is preferable to use <i>primesieve_next_prime()</i>.</p></td>
 </tr>
 <tr class="list2">
 <td class="itemname"><a class="bold" href="primesieve.html#unload_libprimesieve">unload_libprimesieve</a></td>