/usr/share/mozart/doc/base/bytestring.html is in mozart-doc 1.4.0-8ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 | <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD><TITLE>7.3 Byte Strings</TITLE><LINK href="ozdoc.css" rel="stylesheet" type="text/css"></HEAD><BODY><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="string.html#section.text.strings"><< Prev</A></TD><TD><A href="node9.html">- Up -</A></TD><TD><A href="virtualstring.html#section.text.virtualstrings">Next >></A></TD></TR></TABLE><DIV id="section.text.bytestrings"><H2><A name="section.text.bytestrings">7.3 Byte Strings</A></H2><P> Module <A name="label435"></A><SPAN class="index"><CODE>ByteString</CODE></SPAN> provides an interface to a more economical representation for textual data: a simple array of bytes. In terms of memory, the economy is at least a factor of 8, which may improve local processing, IO, pickle sizes, and remote communications (distributed processing). However strings, i. e., lists, are often more convenient for all forms of recursive processing (e. g., <CODE>Map</CODE> or <CODE>Filter</CODE>). Typically, you will be processing textual data in list form, but saving or communicating it in byte string form. </P><DL><DT><A name="label436"></A><SPAN class="index"><CODE>IsByteString</CODE></SPAN> <A name="label438"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{ByteString<SPAN class="keyword">.</SPAN>is </CODE><CODE>+<I>X</I></CODE><CODE> </CODE><CODE>?<I>B</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>tests whether <CODE><I>X</I></CODE> is a byte string. </P></DD><DT><CODE>make</CODE> <A name="label440"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{ByteString<SPAN class="keyword">.</SPAN>make </CODE><CODE>+<I>V</I></CODE><CODE> </CODE><CODE>?<I>ByteString</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>returns a new byte string created from the virtual string <CODE><I>V</I></CODE>. </P></DD><DT><CODE>get</CODE> <A name="label442"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{ByteString<SPAN class="keyword">.</SPAN>get </CODE><CODE>+<I>ByteString</I></CODE><CODE> </CODE><CODE>+<I>I</I></CODE><CODE> </CODE><CODE>?<I>C</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>retrieves the <CODE><I>I</I></CODE>th character of byte string <CODE><I>ByteString</I></CODE>. The first index is <CODE>0</CODE>. </P></DD><DT><CODE>append</CODE> <A name="label444"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{ByteString<SPAN class="keyword">.</SPAN>append </CODE><CODE>+<I>ByteString1</I></CODE><CODE> </CODE><CODE>+<I>ByteString2</I></CODE><CODE> </CODE><CODE>?<I>ByteString3</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>returns the new byte string <CODE><I>ByteString3</I></CODE> which is the concatenation of <CODE><I>ByteString1</I></CODE> and <CODE><I>ByteString2</I></CODE>. </P></DD><DT><CODE>slice</CODE> <A name="label446"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{ByteString<SPAN class="keyword">.</SPAN>slice </CODE><CODE>+<I>ByteString1</I></CODE><CODE> </CODE><CODE>+<I>FromI</I></CODE><CODE> </CODE><CODE>+<I>ToI</I></CODE><CODE> </CODE><CODE>?<I>ByteString2</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>returns a new byte string for the bytes in <CODE><I>ByteString1</I></CODE> starting at index <CODE><I>FromI</I></CODE> and extending up to, but not including, index <CODE><I>ToI</I></CODE>. </P></DD><DT><CODE>width</CODE> <A name="label448"></A> </DT><DT><CODE>length</CODE> <A name="label450"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{ByteString<SPAN class="keyword">.</SPAN>width </CODE><CODE>+<I>ByteString</I></CODE><CODE> </CODE><CODE>?<I>I</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><BLOCKQUOTE class="synopsis"><P><CODE>{ByteString<SPAN class="keyword">.</SPAN>length </CODE><CODE>+<I>ByteString</I></CODE><CODE> </CODE><CODE>?<I>I</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>returns the width <CODE><I>I</I></CODE> of <CODE><I>ByteString</I></CODE>. </P></DD><DT><CODE>toString</CODE> <A name="label452"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{ByteString<SPAN class="keyword">.</SPAN>toString </CODE><CODE>+<I>ByteString</I></CODE><CODE> </CODE><CODE>?<I>S</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>converts <CODE><I>ByteString</I></CODE> to a string <CODE><I>S</I></CODE>. </P></DD><DT><CODE>toStringWithTail</CODE> <A name="label454"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{ByteString<SPAN class="keyword">.</SPAN>toStringWithTail </CODE><CODE>+<I>ByteString</I></CODE><CODE> </CODE><CODE><I>X</I></CODE><CODE> </CODE><CODE>?<I>S</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>converts <CODE><I>ByteString</I></CODE> to a string <CODE><I>S</I></CODE> ending with <CODE><I>X</I></CODE>. This is useful for subsequently instantiating <CODE><I>X</I></CODE>, e. g., with another call to <CODE>ByteString<SPAN class="keyword">.</SPAN>toStringWithTail</CODE>. </P></DD><DT><CODE>strchr</CODE> <A name="label456"></A> </DT><DD><BLOCKQUOTE class="synopsis"><P><CODE>{ByteString<SPAN class="keyword">.</SPAN>strchr </CODE><CODE>+<I>ByteString</I></CODE><CODE> </CODE><CODE>+<I>OffsetI</I></CODE><CODE> </CODE><CODE>+<I>Char</I></CODE><CODE> </CODE><CODE>?<I>PosBI</I></CODE><CODE>}</CODE> </P></BLOCKQUOTE></DD><DD><P>returns the position <CODE><I>PosI</I></CODE> of the first occurrence of <CODE><I>Char</I></CODE> in <CODE><I>ByteString</I></CODE> starting at offset <CODE><I>OffsetI</I></CODE>. If none is found <CODE><SPAN class="keyword">false</SPAN></CODE> is returned instead. </P></DD></DL><P> </P></DIV><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="string.html#section.text.strings"><< Prev</A></TD><TD><A href="node9.html">- Up -</A></TD><TD><A href="virtualstring.html#section.text.virtualstrings">Next >></A></TD></TR></TABLE><HR><ADDRESS><A href="http://www.ps.uni-sb.de/~duchier/">Denys Duchier</A>, <A href="http://www.ps.uni-sb.de/~kornstae/">Leif Kornstaedt</A> and <A href="http://www.ps.uni-sb.de/~schulte/">Christian Schulte</A><BR><SPAN class="version">Version 1.4.0 (20110908185330)</SPAN></ADDRESS></BODY></HTML>
|