
	Where results make sense

Topic: Lists of pairs

Related Topics

Lists of people

List of science topics

List of sports pairs

List of cartoon and comic pairs

Archive of fictional things

List of scientist pairs

List of scientists

List of sibling pairs

List of mythological pairs

List of commercial pairs

List of food pairs

List of trivia lists

List of food topics

List of equipment pairs

List of entertainer pairs

In the News (Thu 16 Feb 12)

EXECUTIVE POWER

Iran

ANALYSIS

Pakistan

Family compact

	List of mythological pairs - Wikipedia, the free encyclopedia
		This is a list of famous pairs in mythology.
		For a complete listing of pairs see Lists of pairs.
		For a list sorted by name see List of pairs by name.
	en.wikipedia.org /wiki/List_of_mythological_pairs (116 words)

	[No title]
		A list may be defined recursively as either the empty list or a pair whose cdr is a list.
		For example, a two-element list is a pair whose car is the first element and whose cdr is a pair whose car is the second element and whose cdr is the empty list.
		is the external representation of a pair, not an expression that evaluates to a pair.
	www.jclark.com /dsssl/split/dsssl-45.html (638 words)

	Lists of Lists (Site not responding. Last check: 2007-11-06)
		A possible definition of a dictionary is a list of pairs, where a pair is a list of two elements.
		This would match a list of at least one element, the first element of which is a list of exactly two elements.
		In other words, the only lists it would fail to match would be the empty list and a list which did not begin with an element which is a pair.
	www.cs.hmc.edu /claremont/keller/webBook/ch02/sec06.html (476 words)

	Lecture 06 (Site not responding. Last check: 2007-11-06)
		A dotted pair is a representation of the pair; Scheme could just as well have used (cons 1 2) itself as the representation, but the dotted pair is more compact.
		Lists are pairs with one special difference: the cdr of the last pair must be null.
		A pair is called an improper list to distinguish it from a chain of pairs terminated by null.
	carbon.cudenver.edu /~traup/sp04/lec/06.html (1015 words)

	Parliament of Australia: Senate: Publications: Odgers' Guide to Australian Senate Practice - Eleventh Edition - Chapter ...
		Pairs are usually not arranged, however, for secret ballots, for the reason that voting is meant to be secret and it should not be known how individual senators vote (for exceptions see SD, 21/4/1983, pp 6-7; 20/8/1996, pp 2676-2692).
		Pairs are entirely an informal arrangement between the parties and not part of the procedures of the Senate.
		Pairs are not referred to in the Journals record of votes, but lists of pairs are included in the voting lists shown in Hansard.
	www.aph.gov.au /senate/pubs/odgers/chap1107.htm (228 words)

	The ListPair structure
		These operations do not require that the lists have the same length; when the lists are of uneven lengths, the excess elements from the tail of the longer list are ignored.
		into a list of pairs, with the first element of each list comprising the first element of the result, the second elements comprising the second element of the result, and so on.
		to the list of pairs of elements from from the lists
	ei.cs.vt.edu /~cs3304/smlnj/doc/basis/pages/list-pair.html (341 words)

	Lpp User's Manual - Lists (Site not responding. Last check: 2007-11-06)
		Dotted pairs are useful in association lists or anywhere an efficient container for associated dynamic typed variables is needed.
		An association list is a list of pairs where each pair is an association of a key to a datum.
		The pair is represented as a cons where the car is the key of the pair and the cdr is the datum.
	www.interhack.net /projects/lpp/lpp_11.html (1230 words)

	Revised^5 Report on the Algorithmic Language Scheme
		A list can be defined recursively as either the empty list or a pair whose cdr is a list.
		The empty list is a special object of its own type (it is not a pair); it has no elements and its length is zero.
		A vector typically occupies less space than a list of the same length, and the average time required to access a randomly chosen element is typically less for the vector than for the list.
	www.schemers.org /Documents/Standards/R5RS/HTML/r5rs-Z-H-9.html (6816 words)

	Revised(5) Report on the Algorithmic Language Scheme - Pairs and lists
		The empty list is in X. f list is in X, then any pair whose cdr field contains list is also in X. The objects in the car fields of successive pairs of a list are the elements of the list.
		5) is the external representation of a pair, not an expression that evaluates to a pair.
		These procedures return the first sublist of list whose car is obj, where the sublists of list are the non-empty lists returned by (list-tail list k) for k less than the length of list.
	www.cs.auc.dk /~normark/prog3-02/external-material/r5rs/r5rs-html/r5rs_58.html (1194 words)

	Answers 2.6
		The answer to the equality of the two lists is the same as the answer to whether the rests of the two lists are equal.
		The length of a list is determined by the number of elements at its top level.
		Pattern D requires a list of two elements whose first element is another list of exactly one element.
	www.cs.hmc.edu /~keller/cs60/solutions/2.6.html (390 words)

	Lists (Site not responding. Last check: 2007-11-06)
		A pair is an ordered collection of two objects, called the head and the tail of the pair.
		A list with n+1 elements is a pair whose head is the first element of the list and whose tail is the rest of the list, i.e.
		The first argument is an element that is being appended to the front of the list given in the second argument.
	www.cs.dartmouth.edu /~brd/cs212/handouts/lists.html (1568 words)

	Info Node: (scheme)Pairs
		Pairs ===== This section describes the simple operations that are available for constructing and manipulating arbitrary graphs constructed from pairs.
		The pair is guaranteed to be different (in the sense of `eqv?') from every previously existing object.
		PATH is an exact non-negative integer that encodes the operations in a bitwise fashion: a zero bit represents a `cdr' operation, and a one bit represents a `car'.
	www.math.psu.edu /bin/info2www?(scheme)Pairs (310 words)

	Larceny Manual: Pairs and Lists (Site not responding. Last check: 2007-11-06)
		destructively appends its arguments, which must be lists, and returns the resulting list.
		for any element tuple of lists, then the value returned by procedure for the last element tuple of lists is returned.
		Each of these procedures returns a new list which contains all the elements of list in the original order, except that those elements of the original list that were equal to key are not in the new list.
	www.ccs.neu.edu /home/lth/larceny/manual/pairs_lists.html (198 words)

	Intro to Tcl: Lists and Keyed Lists
		Lists may be nested to any depth, and are useful for representing trees, among other things.
		returns an element of a list based on its position in the list; list elements are numbered from zero.
		Each pair is itself a list, so keyed lists are simply lists of pairs or lists of lists.
	www.lib.uchicago.edu /keith/courses/tcl/topics/lists.html (1495 words)

	[No title] (Site not responding. Last check: 2007-11-06)
		If one list is shorter, just append all remaining elements from the longer list on the end of the result, for example, intersperse([1,2],[3,4,5]) should give [1,3,2,4,5].
		Your function will be polymorphic, i.e., it will handle lists of many different element types, with the restriction that the two lists it combines will have to have the same element type.
		Write and run test cases for an empty list, keys that are found in the first, last, and in the middle of a list of at least three pairs.
	www.cs.wichita.edu /~rodney/cs410/fl2003/assign11 (454 words)

	GNU Emacs Lisp Reference Manual: Lists
		The important difference between lists and vectors is that two or more lists can share part of their structure; in addition, you can insert or delete elements in a list without copying the whole list.
		When an element to be deleted appears in the middle of the list, removing it involves changing the CDRs (see section 5.6.2 Altering the CDR of a List).
		Association lists are often used to record information that you might otherwise keep on a stack, since new associations may be added easily to the front of the list.
	jamesthornton.com /gnu/elisp-manual/elisp_5.html (3944 words)

	Various AP Lists and Statistics
		Lists of amicable pairs with the same pair sum
		Lists of amicable pairs with pair sum not divisible by 9
		Pairs shown in italics are not necesarily the smallest pair of the type.
	amicable.homepage.dk /apstat.htm (407 words)

	Online Technical Writing: Lists (Site not responding. Last check: 2007-11-06)
		When you see a list of three or four items strung out vertically on the page, rather than in normal paragraph format, you naturally notice it more and are likely to pay more attention to it.
		Like headings, the various types of lists are an important feature of professional technical writing: they help readers understand, remember, and review key points; they help readers follow a sequence of actions or events; and they break up long stretches of straight text.
		Use bulleted lists when the list items are in no necessary order and when you want to emphasize the items in the list.
	www.io.com /~hcexres/tcm1603/acchtml/lists.html (1856 words)

	Guile Reference Manual (Site not responding. Last check: 2007-11-06)
		The reason is that pairs are not only used to make two values available as one object, but that pairs are used for constructing lists of values.
		Because lists are so important in Scheme, they are described in a section of their own (see Lists).
		This syntax consists of an opening parentheses, the first element of the pair, a dot, the second element and a closing parentheses.
	www.gnu.org /software/guile/docs/guile-ref/Pairs.html (321 words)

	List Pattern
		The tail in the last pair of the list points to a special element called `nil' or `null'.
		cdr the selector of the tail of a pair
		A head of a pair may be anything, i.e also a reference of another pair.
	www.aplusplus.net /bookonl/node52.html (207 words)

	Lists as a container for numbers (Site not responding. Last check: 2007-11-06)
		A list is a sequence of pairs, with the cdr of the final pair set to null.
		The cdr of a pair is a pointer or reference to the next pair in the sequence.
		Elements near the front of the list require "less work" to access than elements further away from the front of the list.
	www.ugcs.caltech.edu /~cs1/lecture/110100/notes110100.html (1083 words)

	[No title]
		Here's the abstraction: CONSTRUCTOR: * (pair x l) where x is an object and l is a list -- add x to the head of the list l.
		The value of (pair 1 (pair 2 (pair 3 '()))) is a proper list.
		LIST is a procedure which puts its arguments into a proper list LIST is not a special form--it evaluates its arguments (list + 27 (+ 2 1)) => ({add} {27} {3}) LIST is kind of funky, in that it takes any number of arguments.
	www.cs.cornell.edu /html/cs212-fall98/lectures/l08-lists.txt (1134 words)

	Lists
		A proper list is built by consing elements onto a proper list.
		THIS IS NOT A PROPER LIST, because its tail is not a list.
		The set of lists is defined by '() and (cons x l) for any expression x and list l.
	www.cs.cornell.edu /Courses/cs212/1999FA/lectures/l07-lists.html (988 words)

	The Grinnell Scheme Web: The list procedure (Site not responding. Last check: 2007-11-06)
		There is a whole family of procedures that are designed to apply specifically to lists.
		But the programmer usually doesn't think of lists as being constructed out of pairs; she operates on them with list procedures, basically treating them as a separate data type that just happens to be implemented with pairs.
		Since non-empty lists are pairs, you could build them with repeated applications of
	www.math.grin.edu /~stone/scheme-web/list.html (334 words)

	[No title] (Site not responding. Last check: 2007-11-06)
		Lists, dotted-pairs, and operators The predicate display/1 prints out a representation of a term in functional notation, ignoring any operator declarations or special syntactic conventions.
		(b) In Lisp, the empty list is not a CONS, hence not a dotted-pair.
		Transforming terms in a polynomial This exercise involves transforming a polynomial into a list of terms in standard form.
	www.cs.yorku.ca /Courses95-96/3401/marking-ex6.txt (526 words)

	Lists in HTML documents
		Lists may also be nested and different list types may be used together, as in the following example, which is a definition list that contains an unordered list (the ingredients) and an ordered list (the procedure):
		In ordered lists, it is not possible to continue list numbering automatically from a previous list or to hide numbering of some list items.
		Definition lists vary only slightly from other types of lists in that list items consist of two parts: a term and a description.
	www.w3.org /TR/html401/struct/lists.html (926 words)

	Lists
		A list is a series of cons cells chained together, one cons cell per element of the list.
		By convention, the CARs of the cons cells are the elements of the list, and the CDRs are used to chain the list: the CDR of each cons cell is the following cons cell.
		When an element to be deleted appears in the middle of the list, removing it involves changing the CDRs (see section Altering the CDR of a List).
	www.zvon.org /other/elisp/Output/SEC80.html (3555 words)

	Pairs, lists
		Lists can be nested; an example is the internal representation of algebraic forms (see below) which uses linear lists; e.g.
		All of the above functions are non destructive: an input list remains as it has been before - the value of each access function is a reference to the corresponding part of the structure.
		produces q copy of the top level pair sequence leaving out the first occurrence of the search item: the origiginal list is not changed, and an eventual second occurence of the search item in the list is not removed.
	www.uni-koeln.de /REDUCE/primer/subsubsection3_2_6_1.html (550 words)

	> Home> Family> Childcare> Au Pairs (Site not responding. Last check: 2007-11-06)
		Au Pair and EduCare - - Official information from the U.S. Department of State, Bureau of Educational and Cultural Affairs, about the Au Pair and EduCare exchange visitor program.
		Au Pair Centre - - Directory of agencies in France, Britain, Spain and Germany plus general information on rates of pay.
		Au Pairing in France - - Account of a girl's experience being an au pair in France.
	www.wizzle.co.uk /dir/Home/Family/Childcare/Au_Pairs (488 words)

	TEFL Articles: Our House - suggestions for a CALL lesson (EnglishClub.com)
		Next, ask them to tick all those content words on their lists that were in fact included in the text and to compare the lists with their classmates.
		Invite the students to work in pairs, with one student retelling as much as possible of the content of the text without looking at the computer screen, and his or her friend listening and matching the retold version against the original text (which is still displayed on the screen for the listener’s eyes only).
		Ask the students to prepare individual lists of content words (a) that they expected to find in the text (but were in fact missing), or (b) that they did not expect to find in the text (but were in fact there).
	www.englishclub.com /tefl-articles/our-house.htm (700 words)

	Lists and Dotted Pairs (Site not responding. Last check: 2007-11-06)
		b) ; this is a dotted pair expressed using the infix dot operator.
		(b c)) ; every list is a dotted pair whose second element is a list.
		c)) ; not every dotted pair is a list.
	www.cs.yorku.ca /Courses95-96/3401/dotted-pair.html (74 words)

Try your search on: Qwika (all wikis)