57 lines
22 KiB
HTML
57 lines
22 KiB
HTML
<!-- Common Lisp HyperSpec (TM), version 7.0 generated by Kent M. Pitman on Mon, 11-Apr-2005 2:31am EDT -->
|
|
<HTML>
|
|
<HEAD>
|
|
<TITLE>CLHS: Glossary-Section B</TITLE>
|
|
<LINK HREF="../Data/clhs.css" REL="stylesheet" TYPE="text/css" />
|
|
<META HTTP-EQUIV="Author" CONTENT="Kent M. Pitman">
|
|
<META HTTP-EQUIV="Organization" CONTENT="LispWorks Ltd.">
|
|
<LINK REL=TOP HREF="../Front/index.htm">
|
|
<LINK REL=COPYRIGHT HREF="../Front/Help.htm#Legal">
|
|
<LINK REL=DISCLAIMER HREF="../Front/Help.htm#Disclaimer">
|
|
<LINK REL=PREV HREF="26_glo_a.htm">
|
|
<LINK REL=UP HREF="26_a.htm">
|
|
<LINK REL=NEXT HREF="26_glo_c.htm">
|
|
</HEAD>
|
|
<BODY>
|
|
<H1><A REV=MADE HREF="http://www.lispworks.com/"><IMG WIDTH=80 HEIGHT=65 ALT="[LISPWORKS]" SRC="../Graphics/LWSmall.gif" ALIGN=Bottom></A><A REL=TOP HREF="../Front/index.htm"><IMG WIDTH=237 HEIGHT=65 ALT="[Common Lisp HyperSpec (TM)]" SRC="../Graphics/CLHS_Sm.gif" ALIGN=Bottom></A> <A REL=PREV HREF="26_glo_a.htm"><IMG WIDTH=40 HEIGHT=40 ALT="[Previous]" SRC="../Graphics/Prev.gif" ALIGN=Bottom></A><A REL=UP HREF="26_a.htm"><IMG WIDTH=40 HEIGHT=40 ALT="[Up]" SRC="../Graphics/Up.gif" ALIGN=Bottom></A><A REL=NEXT HREF="26_glo_c.htm"><IMG WIDTH=40 HEIGHT=40 ALT="[Next]" SRC="../Graphics/Next.gif" ALIGN=Bottom></A></H1>
|
|
|
|
<HR>
|
|
|
|
<B>B</B> <P>
|
|
<P><A NAME="backquote"><B>backquote</B></A> <I>n.</I> the <A REL=DEFINITION HREF="26_glo_s.htm#standard_character"><I>standard character</I></A> that is variously called ``grave accent'' or ``backquote'' (<TT>`</TT>). See <A REL=DEFINITION HREF="02_ac.htm#stdcharsthree">Figure 2-5</A>. <P>
|
|
<P><A NAME="backslash"><B>backslash</B></A> <I>n.</I> the <A REL=DEFINITION HREF="26_glo_s.htm#standard_character"><I>standard character</I></A> that is variously called ``reverse solidus'' or ``backslash'' (<TT>\</TT>). See <A REL=DEFINITION HREF="02_ac.htm#stdcharsthree">Figure 2-5</A>. <P>
|
|
<P><A NAME="base_character"><B>base character</B></A> <I>n.</I> a <A REL=DEFINITION HREF="26_glo_c.htm#character"><I>character</I></A> of <A REL=DEFINITION HREF="26_glo_t.htm#type"><I>type</I></A> <A REL=DEFINITION HREF="t_base_c.htm#base-char"><B>base-char</B></A>. <P>
|
|
<P><A NAME="base_string"><B>base string</B></A> <I>n.</I> a <A REL=DEFINITION HREF="26_glo_s.htm#string"><I>string</I></A> of <A REL=DEFINITION HREF="26_glo_t.htm#type"><I>type</I></A> <A REL=DEFINITION HREF="t_base_s.htm#base-string"><B>base-string</B></A>. <P>
|
|
<P><A NAME="before_method"><B>before method</B></A> <I>n.</I> a <A REL=DEFINITION HREF="26_glo_m.htm#method"><I>method</I></A> having the <A REL=DEFINITION HREF="26_glo_q.htm#qualifier"><I>qualifier</I></A> <TT>:before</TT>. <P>
|
|
<P><A NAME="bidirectional"><B>bidirectional</B></A> <I>adj.</I> (of a <A REL=DEFINITION HREF="26_glo_s.htm#stream"><I>stream</I></A>) being both an <A REL=DEFINITION HREF="26_glo_i.htm#input"><I>input</I></A> <A REL=DEFINITION HREF="26_glo_s.htm#stream"><I>stream</I></A> and an <A REL=DEFINITION HREF="26_glo_o.htm#output"><I>output</I></A> <A REL=DEFINITION HREF="26_glo_s.htm#stream"><I>stream</I></A>. <P>
|
|
<P><A NAME="binary"><B>binary</B></A> <I>adj.</I> 1. (of a <A REL=DEFINITION HREF="26_glo_s.htm#stream"><I>stream</I></A>) being a <A REL=DEFINITION HREF="26_glo_s.htm#stream"><I>stream</I></A> that has an <A REL=DEFINITION HREF="26_glo_e.htm#element_type"><I>element type</I></A> that is a <A REL=DEFINITION HREF="26_glo_s.htm#subtype"><I>subtype</I></A> of <A REL=DEFINITION HREF="26_glo_t.htm#type"><I>type</I></A> <A REL=DEFINITION HREF="t_intege.htm#integer"><B>integer</B></A>. The most fundamental operation on a <A REL=DEFINITION HREF="#binary"><I>binary</I></A> <A REL=DEFINITION HREF="26_glo_i.htm#input"><I>input</I></A> <A REL=DEFINITION HREF="26_glo_s.htm#stream"><I>stream</I></A> is <A REL=DEFINITION HREF="f_rd_by.htm#read-byte"><B>read-byte</B></A> and on a <A REL=DEFINITION HREF="#binary"><I>binary</I></A> <A REL=DEFINITION HREF="26_glo_o.htm#output"><I>output</I></A> <A REL=DEFINITION HREF="26_glo_s.htm#stream"><I>stream</I></A> is <A REL=DEFINITION HREF="f_wr_by.htm#write-byte"><B>write-byte</B></A>. See <A REL=DEFINITION HREF="26_glo_c.htm#character"><I>character</I></A>. 2. (of a <A REL=DEFINITION HREF="26_glo_f.htm#file"><I>file</I></A>) having been created by opening a <A REL=DEFINITION HREF="#binary"><I>binary</I></A> <A REL=DEFINITION HREF="26_glo_s.htm#stream"><I>stream</I></A>. (It is <A REL=DEFINITION HREF="26_glo_i.htm#implementation-dependent"><I>implementation-dependent</I></A> whether this is an detectable aspect of the <A REL=DEFINITION HREF="26_glo_f.htm#file"><I>file</I></A>, or whether any given <A REL=DEFINITION HREF="26_glo_c.htm#character"><I>character</I></A> <A REL=DEFINITION HREF="26_glo_f.htm#file"><I>file</I></A> can be treated as a <A REL=DEFINITION HREF="#binary"><I>binary</I></A> <A REL=DEFINITION HREF="26_glo_f.htm#file"><I>file</I></A>.) <P>
|
|
<P><A NAME="bind"><B>bind</B></A> <I>v.t.</I> (a <A REL=DEFINITION HREF="26_glo_v.htm#variable"><I>variable</I></A>) to establish a <A REL=DEFINITION HREF="#binding"><I>binding</I></A> for the <A REL=DEFINITION HREF="26_glo_v.htm#variable"><I>variable</I></A>. <P>
|
|
<P><A NAME="binding"><B>binding</B></A> <I>n.</I> an association between a <A REL=DEFINITION HREF="26_glo_n.htm#name"><I>name</I></A> and that which the <A REL=DEFINITION HREF="26_glo_n.htm#name"><I>name</I></A> denotes. ``A lexical binding is a lexical association between a name and its value.'' When the term <A REL=DEFINITION HREF="#binding"><I>binding</I></A> is qualified by the name of a <A REL=DEFINITION HREF="26_glo_n.htm#namespace"><I>namespace</I></A>, such as ``variable'' or ``function,'' it restricts the binding to the indicated namespace, as in: ``<A REL=DEFINITION HREF="s_let_l.htm#let"><B>let</B></A> establishes variable bindings.'' or ``<A REL=DEFINITION HREF="s_let_l.htm#let"><B>let</B></A> establishes bindings of variables.'' <P>
|
|
<P><A NAME="bit"><B>bit</B></A> <I>n.</I> an <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>object</I></A> of <A REL=DEFINITION HREF="26_glo_t.htm#type"><I>type</I></A> <A REL=DEFINITION HREF="t_bit.htm#bit"><B>bit</B></A>; that is, the <A REL=DEFINITION HREF="26_glo_i.htm#integer"><I>integer</I></A> <TT>0</TT> or the <A REL=DEFINITION HREF="26_glo_i.htm#integer"><I>integer</I></A> <TT>1</TT>. <P>
|
|
<P><A NAME="bit_array"><B>bit array</B></A> <I>n.</I> a specialized <A REL=DEFINITION HREF="26_glo_a.htm#array"><I>array</I></A> that is of <A REL=DEFINITION HREF="26_glo_t.htm#type"><I>type</I></A> <TT>(array bit)</TT>, and whose elements are of <A REL=DEFINITION HREF="26_glo_t.htm#type"><I>type</I></A> <A REL=DEFINITION HREF="t_bit.htm#bit"><B>bit</B></A>. <P>
|
|
<P><A NAME="bit_vector"><B>bit vector</B></A> <I>n.</I> a specialized <A REL=DEFINITION HREF="26_glo_v.htm#vector"><I>vector</I></A> that is of <A REL=DEFINITION HREF="26_glo_t.htm#type"><I>type</I></A> <A REL=DEFINITION HREF="t_bt_vec.htm#bit-vector"><B>bit-vector</B></A>, and whose elements are of <A REL=DEFINITION HREF="26_glo_t.htm#type"><I>type</I></A> <A REL=DEFINITION HREF="t_bit.htm#bit"><B>bit</B></A>. <P>
|
|
<P><A NAME="bit-wise_logical_operation_specifier"><B>bit-wise logical operation specifier</B></A> <I>n.</I> an <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>object</I></A> which names one of the sixteen possible bit-wise logical operations that can be performed by the <A REL=DEFINITION HREF="f_boole.htm#boole"><B>boole</B></A> function, and which is the <A REL=DEFINITION HREF="26_glo_v.htm#value"><I>value</I></A> of exactly one of the <A REL=DEFINITION HREF="26_glo_c.htm#constant_variable"><I>constant variables</I></A> <A REL=DEFINITION HREF="v_b_1_b.htm#boole-clr"><B>boole-clr</B></A>, <A REL=DEFINITION HREF="v_b_1_b.htm#boole-set"><B>boole-set</B></A>, <A REL=DEFINITION HREF="v_b_1_b.htm#boole-1"><B>boole-1</B></A>, <A REL=DEFINITION HREF="v_b_1_b.htm#boole-2"><B>boole-2</B></A>, <A REL=DEFINITION HREF="v_b_1_b.htm#boole-c1"><B>boole-c1</B></A>, <A REL=DEFINITION HREF="v_b_1_b.htm#boole-c2"><B>boole-c2</B></A>, <A REL=DEFINITION HREF="v_b_1_b.htm#boole-and"><B>boole-and</B></A>, <A REL=DEFINITION HREF="v_b_1_b.htm#boole-ior"><B>boole-ior</B></A>, <A REL=DEFINITION HREF="v_b_1_b.htm#boole-xor"><B>boole-xor</B></A>, <A REL=DEFINITION HREF="v_b_1_b.htm#boole-eqv"><B>boole-eqv</B></A>, <A REL=DEFINITION HREF="v_b_1_b.htm#boole-nand"><B>boole-nand</B></A>, <A REL=DEFINITION HREF="v_b_1_b.htm#boole-nor"><B>boole-nor</B></A>, <A REL=DEFINITION HREF="v_b_1_b.htm#boole-andc1"><B>boole-andc1</B></A>, <A REL=DEFINITION HREF="v_b_1_b.htm#boole-andc2"><B>boole-andc2</B></A>, <A REL=DEFINITION HREF="v_b_1_b.htm#boole-orc1"><B>boole-orc1</B></A>, or <A REL=DEFINITION HREF="v_b_1_b.htm#boole-orc2"><B>boole-orc2</B></A>. <P>
|
|
<P><A NAME="block"><B>block</B></A> <I>n.</I> a named lexical <A REL=DEFINITION HREF="26_glo_e.htm#exit_point"><I>exit point</I></A>, <I>established</I> explicitly by <A REL=DEFINITION HREF="s_block.htm#block"><B>block</B></A> or implicitly by <A REL=DEFINITION HREF="26_glo_o.htm#operator"><I>operators</I></A> such as <A REL=DEFINITION HREF="m_loop.htm#loop"><B>loop</B></A>, <A REL=DEFINITION HREF="m_do_do.htm#do"><B>do</B></A> and <A REL=DEFINITION HREF="m_prog_.htm#prog"><B>prog</B></A>, to which control and values may be transfered by using a <A REL=DEFINITION HREF="s_ret_fr.htm#return-from"><B>return-from</B></A> <A REL=DEFINITION HREF="26_glo_f.htm#form"><I>form</I></A> with the name of the <A REL=DEFINITION HREF="#block"><I>block</I></A>. <P>
|
|
<P><A NAME="block_tag"><B>block tag</B></A> <I>n.</I> the <A REL=DEFINITION HREF="26_glo_s.htm#symbol"><I>symbol</I></A> that, within the <A REL=DEFINITION HREF="26_glo_l.htm#lexical_scope"><I>lexical scope</I></A> of a <A REL=DEFINITION HREF="s_block.htm#block"><B>block</B></A> <A REL=DEFINITION HREF="26_glo_f.htm#form"><I>form</I></A>, names the <A REL=DEFINITION HREF="#block"><I>block</I></A> <I>established</I> by that <A REL=DEFINITION HREF="s_block.htm#block"><B>block</B></A> <A REL=DEFINITION HREF="26_glo_f.htm#form"><I>form</I></A>. See <A REL=DEFINITION HREF="m_return.htm#return"><B>return</B></A> or <A REL=DEFINITION HREF="s_ret_fr.htm#return-from"><B>return-from</B></A>. <P>
|
|
<P><A NAME="boa_lambda_list"><B>boa lambda list</B></A> <I>n.</I> a <A REL=DEFINITION HREF="26_glo_l.htm#lambda_list"><I>lambda list</I></A> that is syntactically like an <A REL=DEFINITION HREF="26_glo_o.htm#ordinary_lambda_list"><I>ordinary lambda list</I></A>, but that is processed in ``<B>b</B>y <B>o</B>rder of <B>a</B>rgument'' style. See <A REL=CHILD HREF="03_df.htm">Section 3.4.6 (Boa Lambda Lists)</A>. <P>
|
|
<P><A NAME="body_parameter"><B>body parameter</B></A> <I>n.</I> a <A REL=DEFINITION HREF="26_glo_p.htm#parameter"><I>parameter</I></A> available in certain <A REL=DEFINITION HREF="26_glo_l.htm#lambda_list"><I>lambda lists</I></A> which from the point of view of <A REL=DEFINITION HREF="26_glo_c.htm#conforming_program"><I>conforming programs</I></A> is like a <A REL=DEFINITION HREF="26_glo_r.htm#rest_parameter"><I>rest parameter</I></A> in every way except that it is introduced by <TT>&body</TT> instead of <TT>&rest</TT>. (<A REL=DEFINITION HREF="26_glo_i.htm#implementation"><I>Implementations</I></A> are permitted to provide extensions which distinguish <A REL=DEFINITION HREF="#body_parameter"><I>body parameters</I></A> and <A REL=DEFINITION HREF="26_glo_r.htm#rest_parameter"><I>rest parameters</I></A>---e.g., the <A REL=DEFINITION HREF="26_glo_f.htm#form"><I>forms</I></A> for <A REL=DEFINITION HREF="26_glo_o.htm#operator"><I>operators</I></A> which were defined using a <A REL=DEFINITION HREF="#body_parameter"><I>body parameter</I></A> might be pretty printed slightly differently than <A REL=DEFINITION HREF="26_glo_f.htm#form"><I>forms</I></A> for <A REL=DEFINITION HREF="26_glo_o.htm#operator"><I>operators</I></A> which were defined using <A REL=DEFINITION HREF="26_glo_r.htm#rest_parameter"><I>rest parameters</I></A>.) <P>
|
|
<P><A NAME="boolean"><B>boolean</B></A> <I>n.</I> an <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>object</I></A> of <A REL=DEFINITION HREF="26_glo_t.htm#type"><I>type</I></A> <A REL=DEFINITION HREF="t_ban.htm#boolean"><B>boolean</B></A>; that is, one of the following <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>objects</I></A>: the symbol <A REL=DEFINITION HREF="a_t.htm#t"><B>t</B></A> (representing <A REL=DEFINITION HREF="26_glo_t.htm#true"><I>true</I></A>), or the symbol <A REL=DEFINITION HREF="a_nil.htm#nil"><B>nil</B></A> (representing <A REL=DEFINITION HREF="26_glo_f.htm#false"><I>false</I></A>). See <A REL=DEFINITION HREF="26_glo_g.htm#generalized_boolean"><I>generalized boolean</I></A>. <P>
|
|
<P><A NAME="boolean_equivalent"><B>boolean equivalent</B></A> <I>n.</I> (of an <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>object</I></A> O1) any <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>object</I></A> O2 that has the same truth value as O1 when both O1 and O2 are viewed as <A REL=DEFINITION HREF="26_glo_g.htm#generalized_boolean"><I>generalized booleans</I></A>. <P>
|
|
<P><A NAME="bound"><B>bound</B></A> <I>adj.</I>, <I>v.t.</I> 1. <I>adj.</I> having an associated denotation in a <A REL=DEFINITION HREF="#binding"><I>binding</I></A>. ``The variables named by a <A REL=DEFINITION HREF="s_let_l.htm#let"><B>let</B></A> are bound within its body.'' See <A REL=DEFINITION HREF="26_glo_u.htm#unbound"><I>unbound</I></A>. 2. <I>adj.</I> having a local <A REL=DEFINITION HREF="#binding"><I>binding</I></A> which <A REL=DEFINITION HREF="26_glo_s.htm#shadow"><I>shadows</I></A>[2] another. ``The variable <A REL=DEFINITION HREF="v_pr_esc.htm#STprint-escapeST"><B>*print-escape*</B></A> is bound while in the <A REL=DEFINITION HREF="f_wr_pr.htm#princ"><B>princ</B></A> function.'' 3. <I>v.t.</I> the past tense of <A REL=DEFINITION HREF="#bind"><I>bind</I></A>. <P>
|
|
<P><A NAME="bound_declaration"><B>bound declaration</B></A> <I>n.</I> a <A REL=DEFINITION HREF="26_glo_d.htm#declaration"><I>declaration</I></A> that refers to or is associated with a <A REL=DEFINITION HREF="26_glo_v.htm#variable"><I>variable</I></A> or <A REL=DEFINITION HREF="26_glo_f.htm#function"><I>function</I></A> and that appears within the <A REL=DEFINITION HREF="26_glo_s.htm#special_form"><I>special form</I></A> that <A REL=DEFINITION HREF="26_glo_e.htm#establish"><I>establishes</I></A> the <A REL=DEFINITION HREF="26_glo_v.htm#variable"><I>variable</I></A> or <A REL=DEFINITION HREF="26_glo_f.htm#function"><I>function</I></A>, but before the body of that <A REL=DEFINITION HREF="26_glo_s.htm#special_form"><I>special form</I></A> (specifically, at the head of that <A REL=DEFINITION HREF="26_glo_f.htm#form"><I>form</I></A>'s body). (If a <A REL=DEFINITION HREF="#bound_declaration"><I>bound declaration</I></A> refers to a <A REL=DEFINITION HREF="26_glo_f.htm#function"><I>function</I></A> <A REL=DEFINITION HREF="#binding"><I>binding</I></A> or a <A REL=DEFINITION HREF="26_glo_l.htm#lexical_variable"><I>lexical variable</I></A> <A REL=DEFINITION HREF="#binding"><I>binding</I></A>, the <A REL=DEFINITION HREF="26_glo_s.htm#scope"><I>scope</I></A> of the <A REL=DEFINITION HREF="26_glo_d.htm#declaration"><I>declaration</I></A> is exactly the <A REL=DEFINITION HREF="26_glo_s.htm#scope"><I>scope</I></A> of that <A REL=DEFINITION HREF="#binding"><I>binding</I></A>. If the <A REL=DEFINITION HREF="26_glo_d.htm#declaration"><I>declaration</I></A> refers to a <A REL=DEFINITION HREF="26_glo_d.htm#dynamic_variable"><I>dynamic variable</I></A> <A REL=DEFINITION HREF="#binding"><I>binding</I></A>, the <A REL=DEFINITION HREF="26_glo_s.htm#scope"><I>scope</I></A> of the <A REL=DEFINITION HREF="26_glo_d.htm#declaration"><I>declaration</I></A> is what the <A REL=DEFINITION HREF="26_glo_s.htm#scope"><I>scope</I></A> of the <A REL=DEFINITION HREF="#binding"><I>binding</I></A> would have been if it were lexical rather than dynamic.) <P>
|
|
<P><A NAME="bounded"><B>bounded</B></A> <I>adj.</I> (of a <A REL=DEFINITION HREF="26_glo_s.htm#sequence"><I>sequence</I></A> S, by an ordered pair of <I>bounding indices</I> istart and iend) restricted to a subrange of the <A REL=DEFINITION HREF="26_glo_e.htm#element"><I>elements</I></A> of S that includes each <A REL=DEFINITION HREF="26_glo_e.htm#element"><I>element</I></A> beginning with (and including) the one indexed by istart and continuing up to (but not including) the one indexed by iend. <P>
|
|
<P><A NAME="bounding_index"><B>bounding index</B></A> <I>n.</I> (of a <A REL=DEFINITION HREF="26_glo_s.htm#sequence"><I>sequence</I></A> with <A REL=DEFINITION HREF="26_glo_l.htm#length"><I>length</I></A> n) either of a conceptual pair of <A REL=DEFINITION HREF="26_glo_i.htm#integer"><I>integers</I></A>, istart and iend, respectively called the ``lower bounding index'' and ``upper bounding index'', such that 0 <=istart <=iend <=n, and which therefore delimit a subrange of the <A REL=DEFINITION HREF="26_glo_s.htm#sequence"><I>sequence</I></A> <A REL=DEFINITION HREF="#bounded"><I>bounded</I></A> by istart and iend. <P>
|
|
<P><A NAME="bounding_index_designator"><B>bounding index designator</B></A> (for a <A REL=DEFINITION HREF="26_glo_s.htm#sequence"><I>sequence</I></A>) one of two <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>objects</I></A> that, taken together as an ordered pair, behave as a <A REL=DEFINITION HREF="26_glo_d.htm#designator"><I>designator</I></A> for <I>bounding indices</I> of the <A REL=DEFINITION HREF="26_glo_s.htm#sequence"><I>sequence</I></A>; that is, they denote <I>bounding indices</I> of the <A REL=DEFINITION HREF="26_glo_s.htm#sequence"><I>sequence</I></A>, and are either: an <A REL=DEFINITION HREF="26_glo_i.htm#integer"><I>integer</I></A> (denoting itself) and <A REL=DEFINITION HREF="a_nil.htm#nil"><B>nil</B></A> (denoting the <A REL=DEFINITION HREF="26_glo_l.htm#length"><I>length</I></A> of the <A REL=DEFINITION HREF="26_glo_s.htm#sequence"><I>sequence</I></A>), or two <A REL=DEFINITION HREF="26_glo_i.htm#integer"><I>integers</I></A> (each denoting themselves). <P>
|
|
<P><A NAME="break_loop"><B>break loop</B></A> <I>n.</I> A variant of the normal <A REL=DEFINITION HREF="26_glo_l.htm#lisp_read-eval-print_loop"><I>Lisp read-eval-print loop</I></A> that is recursively entered, usually because the ongoing <A REL=DEFINITION HREF="26_glo_e.htm#evaluation"><I>evaluation</I></A> of some other <A REL=DEFINITION HREF="26_glo_f.htm#form"><I>form</I></A> has been suspended for the purpose of debugging. Often, a <A REL=DEFINITION HREF="#break_loop"><I>break loop</I></A> provides the ability to exit in such a way as to continue the suspended computation. See the <A REL=DEFINITION HREF="26_glo_f.htm#function"><I>function</I></A> <A REL=DEFINITION HREF="f_break.htm#break"><B>break</B></A>. <P>
|
|
<P><A NAME="broadcast_stream"><B>broadcast stream</B></A> <I>n.</I> an <A REL=DEFINITION HREF="26_glo_o.htm#output"><I>output</I></A> <A REL=DEFINITION HREF="26_glo_s.htm#stream"><I>stream</I></A> of <A REL=DEFINITION HREF="26_glo_t.htm#type"><I>type</I></A> <A REL=DEFINITION HREF="t_broadc.htm#broadcast-stream"><B>broadcast-stream</B></A>. <P>
|
|
<P><A NAME="built-in_class"><B>built-in class</B></A> <I>n.</I> a <A REL=DEFINITION HREF="26_glo_c.htm#class"><I>class</I></A> that is a <A REL=DEFINITION HREF="26_glo_g.htm#generalized_instance"><I>generalized instance</I></A> of <A REL=DEFINITION HREF="26_glo_c.htm#class"><I>class</I></A> <A REL=DEFINITION HREF="t_built_.htm#built-in-class"><B>built-in-class</B></A>. <P>
|
|
<P><A NAME="built-in_type"><B>built-in type</B></A> <I>n.</I> one of the <A REL=DEFINITION HREF="26_glo_t.htm#type"><I>types</I></A> in <A REL=DEFINITION HREF="04_bc.htm#standardizedatomictypespecs">Figure 4-2</A>. <P>
|
|
<P><A NAME="byte"><B>byte</B></A> <I>n.</I> 1. adjacent bits within an <A REL=DEFINITION HREF="26_glo_i.htm#integer"><I>integer</I></A>. (The specific number of bits can vary from point to point in the program; see the <A REL=DEFINITION HREF="26_glo_f.htm#function"><I>function</I></A> <A REL=DEFINITION HREF="f_by_by.htm#byte"><B>byte</B></A>.) 2. an integer in a specified range. (The specific range can vary from point to point in the program; see the <A REL=DEFINITION HREF="26_glo_f.htm#function"><I>functions</I></A> <A REL=DEFINITION HREF="f_open.htm#open"><B>open</B></A> and <A REL=DEFINITION HREF="f_wr_by.htm#write-byte"><B>write-byte</B></A>.) <P>
|
|
<P><A NAME="byte_specifier"><B>byte specifier</B></A> <I>n.</I> An <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>object</I></A> of <A REL=DEFINITION HREF="26_glo_i.htm#implementation-dependent"><I>implementation-dependent</I></A> nature that is returned by the <A REL=DEFINITION HREF="26_glo_f.htm#function"><I>function</I></A> <A REL=DEFINITION HREF="f_by_by.htm#byte"><B>byte</B></A> and that specifies the range of bits in an <A REL=DEFINITION HREF="26_glo_i.htm#integer"><I>integer</I></A> to be used as a <A REL=DEFINITION HREF="#byte"><I>byte</I></A> by <A REL=DEFINITION HREF="26_glo_f.htm#function"><I>functions</I></A> such as <A REL=DEFINITION HREF="f_ldb.htm#ldb"><B>ldb</B></A>. <P>
|
|
<P><HR>The following <A REL=META HREF="../Front/X3J13Iss.htm">X3J13 cleanup issue</A>, <I>not part of the specification</I>, applies to this section:<P><UL><LI> <A REL=CHILD HREF="../Issues/iss046.htm">CHARACTER-VS-CHAR:LESS-INCONSISTENT-SHORT</A><P></UL><HR>
|
|
|
|
<A REL=NAVIGATOR HREF="../Front/StartPts.htm"><IMG WIDTH=80 HEIGHT=40 ALT="[Starting Points]" SRC="../Graphics/StartPts.gif" ALIGN=Bottom></A><A REL=TOC HREF="../Front/Contents.htm"><IMG WIDTH=80 HEIGHT=40 ALT="[Contents]" SRC="../Graphics/Contents.gif" ALIGN=Bottom></A><A REL=INDEX HREF="../Front/X_Master.htm"><IMG WIDTH=80 HEIGHT=40 ALT="[Index]" SRC="../Graphics/Index.gif" ALIGN=Bottom></A><A REL=INDEX HREF="../Front/X_Symbol.htm"><IMG WIDTH=80 HEIGHT=40 ALT="[Symbols]" SRC="../Graphics/Symbols.gif" ALIGN=Bottom></A><A REL=GLOSSARY HREF="../Body/26_a.htm"><IMG WIDTH=80 HEIGHT=40 ALT="[Glossary]" SRC="../Graphics/Glossary.gif" ALIGN=Bottom></A><A HREF="../Front/X3J13Iss.htm"><IMG WIDTH=80 HEIGHT=40 ALT="[Issues]" SRC="../Graphics/Issues.gif" ALIGN=Bottom></A><BR>
|
|
|
|
<A REL=COPYRIGHT HREF="../Front/Help.htm#Legal"><I>Copyright 1996-2005, LispWorks Ltd. All rights reserved.</I></A><P>
|
|
</BODY>
|
|
</HTML>
|