﻿<?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>C++博客-千里暮云平-随笔分类-vgl::adt 泛化容器库</title><link>http://www.cppblog.com/zblc/category/15455.html</link><description>premature optimization is the root of all evil. Email:zblcving@gmail.com  QQ:739227481</description><language>zh-cn</language><lastBuildDate>Sun, 14 Nov 2010 14:35:07 GMT</lastBuildDate><pubDate>Sun, 14 Nov 2010 14:35:07 GMT</pubDate><ttl>60</ttl><item><title>vgl::adt::gstring 泛化字符串类 1.1</title><link>http://www.cppblog.com/zblc/archive/2010/11/14/133610.html</link><dc:creator>千暮(zblc)</dc:creator><author>千暮(zblc)</author><pubDate>Sun, 14 Nov 2010 13:52:00 GMT</pubDate><guid>http://www.cppblog.com/zblc/archive/2010/11/14/133610.html</guid><wfw:comment>http://www.cppblog.com/zblc/comments/133610.html</wfw:comment><comments>http://www.cppblog.com/zblc/archive/2010/11/14/133610.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cppblog.com/zblc/comments/commentRss/133610.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/zblc/services/trackbacks/133610.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: <br>包含gstring(泛型字符串类)以及它的派生ustring(宽字符类).<br><br>现在贴出来晒晒，改天把case也贴出来下，不过肯定会存在bug的。<br><br>而且只实现了一些必须的功能。<br>&nbsp;&nbsp;<a href='http://www.cppblog.com/zblc/archive/2010/11/14/133610.html'>阅读全文</a><img src ="http://www.cppblog.com/zblc/aggbug/133610.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zblc/" target="_blank">千暮(zblc)</a> 2010-11-14 21:52 <a href="http://www.cppblog.com/zblc/archive/2010/11/14/133610.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>vgl base::adt::graph 2.0(更新)</title><link>http://www.cppblog.com/zblc/archive/2009/12/21/103605.html</link><dc:creator>千暮(zblc)</dc:creator><author>千暮(zblc)</author><pubDate>Sun, 20 Dec 2009 20:20:00 GMT</pubDate><guid>http://www.cppblog.com/zblc/archive/2009/12/21/103605.html</guid><wfw:comment>http://www.cppblog.com/zblc/comments/103605.html</wfw:comment><comments>http://www.cppblog.com/zblc/archive/2009/12/21/103605.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/zblc/comments/commentRss/103605.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/zblc/services/trackbacks/103605.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 由于上一次的graph adt结构没有 主索引表allArc,allNode 和 VNode 结构内的inArc,outArc 的相互索引能力,效率比较低.这一次专门细化了基本结构(VNode,VArc)的元操作,不导致任何功能上的冲突.写代码期间居然有心情写注释,说明写库如果先自上而下的设计,再自下而上的实现,还是能够增加设计级效率.0&nbsp; 为了实现相互索引的优化能力,图结构的每一个no...&nbsp;&nbsp;<a href='http://www.cppblog.com/zblc/archive/2009/12/21/103605.html'>阅读全文</a><img src ="http://www.cppblog.com/zblc/aggbug/103605.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zblc/" target="_blank">千暮(zblc)</a> 2009-12-21 04:20 <a href="http://www.cppblog.com/zblc/archive/2009/12/21/103605.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>VGAlgo.VGAdt.VGGraph 1.0</title><link>http://www.cppblog.com/zblc/archive/2009/12/12/103027.html</link><dc:creator>千暮(zblc)</dc:creator><author>千暮(zblc)</author><pubDate>Fri, 11 Dec 2009 16:27:00 GMT</pubDate><guid>http://www.cppblog.com/zblc/archive/2009/12/12/103027.html</guid><wfw:comment>http://www.cppblog.com/zblc/comments/103027.html</wfw:comment><comments>http://www.cppblog.com/zblc/archive/2009/12/12/103027.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cppblog.com/zblc/comments/commentRss/103027.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/zblc/services/trackbacks/103027.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 封装两种DirectedGraph结构,在写泛化VDiGraphEx时考虑的不是很周全,一开始犹豫是用Vector还是Array实现对边和结点的打包,考虑到图结构的递归特性,如果用Array对空间消耗较大,另一方面映射表已经解决了时间效率问题,那么非映射表型的图决定采取其互补形式设计.<br>&nbsp;&nbsp;<a href='http://www.cppblog.com/zblc/archive/2009/12/12/103027.html'>阅读全文</a><img src ="http://www.cppblog.com/zblc/aggbug/103027.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zblc/" target="_blank">千暮(zblc)</a> 2009-12-12 00:27 <a href="http://www.cppblog.com/zblc/archive/2009/12/12/103027.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>vgl base::adt::tree &amp; base::code::ptr 1.2(更新)</title><link>http://www.cppblog.com/zblc/archive/2009/12/07/102748.html</link><dc:creator>千暮(zblc)</dc:creator><author>千暮(zblc)</author><pubDate>Mon, 07 Dec 2009 13:04:00 GMT</pubDate><guid>http://www.cppblog.com/zblc/archive/2009/12/07/102748.html</guid><wfw:comment>http://www.cppblog.com/zblc/comments/102748.html</wfw:comment><comments>http://www.cppblog.com/zblc/archive/2009/12/07/102748.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cppblog.com/zblc/comments/commentRss/102748.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/zblc/services/trackbacks/102748.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: Tree&nbsp; &amp; SmartPtr没有命名冲突后,考虑是否要去掉库前缀. 本来想重写泛化N叉树，再派生出泛化二叉树.考虑到效率而且常用性,暂时不重写N叉树.:第一季tree实现的更改版本/**//*&nbsp;&nbsp;tree.h&nbsp;:base::adt::tree&nbsp;*/#ifndef&nbsp;&nbsp;TREE__#define&nbsp;&nbsp...&nbsp;&nbsp;<a href='http://www.cppblog.com/zblc/archive/2009/12/07/102748.html'>阅读全文</a><img src ="http://www.cppblog.com/zblc/aggbug/102748.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zblc/" target="_blank">千暮(zblc)</a> 2009-12-07 21:04 <a href="http://www.cppblog.com/zblc/archive/2009/12/07/102748.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>vgl base::adt::vector 1.2 (更新)</title><link>http://www.cppblog.com/zblc/archive/2009/12/05/102584.html</link><dc:creator>千暮(zblc)</dc:creator><author>千暮(zblc)</author><pubDate>Fri, 04 Dec 2009 18:52:00 GMT</pubDate><guid>http://www.cppblog.com/zblc/archive/2009/12/05/102584.html</guid><wfw:comment>http://www.cppblog.com/zblc/comments/102584.html</wfw:comment><comments>http://www.cppblog.com/zblc/archive/2009/12/05/102584.html#Feedback</comments><slash:comments>4</slash:comments><wfw:commentRss>http://www.cppblog.com/zblc/comments/commentRss/102584.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/zblc/services/trackbacks/102584.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 其他数据结构通过泛化的Pair,Array,Chain,Auto,Tree,Graphi衍生,不独立设计新的容器,这样可以集中写自己想要的目标实现.向量 vector0 没有SmartPtr去控制指针,而是把所有可能的基本操作封装到结点本身的结构体内.1 为链表的小操作如插入删除列出内部结构体函数,方便以后代码优化,以后增加迭代器的操作就无关内存回收,因为最小粒度操作被封装进结点本身的结构体内方法...&nbsp;&nbsp;<a href='http://www.cppblog.com/zblc/archive/2009/12/05/102584.html'>阅读全文</a><img src ="http://www.cppblog.com/zblc/aggbug/102584.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zblc/" target="_blank">千暮(zblc)</a> 2009-12-05 02:52 <a href="http://www.cppblog.com/zblc/archive/2009/12/05/102584.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>