﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>博客园-花开花落-随笔分类-数据结构</title><link>http://www.cnblogs.com/lucifer1982/category/140153.html</link><description /><language>zh-cn</language><lastBuildDate>Thu, 03 Jul 2008 02:50:21 GMT</lastBuildDate><pubDate>Thu, 03 Jul 2008 02:50:21 GMT</pubDate><ttl>60</ttl><item><title>数据结构 : Hash Table [II]</title><link>http://www.cnblogs.com/lucifer1982/archive/2008/07/03/1234431.html</link><dc:creator>Angel Lucifer</dc:creator><author>Angel Lucifer</author><pubDate>Wed, 02 Jul 2008 21:35:00 GMT</pubDate><guid>http://www.cnblogs.com/lucifer1982/archive/2008/07/03/1234431.html</guid><wfw:comment>http://www.cnblogs.com/lucifer1982/comments/1234431.html</wfw:comment><comments>http://www.cnblogs.com/lucifer1982/archive/2008/07/03/1234431.html#Feedback</comments><slash:comments>7</slash:comments><wfw:commentRss>http://www.cnblogs.com/lucifer1982/comments/commentRss/1234431.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/lucifer1982/services/trackbacks/1234431.html</trackback:ping><description><![CDATA[摘要: Hash Table 给我们带来了 O(1) 的插入，删除和查找性能。 <br>我们应当如何使用？ <br>它实现的原理是什么？ <br>又该如何实现呢？ <br>这篇文章将尝试着对其做出解答。&nbsp;&nbsp;<a href='http://www.cnblogs.com/lucifer1982/archive/2008/07/03/1234431.html'>阅读全文</a><img src ="http://www.cnblogs.com/lucifer1982/aggbug/1234431.html?type=1" width = "1" height = "1" />]]></description></item><item><title>数据结构 : Hash Table [I]</title><link>http://www.cnblogs.com/lucifer1982/archive/2008/06/18/1224319.html</link><dc:creator>Angel Lucifer</dc:creator><author>Angel Lucifer</author><pubDate>Tue, 17 Jun 2008 16:46:00 GMT</pubDate><guid>http://www.cnblogs.com/lucifer1982/archive/2008/06/18/1224319.html</guid><wfw:comment>http://www.cnblogs.com/lucifer1982/comments/1224319.html</wfw:comment><comments>http://www.cnblogs.com/lucifer1982/archive/2008/06/18/1224319.html#Feedback</comments><slash:comments>29</slash:comments><wfw:commentRss>http://www.cnblogs.com/lucifer1982/comments/commentRss/1224319.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/lucifer1982/services/trackbacks/1224319.html</trackback:ping><description><![CDATA[摘要: Hash Table 给我们带来了 O(1) 的插入，删除和查找性能。<br>我们应当如何使用？<br>它实现的原理是什么？<br>又该如何实现呢？<br>这篇文章将尝试着对其做出解答。&nbsp;&nbsp;<a href='http://www.cnblogs.com/lucifer1982/archive/2008/06/18/1224319.html'>阅读全文</a><img src ="http://www.cnblogs.com/lucifer1982/aggbug/1224319.html?type=1" width = "1" height = "1" />]]></description></item><item><title>数据结构 : 堆之外传</title><link>http://www.cnblogs.com/lucifer1982/archive/2008/06/13/1218559.html</link><dc:creator>Angel Lucifer</dc:creator><author>Angel Lucifer</author><pubDate>Thu, 12 Jun 2008 19:23:00 GMT</pubDate><guid>http://www.cnblogs.com/lucifer1982/archive/2008/06/13/1218559.html</guid><wfw:comment>http://www.cnblogs.com/lucifer1982/comments/1218559.html</wfw:comment><comments>http://www.cnblogs.com/lucifer1982/archive/2008/06/13/1218559.html#Feedback</comments><slash:comments>18</slash:comments><wfw:commentRss>http://www.cnblogs.com/lucifer1982/comments/commentRss/1218559.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/lucifer1982/services/trackbacks/1218559.html</trackback:ping><description><![CDATA[摘要: 优先级队列是仅允许访问最小项的基本数据结构。<br>这篇文章将讨论支持优先级队列数据结构的一种实现，即著名的二叉堆（Binary Heap）。<br>如无特别提及，本文均简称其为堆。<br>堆支持最坏情况对对数时间的新项插入和最小项删除，而具体实现则使用我们最熟知的数组。&nbsp;&nbsp;<a href='http://www.cnblogs.com/lucifer1982/archive/2008/06/13/1218559.html'>阅读全文</a><img src ="http://www.cnblogs.com/lucifer1982/aggbug/1218559.html?type=1" width = "1" height = "1" />]]></description></item><item><title>并发数据结构 : SpinWait</title><link>http://www.cnblogs.com/lucifer1982/archive/2008/06/01/1211471.html</link><dc:creator>Angel Lucifer</dc:creator><author>Angel Lucifer</author><pubDate>Sat, 31 May 2008 18:20:00 GMT</pubDate><guid>http://www.cnblogs.com/lucifer1982/archive/2008/06/01/1211471.html</guid><wfw:comment>http://www.cnblogs.com/lucifer1982/comments/1211471.html</wfw:comment><comments>http://www.cnblogs.com/lucifer1982/archive/2008/06/01/1211471.html#Feedback</comments><slash:comments>10</slash:comments><wfw:commentRss>http://www.cnblogs.com/lucifer1982/comments/commentRss/1211471.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/lucifer1982/services/trackbacks/1211471.html</trackback:ping><description><![CDATA[摘要: 老实说，没有哪个开发人员愿意在其编码时还要考虑线程同步。更糟糕的情况是，编写线程同步代码一点也不好玩。稍一不慎，就会导致共享资源状态不一致，从而引发程序未预期行为。此外，当我们添加线程同步代码时还会导致程序运行变慢，损害性能和可伸缩性。从这点上来看，线程同步简直一无是处。可惜，这也是现实生活中必要的一部分。尤其在多核CPU成为主流的今天。&nbsp;&nbsp;<a href='http://www.cnblogs.com/lucifer1982/archive/2008/06/01/1211471.html'>阅读全文</a><img src ="http://www.cnblogs.com/lucifer1982/aggbug/1211471.html?type=1" width = "1" height = "1" />]]></description></item><item><title>并发数据结构:Stack</title><link>http://www.cnblogs.com/lucifer1982/archive/2008/04/24/1168483.html</link><dc:creator>Angel Lucifer</dc:creator><author>Angel Lucifer</author><pubDate>Wed, 23 Apr 2008 18:52:00 GMT</pubDate><guid>http://www.cnblogs.com/lucifer1982/archive/2008/04/24/1168483.html</guid><wfw:comment>http://www.cnblogs.com/lucifer1982/comments/1168483.html</wfw:comment><comments>http://www.cnblogs.com/lucifer1982/archive/2008/04/24/1168483.html#Feedback</comments><slash:comments>17</slash:comments><wfw:commentRss>http://www.cnblogs.com/lucifer1982/comments/commentRss/1168483.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/lucifer1982/services/trackbacks/1168483.html</trackback:ping><description><![CDATA[摘要: Stack是一种线性数据结构，只能访问它的一端来存储或读取数据。Stack很像餐厅中的一叠盘子：将新盘子堆在最上面，并从最上面取走盘子。最后一个堆在上面的盘子第一个被取走。因此Stack也被称为后进先出结构(LIFO)。&nbsp;&nbsp;<a href='http://www.cnblogs.com/lucifer1982/archive/2008/04/24/1168483.html'>阅读全文</a><img src ="http://www.cnblogs.com/lucifer1982/aggbug/1168483.html?type=1" width = "1" height = "1" />]]></description></item></channel></rss>