⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 00714.html

📁 这是一本关于verilog编程语言的教程,对学习verilog语言有帮助
💻 HTML
📖 第 1 页 / 共 2 页
字号:
<div class="Element207">
function void pop_front();<br>pop_front removes the first element of the list. If the list is empty, this method is illegal and can generate an error.&nbsp;</div></td></tr><tr>
<td class="Element202" valign="top" width="50%">
<div class="Element203">
<a href="00731.html" target="topic">D.5.8 pop_back()</a>&nbsp;</div></td><td class="Element206" valign="top" width="50%">
<div class="Element207">
function void pop_back();<br>pop_back removes the last element of the list. If the list is empty, this method is illegal and can generate an error.<br>while ( lp.size &gt; 1 ) begin // remove all but the center element from<br>// an odd-sized list lp<br>lp.pop_front();<br>lp.pop_back();<br>end&nbsp;</div></td></tr><tr>
<td class="Element202" valign="top" width="50%">
<div class="Element203">
<a href="00732.html" target="topic">D.5.9 start()</a>&nbsp;</div></td><td class="Element206" valign="top" width="50%">
<div class="Element207">
function List_Iterator#(T) start();<br>start returns an iterator to the position of the first element in the list.&nbsp;</div></td></tr><tr>
<td class="Element202" valign="top" width="50%">
<div class="Element203">
<a href="00716.html" target="topic">D.5.10 finish()</a>&nbsp;</div></td><td class="Element206" valign="top" width="50%">
<div class="Element207">
function List_Iterator#(T) finish();<br>finish returns an iterator to a position just past the last element in the list. The last element in the last can be accessed using finish.prev.<br>List#(int) lst; // display contents of list lst in position order<br>for ( List_Iterator#(int) p = lst.start; p.neq(lst.finish); p.next )<br>$display( p.data );&nbsp;</div></td></tr><tr>
<td class="Element202" valign="top" width="50%">
<div class="Element203">
<a href="00717.html" target="topic">D.5.11 insert()</a>&nbsp;</div></td><td class="Element206" valign="top" width="50%">
<div class="Element207">
function void insert( List_Iterator#(T) position, T value );<br>insert inserts the given data (value) into the list at the position specified by the iterator (before the element, if any, that was previously at the iterator’s position). If the iterator is not a valid position within the list, then this operation is illegal and can generate an error.<br>function void add_sort( List#(byte) L, byte value );<br>for ( List_Iterator#(byte) p = L.start; p.neq(L.finish) ; p.next )<br>if ( p.data &gt; value ) begin<br>lst.insert( p, value ); // Add to sorted list (ascending order)<br>return;<br>end<br>endfunction&nbsp;</div></td></tr><tr>
<td class="Element202" valign="top" width="50%">
<div class="Element203">
<a href="00718.html" target="topic">D.5.12 insert_range()</a>&nbsp;</div></td><td class="Element206" valign="top" width="50%">
<div class="Element207">
function void insert_range( List_Iterator#(T) position, first, last );<br>insert_range inserts the elements contained in the list range specified by the iterators first and last at the specified list position (before the element, if any, that was previously at the position iterator). All the elements from first up to, but not including, last are inserted into the list. If the last iterator refers to an element before the first iterator, the range wraps around the end of the list. The range iterators can specify a range either in another list or in the same list as being inserted.<br><br>If the position... <a href="00718.html" target="topic">more</a>&nbsp;</div></td></tr><tr>
<td class="Element202" valign="top" width="50%">
<div class="Element203">
<a href="00719.html" target="topic">D.5.13 erase()</a>&nbsp;</div></td><td class="Element206" valign="top" width="50%">
<div class="Element207">
function void erase( List_Iterator#(T) position );<br>erase removes form the list the element at the specified position. After erase() returns, the position iterator becomes invalid.<br>list1.erase( list1.start ); // same as pop_front<br>If the position iterator is not a valid position within the list, this operation is illegal and can generate an error.&nbsp;</div></td></tr><tr>
<td class="Element202" valign="top" width="50%">
<div class="Element203">
<a href="00720.html" target="topic">D.5.14 erase_range()</a>&nbsp;</div></td><td class="Element206" valign="top" width="50%">
<div class="Element207">
function void erase_range( List_Iterator#(T) first, last );<br>erase_range removes from a list the range of elements specified by the first and last iterators. This operation removes elements from the first iterator’s position up to, but not including, the last iterator’s position. If the last iterator refers to an element before the first iterator, the range wraps around the end of the list.<br>list1.erase_range( list1.start, list1.finish ); // Remove all elements from<br>// list1<br>If the range iterators are invalid (i.e., they refer to different lists or to invalid positions), then this operation is illegal and can generate an error.&nbsp;</div></td></tr><tr>
<td class="Element202" valign="top" width="50%">
<div class="Element203">
<a href="00721.html" target="topic">D.5.15 set()</a>&nbsp;</div></td><td class="Element206" valign="top" width="50%">
<div class="Element207">
function void set( List_Iterator#(T) first, last );<br>set assigns to the list object the elements that lie in the range specified by the first and last iterators. After this method returns, the modified list shall have a size equal to the range specified by first and last. This method copies the data from the first iterator’s position up to, but not including, the last iterator’s position. If the last iterator refers to an element before the first iterator, the range wraps around the end of the list.<br>list2.set( list1.start, list2.finish ); // list2 is a copy of list1<br>If the... <a href="00721.html" target="topic">more</a>&nbsp;</div></td></tr><tr>
<td class="Element202" valign="top" width="50%">
<div class="Element203">
<a href="00722.html" target="topic">D.5.16 swap()</a>&nbsp;</div></td><td class="Element206" valign="top" width="50%">
<div class="Element207">
function void swap( List#(T) lst );<br>swap exchanges the contents of two equal-size lists.<br>list1.swap( list2 ); // swap the contents of list1 to list2 and vice-versa<br>Swapping a list with itself has no effect. If the lists are of different sizes, this method can issue a warning.&nbsp;</div></td></tr><tr>
<td class="Element202" valign="top" width="50%">
<div class="Element203">
<a href="00723.html" target="topic">D.5.17 clear()</a>&nbsp;</div></td><td class="Element206" valign="top" width="50%">
<div class="Element207">
function void clear();<br>clear removes all the elements from a list, but not the list itself (i.e., the list header itself).<br>list1.clear(); // list1 becomes empty&nbsp;</div></td></tr><tr>
<td class="Element202" valign="top" width="50%">
<div class="Element203">
<a href="00724.html" target="topic">D.5.18 purge()</a>&nbsp;</div></td><td class="Element206" valign="top" width="50%">
<div class="Element207">
function void purge();<br>purge removes all the list elements (as in clear) and the list itself. This accomplishes the same effect as assigning null to the list. A purged list must be re-created using new before it can be used again.<br>list1.purge(); // same as list1 = null&nbsp;</div></td></tr></table></div></div>
</div>
</div>
</div>
<a name="Links"></a><div class="Element14">
<a onclick="toggleVisibilityStored('链接');" class="a_Element14"><img src="sectionminus.png" border="0" alt="" title="" id="img链接">链接</a></div>
<div id="div链接">
<div class="Element11">
<div class="Element10">
<a href="00882.html" target="topic">附录D 链表</a>, <a href="01030.html" target="topic">主题</a></div>
</div>
</div>
</div>
<!-- End Page Content -->

<!-- Begin Page Footer -->
<hr width="98%" align="center" size="1" color="#CCCCCC" />
<table align="center" cellpadding="0" cellspacing="0" border="0">
	<tbody>
		<tr height="10">
			<td></td>
		</tr>
		<tr align="center">
			<td>
<script type="text/javascript"><!--
google_ad_client = "pub-5266859600380184";
google_ad_width = 468;
google_ad_height = 60;
google_ad_format = "468x60_as";
google_ad_type = "text_image";
google_ad_channel ="";
google_page_url = document.location;
//--></script>
<script type="text/javascript"
  src="http://pagead2.googlesyndication.com/pagead/show_ads.js">
</script>
			</td>
		</tr>
		<tr height="15">
			<td></td>
		</tr>
		<tr align="center">
			<td>
				<font size=2>除非特别声明,原文版权归作者所有,如有转摘请注明原作者以及译者(<a href="http://www.fpgatech.net/"  target="_blank">FPGA技术网</a>)信息。<br />
如果您对本主题有何建议或意见,请登陆<a href="http://www.fpgatech.net/forum/forumdisplay.php?fid=18" target="_blank">FPGA开发者家园</a>提交,您的参与是我们前进的动力。</font>
<script language="javascript" type="text/javascript" src="http://js.users.51.la/195685.js"></script>
<noscript><a href="http://www.51.la/?195685" target="_blank"><img alt="&#x6211;&#x8981;&#x5566;&#x514D;&#x8D39;&#x7EDF;&#x8BA1;" src="http://img.users.51.la/195685.asp" style="border:none" /></a></noscript>
			</td>
		</tr>
	</tbody>
</table>

<!-- End Page Footer -->
</div>
</div>

<!-- End Client Area -->
</body></html>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -