bidirectional_filter.html 8.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154
  1. <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
  2. <HTML>
  3. <HEAD>
  4. <TITLE>BidirectionalFilter</TITLE>
  5. <LINK REL="stylesheet" HREF="../../../../boost.css">
  6. <LINK REL="stylesheet" HREF="../theme/iostreams.css">
  7. </HEAD>
  8. <BODY>
  9. <!-- Begin Banner -->
  10. <H1 CLASS="title">BidirectionalFilter</H1>
  11. <HR CLASS="banner">
  12. <!-- End Banner -->
  13. <H2>Definition</H2>
  14. <P>
  15. An BidirectionalFilter is a <A HREF="filter.html">Filter</A> whose <A HREF="../guide/modes.html">mode</A> refines <A HREF="../guide/modes.html#bidirectional"><CODE>bidirectional</CODE></A>.
  16. </P>
  17. <H2>Description</H2>
  18. <P>
  19. An BidirectionalFilter operates on the character sequences controlled by a <A HREF="bidirectional_device.html">BidirectionalDevice</A>, providing access to two filtered sequences having the same character type. It may expose the filtered sequences in two ways:
  20. <OL>
  21. <LI STYLE="list-style-type:lower-roman">
  22. by defining member function <CODE>get</CODE> and <CODE>put</CODE>.
  23. </LI>
  24. <LI STYLE="list-style-type:lower-roman">
  25. by defining member functions <CODE>read</CODE> and <CODE>write</CODE>.
  26. </LI>
  27. </OL>
  28. The second alternative is provided for enhanced performance. BidirectionalFilters implementing this alternative are referred to as <A HREF="multi_character.html">Multi-Character Filters</A>.
  29. </P>
  30. <H2>Refinement of</H2>
  31. <P><A HREF="input_filter.html">InputFilter</A>, <A HREF="output_filter.html">OutputFilter</A>.</P>
  32. <H2>Associated Types</H2>
  33. <TABLE CELLPADDING="5" BORDER="1">
  34. <TR><TD>Character type</TD><TD>The type of the characters in the filtered sequences</TD></TR>
  35. <TR>
  36. <TD>Category</TD>
  37. <TD>
  38. A type convertible to <A HREF="../guide/traits.html#category_tags"><CODE>filter_tag</CODE></A> and to <A HREF="../guide/modes.html#bidirectional"><CODE>bidirectional</CODE></A>
  39. </TD>
  40. </TR>
  41. <TR>
  42. <TD>Mode</TD>
  43. <TD>
  44. The unique <I>most-derived</I> <A HREF="../guide/modes.html#mode_tags">mode tag</A> to which Category is convertible
  45. </TD>
  46. </TR>
  47. </TABLE>
  48. <H2>Notation</H2>
  49. <TABLE CELLPADDING="2">
  50. <TR><TD><CODE>F</CODE></TD><TD>- A type which is a model of BidirectionalFilter</TD></TR>
  51. <TR><TD><CODE>D</CODE></TD><TD>- A type which is a model of <A HREF="device.html">Device</A>, with the same character type as <CODE>F</CODE> and with mode refining the mode of <CODE>F</CODE></TD></TR>
  52. <TR><TD><CODE>Ch</CODE></TD><TD>- The character type of <CODE>F</CODE></TD></TR>
  53. <TR><TD><CODE>Tr</CODE></A></TD><TD>- <A HREF="../classes/char_traits.html"><CODE>boost::iostreams::char_traits&lt;Ch&gt;</CODE></A></TD></TR>
  54. <TR><TD><CODE>f</CODE></TD><TD>- Object of type <CODE>F</CODE></TD></TR>
  55. <TR><TD><CODE>d</CODE></TD><TD>- Object of type <CODE>D</CODE></TD></TR>
  56. <TR><TD><CODE>c</CODE></TD><TD>- Object of type <CODE>Ch</CODE></TD></TR>
  57. <TR><TD><CODE>s1</CODE></TD><TD>- Object of type <CODE>Ch*</CODE></TD></TR>
  58. <TR><TD><CODE>s2</CODE></TD><TD>- Object of type <CODE>const Ch*</CODE></TD></TR>
  59. <TR><TD><CODE>n</CODE></TD><TD>- Object of type <CODE>std::streamsize</CODE></TD></TR>
  60. <TR><TD><CODE>io</CODE></TD><TD>- Alias for namespace <CODE>boost::iostreams</CODE></TD></TR>
  61. </TABLE>
  62. <H2>Valid Expressions / Semantics</H2>
  63. <TABLE CELLPADDING="5" BORDER="1">
  64. <TR><TH>Expression</TH><TH>Expression Type</TH><TH>Category Precondition</TH><TH>Semantics</TH></TR>
  65. <TR>
  66. <TD>
  67. <PRE CLASS="plain_code"><CODE>typename <A HREF="../guide/traits.html#char_type_of_ref">char_type_of</A>&lt;F&gt;::type</CODE></PRE>
  68. </TD>
  69. <TD><CODE>typename</CODE> of the character type</TD>
  70. <TD ALIGN="center">-</TD><TD ALIGN="center">-</TD>
  71. </TR>
  72. <TR>
  73. <TD>
  74. <PRE CLASS="plain_code"><CODE>typename <A HREF="../guide/traits.html#category_ref">category_of</A>&lt;F&gt;::type</CODE></PRE>
  75. </TD>
  76. <TD><CODE>typename</CODE> of the category</TD>
  77. <TD ALIGN="center">-</TD><TD ALIGN="center">-</TD>
  78. </TR>
  79. <TR>
  80. <TD><PRE CLASS="plain_code"><CODE>f.get(d)</CODE></PRE></TD>
  81. <TD><CODE>Tr::int_type</CODE></TD>
  82. <TD ROWSPAN="2">
  83. Convertible to <A HREF="../guide/modes.html#mode_tags"><CODE>input</CODE></A> but not to <A HREF="../guide/traits.html#category_tags"><CODE>multichar_tag</CODE></A>
  84. </TD>
  85. <TD>
  86. Returns the next character in the input sequence controlled by <CODE>f</CODE>, <CODE>Tr::eof()</CODE> if the end of the sequence has been reached or <CODE>Tr::would_block()</CODE> if input is temporarily unavilable because a call to <CODE>d</CODE> has produced fewer characters than requested. The input sequence controlled by <CODE>d</CODE> may be accessed using <A HREF="../functions/get.html"><CODE>io::get</CODE></A>, <A HREF="../functions/read.html"><CODE>io::read</CODE></A> and <A HREF="../functions/putback.html"><CODE>io::putback</CODE></A>.
  87. </TD>
  88. </TR>
  89. <TR>
  90. <TD><PRE CLASS="plain_code"><CODE>f.put(d, c)</CODE></PRE></TD>
  91. <TD><CODE>bool</CODE></TD>
  92. <TD>
  93. Attempts to writes the character <CODE>c</CODE> to the output sequence controlled by <CODE>f</CODE>, returning <CODE>false</CODE> if <CODE>c</CODE> cannot be consumed because a call to <CODE>d</CODE> has consumed fewer characters than requested. The output sequence controlled by <CODE>d</CODE> may be accessed using <A HREF="../functions/put.html"><CODE>io::put</CODE></A> and <A HREF="../functions/write.html"><CODE>io::write</CODE></A>.
  94. </TD>
  95. </TR>
  96. <TR>
  97. <TD><PRE CLASS="plain_code"><CODE>f.read(d, s1, n)</CODE></PRE></TD>
  98. <TD><PRE CLASS="plain_code"><CODE>std::streamsize</CODE></PRE></TD>
  99. <TD ROWSPAN="2">
  100. Convertible to <A HREF="../guide/modes.html#mode_tags"><CODE>input</CODE></A> and to <A HREF="../guide/traits.html#category_tags"><CODE>multichar_tag</CODE></A>
  101. </TD>
  102. <TD>
  103. Reads up to <CODE>n</CODE> characters from the input sequence controlled by <CODE>f</CODE> into the buffer <CODE>s1</CODE>, returning the number of characters read or <CODE>-1</CODE> to indicate end-of-sequence. A value less than <CODE>n</CODE> may be returned only at end-of-sequence or if input is temporarily unavilable because a call to <CODE>d</CODE> has produced fewer characters than requested. The input sequence controlled by <CODE>d</CODE> may be accessed using <A HREF="../functions/get.html"><CODE>io::get</CODE></A>, <A HREF="../functions/read.html"><CODE>io::read</CODE></A> and <A HREF="../functions/putback.html"><CODE>io::putback</CODE></A>.
  104. </TD>
  105. </TR>
  106. <TR>
  107. <TD><PRE CLASS="plain_code"><CODE>f.write(d, s2, n)</CODE></PRE></TD>
  108. <TD><PRE CLASS="plain_code"><CODE>std::streamsize</CODE></PRE></TD>
  109. <TD>
  110. Writes up to <CODE>n</CODE> characters from the buffer <CODE>s2</CODE> to the output sequence controlled by <CODE>d</CODE>, returning the number of characters written. A value less than <CODE>n</CODE> may be returned only if a call to <CODE>d</CODE> has consumed fewer characters than requested. The output sequence controlled by <CODE>d</CODE> may be accessed using <A HREF="../functions/put.html"><CODE>io::put</CODE></A> and <A HREF="../functions/write.html"><CODE>io::write</CODE></A>.
  111. </TD>
  112. </TR>
  113. </TABLE>
  114. <H2>Exceptions</H2>
  115. <P>
  116. Errors which occur during the execution of <CODE>get</CODE>, <CODE>put</CODE>, <CODE>read</CODE> or <CODE>write</CODE> are indicated by throwing exceptions. Reaching the end of the input sequence is not an error, but attempting to write past the end of the output sequence is.
  117. </P>
  118. <P>
  119. After an exception is thrown, an BidirectionalFilter must be in a consistent state; further i/o operations may throw exceptions but must have well-defined behaviour. Furthermore, unless it is <A HREF="closable.html">Closable</A>, it must be ready to begin processing a new character sequence.
  120. </P>
  121. <H2>Models</H2>
  122. <!-- Begin Footer -->
  123. <HR>
  124. <P CLASS="copyright">&copy; Copyright 2008 <a href="http://www.coderage.com/" target="_top">CodeRage, LLC</a><br/>&copy; Copyright 2004-2007 <a href="https://www.boost.org/users/people/jonathan_turkanis.html" target="_top">Jonathan Turkanis</a></P>
  125. <P CLASS="copyright">
  126. Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at <A HREF="http://www.boost.org/LICENSE_1_0.txt">http://www.boost.org/LICENSE_1_0.txt</A>)
  127. </P>
  128. <!-- End Footer -->
  129. </BODY>