File: POSITION-EQUAL.html

package info (click to toggle)
acl2 3.1-1
  • links: PTS
  • area: main
  • in suites: etch, etch-m68k
  • size: 36,712 kB
  • ctags: 38,396
  • sloc: lisp: 464,023; makefile: 5,470; sh: 86; csh: 47; cpp: 25; ansic: 22
file content (19 lines) | stat: -rw-r--r-- 1,169 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
<html>
<head><title>POSITION-EQUAL.html  --  ACL2 Version 3.1</title></head>
<body text=#000000 bgcolor="#FFFFFF">
<h2>POSITION-EQUAL</h2>position of an item in a string or a list
<pre>Major Section:  <a href="PROGRAMMING.html">PROGRAMMING</a>
</pre><p>

<code>(Position item seq)</code> is the least index (zero-based) of the
element <code>item</code> in the string or list <code>seq</code>, if in fact <code>item</code> is
an element of <code>seq</code>.  Otherwise <code>(position item seq)</code> is <code>nil</code>.
<p>
<code>(Position-equal item lst)</code> has a <a href="GUARD.html">guard</a> of <code>(true-listp lst)</code>.
<code>Position-equal</code> has the same functionality as the Common Lisp
function <code><a href="POSITION.html">position</a></code>, except that it uses the <code><a href="EQUAL.html">equal</a></code> function to
test whether <code>item</code> is the same as each successive element of
<code>lst</code>.  See <a href="POSITION.html">position</a> and see <a href="POSITION-EQ.html">position-eq</a>.
<br><br><br><a href="acl2-doc.html"><img src="llogo.gif"></a> <a href="acl2-doc-index.html"><img src="index.gif"></a>
</body>
</html>