Sophie

Sophie

distrib > Mageia > 4 > x86_64 > by-pkgid > e8b843ab5e81e8ccd9744ac473f81aca > files > 85

ocaml-camlpdf-devel-0.5-5.mga3.x86_64.rpm

<html>
<head>
<link rel="stylesheet" href="style.css" type="text/css">
<meta content="text/html; charset=iso-8859-1" http-equiv="Content-Type">
<link rel="Start" href="index.html">
<link title="Index of types" rel=Appendix href="index_types.html">
<link title="Index of exceptions" rel=Appendix href="index_exceptions.html">
<link title="Index of values" rel=Appendix href="index_values.html">
<link title="Index of modules" rel=Appendix href="index_modules.html">
<link title="Utility" rel="Chapter" href="Utility.html">
<link title="Istring" rel="Chapter" href="Istring.html">
<link title="Io" rel="Chapter" href="Io.html">
<link title="Unzip" rel="Chapter" href="Unzip.html">
<link title="Pdfio" rel="Chapter" href="Pdfio.html">
<link title="Cgenlex" rel="Chapter" href="Cgenlex.html">
<link title="Zlib" rel="Chapter" href="Zlib.html">
<link title="Transform" rel="Chapter" href="Transform.html">
<link title="Units" rel="Chapter" href="Units.html">
<link title="Paper" rel="Chapter" href="Paper.html">
<link title="Pdf" rel="Chapter" href="Pdf.html">
<link title="Pdfcrypt" rel="Chapter" href="Pdfcrypt.html">
<link title="Pdfwrite" rel="Chapter" href="Pdfwrite.html">
<link title="Pdfcodec" rel="Chapter" href="Pdfcodec.html">
<link title="Pdfread" rel="Chapter" href="Pdfread.html">
<link title="Pdfpages" rel="Chapter" href="Pdfpages.html">
<link title="Pdfdoc" rel="Chapter" href="Pdfdoc.html">
<link title="Pdfannot" rel="Chapter" href="Pdfannot.html">
<link title="Pdffun" rel="Chapter" href="Pdffun.html">
<link title="Pdfspace" rel="Chapter" href="Pdfspace.html">
<link title="Pdfimage" rel="Chapter" href="Pdfimage.html">
<link title="Glyphlist" rel="Chapter" href="Glyphlist.html">
<link title="Pdftext" rel="Chapter" href="Pdftext.html">
<link title="Fonttables" rel="Chapter" href="Fonttables.html">
<link title="Pdfgraphics" rel="Chapter" href="Pdfgraphics.html">
<link title="Pdfshapes" rel="Chapter" href="Pdfshapes.html">
<link title="Pdfmarks" rel="Chapter" href="Pdfmarks.html">
<link title="Pdfdate" rel="Chapter" href="Pdfdate.html">
<link title="Cff" rel="Chapter" href="Cff.html"><title>Index of values</title>
</head>
<body>
<div class="navbar">&nbsp;<a class="up" href="index.html" title="Index">Up</a>
&nbsp;</div>
<h1>Index of values</h1>
<table>
<tr><td align="left"><br></td></tr>
<tr><td><a href="Utility.html#VAL( *.= )">( *.= )</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Operations on floating point references
</div>
</td></tr>
<tr><td><a href="Utility.html#VAL( *= )">( *= )</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Operations on integer references
</div>
</td></tr>
<tr><td><a href="Utility.html#VAL(+.=)">(+.=)</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VAL(+=)">(+=)</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VAL(-.=)">(-.=)</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VAL(-=)">(-=)</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VAL(/.=)">(/.=)</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VAL(/=)">(/=)</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VAL(<|)">(&lt;|)</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
<code class="code">let ( &lt;| ) a b = a b</code>
</div>
</td></tr>
<tr><td><a href="Utility.html#VAL(=@)">(=@)</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Append something to the front of the contents of a list reference.
</div>
</td></tr>
<tr><td><a href="Utility.html#VAL(=|)">(=|)</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Cons something onto the contents of a list reference.
</div>
</td></tr>
<tr><td><a href="Utility.html#VAL(@)">(@)</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VAL(@@)">(@@)</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Append with reversed arguments.
</div>
</td></tr>
<tr><td><a href="Utility.html#VAL(|&|)">(|&amp;|)</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Exclusive OR
</div>
</td></tr>
<tr><td align="left"><br>A</td></tr>
<tr><td><a href="Paper.html#VALa0">a0</a> [<a href="Paper.html">Paper</a>]</td>
<td></td></tr>
<tr><td><a href="Paper.html#VALa1">a1</a> [<a href="Paper.html">Paper</a>]</td>
<td></td></tr>
<tr><td><a href="Paper.html#VALa2">a2</a> [<a href="Paper.html">Paper</a>]</td>
<td></td></tr>
<tr><td><a href="Paper.html#VALa3">a3</a> [<a href="Paper.html">Paper</a>]</td>
<td></td></tr>
<tr><td><a href="Paper.html#VALa4">a4</a> [<a href="Paper.html">Paper</a>]</td>
<td></td></tr>
<tr><td><a href="Paper.html#VALa5">a5</a> [<a href="Paper.html">Paper</a>]</td>
<td></td></tr>
<tr><td><a href="Paper.html#VALa6">a6</a> [<a href="Paper.html">Paper</a>]</td>
<td></td></tr>
<tr><td><a href="Paper.html#VALa7">a7</a> [<a href="Paper.html">Paper</a>]</td>
<td></td></tr>
<tr><td><a href="Paper.html#VALa8">a8</a> [<a href="Paper.html">Paper</a>]</td>
<td><div class="info">
ISO A series paper sizes, portrait.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALadd">add</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
<code class="code">add k v l</code> Adds <code class="code">(k, v)</code> to a dictionary, replacing any existing binding of
<code class="code">k</code>.
</div>
</td></tr>
<tr><td><a href="Pdfmarks.html#VALadd_bookmarks">add_bookmarks</a> [<a href="Pdfmarks.html">Pdfmarks</a>]</td>
<td><div class="info">
Add bookmarks to a document, replacing any currently there.
</div>
</td></tr>
<tr><td><a href="Pdf.html#VALadd_dict_entry">add_dict_entry</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
Add a dictionary entry, replacing if already there.
</div>
</td></tr>
<tr><td><a href="Pdfdoc.html#VALadd_pagetree">add_pagetree</a> [<a href="Pdfdoc.html">Pdfdoc</a>]</td>
<td><div class="info">
Build a page tree from a list of pages and install it in the given PDF
document.
</div>
</td></tr>
<tr><td><a href="Pdfdoc.html#VALadd_root">add_root</a> [<a href="Pdfdoc.html">Pdfdoc</a>]</td>
<td><div class="info">
Given the page root number (for instance that returned by <code class="code">add_pagetree</code>),
any specific extra dictionary entries and a PDF document, build a document root.
</div>
</td></tr>
<tr><td><a href="Pdf.html#VALaddobj">addobj</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
Add an object.
</div>
</td></tr>
<tr><td><a href="Pdf.html#VALaddobj_given_num">addobj_given_num</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
Same, but pick a number ourselves.
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALalign">align</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Align on a byte boundary
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALalign_write">align_write</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Byte-align.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALall_but_last">all_but_last</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Produce a list containing all but the last element of a list.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALalways">always</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
The always-true predicate.
</div>
</td></tr>
<tr><td><a href="Pdfannot.html#VALannotations_of_page">annotations_of_page</a> [<a href="Pdfannot.html">Pdfannot</a>]</td>
<td><div class="info">
Return the annotations on a page in a document.
</div>
</td></tr>
<tr><td><a href="Transform.html#VALappend">append</a> [<a href="Transform.html">Transform</a>]</td>
<td><div class="info">
<code class="code">append a b</code> is a transform with the same effect as performing b then a
</div>
</td></tr>
<tr><td><a href="Utility.html#VALappend">append</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALapplyn">applyn</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Apply a function <code class="code">f</code> <code class="code">n</code> times to initial argument <code class="code">arg</code>.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALarray_iter2">array_iter2</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
<code class="code">iter2</code> on arrays.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALarray_map2">array_map2</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
<code class="code">map2</code> on arrays.
</div>
</td></tr>
<tr><td align="left"><br>B</td></tr>
<tr><td><a href="Pdfgraphics.html#VALbbox_of_graphic">bbox_of_graphic</a> [<a href="Pdfgraphics.html">Pdfgraphics</a>]</td>
<td><div class="info">
Bounding box xmin, xmax, ymin, yman of a graphic
</div>
</td></tr>
<tr><td><a href="Utility.html#VALbetween">between</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Find the point equidistant between two others.
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALbitstream_of_input">bitstream_of_input</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Make a bitstream from an input.
</div>
</td></tr>
<tr><td><a href="Pdfdoc.html#VALblankpage">blankpage</a> [<a href="Pdfdoc.html">Pdfdoc</a>]</td>
<td><div class="info">
Create a page with empty content, media box from the given paper size, empty
resources, zero rotation and no extra dictionary entries.
</div>
</td></tr>
<tr><td><a href="Istring.html#VALblit">blit</a> [<a href="Istring.html">Istring</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALbytestream_of_arraylist">bytestream_of_arraylist</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Make a bytestream from a list of integer arrays.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALbytestream_of_charlist">bytestream_of_charlist</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Make a bytestream from a character list.
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALbytestream_of_input_channel">bytestream_of_input_channel</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Extract a bytestream from an input or output.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALbytestream_of_list">bytestream_of_list</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Make a bytestream from an integer list.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALbytestream_of_string">bytestream_of_string</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Make a bytestream from a string, no terminator.
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALbytestream_of_write_bitstream">bytestream_of_write_bitstream</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Build a bytestream from a write bitstream, padding with zeroes.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALbytestream_sub">bytestream_sub</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
<code class="code">bytestream_sub b s l</code> builds a new bytestream from the section of b starting at s with length l
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALbytestream_to_output_channel">bytestream_to_output_channel</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Write a bytestream to an output channel
</div>
</td></tr>
<tr><td align="left"><br>C</td></tr>
<tr><td><a href="Pdfdoc.html#VALchange_pages">change_pages</a> [<a href="Pdfdoc.html">Pdfdoc</a>]</td>
<td><div class="info">
Change the pages in a document for some new ones.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALcharlist_of_bytestream">charlist_of_bytestream</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Make a character list from a byte stream
</div>
</td></tr>
<tr><td><a href="Pdfshapes.html#VALcircle">circle</a> [<a href="Pdfshapes.html">Pdfshapes</a>]</td>
<td><div class="info">
Calling <code class="code">circle x y r</code> builds a path representing a circle at <code class="code">(x, y)</code> with
radius <code class="code">r</code>.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALclear">clear</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Set a boolean reference to <code class="code">false</code>
</div>
</td></tr>
<tr><td><a href="Utility.html#VALcleave">cleave</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
<code class="code">cleave l n</code> splits <code class="code">l</code> into two parts, returned as a tuple.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALcleavewhile">cleavewhile</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Same, but split point controlled by a predicate, which is true for elements
in the first returned list.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALcleavewhile_unordered">cleavewhile_unordered</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
The same, but the output lists are each unordered.
</div>
</td></tr>
<tr><td><a href="Io.html#VALclose_in">close_in</a> [<a href="Io.html">Io</a>]</td>
<td><div class="info">
Close the input.
</div>
</td></tr>
<tr><td><a href="Pdftext.html#VALcodepoints_of_text">codepoints_of_text</a> [<a href="Pdftext.html">Pdftext</a>]</td>
<td><div class="info">
Return a list of unicode points from a given extractor and string (for
example from a <code class="code">Pdfpages.Op_Tj</code> or <code class="code">Op_TJ</code> operator).
</div>
</td></tr>
<tr><td><a href="Pdftext.html#VALcodepoints_of_textstring">codepoints_of_textstring</a> [<a href="Pdftext.html">Pdftext</a>]</td>
<td><div class="info">
Read the codepoints in a PDF text string, unicode or PDFDocEncoding.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALcollate">collate</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Collate a list into a list of lists based upon a comparison function by which
it has already been sorted.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALcombine">combine</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALcombine3">combine3</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALcompare_i">compare_i</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Monomorphic integer version of <code class="code">Pervasives.compare</code>
</div>
</td></tr>
<tr><td><a href="Transform.html#VALcompose">compose</a> [<a href="Transform.html">Transform</a>]</td>
<td><div class="info">
<code class="code">compose t ts</code> adds operation <code class="code">t</code> to the transform <code class="code">ts</code>.
</div>
</td></tr>
<tr><td><a href="Zlib.html#VALcompress">compress</a> [<a href="Zlib.html">Zlib</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALconspair">conspair</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Consing to each of a pair of lists at the same time.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALconspairopt">conspairopt</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Version where there may or may not be somthing to cons in each case.
</div>
</td></tr>
<tr><td><a href="Units.html#VALconvert">convert</a> [<a href="Units.html">Units</a>]</td>
<td><div class="info">
<code class="code">convert d u u'</code> produces a convertor converting from unit <code class="code">u</code> to <code class="code">u'</code> with
dpi <code class="code">d</code>
</div>
</td></tr>
<tr><td><a href="Utility.html#VALcopystream">copystream</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Copy a bytestream.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALcouple">couple</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Couple the elements of a list <code class="code">l</code> using function <code class="code">f</code>.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALcouple_ext">couple_ext</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
As <code class="code">couple</code>, but an extra function <code class="code">g</code> is applied to any last (odd) element.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALcouple_reduce">couple_reduce</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Apply <code class="code">couple</code> repeatedly until only one element remains.
</div>
</td></tr>
<tr><td><a href="Istring.html#VALcreate">create</a> [<a href="Istring.html">Istring</a>]</td>
<td></td></tr>
<tr><td><a href="Io.html#VALcreate_in">create_in</a> [<a href="Io.html">Io</a>]</td>
<td><div class="info">
Creation of IO Inputs/Outputs
</div>
</td></tr>
<tr><td><a href="Utility.html#VALcumulative_sum">cumulative_sum</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Cumulative sum of a list given an initial value.
</div>
</td></tr>
<tr><td><a href="Pdfdoc.html#VALcustompage">custompage</a> [<a href="Pdfdoc.html">Pdfdoc</a>]</td>
<td><div class="info">
The same, but given a page size rectangle.
</div>
</td></tr>
<tr><td align="left"><br>D</td></tr>
<tr><td><a href="Pdfdate.html#VALdate_of_string">date_of_string</a> [<a href="Pdfdate.html">Pdfdate</a>]</td>
<td><div class="info">
Build a date by parsing a PDF date string.
</div>
</td></tr>
<tr><td><a href="Pdftext.html#VALdecode_char">decode_char</a> [<a href="Pdftext.html">Pdftext</a>]</td>
<td><div class="info">
Decode a single character code in a standard font
</div>
</td></tr>
<tr><td><a href="Pdfcodec.html#VALdecode_pdfstream">decode_pdfstream</a> [<a href="Pdfcodec.html">Pdfcodec</a>]</td>
<td><div class="info">
Given a document and stream, decode.
</div>
</td></tr>
<tr><td><a href="Pdfcodec.html#VALdecode_pdfstream_onestage">decode_pdfstream_onestage</a> [<a href="Pdfcodec.html">Pdfcodec</a>]</td>
<td><div class="info">
Given a document and stream decode just one stage.
</div>
</td></tr>
<tr><td><a href="Pdfcodec.html#VALdecode_pdfstream_until_unknown">decode_pdfstream_until_unknown</a> [<a href="Pdfcodec.html">Pdfcodec</a>]</td>
<td><div class="info">
Given a document and stream decode until there's an unknown decoder.
</div>
</td></tr>
<tr><td><a href="Pdftext.html#VALdecode_type3_char">decode_type3_char</a> [<a href="Pdftext.html">Pdftext</a>]</td>
<td><div class="info">
Decode a single character code in a type3 font to a glyph name
</div>
</td></tr>
<tr><td><a href="Transform.html#VALdecompose">decompose</a> [<a href="Transform.html">Transform</a>]</td>
<td><div class="info">
Decompose a transformation matrix to scale, aspect, rotation, shear,
translation in x, translation in y.
</div>
</td></tr>
<tr><td><a href="Pdfcrypt.html#VALdecrypt_pdf">decrypt_pdf</a> [<a href="Pdfcrypt.html">Pdfcrypt</a>]</td>
<td><div class="info">
Decrypt a PDF document, given the user password, returning the permissions
under which the document was encrypted.
</div>
</td></tr>
<tr><td><a href="Pdfcrypt.html#VALdecrypt_pdf_owner">decrypt_pdf_owner</a> [<a href="Pdfcrypt.html">Pdfcrypt</a>]</td>
<td><div class="info">
Decrypt a PDF document, given the owner password.
</div>
</td></tr>
<tr><td><a href="Zlib.html#VALdeflate">deflate</a> [<a href="Zlib.html">Zlib</a>]</td>
<td></td></tr>
<tr><td><a href="Zlib.html#VALdeflate_end">deflate_end</a> [<a href="Zlib.html">Zlib</a>]</td>
<td></td></tr>
<tr><td><a href="Zlib.html#VALdeflate_init">deflate_init</a> [<a href="Zlib.html">Zlib</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALdeg_of_rad">deg_of_rad</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Convert between radians and degrees.
</div>
</td></tr>
<tr><td><a href="Glyphlist.html#VALdingbatmap">dingbatmap</a> [<a href="Glyphlist.html">Glyphlist</a>]</td>
<td><div class="info">
A ZapfDingbats glyph list
</div>
</td></tr>
<tr><td><a href="Pdf.html#VALdirect">direct</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
Make a PDF object direct -- that is, follow any indirect links.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALdistance_between">distance_between</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Cartesian distance between two points.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALdo_many">do_many</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
<code class="code">do_many f n</code> calls <code class="code">f ()</code> n times.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALdo_return">do_return</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
<code class="code">do_return f g</code> Evaluate <code class="code">f ()</code>, evaluate and ignore <code class="code">g ()</code>, return <code class="code">f ()</code>, in that order.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALdp_print">dp_print</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Set debug printing on or off.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALdpr">dpr</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Debug print a string if <code class="code">dp_print</code> is set.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALdrop">drop</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
<code class="code">drop l n</code> drops <code class="code">n</code> elements from the list raising <code class="code">Invalid_argument</code> if n
 &lt; 0 or there are not enough elements.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALdrop'">drop'</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Same, arguments reversed.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALdrop_evens">drop_evens</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Remove the second, fourth etc.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALdrop_odds">drop_odds</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Remove the first, third etc.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALdropwhile">dropwhile</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
drop elements from a list while a given predicate is true.
</div>
</td></tr>
<tr><td align="left"><br>E</td></tr>
<tr><td><a href="Pdf.html#VALempty">empty</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
The empty document (PDF 1.0, no objects, no root, empty trailer dictionary).
</div>
</td></tr>
<tr><td><a href="Pdfcodec.html#VALencode_pdfstream">encode_pdfstream</a> [<a href="Pdfcodec.html">Pdfcodec</a>]</td>
<td><div class="info">
Encode a PDF stream with an encoding.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALeq">eq</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Equality.
</div>
</td></tr>
<tr><td><a href="Pdffun.html#VALeval_function">eval_function</a> [<a href="Pdffun.html">Pdffun</a>]</td>
<td><div class="info">
Evaluate a function given a list of inputs.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALeven">even</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALexplode">explode</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
List of characters representing a string.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALextremes">extremes</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Find the first and last element of a list.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALextremes_and_middle">extremes_and_middle</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Return the first, middle and last elements of a list which has length at
least two.
</div>
</td></tr>
<tr><td align="left"><br>F</td></tr>
<tr><td><a href="Utility.html#VALfabs">fabs</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Monomorphic floating-point versions of <code class="code">Pervasives</code> functions
</div>
</td></tr>
<tr><td><a href="Utility.html#VALfillstream">fillstream</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Fill a stream with a value
</div>
</td></tr>
<tr><td><a href="Utility.html#VALfirstchar">firstchar</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Return the first character of a string, should it have one.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALflatten">flatten</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALflip">flip</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Flip a boolean reference
</div>
</td></tr>
<tr><td><a href="Utility.html#VALflprint">flprint</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Print a string and flush standard output.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALfmax">fmax</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALfmin">fmin</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALfold_left">fold_left</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALfold_right">fold_right</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td align="left"><br>G</td></tr>
<tr><td><a href="Istring.html#VALget">get</a> [<a href="Istring.html">Istring</a>]</td>
<td></td></tr>
<tr><td><a href="Pdfimage.html#VALget_image">get_image</a> [<a href="Pdfimage.html">Pdfimage</a>]</td>
<td><div class="info">
Similarly, but if it's to be Raw, use the smallest pixel layout required to
represent the data.
</div>
</td></tr>
<tr><td><a href="Pdfimage.html#VALget_image_24bpp">get_image_24bpp</a> [<a href="Pdfimage.html">Pdfimage</a>]</td>
<td><div class="info">
Given a pdf document, resources dictionary and a stream representing an
image, return a triple : width, height, and a stream of (width * height * 3)
bytes RGBRGB etc.
</div>
</td></tr>
<tr><td><a href="Pdfimage.html#VALget_image_raw">get_image_raw</a> [<a href="Pdfimage.html">Pdfimage</a>]</td>
<td><div class="info">
Get the uncompressed image contents, decoding JPEG, JPEG2000 and JBIG2 as
required.
</div>
</td></tr>
<tr><td><a href="Pdfimage.html#VALget_image_raw_24bpp">get_image_raw_24bpp</a> [<a href="Pdfimage.html">Pdfimage</a>]</td>
<td><div class="info">
Get the uncompressed image contents in 24bpp, decoding JPEG, JPEG2000 and JBIG2 as
required.
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALgetbit">getbit</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Get a bit
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALgetbitint">getbitint</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Ditto but as an integer, 0 or 1.
</div>
</td></tr>
<tr><td><a href="Pdf.html#VALgetnum">getnum</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
Return a float from either a <code class="code">Real</code> or an <code class="code">Int</code>
</div>
</td></tr>
<tr><td><a href="Pdf.html#VALgetstream">getstream</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
Get a stream from disc if it hasn't already been got.
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALgetval_32">getval_32</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Get a 32-bit value
</div>
</td></tr>
<tr><td><a href="Glyphlist.html#VALglyphmap">glyphmap</a> [<a href="Glyphlist.html">Glyphlist</a>]</td>
<td><div class="info">
The Adobe Glyph List
</div>
</td></tr>
<tr><td><a href="Pdfgraphics.html#VALgraphic_of_ops">graphic_of_ops</a> [<a href="Pdfgraphics.html">Pdfgraphics</a>]</td>
<td><div class="info">
Make a graphic from a simple string.
</div>
</td></tr>
<tr><td><a href="Pdfgraphics.html#VALgraphic_of_page">graphic_of_page</a> [<a href="Pdfgraphics.html">Pdfgraphics</a>]</td>
<td><div class="info">
Make a graphic from operations.
</div>
</td></tr>
<tr><td align="left"><br>H</td></tr>
<tr><td><a href="Utility.html#VALhashtable_of_dictionary">hashtable_of_dictionary</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Build a hashtable from a dictionary (list of key-value pairs).
</div>
</td></tr>
<tr><td><a href="Utility.html#VALhd">hd</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALheads">heads</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Return a list of the heads of a list of lists, each of which has at least
one element, preserving order.
</div>
</td></tr>
<tr><td><a href="Paper.html#VALheight">height</a> [<a href="Paper.html">Paper</a>]</td>
<td><div class="info">
Project the height from a paper size.
</div>
</td></tr>
<tr><td align="left"><br>I</td></tr>
<tr><td><a href="Transform.html#VALi">i</a> [<a href="Transform.html">Transform</a>]</td>
<td><div class="info">
The identity transform
</div>
</td></tr>
<tr><td><a href="Utility.html#VALi32add">i32add</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALi32div">i32div</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALi32max">i32max</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALi32min">i32min</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALi32mul">i32mul</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALi32ofi">i32ofi</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALi32pred">i32pred</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALi32sub">i32sub</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALi32succ">i32succ</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALi32tof">i32tof</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALi32toi">i32toi</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALi64add">i64add</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALi64div">i64div</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALi64max">i64max</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALi64min">i64min</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALi64mul">i64mul</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALi64ofi">i64ofi</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALi64pred">i64pred</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALi64sub">i64sub</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALi64succ">i64succ</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALi64toi">i64toi</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Transform.html#VALi_matrix">i_matrix</a> [<a href="Transform.html">Transform</a>]</td>
<td><div class="info">
The identity matrix
</div>
</td></tr>
<tr><td><a href="Utility.html#VALident">ident</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
The identity function.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALilist">ilist</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
<code class="code">ilist 2 5</code> returns <code class="code">[2; 3; 4; 5]</code>.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALilist_fail_null">ilist_fail_null</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Same as ilist_null, but return empty list if start &gt; end, instead of failing
</div>
</td></tr>
<tr><td><a href="Utility.html#VALilist_null">ilist_null</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Same, but return null list for ilist x x rather than <code class="code">x</code>
</div>
</td></tr>
<tr><td><a href="Utility.html#VALimplode">implode</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
String representing a list of characters.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALindex">index</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Find the position of the first element matching a predicate.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALindx">indx</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
<code class="code">indx l</code> returns <code class="code">1; 2; 3</code> if <code class="code">l</code> has length 3, for example.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALindx0">indx0</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Same, but 0-based.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALindxn">indxn</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Same, but n-based.
</div>
</td></tr>
<tr><td><a href="Zlib.html#VALinflate">inflate</a> [<a href="Zlib.html">Zlib</a>]</td>
<td></td></tr>
<tr><td><a href="Unzip.html#VALinflate">inflate</a> [<a href="Unzip.html">Unzip</a>]</td>
<td><div class="info">
wrap an input using "inflate" decompression algorithm.
</div>
</td></tr>
<tr><td><a href="Zlib.html#VALinflate_end">inflate_end</a> [<a href="Zlib.html">Zlib</a>]</td>
<td></td></tr>
<tr><td><a href="Zlib.html#VALinflate_init">inflate_init</a> [<a href="Zlib.html">Zlib</a>]</td>
<td></td></tr>
<tr><td><a href="Pdfio.html#VALinput_of_bytestream">input_of_bytestream</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td></td></tr>
<tr><td><a href="Pdfio.html#VALinput_of_channel">input_of_channel</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td></td></tr>
<tr><td><a href="Pdfio.html#VALinput_of_stream">input_of_stream</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td></td></tr>
<tr><td><a href="Pdfio.html#VALinput_of_string">input_of_string</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Convert between various input and output and data types.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALint_array_of_stream">int_array_of_stream</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
An integer array of bytes from a stream
</div>
</td></tr>
<tr><td><a href="Utility.html#VALint_array_of_string">int_array_of_string</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Integer array from a string
</div>
</td></tr>
<tr><td><a href="Pdfdoc.html#VALint_of_rotation">int_of_rotation</a> [<a href="Pdfdoc.html">Pdfdoc</a>]</td>
<td><div class="info">
Utility function to convert from rotation to integers.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALinterleave">interleave</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Interleave an element among a list, so that <code class="code">interleave 0 [1; 2; 3]</code>
yields <code class="code">[1; 0; 2; 0; 3]</code>.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALinterleave_lists">interleave_lists</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Interleave two equal-length lists, taking from the first list first.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALinvert">invert</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Invert a vector.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALisdigit">isdigit</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
A character is a decimal digit.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALisnull">isnull</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALisolate">isolate</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Isolate a central section of a list, from the first element after the element
for which predicate <code class="code">p</code> is true, to the element before <code class="code">p'</code> is first true.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALiter">iter</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALiter2">iter2</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALiter3">iter3</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Pdf.html#VALiter_stream">iter_stream</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
Iterate over just the stream objects in a document.
</div>
</td></tr>
<tr><td align="left"><br>J</td></tr>
<tr><td><a href="Pdfio.html#VALjoin_write_bitstreams">join_write_bitstreams</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Join several write bitstreams
</div>
</td></tr>
<tr><td align="left"><br>K</td></tr>
<tr><td><a href="Pdfshapes.html#VALkappa">kappa</a> [<a href="Pdfshapes.html">Pdfshapes</a>]</td>
<td><div class="info">
The factor by which the radius of a circle is multiplied to find the length
of the bezier control lines when approximating quarter arcs to make circles.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALkeep">keep</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td align="left"><br>L</td></tr>
<tr><td><a href="Utility.html#VALland32">land32</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Paper.html#VALlandscape">landscape</a> [<a href="Paper.html">Paper</a>]</td>
<td><div class="info">
Flip a paper size between landscape and portrait, swapping its dimensions.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALlargest_pow2_divisible">largest_pow2_divisible</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
The largest power of two by which a number is exactly divisible.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALlast">last</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Find the last element of a list.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALlastchar">lastchar</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Return the first character of a string, should it have one.
</div>
</td></tr>
<tr><td><a href="Pdftext.html#VALlatin1_string_of_text">latin1_string_of_text</a> [<a href="Pdftext.html">Pdftext</a>]</td>
<td><div class="info">
Same, but return Latin1 (Lossy)
</div>
</td></tr>
<tr><td><a href="Utility.html#VALlcount">lcount</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Count the number of elements matchin a predicate.
</div>
</td></tr>
<tr><td><a href="Istring.html#VALlength">length</a> [<a href="Istring.html">Istring</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALlength">length</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Cgenlex.html#VALlex">lex</a> [<a href="Cgenlex.html">Cgenlex</a>]</td>
<td></td></tr>
<tr><td><a href="Cgenlex.html#VALlex_string">lex_string</a> [<a href="Cgenlex.html">Cgenlex</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALlist_of_hashtbl">list_of_hashtbl</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Make a list of key-value pairs reflecting the contents of a hash table.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALlist_of_q">list_of_q</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
All the elements of a queue
</div>
</td></tr>
<tr><td><a href="Utility.html#VALlog2of">log2of</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Base two logarithm
</div>
</td></tr>
<tr><td><a href="Utility.html#VALlookup">lookup</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
<code class="code">lookup x l</code> looks up something, returning <code class="code">None</code> if not found.
</div>
</td></tr>
<tr><td><a href="Pdf.html#VALlookup_direct">lookup_direct</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
<code class="code">lookup_direct doc key dict</code> looks up the key returning an option type.
</div>
</td></tr>
<tr><td><a href="Pdf.html#VALlookup_direct_orelse">lookup_direct_orelse</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
Same, but allow alternative key.
</div>
</td></tr>
<tr><td><a href="Pdf.html#VALlookup_exception">lookup_exception</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
Same, but with customised exception.
</div>
</td></tr>
<tr><td><a href="Pdf.html#VALlookup_fail">lookup_fail</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
<code class="code">lookup_fail errtext doc key dict</code> looks up a key in a PDF dictionary or the
dictionary of a PDF stream.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALlookup_failnull">lookup_failnull</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Same, but no option type.
</div>
</td></tr>
<tr><td><a href="Pdf.html#VALlookup_obj">lookup_obj</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
Lookup an object in a document, parsing it if required.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALlor32">lor32</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALlor64">lor64</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALlose">lose</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
<code class="code">List.filter</code> has a confusing name, so we define <code class="code">keep</code> and <code class="code">lose</code> to avoid
error.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALlsl32">lsl32</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALlsl64">lsl64</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALlsr32">lsr32</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALlsr64">lsr64</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALlxor32">lxor32</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td align="left"><br>M</td></tr>
<tr><td><a href="Paper.html#VALmake">make</a> [<a href="Paper.html">Paper</a>]</td>
<td><div class="info">
Make a paper size given its unit, width and height.
</div>
</td></tr>
<tr><td><a href="Istring.html#VALmake">make</a> [<a href="Istring.html">Istring</a>]</td>
<td></td></tr>
<tr><td><a href="Pdf.html#VALmake_matrix">make_matrix</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
Build a matrix <code class="code">pdfobject</code>.
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALmake_write_bitstream">make_write_bitstream</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Return a new write bistream.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALmany">many</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
<code class="code">many x n</code> makes a list of length <code class="code">n</code> with each element equal to <code class="code">x</code>.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALmanyunique">manyunique</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
A version where we need to apply unit each time, for instance when producing
a list of random numbers.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALmap">map</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALmap2">map2</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALmap3">map3</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Similar to <code class="code">map2</code>, but 3 arguments.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALmap4">map4</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Similar to <code class="code">map2</code>, but 4 arguments.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALmap5">map5</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Similar to <code class="code">map2</code>, but 5 arguments.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALmap_lol">map_lol</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Map on lists of lists.
</div>
</td></tr>
<tr><td><a href="Pdf.html#VALmap_stream">map_stream</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
Map over just the stream objects in a document.
</div>
</td></tr>
<tr><td><a href="Transform.html#VALmatrix_compose">matrix_compose</a> [<a href="Transform.html">Transform</a>]</td>
<td><div class="info">
<code class="code">compose a b</code> produces a matrix equivalent to performing <code class="code">b</code> then <code class="code">a</code>.
</div>
</td></tr>
<tr><td><a href="Transform.html#VALmatrix_invert">matrix_invert</a> [<a href="Transform.html">Transform</a>]</td>
<td><div class="info">
Matrix inversion.
</div>
</td></tr>
<tr><td><a href="Transform.html#VALmatrix_of_op">matrix_of_op</a> [<a href="Transform.html">Transform</a>]</td>
<td><div class="info">
Make a matrix from a single transformation operation
</div>
</td></tr>
<tr><td><a href="Transform.html#VALmatrix_of_transform">matrix_of_transform</a> [<a href="Transform.html">Transform</a>]</td>
<td><div class="info">
Make a matrix from a transform
</div>
</td></tr>
<tr><td><a href="Utility.html#VALmax">max</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Monomorphic integer versions of <code class="code">Pervasives</code> functions.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALmegabytes">megabytes</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
<code class="code">megabytes x</code> is <code class="code">x * 1024 * 1024</code>
</div>
</td></tr>
<tr><td><a href="Utility.html#VALmem">mem</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Synonym for <code class="code">List.mem</code>.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALmem'">mem'</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
<code class="code">List.mem</code> with arguments reversed.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALmergedict">mergedict</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Merge two lists, preferring elements in the second in the case of clashes.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALmin">min</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Transform.html#VALmkrotate">mkrotate</a> [<a href="Transform.html">Transform</a>]</td>
<td></td></tr>
<tr><td><a href="Transform.html#VALmkscale">mkscale</a> [<a href="Transform.html">Transform</a>]</td>
<td></td></tr>
<tr><td><a href="Transform.html#VALmkshearx">mkshearx</a> [<a href="Transform.html">Transform</a>]</td>
<td></td></tr>
<tr><td><a href="Transform.html#VALmksheary">mksheary</a> [<a href="Transform.html">Transform</a>]</td>
<td><div class="info">
Low-level functions to create transformation matrices
</div>
</td></tr>
<tr><td><a href="Utility.html#VALmkstream">mkstream</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Make from a given size.
</div>
</td></tr>
<tr><td><a href="Transform.html#VALmktranslate">mktranslate</a> [<a href="Transform.html">Transform</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALmkunit">mkunit</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
<code class="code">mkunit f x</code> gives <code class="code">fun () -&gt; f x</code>
</div>
</td></tr>
<tr><td><a href="Utility.html#VALmkunitvector">mkunitvector</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Make a unit vector in the direction from one point to a second.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALmkvector">mkvector</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
<code class="code">mkvector (a, b) (c, d)</code> makes a vector from point <code class="code">(a, b)</code> to point <code class="code">(c, d)</code>.
</div>
</td></tr>
<tr><td align="left"><br>N</td></tr>
<tr><td><a href="Pdfspace.html#VALname_of_colourspace">name_of_colourspace</a> [<a href="Pdfspace.html">Pdfspace</a>]</td>
<td><div class="info">
Read the name of a colour, if it has one
</div>
</td></tr>
<tr><td><a href="Utility.html#VALneq">neq</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Inequality.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALnever">never</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
The always-false predicate.
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALno_more">no_more</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
A distinguished byte value indicating "no more input"
</div>
</td></tr>
<tr><td><a href="Utility.html#VALnone">none</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Predicates on the someness or noneness of an <code class="code">'a option</code>.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALnotnull">notnull</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Predicates on the nullness of a list.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALnotpred">notpred</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Invert a predicate.
</div>
</td></tr>
<tr><td><a href="Io.html#VALnread">nread</a> [<a href="Io.html">Io</a>]</td>
<td><div class="info">
Standard API
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALnudge">nudge</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Move forward one character
</div>
</td></tr>
<tr><td><a href="Utility.html#VALnull_hash">null_hash</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
The empty zero-sized hash table.
</div>
</td></tr>
<tr><td align="left"><br>O</td></tr>
<tr><td><a href="Pdf.html#VALobjcard">objcard</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
Return the cardinality of the object map.
</div>
</td></tr>
<tr><td><a href="Pdf.html#VALobjiter">objiter</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
Iterate over the objects in a document.
</div>
</td></tr>
<tr><td><a href="Pdf.html#VALobjiter_gen">objiter_gen</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
Iterate over the objects in a document.
</div>
</td></tr>
<tr><td><a href="Pdf.html#VALobjmap">objmap</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
Map over all pdf objects in a document.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALodd">odd</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Even and odd predicates on integers.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALoffset_point">offset_point</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Offset a point by a vector.
</div>
</td></tr>
<tr><td><a href="Pdfgraphics.html#VALops_of_simple_graphic">ops_of_simple_graphic</a> [<a href="Pdfgraphics.html">Pdfgraphics</a>]</td>
<td><div class="info">
Operations from a simple graphic (i.e no need for resources etc.)
</div>
</td></tr>
<tr><td><a href="Utility.html#VALoption_map">option_map</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Map with a function returning an option, dropping all None results and extracting all Some ones.
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALoutput_of_channel">output_of_channel</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td></td></tr>
<tr><td><a href="Pdfio.html#VALoutput_of_stream">output_of_stream</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td></td></tr>
<tr><td><a href="Pdfio.html#VALoutput_string">output_string</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Output a string.
</div>
</td></tr>
<tr><td align="left"><br>P</td></tr>
<tr><td><a href="Pdfgraphics.html#VALpage_of_graphic">page_of_graphic</a> [<a href="Pdfgraphics.html">Pdfgraphics</a>]</td>
<td><div class="info">
Flatten a graphic to a list of operations and replace the operations in a
page by them, returning the new page.
</div>
</td></tr>
<tr><td><a href="Pdfmarks.html#VALpagenumber_of_target">pagenumber_of_target</a> [<a href="Pdfmarks.html">Pdfmarks</a>]</td>
<td></td></tr>
<tr><td><a href="Pdfdoc.html#VALpages_of_pagetree">pages_of_pagetree</a> [<a href="Pdfdoc.html">Pdfdoc</a>]</td>
<td><div class="info">
Extract the page tree from a PDF document and parse it to a list of page
objects.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALpair">pair</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
A similar function to <code class="code">couple</code>, but the coupling is non-overlapping.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALpair_ext">pair_ext</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
A version of <code class="code">pair</code> which adds a unary function for the singleton, much
like <code class="code">couple_ext</code>.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALpair_reduce">pair_reduce</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
As <code class="code">couple_reduce</code> is to <code class="code">couple</code>, so <code class="code">pair_reduce</code> is to <code class="code">pair</code>.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALpairs">pairs</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Produce a list of overlapping pairs of elements in a list in order, producing
the empty list if on singleton input.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALpairs_of_list">pairs_of_list</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Make consecutive elements of an even-length list into a list of pairs.
</div>
</td></tr>
<tr><td><a href="Pdffun.html#VALparse_function">parse_function</a> [<a href="Pdffun.html">Pdffun</a>]</td>
<td><div class="info">
Parse a function given a document and function object.
</div>
</td></tr>
<tr><td><a href="Pdf.html#VALparse_matrix">parse_matrix</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
Calling <code class="code">parse_matrix pdf name dict</code> parses a PDF matrix found under
key <code class="code">name</code> in dictionary <code class="code">dict</code> into a <code class="code">Transform.transform_matrix</code>.
</div>
</td></tr>
<tr><td><a href="Pdfpages.html#VALparse_operators">parse_operators</a> [<a href="Pdfpages.html">Pdfpages</a>]</td>
<td><div class="info">
Given a pdf document, resource dictionary and list of streams representing
the graphics content (PDF allows a single page's graphics content to be split
over several streams), return a list of operators.
</div>
</td></tr>
<tr><td><a href="Pdf.html#VALparse_rectangle">parse_rectangle</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
Parse a PDF rectangle structure into min x, min y, max x, max y.
</div>
</td></tr>
<tr><td><a href="Pdfpages.html#VALparse_stream">parse_stream</a> [<a href="Pdfpages.html">Pdfpages</a>]</td>
<td><div class="info">
Parse a single byte stream to an operator list given a document and resource
dictionary.
</div>
</td></tr>
<tr><td><a href="Pdfread.html#VALpdf_of_channel">pdf_of_channel</a> [<a href="Pdfread.html">Pdfread</a>]</td>
<td><div class="info">
Read a PDF from an OCaml channel.
</div>
</td></tr>
<tr><td><a href="Pdfread.html#VALpdf_of_channel_lazy">pdf_of_channel_lazy</a> [<a href="Pdfread.html">Pdfread</a>]</td>
<td><div class="info">
Same, but delay loading of streams and parsing of objects.
</div>
</td></tr>
<tr><td><a href="Pdfread.html#VALpdf_of_file">pdf_of_file</a> [<a href="Pdfread.html">Pdfread</a>]</td>
<td><div class="info">
Read a PDF from the given filename.
</div>
</td></tr>
<tr><td><a href="Pdfread.html#VALpdf_of_input">pdf_of_input</a> [<a href="Pdfread.html">Pdfread</a>]</td>
<td><div class="info">
Read a PDF from an <code class="code">Io.input</code>, with an optional user password which, if
absent, is assumed to be the empty string.
</div>
</td></tr>
<tr><td><a href="Pdfread.html#VALpdf_of_input_lazy">pdf_of_input_lazy</a> [<a href="Pdfread.html">Pdfread</a>]</td>
<td><div class="info">
Same, but delay loading of streams and parsing of objects.
</div>
</td></tr>
<tr><td><a href="Pdfwrite.html#VALpdf_to_channel">pdf_to_channel</a> [<a href="Pdfwrite.html">Pdfwrite</a>]</td>
<td><div class="info">
Similarly to an OCaml channel.
</div>
</td></tr>
<tr><td><a href="Pdfwrite.html#VALpdf_to_file">pdf_to_file</a> [<a href="Pdfwrite.html">Pdfwrite</a>]</td>
<td><div class="info">
Simple version.
</div>
</td></tr>
<tr><td><a href="Pdfwrite.html#VALpdf_to_file_options">pdf_to_file_options</a> [<a href="Pdfwrite.html">Pdfwrite</a>]</td>
<td><div class="info">
Similarly to a named file.
</div>
</td></tr>
<tr><td><a href="Pdfwrite.html#VALpdf_to_file_recrypting">pdf_to_file_recrypting</a> [<a href="Pdfwrite.html">Pdfwrite</a>]</td>
<td><div class="info">
Recrypting version.
</div>
</td></tr>
<tr><td><a href="Pdfwrite.html#VALpdf_to_output">pdf_to_output</a> [<a href="Pdfwrite.html">Pdfwrite</a>]</td>
<td><div class="info">
Write a PDF document to an <code class="code">Io.output</code>, optionally encrypting and/or
linearizing.
</div>
</td></tr>
<tr><td><a href="Pdffun.html#VALpdfobject_of_function">pdfobject_of_function</a> [<a href="Pdffun.html">Pdffun</a>]</td>
<td><div class="info">
Flatten a function to its PDF representation
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALpeek_byte">peek_byte</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Look at the next byte without advancing the pointer.
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALpeek_char">peek_char</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Look at the next character without advancing the pointer.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALperpendicular">perpendicular</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Find the vector <code class="code">pi / 2</code> anticlockwise from the given one.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALpi">pi</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Pi.
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALpos_max">pos_max</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td></td></tr>
<tr><td><a href="Pdfio.html#VALpos_pred">pos_pred</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td></td></tr>
<tr><td><a href="Pdfio.html#VALpos_succ">pos_succ</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td></td></tr>
<tr><td><a href="Pdfio.html#VALposadd">posadd</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Arithmetic on positions
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALposofi">posofi</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Convert to and from integers
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALposofi64">posofi64</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Convert to and from 64 bit integers
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALpossub">possub</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td></td></tr>
<tr><td><a href="Pdfio.html#VALpostoi">postoi</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td></td></tr>
<tr><td><a href="Pdfio.html#VALpostoi64">postoi64</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALpow">pow</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
<code class="code">pow x y</code> is y to the power x
</div>
</td></tr>
<tr><td><a href="Utility.html#VALpow2gt">pow2gt</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Largest power of two greater or equal to an integer.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALpow2lt">pow2lt</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Largest power of two smaller or equal to an integer.
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALprint_bitstream">print_bitstream</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Debug printer.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALprint_stream">print_stream</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Print a bytestream.
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALputbit">putbit</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Put a single bit, 0 or 1.
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALputbool">putbool</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Same, but input is boolean
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALputval">putval</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Put a multi-bit value (given as an int32) containing the given number of
useful bits into a bitstream
</div>
</td></tr>
<tr><td align="left"><br>Q</td></tr>
<tr><td><a href="Utility.html#VALq_deq">q_deq</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Remove an element from the queue
</div>
</td></tr>
<tr><td><a href="Utility.html#VALq_enq">q_enq</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Enqueue
</div>
</td></tr>
<tr><td><a href="Utility.html#VALq_hd">q_hd</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Peek at the head of a queue
</div>
</td></tr>
<tr><td><a href="Utility.html#VALq_len">q_len</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Length of a queue
</div>
</td></tr>
<tr><td><a href="Utility.html#VALq_mk">q_mk</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
The empty queue
</div>
</td></tr>
<tr><td><a href="Utility.html#VALq_null">q_null</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Null predicate
</div>
</td></tr>
<tr><td><a href="Utility.html#VALq_of_list">q_of_list</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Insert elements of list into queue.
</div>
</td></tr>
<tr><td align="left"><br>R</td></tr>
<tr><td><a href="Utility.html#VALrad_of_deg">rad_of_deg</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Io.html#VALread_all">read_all</a> [<a href="Io.html">Io</a>]</td>
<td><div class="info">
Utilities
</div>
</td></tr>
<tr><td><a href="Pdfmarks.html#VALread_bookmarks">read_bookmarks</a> [<a href="Pdfmarks.html">Pdfmarks</a>]</td>
<td><div class="info">
Read the bookmarks from a document.
</div>
</td></tr>
<tr><td><a href="Io.html#VALread_byte">read_byte</a> [<a href="Io.html">Io</a>]</td>
<td><div class="info">
Read an unsigned 8-bit integer.
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALread_char_back">read_char_back</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Read the previous character, moving the pointer back one.
</div>
</td></tr>
<tr><td><a href="Pdfspace.html#VALread_colourspace">read_colourspace</a> [<a href="Pdfspace.html">Pdfspace</a>]</td>
<td><div class="info">
Read a colourspace from a PDF given a document, page resources dictionary and the colourspace object
</div>
</td></tr>
<tr><td><a href="Pdftext.html#VALread_font">read_font</a> [<a href="Pdftext.html">Pdftext</a>]</td>
<td><div class="info">
Read a font from a given document and object
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALread_line">read_line</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Read a line.
</div>
</td></tr>
<tr><td><a href="Io.html#VALread_ui16">read_ui16</a> [<a href="Io.html">Io</a>]</td>
<td><div class="info">
Read an unsigned 16-bit word.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALreally_drop_evens">really_drop_evens</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Same, but don't save the last element.
</div>
</td></tr>
<tr><td><a href="Transform.html#VALrecompose">recompose</a> [<a href="Transform.html">Transform</a>]</td>
<td><div class="info">
Recompose from the above information.
</div>
</td></tr>
<tr><td><a href="Pdfcrypt.html#VALrecrypt_pdf">recrypt_pdf</a> [<a href="Pdfcrypt.html">Pdfcrypt</a>]</td>
<td><div class="info">
<code class="code">recrypt_pdf original decrypted_and_modified</code> re-encrypts a PDF document
which was decrypted using the user password and owner password from the
original encrypted file and the same permissions and encryption parameters.
</div>
</td></tr>
<tr><td><a href="Pdfshapes.html#VALrectangle">rectangle</a> [<a href="Pdfshapes.html">Pdfshapes</a>]</td>
<td><div class="info">
Calling <code class="code">rectangle x y w h</code> builds a path representing a rectangle with top
left <code class="code">(x, y)</code>, width <code class="code">w</code> and height <code class="code">h</code>.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALremove">remove</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Remove something from a list, if it's there.
</div>
</td></tr>
<tr><td><a href="Pdfmarks.html#VALremove_bookmarks">remove_bookmarks</a> [<a href="Pdfmarks.html">Pdfmarks</a>]</td>
<td><div class="info">
Remove the bookmarks from a document.
</div>
</td></tr>
<tr><td><a href="Pdf.html#VALremove_dict_entry">remove_dict_entry</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
Remove a dictionary entry, if it exists.
</div>
</td></tr>
<tr><td><a href="Pdf.html#VALremove_unreferenced">remove_unreferenced</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
Garbage-collect a pdf document.
</div>
</td></tr>
<tr><td><a href="Pdfdoc.html#VALrenumber_pages">renumber_pages</a> [<a href="Pdfdoc.html">Pdfdoc</a>]</td>
<td><div class="info">
Rename the resources within a number of page resource dictionaries and
contents, so as to allow them to be merged without name clashes.
</div>
</td></tr>
<tr><td><a href="Pdf.html#VALrenumber_pdfs">renumber_pdfs</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
Make a number of PDF documents contain no mutual object numbers.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALreplace">replace</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
<code class="code">replace k v l</code> replaces the existing binding of <code class="code">k</code> in <code class="code">l</code> with one with binds <code class="code">k</code>
to <code class="code">v</code>.
</div>
</td></tr>
<tr><td><a href="Pdf.html#VALreplace_dict_entry">replace_dict_entry</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
Replace a dictionary entry, raising <code class="code">Not_found</code> if it's not there.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALreplaceinlist">replaceinlist</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
<code class="code">replaceinlist f x l</code> replaces any element of <code class="code">l</code> for which <code class="code">f l</code> is true
with <code class="code">x</code>.
</div>
</td></tr>
<tr><td><a href="Pdfshapes.html#VALrestrict_angle">restrict_angle</a> [<a href="Pdfshapes.html">Pdfshapes</a>]</td>
<td><div class="info">
Calling <code class="code">restrict_angle s a</code> restricts an angle <code class="code">a</code> to one of those at <code class="code">s,
2s, 3s...</code> returning the chosen one.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALrev">rev</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALrev_compare">rev_compare</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Like <code class="code">Pervasives.compare</code>, but the other way around.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALrev_map">rev_map</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALrev_map3">rev_map3</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Similar to <code class="code">rev_map</code>, but 3 arguments.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALrev_map4">rev_map4</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Similar to <code class="code">rev_map</code>, but 4 arguments.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALrev_map5">rev_map5</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Similar to <code class="code">rev_map</code>, but 5 arguments.
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALrewind">rewind</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td></td></tr>
<tr><td><a href="Pdfio.html#VALrewind2">rewind2</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td></td></tr>
<tr><td><a href="Pdfio.html#VALrewind3">rewind3</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Move backward one, two or three positions.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALroot2">root2</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Square root of two.
</div>
</td></tr>
<tr><td><a href="Pdfdoc.html#VALrotation_of_int">rotation_of_int</a> [<a href="Pdfdoc.html">Pdfdoc</a>]</td>
<td><div class="info">
The reverse.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALround">round</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Round a real.
</div>
</td></tr>
<tr><td align="left"><br>S</td></tr>
<tr><td><a href="Utility.html#VALscalevectolength">scalevectolength</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Scale a vector to a given length.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALselect">select</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Select the nth element in a list (first is element 1).
</div>
</td></tr>
<tr><td><a href="Istring.html#VALset">set</a> [<a href="Istring.html">Istring</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALset">set</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Set a boolean reference to <code class="code">true</code>
</div>
</td></tr>
<tr><td><a href="Utility.html#VALset_array">set_array</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Set all the values of an array.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALsetify">setify</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Remove duplicates from a list.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALsetify_preserving_order">setify_preserving_order</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Same, but preserve order.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALsetminus">setminus</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
The set <code class="code">setminus a b</code> contains all those elements which are in <code class="code">a</code> but are
do not appear in <code class="code">b</code>.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALsetminus_preserving_order">setminus_preserving_order</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
The same, but preserving order
</div>
</td></tr>
<tr><td><a href="Utility.html#VALsget">sget</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Get the value at a position in a bytestream
</div>
</td></tr>
<tr><td><a href="Utility.html#VALsome">some</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALsort">sort</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Tail-recursive versions of list functions (and some simple variations).
</div>
</td></tr>
<tr><td><a href="Utility.html#VALsplit">split</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALsplit3">split3</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALsplit8">split8</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALsplitat">splitat</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Split a list at the given positions.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALsplitinto">splitinto</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Split a list into some lists of length <code class="code">n</code> (and possibly a final one of
length <code class="code">&lt; n</code>), preserving order.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALsset">sset</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
<code class="code">sset s n v</code> sets the value n at position v in a bytestream s
</div>
</td></tr>
<tr><td><a href="Pdftext.html#VALstandard_font_of_name">standard_font_of_name</a> [<a href="Pdftext.html">Pdftext</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALstream_of_int_array">stream_of_int_array</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
And from an integer array
</div>
</td></tr>
<tr><td><a href="Pdfpages.html#VALstream_of_ops">stream_of_ops</a> [<a href="Pdfpages.html">Pdfpages</a>]</td>
<td><div class="info">
Flatten a list of operators to an uncompressed PDF stream.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALstream_size">stream_size</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Size of a stream in bytes.
</div>
</td></tr>
<tr><td><a href="Pdfgraphics.html#VALstreams_of_simple_graphic">streams_of_simple_graphic</a> [<a href="Pdfgraphics.html">Pdfgraphics</a>]</td>
<td><div class="info">
Pdfdoc.content entry from a simple graphic (i.e no need for resources etc.)
</div>
</td></tr>
<tr><td><a href="Utility.html#VALstring_of_bytestream">string_of_bytestream</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Make a string from a bytestream.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALstring_of_char">string_of_char</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Make a string from a character.
</div>
</td></tr>
<tr><td><a href="Pdfspace.html#VALstring_of_colourspace">string_of_colourspace</a> [<a href="Pdfspace.html">Pdfspace</a>]</td>
<td><div class="info">
Produce a debug string
</div>
</td></tr>
<tr><td><a href="Pdfdate.html#VALstring_of_date">string_of_date</a> [<a href="Pdfdate.html">Pdfdate</a>]</td>
<td><div class="info">
Build a string from a date
</div>
</td></tr>
<tr><td><a href="Pdftext.html#VALstring_of_font">string_of_font</a> [<a href="Pdftext.html">Pdftext</a>]</td>
<td><div class="info">
Debug string
</div>
</td></tr>
<tr><td><a href="Pdfgraphics.html#VALstring_of_graphic">string_of_graphic</a> [<a href="Pdfgraphics.html">Pdfgraphics</a>]</td>
<td><div class="info">
Debug string of a <code class="code">graphic</code>
</div>
</td></tr>
<tr><td><a href="Utility.html#VALstring_of_int_array">string_of_int_array</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
A string from a single int array
</div>
</td></tr>
<tr><td><a href="Utility.html#VALstring_of_int_arrays">string_of_int_arrays</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
A string from a list of integer arrays
</div>
</td></tr>
<tr><td><a href="Transform.html#VALstring_of_matrix">string_of_matrix</a> [<a href="Transform.html">Transform</a>]</td>
<td><div class="info">
String of a transformation matrix.
</div>
</td></tr>
<tr><td><a href="Pdfpages.html#VALstring_of_op">string_of_op</a> [<a href="Pdfpages.html">Pdfpages</a>]</td>
<td><div class="info">
Make a string of a single operator (for debug purposes).
</div>
</td></tr>
<tr><td><a href="Pdfpages.html#VALstring_of_ops">string_of_ops</a> [<a href="Pdfpages.html">Pdfpages</a>]</td>
<td><div class="info">
Same, but of several operators (for debug purposes).
</div>
</td></tr>
<tr><td><a href="Pdfgraphics.html#VALstring_of_path">string_of_path</a> [<a href="Pdfgraphics.html">Pdfgraphics</a>]</td>
<td></td></tr>
<tr><td><a href="Pdfwrite.html#VALstring_of_pdf">string_of_pdf</a> [<a href="Pdfwrite.html">Pdfwrite</a>]</td>
<td><div class="info">
Calculate a string of a pdf object.
</div>
</td></tr>
<tr><td><a href="Pdftext.html#VALstring_of_standard_font">string_of_standard_font</a> [<a href="Pdftext.html">Pdftext</a>]</td>
<td></td></tr>
<tr><td><a href="Cgenlex.html#VALstring_of_token">string_of_token</a> [<a href="Cgenlex.html">Cgenlex</a>]</td>
<td></td></tr>
<tr><td><a href="Cgenlex.html#VALstring_of_tokens">string_of_tokens</a> [<a href="Cgenlex.html">Cgenlex</a>]</td>
<td></td></tr>
<tr><td><a href="Transform.html#VALstring_of_transform">string_of_transform</a> [<a href="Transform.html">Transform</a>]</td>
<td><div class="info">
Make a string of a transform for debug purposes.
</div>
</td></tr>
<tr><td><a href="Istring.html#VALsub">sub</a> [<a href="Istring.html">Istring</a>]</td>
<td></td></tr>
<tr><td><a href="Utility.html#VALswap">swap</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Swaps the data at the given indexes in an array.
</div>
</td></tr>
<tr><td align="left"><br>T</td></tr>
<tr><td><a href="Utility.html#VALtail_no_fail">tail_no_fail</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Like <code class="code">List.tl</code> but <code class="code">[]</code> yields <code class="code">[]</code>.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALtails">tails</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Ditto, tails.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALtake">take</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
<code class="code">take l n</code> takes <code class="code">n</code> elements from the list raising <code class="code">Invalid_argument</code> if
there are not enough elements to take or if n &lt; 0.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALtake'">take'</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Same, arguments reversed.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALtakewhile">takewhile</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
take elements from a list while a given predicate is true.
</div>
</td></tr>
<tr><td><a href="Pdfmarks.html#VALtarget_of_pagenumber">target_of_pagenumber</a> [<a href="Pdfmarks.html">Pdfmarks</a>]</td>
<td></td></tr>
<tr><td><a href="Pdftext.html#VALtext_extractor_of_font">text_extractor_of_font</a> [<a href="Pdftext.html">Pdftext</a>]</td>
<td><div class="info">
Build a text extractor from a document and font object
</div>
</td></tr>
<tr><td><a href="Fonttables.html#VALtextwidth">textwidth</a> [<a href="Fonttables.html">Fonttables</a>]</td>
<td><div class="info">
Calculate the width, in millipoints, of a string in the given font, taking
into account kerning.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALtl">tl</a> [<a href="Utility.html">Utility</a>]</td>
<td></td></tr>
<tr><td><a href="Cff.html#VALto_type3">to_type3</a> [<a href="Cff.html">Cff</a>]</td>
<td><div class="info">
Convert a CFF Type 1 Font to a Type 3 Font - Incomplete and unsupported.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALtoint">toint</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Same as <code class="code">Pervasives.int_of_float</code>
</div>
</td></tr>
<tr><td><a href="Transform.html#VALtransform">transform</a> [<a href="Transform.html">Transform</a>]</td>
<td><div class="info">
Transform a coordinate by a given transform.
</div>
</td></tr>
<tr><td><a href="Pdfgraphics.html#VALtransform_graphic">transform_graphic</a> [<a href="Pdfgraphics.html">Pdfgraphics</a>]</td>
<td><div class="info">
Transform a graphic by a matrixn
</div>
</td></tr>
<tr><td><a href="Transform.html#VALtransform_matrix">transform_matrix</a> [<a href="Transform.html">Transform</a>]</td>
<td><div class="info">
Transform a coordinate by a given transformation matrix.
</div>
</td></tr>
<tr><td><a href="Glyphlist.html#VALtruetypemap">truetypemap</a> [<a href="Glyphlist.html">Glyphlist</a>]</td>
<td><div class="info">
A Truetype Glyph List
</div>
</td></tr>
<tr><td><a href="Utility.html#VALtryfind">tryfind</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Option lookup on hashtables
</div>
</td></tr>
<tr><td><a href="Utility.html#VALtuple">tuple</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Make a tuple.
</div>
</td></tr>
<tr><td align="left"><br>U</td></tr>
<tr><td><a href="Zlib.html#VALuncompress">uncompress</a> [<a href="Zlib.html">Zlib</a>]</td>
<td></td></tr>
<tr><td><a href="Pdf.html#VALunique_key">unique_key</a> [<a href="Pdf.html">Pdf</a>]</td>
<td><div class="info">
Given a dictionary and a prefix (e.g gs), return a name, starting with the
prefix, which is not already in the dictionary (e.g /gs0).
</div>
</td></tr>
<tr><td><a href="Paper.html#VALunit">unit</a> [<a href="Paper.html">Paper</a>]</td>
<td><div class="info">
Project the unit from a paper size
</div>
</td></tr>
<tr><td><a href="Utility.html#VALunopt">unopt</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Strip the <code class="code">Some</code> from an option.
</div>
</td></tr>
<tr><td><a href="Utility.html#VALuntil_exception">until_exception</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
<code class="code">until_exception r c</code> Perform computation <code class="code">c</code> until an exception is raised,
with the dummy return value <code class="code">r</code>, of the type of the expression evaluted when the
exception is caught.
</div>
</td></tr>
<tr><td><a href="Zlib.html#VALupdate_crc">update_crc</a> [<a href="Zlib.html">Zlib</a>]</td>
<td></td></tr>
<tr><td><a href="Paper.html#VALuslegal">uslegal</a> [<a href="Paper.html">Paper</a>]</td>
<td><div class="info">
United States paper sizes.
</div>
</td></tr>
<tr><td><a href="Paper.html#VALusletter">usletter</a> [<a href="Paper.html">Paper</a>]</td>
<td></td></tr>
<tr><td><a href="Pdftext.html#VALutf16be_of_codepoints">utf16be_of_codepoints</a> [<a href="Pdftext.html">Pdftext</a>]</td>
<td><div class="info">
Return UTF16BE from a list of codepoints.
</div>
</td></tr>
<tr><td><a href="Pdftext.html#VALutf16be_of_text">utf16be_of_text</a> [<a href="Pdftext.html">Pdftext</a>]</td>
<td><div class="info">
Same, but return UTF16BE
</div>
</td></tr>
<tr><td align="left"><br>V</td></tr>
<tr><td><a href="Utility.html#VALveclength">veclength</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
The length of a vector.
</div>
</td></tr>
<tr><td align="left"><br>W</td></tr>
<tr><td><a href="Paper.html#VALwidth">width</a> [<a href="Paper.html">Paper</a>]</td>
<td><div class="info">
Project the width from a paper size.
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALwrite_bitstream_append">write_bitstream_append</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Append two write bitstreams
</div>
</td></tr>
<tr><td><a href="Pdfio.html#VALwrite_bitstream_append_aligned">write_bitstream_append_aligned</a> [<a href="Pdfio.html">Pdfio</a>]</td>
<td><div class="info">
Same, but align at boundary
</div>
</td></tr>
<tr><td align="left"><br>Z</td></tr>
<tr><td><a href="Utility.html#VALzipn">zipn</a> [<a href="Utility.html">Utility</a>]</td>
<td><div class="info">
Take a list of lists of equal length, and turn into a list of lists, the
first containing all the first elements of the original lists, the second the
second, and so on.
</div>
</td></tr>
</table>
</body>
</html>