<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title>Chao's garden</title><link>https://01io.dev/zh-cn/</link><description>Chao Sun's garden. It is inspired by digital garden concept, and the most importance philosphy is 'don't have to be perfect'. With this spirit, each posts here can be imperfect or incompelete, and hopeful it grows up and develops as time goes</description><generator>Hugo -- gohugo.io</generator><language>zh-CN</language><managingEditor>csun01io@outlook.coms (Chao)</managingEditor><webMaster>csun01io@outlook.coms (Chao)</webMaster><lastBuildDate>Mon, 25 May 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://01io.dev/zh-cn/index.xml" rel="self" type="application/rss+xml"/><item><title>使用大模型 AI 的基本原则</title><link>https://01io.dev/zh-cn/posts/basic-principles-of-using-llm-ai/</link><pubDate>Mon, 25 May 2026 00:00:00 +0000</pubDate><author>Chao</author><guid>https://01io.dev/zh-cn/posts/basic-principles-of-using-llm-ai/</guid><description>使用大模型 AI 时应该遵循的一些基本原则。</description></item><item><title>C++ STL Algorithm 里的比较函数</title><link>https://01io.dev/zh-cn/posts/c++-stl-algorithm-%E9%87%8C%E7%9A%84%E6%AF%94%E8%BE%83%E5%87%BD%E6%95%B0/</link><pubDate>Sun, 10 May 2026 12:15:37 +0000</pubDate><author>Chao</author><guid>https://01io.dev/zh-cn/posts/c++-stl-algorithm-%E9%87%8C%E7%9A%84%E6%AF%94%E8%BE%83%E5%87%BD%E6%95%B0/</guid><description><![CDATA[这篇我想聊的是，类似 std::sort、std::priority_queue 或者 lower_bound/upper_bound 的定制比较函数。
template&lt; class RandomIt, class Compare &gt; void sort( RandomIt first, RandomIt last, Compare comp ); template&lt; class ForwardIt, class T, class Compare &gt; ForwardIt lower_bound( ForwardIt first, ForwardIt last, const T&amp; value, Compare comp ); template&lt; class ForwardIt, class T, class Compare &gt; ForwardIt upper_bound( ForwardIt first, ForwardIt last, const T&amp; value, Compare comp ); template&lt; class T, class Container = std::vector&lt;T&gt;, class Compare = std::less&lt;typename Container::value_type&gt; &gt; class priority_queue; 在面试做题或者实际工作中，有时候我们遇到的类型 T 是一个复合类型，无法应用默认的比较函数；或者我们对于排序有自己的规则，这种情况就需要实现定制化的比较函数，通常通过仿函数（Functor）或者 Lambda 表达式实现。]]></description></item><item><title>行动是解决 AI 焦虑的良药</title><link>https://01io.dev/zh-cn/posts/take-action-to-relieve-ai-anxiety/</link><pubDate>Tue, 14 Apr 2026 21:54:33 +0000</pubDate><author>Chao</author><guid>https://01io.dev/zh-cn/posts/take-action-to-relieve-ai-anxiety/</guid><description>AI 的发展让人们感到焦虑， 但是我们可以通过行动来缓解这种焦虑， 让自己更好地适应这个时代。</description></item></channel></rss>