51 lines
16 KiB
HTML
51 lines
16 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 T</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_s.htm">
|
|
<LINK REL=UP HREF="26_a.htm">
|
|
<LINK REL=NEXT HREF="26_glo_u.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_s.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_u.htm"><IMG WIDTH=40 HEIGHT=40 ALT="[Next]" SRC="../Graphics/Next.gif" ALIGN=Bottom></A></H1>
|
|
|
|
<HR>
|
|
|
|
<B>T</B> <P>
|
|
<P><A NAME="t"><B>t</B></A> <I>n.</I> 1. a. the <A REL=DEFINITION HREF="26_glo_b.htm#boolean"><I>boolean</I></A> representing true. b. the canonical <A REL=DEFINITION HREF="26_glo_g.htm#generalized_boolean"><I>generalized boolean</I></A> representing true. (Although any <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>object</I></A> other than <A REL=DEFINITION HREF="a_nil.htm#nil"><B>nil</B></A> is considered <A REL=DEFINITION HREF="#true"><I>true</I></A> as a <A REL=DEFINITION HREF="26_glo_g.htm#generalized_boolean"><I>generalized boolean</I></A>, <TT>t</TT> is generally used when there is no special reason to prefer one such <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>object</I></A> over another.) 2. the <A REL=DEFINITION HREF="26_glo_n.htm#name"><I>name</I></A> of the <A REL=DEFINITION HREF="#type"><I>type</I></A> to which all <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>objects</I></A> belong---the <A REL=DEFINITION HREF="26_glo_s.htm#supertype"><I>supertype</I></A> of all <A REL=DEFINITION HREF="#type"><I>types</I></A> (including itself). 3. the <A REL=DEFINITION HREF="26_glo_n.htm#name"><I>name</I></A> of the <A REL=DEFINITION HREF="26_glo_s.htm#superclass"><I>superclass</I></A> of all <A REL=DEFINITION HREF="26_glo_c.htm#class"><I>classes</I></A> except itself. <P>
|
|
<P><A NAME="tag"><B>tag</B></A> <I>n.</I> 1. a <A REL=DEFINITION HREF="26_glo_c.htm#catch_tag"><I>catch tag</I></A>. 2. a <A REL=DEFINITION HREF="26_glo_g.htm#go_tag"><I>go tag</I></A>. <P>
|
|
<P><A NAME="tail"><B>tail</B></A> <I>n.</I> (of a <A REL=DEFINITION HREF="26_glo_l.htm#list"><I>list</I></A>) an <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>object</I></A> that is the <A REL=DEFINITION HREF="26_glo_s.htm#same"><I>same</I></A> as either some <A REL=DEFINITION HREF="26_glo_c.htm#cons"><I>cons</I></A> which makes up that <A REL=DEFINITION HREF="26_glo_l.htm#list"><I>list</I></A> or the <A REL=DEFINITION HREF="26_glo_a.htm#atom"><I>atom</I></A> (if any) which terminates the <A REL=DEFINITION HREF="26_glo_l.htm#list"><I>list</I></A>. ``The empty list is a tail of every proper list.'' <P>
|
|
<P><A NAME="target"><B>target</B></A> <I>n.</I> 1. (of a <A REL=DEFINITION HREF="26_glo_c.htm#constructed_stream"><I>constructed stream</I></A>) a <A REL=DEFINITION HREF="26_glo_c.htm#constituent"><I>constituent</I></A> of the <A REL=DEFINITION HREF="26_glo_c.htm#constructed_stream"><I>constructed stream</I></A>. ``The target of a synonym stream is the value of its synonym stream symbol.'' 2. (of a <A REL=DEFINITION HREF="26_glo_d.htm#displaced_array"><I>displaced array</I></A>) the <A REL=DEFINITION HREF="26_glo_a.htm#array"><I>array</I></A> to which the <A REL=DEFINITION HREF="26_glo_d.htm#displaced_array"><I>displaced array</I></A> is displaced. (In the case of a chain of <A REL=DEFINITION HREF="26_glo_c.htm#constructed_stream"><I>constructed streams</I></A> or <A REL=DEFINITION HREF="26_glo_d.htm#displaced_array"><I>displaced arrays</I></A>, the unqualified term ``<A REL=DEFINITION HREF="#target"><I>target</I></A>'' always refers to the immediate <A REL=DEFINITION HREF="#target"><I>target</I></A> of the first item in the chain, not the immediate target of the last item.) <P>
|
|
<P><A NAME="terminal_iSLo"><B>terminal I/O</B></A> <I>n.</I> the <A REL=DEFINITION HREF="26_glo_b.htm#bidirectional"><I>bidirectional</I></A> <A REL=DEFINITION HREF="26_glo_s.htm#stream"><I>stream</I></A> that is the <A REL=DEFINITION HREF="26_glo_v.htm#value"><I>value</I></A> of the <A REL=DEFINITION HREF="26_glo_v.htm#variable"><I>variable</I></A> <A REL=DEFINITION HREF="v_termin.htm#STterminal-ioST"><B>*terminal-io*</B></A>. <P>
|
|
<P><A NAME="terminating"><B>terminating</B></A> <I>n.</I> (of a <A REL=DEFINITION HREF="26_glo_m.htm#macro_character"><I>macro character</I></A>) being such that, if it appears while parsing a token, it terminates that token. See <A REL=CHILD HREF="02_b.htm">Section 2.2 (Reader Algorithm)</A>. <P>
|
|
<P><A NAME="tertiary_value"><B>tertiary value</B></A> <I>n.</I> (of <A REL=DEFINITION HREF="26_glo_v.htm#value"><I>values</I></A> resulting from the <A REL=DEFINITION HREF="26_glo_e.htm#evaluation"><I>evaluation</I></A> of a <A REL=DEFINITION HREF="26_glo_f.htm#form"><I>form</I></A>) the third <A REL=DEFINITION HREF="26_glo_v.htm#value"><I>value</I></A>, if any, or else <A REL=DEFINITION HREF="a_nil.htm#nil"><B>nil</B></A> if there are fewer than three <A REL=DEFINITION HREF="26_glo_v.htm#value"><I>values</I></A>. <P>
|
|
<P><A NAME="throw"><B>throw</B></A> <I>v.</I> to transfer control and <A REL=DEFINITION HREF="26_glo_v.htm#value"><I>values</I></A> to a <A REL=DEFINITION HREF="26_glo_c.htm#catch"><I>catch</I></A>. See the <A REL=DEFINITION HREF="26_glo_s.htm#special_operator"><I>special operator</I></A> <A REL=DEFINITION HREF="s_throw.htm#throw"><B>throw</B></A>. <P>
|
|
<P><A NAME="tilde"><B>tilde</B></A> <I>n.</I> the <A REL=DEFINITION HREF="26_glo_s.htm#standard_character"><I>standard character</I></A> that is called ``tilde'' (<TT>~</TT>). See <A REL=DEFINITION HREF="02_ac.htm#stdcharsthree">Figure 2-5</A>. <P>
|
|
<P><A NAME="time"><B>time</B></A> a representation of a point (<A REL=DEFINITION HREF="26_glo_a.htm#absolute"><I>absolute</I></A> <A REL=DEFINITION HREF="#time"><I>time</I></A>) or an interval (<A REL=DEFINITION HREF="26_glo_r.htm#relative"><I>relative</I></A> <A REL=DEFINITION HREF="#time"><I>time</I></A>) on a time line. See <A REL=DEFINITION HREF="26_glo_d.htm#decoded_time"><I>decoded time</I></A>, <A REL=DEFINITION HREF="26_glo_i.htm#internal_time"><I>internal time</I></A>, and <A REL=DEFINITION HREF="26_glo_u.htm#universal_time"><I>universal time</I></A>. <P>
|
|
<P><A NAME="time_zone"><B>time zone</B></A> <I>n.</I> a <A REL=DEFINITION HREF="26_glo_r.htm#rational"><I>rational</I></A> multiple of <TT>1/3600</TT> between <TT>-24</TT> (inclusive) and <TT>24</TT> (inclusive) that represents a time zone as a number of hours offset from Greenwich Mean Time. Time zone values increase with motion to the west, so Massachusetts, U.S.A. is in time zone <TT>5</TT>, California, U.S.A. is time zone <TT>8</TT>, and Moscow, Russia is time zone <I>-3</I>. (When ``daylight savings time'' is separately represented as an <A REL=DEFINITION HREF="26_glo_a.htm#argument"><I>argument</I></A> or <A REL=DEFINITION HREF="26_glo_r.htm#return_value"><I>return value</I></A>, the <A REL=DEFINITION HREF="#time_zone"><I>time zone</I></A> that accompanies it does not depend on whether daylight savings time is in effect.) <P>
|
|
<P><A NAME="token"><B>token</B></A> <I>n.</I> a textual representation for a <A REL=DEFINITION HREF="26_glo_n.htm#number"><I>number</I></A> or a <A REL=DEFINITION HREF="26_glo_s.htm#symbol"><I>symbol</I></A>. See <A REL=CHILD HREF="02_c.htm">Section 2.3 (Interpretation of Tokens)</A>. <P>
|
|
<P><A NAME="top_level_form"><B>top level form</B></A> <I>n.</I> a <A REL=DEFINITION HREF="26_glo_f.htm#form"><I>form</I></A> which is processed specially by <A REL=DEFINITION HREF="f_cmp_fi.htm#compile-file"><B>compile-file</B></A> for the purposes of enabling <A REL=DEFINITION HREF="26_glo_c.htm#compile_time"><I>compile time</I></A> <A REL=DEFINITION HREF="26_glo_e.htm#evaluation"><I>evaluation</I></A> of that <A REL=DEFINITION HREF="26_glo_f.htm#form"><I>form</I></A>. <A REL=DEFINITION HREF="#top_level_form"><I>Top level forms</I></A> include those <A REL=DEFINITION HREF="26_glo_f.htm#form"><I>forms</I></A> which are not <A REL=DEFINITION HREF="26_glo_s.htm#subform"><I>subforms</I></A> of any other <A REL=DEFINITION HREF="26_glo_f.htm#form"><I>form</I></A>, and certain other cases. See <A REL=CHILD HREF="03_bca.htm">Section 3.2.3.1 (Processing of Top Level Forms)</A>. <P>
|
|
<P><A NAME="trace_output"><B>trace output</B></A> <I>n.</I> the <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> which is the <A REL=DEFINITION HREF="26_glo_v.htm#value"><I>value</I></A> of the <A REL=DEFINITION HREF="26_glo_d.htm#dynamic_variable"><I>dynamic variable</I></A> <A REL=DEFINITION HREF="v_debug_.htm#STtrace-outputST"><B>*trace-output*</B></A>. <P>
|
|
<P><A NAME="tree"><B>tree</B></A> <I>n.</I> 1. a binary recursive data structure made up of <A REL=DEFINITION HREF="26_glo_c.htm#cons"><I>conses</I></A> and <A REL=DEFINITION HREF="26_glo_a.htm#atom"><I>atoms</I></A>: the <A REL=DEFINITION HREF="26_glo_c.htm#cons"><I>conses</I></A> are themselves also <A REL=DEFINITION HREF="#tree"><I>trees</I></A> (sometimes called ``subtrees'' or ``branches''), and the <A REL=DEFINITION HREF="26_glo_a.htm#atom"><I>atoms</I></A> are terminal nodes (sometimes called <A REL=DEFINITION HREF="26_glo_l.htm#leaf"><I>leaves</I></A>). Typically, the <A REL=DEFINITION HREF="26_glo_l.htm#leaf"><I>leaves</I></A> represent data while the branches establish some relationship among that data. 2. in general, any recursive data structure that has some notion of ``branches'' and <A REL=DEFINITION HREF="26_glo_l.htm#leaf"><I>leaves</I></A>. <P>
|
|
<P><A NAME="tree_structure"><B>tree structure</B></A> <I>n.</I> (of a <A REL=DEFINITION HREF="#tree"><I>tree</I></A>[1]) the set of <A REL=DEFINITION HREF="26_glo_c.htm#cons"><I>conses</I></A> that make up the <A REL=DEFINITION HREF="#tree"><I>tree</I></A>. Note that while the <A REL=DEFINITION HREF="26_glo_c.htm#car"><I>car</I></A>[1b] component of each such <A REL=DEFINITION HREF="26_glo_c.htm#cons"><I>cons</I></A> is part of the <A REL=DEFINITION HREF="#tree_structure"><I>tree structure</I></A>, the <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>objects</I></A> that are the <A REL=DEFINITION HREF="26_glo_c.htm#car"><I>cars</I></A>[2] of each <A REL=DEFINITION HREF="26_glo_c.htm#cons"><I>cons</I></A> in the <A REL=DEFINITION HREF="#tree"><I>tree</I></A> are not themselves part of its <A REL=DEFINITION HREF="#tree_structure"><I>tree structure</I></A> unless they are also <A REL=DEFINITION HREF="26_glo_c.htm#cons"><I>conses</I></A>. <P>
|
|
<P><A NAME="true"><B>true</B></A> <I>n.</I> any <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>object</I></A> that is not <A REL=DEFINITION HREF="26_glo_f.htm#false"><I>false</I></A> and that is used to represent the success of a <A REL=DEFINITION HREF="26_glo_p.htm#predicate"><I>predicate</I></A> test. See <A REL=DEFINITION HREF="#t"><I>t</I></A>[1]. <P>
|
|
<P><A NAME="truename"><B>truename</B></A> <I>n.</I> 1. the canonical <A REL=DEFINITION HREF="26_glo_f.htm#filename"><I>filename</I></A> of a <A REL=DEFINITION HREF="26_glo_f.htm#file"><I>file</I></A> in the <A REL=DEFINITION HREF="26_glo_f.htm#file_system"><I>file system</I></A>. See <A REL=CHILD HREF="20_ac.htm">Section 20.1.3 (Truenames)</A>. 2. a <A REL=DEFINITION HREF="26_glo_p.htm#pathname"><I>pathname</I></A> representing a <A REL=DEFINITION HREF="#truename"><I>truename</I></A>[1]. <P>
|
|
<P><A NAME="two-way_stream"><B>two-way stream</B></A> <I>n.</I> a <A REL=DEFINITION HREF="26_glo_s.htm#stream"><I>stream</I></A> of <A REL=DEFINITION HREF="#type"><I>type</I></A> <A REL=DEFINITION HREF="t_two_wa.htm#two-way-stream"><B>two-way-stream</B></A>, which is a <A REL=DEFINITION HREF="26_glo_b.htm#bidirectional"><I>bidirectional</I></A> <A REL=DEFINITION HREF="26_glo_c.htm#composite_stream"><I>composite stream</I></A> that receives its input from an associated <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 sends its output to an associated <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="type"><B>type</B></A> <I>n.</I> 1. a set of <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>objects</I></A>, usually with common structure, behavior, or purpose. (Note that the expression ``<I>X</I> is of type <I>Sa</I>'' naturally implies that ``<I>X</I> is of type <I>Sb</I>'' if <I>Sa</I> is a <A REL=DEFINITION HREF="26_glo_s.htm#subtype"><I>subtype</I></A> of <I>Sb</I>.) 2. (immediately following the name of a <A REL=DEFINITION HREF="#type"><I>type</I></A>) a <A REL=DEFINITION HREF="26_glo_s.htm#subtype"><I>subtype</I></A> of that <A REL=DEFINITION HREF="#type"><I>type</I></A>. ``The type <A REL=DEFINITION HREF="t_vector.htm#vector"><B>vector</B></A> is an array type.'' <P>
|
|
<P><A NAME="type_declaration"><B>type declaration</B></A> <I>n.</I> a <A REL=DEFINITION HREF="26_glo_d.htm#declaration"><I>declaration</I></A> that asserts that every reference to a specified <A REL=DEFINITION HREF="26_glo_b.htm#binding"><I>binding</I></A> within the scope of the <A REL=DEFINITION HREF="26_glo_d.htm#declaration"><I>declaration</I></A> results in some <A REL=DEFINITION HREF="26_glo_o.htm#object"><I>object</I></A> of the specified <A REL=DEFINITION HREF="#type"><I>type</I></A>. <P>
|
|
<P><A NAME="type_equivalent"><B>type equivalent</B></A> <I>adj.</I> (of two <A REL=DEFINITION HREF="#type"><I>types</I></A> X and Y) having the same <A REL=DEFINITION HREF="26_glo_e.htm#element"><I>elements</I></A>; that is, X is a <A REL=DEFINITION HREF="26_glo_s.htm#subtype"><I>subtype</I></A> of Y and Y is a <A REL=DEFINITION HREF="26_glo_s.htm#subtype"><I>subtype</I></A> of X. <P>
|
|
<P><A NAME="type_expand"><B>type expand</B></A> <I>n.</I> to fully expand a <A REL=DEFINITION HREF="#type_specifier"><I>type specifier</I></A>, removing any references to <A REL=DEFINITION HREF="26_glo_d.htm#derived_type"><I>derived types</I></A>. (Common Lisp provides no program interface to cause this to occur, but the semantics of Common Lisp are such that every <A REL=DEFINITION HREF="26_glo_i.htm#implementation"><I>implementation</I></A> must be able to do this internally, and some situations involving <A REL=DEFINITION HREF="#type_specifier"><I>type specifiers</I></A> are most easily described in terms of a fully expanded <A REL=DEFINITION HREF="#type_specifier"><I>type specifier</I></A>.) <P>
|
|
<P><A NAME="type_specifier"><B>type specifier</B></A> <I>n.</I> an <A REL=DEFINITION HREF="26_glo_e.htm#expression"><I>expression</I></A> that denotes a <A REL=DEFINITION HREF="#type"><I>type</I></A>. ``The symbol <TT>random-state</TT>, the list <TT>(integer 3 5)</TT>, the list <TT>(and list (not null))</TT>, and the class named <TT>standard-class</TT> are type specifiers.'' <P>
|
|
<P><HR>The following <A REL=META HREF="../Front/X3J13Iss.htm">X3J13 cleanup issues</A>, <I>not part of the specification</I>, apply to this section:<P><UL><LI> <A REL=CHILD HREF="../Issues/iss348.htm">TIME-ZONE-NON-INTEGER:ALLOW</A><LI> <A REL=CHILD HREF="../Issues/iss344.htm">TAILP-NIL:T</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>
|