mirror of
https://github.com/boostorg/preprocessor.git
synced 2025-07-19 15:32:05 +02:00
set -> seq
[SVN r16152]
This commit is contained in:
Paul Mensonides
@ -1,14 +1,14 @@
|
|||||||
<html>
|
<html>
|
||||||
<head>
|
<head>
|
||||||
<title>seqs.html</title>
|
<title>sequences.html</title>
|
||||||
<link rel="stylesheet" type="text/css" href="../styles.css">
|
<link rel="stylesheet" type="text/css" href="../styles.css">
|
||||||
</head>
|
</head>
|
||||||
<body>
|
<body>
|
||||||
<h4>
|
<h4>
|
||||||
Sets
|
Sequences
|
||||||
</h4>
|
</h4>
|
||||||
<div>
|
<div>
|
||||||
A <i>seq</i> is a group of adjacent parenthesized elements. For example,
|
A <i>sequence</i> (abbreviated to <i>seq</i>) is a group of adjacent parenthesized elements. For example,
|
||||||
</div>
|
</div>
|
||||||
<div class="code">
|
<div class="code">
|
||||||
(<i>a</i>)(<i>b</i>)(<i>c</i>)
|
(<i>a</i>)(<i>b</i>)(<i>c</i>)
|
||||||
@ -17,8 +17,8 @@
|
|||||||
...is a <i>seq</i> of <i>3</i> elements--<i>a</i>, <i>b</i>, and <i>c</i>.
|
...is a <i>seq</i> of <i>3</i> elements--<i>a</i>, <i>b</i>, and <i>c</i>.
|
||||||
</div>
|
</div>
|
||||||
<div>
|
<div>
|
||||||
<i>Sets</i> are data structures that merge the properties of both <i>lists</i> and
|
<i>Sequences</i> are data structures that merge the properties of both <i>lists</i> and
|
||||||
<i>tuples</i> with the exception that <i>seqs</i> cannot be empty.
|
<i>tuples</i> with the exception that a <i>seq</i> cannot be empty.
|
||||||
Therefore, an "empty" <i>seq</i> is considered a special case scenario that
|
Therefore, an "empty" <i>seq</i> is considered a special case scenario that
|
||||||
must be handled separately in C++.
|
must be handled separately in C++.
|
||||||
</div>
|
</div>
|
||||||
@ -44,7 +44,7 @@ BOOST_PP_SEQ_FOLD_RIGHT(INC, BOOST_PP_SEQ_NIL, SEQ)
|
|||||||
</pre>
|
</pre>
|
||||||
</div>
|
</div>
|
||||||
<div>
|
<div>
|
||||||
<i>Sets</i> are extremely efficient. Element access speed approaches
|
<i>Sequences</i> are extremely efficient. Element access speed approaches
|
||||||
random access--even with <i>seqs</i> of up to <i>256</i> elements. This
|
random access--even with <i>seqs</i> of up to <i>256</i> elements. This
|
||||||
is because element access (among other things) is implemented iteratively
|
is because element access (among other things) is implemented iteratively
|
||||||
rather than recursively. Therefore, elements can be accessed at extremely
|
rather than recursively. Therefore, elements can be accessed at extremely
|
||||||
@ -181,42 +181,42 @@ BOOST_PP_ADD
|
|||||||
<br>BOOST_PP_REPEAT_
|
<br>BOOST_PP_REPEAT_
|
||||||
<br>BOOST_PP_RPAREN
|
<br>BOOST_PP_RPAREN
|
||||||
<br>BOOST_PP_RPAREN_IF
|
<br>BOOST_PP_RPAREN_IF
|
||||||
<br>BOOST_PP_SET_CAT
|
<br>BOOST_PP_SEQ_CAT
|
||||||
<br>BOOST_PP_SET_CAT_S
|
<br>BOOST_PP_SEQ_CAT_S
|
||||||
<br>BOOST_PP_SET_ELEM
|
<br>BOOST_PP_SEQ_ELEM
|
||||||
<br>BOOST_PP_SET_ENUM
|
<br>BOOST_PP_SEQ_ENUM
|
||||||
<br>BOOST_PP_SET_FILTER
|
<br>BOOST_PP_SEQ_FILTER
|
||||||
<br>BOOST_PP_SET_FILTER_S
|
<br>BOOST_PP_SEQ_FILTER_S
|
||||||
<br>BOOST_PP_SET_FIRST_N
|
<br>BOOST_PP_SEQ_FIRST_N
|
||||||
<br>BOOST_PP_SET_FOLD_LEFT
|
<br>BOOST_PP_SEQ_FOLD_LEFT
|
||||||
<br>BOOST_PP_SET_FOLD_LEFT_
|
<br>BOOST_PP_SEQ_FOLD_LEFT_
|
||||||
<br>BOOST_PP_SET_FOLD_RIGHT
|
<br>BOOST_PP_SEQ_FOLD_RIGHT
|
||||||
<br>BOOST_PP_SET_FOLD_RIGHT_
|
<br>BOOST_PP_SEQ_FOLD_RIGHT_
|
||||||
<br>BOOST_PP_SET_FOR_EACH
|
<br>BOOST_PP_SEQ_FOR_EACH
|
||||||
<br>BOOST_PP_SET_FOR_EACH_R
|
<br>BOOST_PP_SEQ_FOR_EACH_R
|
||||||
<br>BOOST_PP_SET_FOR_EACH_I
|
<br>BOOST_PP_SEQ_FOR_EACH_I
|
||||||
<br>BOOST_PP_SET_FOR_EACH_I_R
|
<br>BOOST_PP_SEQ_FOR_EACH_I_R
|
||||||
<br>BOOST_PP_SET_FOR_EACH_PRODUCT
|
<br>BOOST_PP_SEQ_FOR_EACH_PRODUCT
|
||||||
<br>BOOST_PP_SET_FOR_EACH_PRODUCT_R
|
<br>BOOST_PP_SEQ_FOR_EACH_PRODUCT_R
|
||||||
<br>BOOST_PP_SET_HEAD
|
<br>BOOST_PP_SEQ_HEAD
|
||||||
<br>BOOST_PP_SET_INSERT
|
<br>BOOST_PP_SEQ_INSERT
|
||||||
<br>BOOST_PP_SET_NIL
|
<br>BOOST_PP_SEQ_NIL
|
||||||
<br>BOOST_PP_SET_POP_BACK
|
<br>BOOST_PP_SEQ_POP_BACK
|
||||||
<br>BOOST_PP_SET_POP_FRONT
|
<br>BOOST_PP_SEQ_POP_FRONT
|
||||||
<br>BOOST_PP_SET_PUSH_BACK
|
<br>BOOST_PP_SEQ_PUSH_BACK
|
||||||
<br>BOOST_PP_SET_PUSH_FRONT
|
<br>BOOST_PP_SEQ_PUSH_FRONT
|
||||||
<br>BOOST_PP_SET_REMOVE
|
<br>BOOST_PP_SEQ_REMOVE
|
||||||
<br>BOOST_PP_SET_REPLACE
|
<br>BOOST_PP_SEQ_REPLACE
|
||||||
<br>BOOST_PP_SET_REST_N
|
<br>BOOST_PP_SEQ_REST_N
|
||||||
<br>BOOST_PP_SET_REVERSE
|
<br>BOOST_PP_SEQ_REVERSE
|
||||||
<br>BOOST_PP_SET_REVERSE_S
|
<br>BOOST_PP_SEQ_REVERSE_S
|
||||||
<br>BOOST_PP_SET_SIZE
|
<br>BOOST_PP_SEQ_SIZE
|
||||||
<br>BOOST_PP_SET_SUBSET
|
<br>BOOST_PP_SEQ_SUBSEQ
|
||||||
<br>BOOST_PP_SET_TAIL
|
<br>BOOST_PP_SEQ_TAIL
|
||||||
<br>BOOST_PP_SET_TO_ARRAY
|
<br>BOOST_PP_SEQ_TO_ARRAY
|
||||||
<br>BOOST_PP_SET_TO_TUPLE
|
<br>BOOST_PP_SEQ_TO_TUPLE
|
||||||
<br>BOOST_PP_SET_TRANSFORM
|
<br>BOOST_PP_SEQ_TRANSFORM
|
||||||
<br>BOOST_PP_SET_TRANSFORM_S
|
<br>BOOST_PP_SEQ_TRANSFORM_S
|
||||||
<br>BOOST_PP_SLOT
|
<br>BOOST_PP_SLOT
|
||||||
<br>BOOST_PP_STRINGIZE
|
<br>BOOST_PP_STRINGIZE
|
||||||
<br>BOOST_PP_SUB
|
<br>BOOST_PP_SUB
|
||||||
@ -227,7 +227,7 @@ BOOST_PP_ADD
|
|||||||
<br>BOOST_PP_TUPLE_REM_CTOR
|
<br>BOOST_PP_TUPLE_REM_CTOR
|
||||||
<br>BOOST_PP_TUPLE_REVERSE
|
<br>BOOST_PP_TUPLE_REVERSE
|
||||||
<br>BOOST_PP_TUPLE_TO_LIST
|
<br>BOOST_PP_TUPLE_TO_LIST
|
||||||
<br>BOOST_PP_TUPLE_TO_SET
|
<br>BOOST_PP_TUPLE_TO_SEQ
|
||||||
<br>BOOST_PP_VALUE
|
<br>BOOST_PP_VALUE
|
||||||
<br>BOOST_PP_WHILE
|
<br>BOOST_PP_WHILE
|
||||||
<br>BOOST_PP_WHILE_
|
<br>BOOST_PP_WHILE_
|
||||||
|
|||||||
@ -15,7 +15,7 @@
|
|||||||
Library
|
Library
|
||||||
<br>
|
<br>
|
||||||
<a href="index.html" target="_parent"><font color="green"><b>Preprocessor</b></font></a>
|
<a href="index.html" target="_parent"><font color="green"><b>Preprocessor</b></font></a>
|
||||||
Subseq for <font color="red">C/C++</font>
|
Subset for <font color="red">C/C++</font>
|
||||||
</td>
|
</td>
|
||||||
</tr>
|
</tr>
|
||||||
</table>
|
</table>
|
||||||
|
|||||||
Reference in New Issue
Block a user