<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Infernal_Puppet的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Infernal_Puppet</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Infernal_Puppet]]></copyright><item><title><![CDATA[博客系统测试用例]]></title><link>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/147593882</link><guid>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/147593882</guid><author>Infernal_Puppet</author><pubDate>Mon, 28 Apr 2025 19:19:32 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[Linux之多线程]]></title><link>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/141857858</link><guid>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/141857858</guid><author>Infernal_Puppet</author><pubDate>Tue, 03 Sep 2024 11:58:42 +0800</pubDate><description><![CDATA[个人主页：点我进入主页
专栏分类：C语言初阶 C语言进阶 数据结构初阶 Linux C++初阶 算法 C++进阶
欢迎大家点赞，评论，收藏。
一起努力，一起奔赴大厂

一.背景知识
1.1重谈地址空间
先看看地址空间的样子：


​	在操作系统中，内存不是以字节为单位，而是被分为很多块，每块的大小是**4kb，4kb？磁盘中的文件进行IO的基本单位就是4kb(8个扇区)，操作系统是4G, 被分成（102410244/4=2^20）块。在操作系统中者知识巧合吗？显然不是，操作系统是被精心设计过的，例如在磁盘]]></description><category></category></item><item><title><![CDATA[Linux之信号]]></title><link>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/141269099</link><guid>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/141269099</guid><author>Infernal_Puppet</author><pubDate>Fri, 16 Aug 2024 20:30:19 +0800</pubDate><description><![CDATA[上面图片还可以入如下理解（信号的捕捉需要4次切换。]]></description><category></category></item><item><title><![CDATA[Linux之管道]]></title><link>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/141037285</link><guid>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/141037285</guid><author>Infernal_Puppet</author><pubDate>Mon, 12 Aug 2024 15:12:05 +0800</pubDate><description><![CDATA[一起努力，一起奔赴大厂。]]></description><category></category></item><item><title><![CDATA[Linux之软硬链接和动静态库]]></title><link>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/140937696</link><guid>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/140937696</guid><author>Infernal_Puppet</author><pubDate>Tue, 06 Aug 2024 18:03:15 +0800</pubDate><description><![CDATA[一起努力，一起奔赴大厂。]]></description><category></category></item><item><title><![CDATA[Linux之文件系统]]></title><link>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/140907709</link><guid>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/140907709</guid><author>Infernal_Puppet</author><pubDate>Sun, 04 Aug 2024 23:32:18 +0800</pubDate><description><![CDATA[一起努力，一起奔赴大厂。]]></description><category></category></item><item><title><![CDATA[C++进阶之C++11]]></title><link>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/140857699</link><guid>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/140857699</guid><author>Infernal_Puppet</author><pubDate>Sat, 03 Aug 2024 20:34:05 +0800</pubDate><description><![CDATA[目录一.列表初始化1.1一切皆可用列表初始化1.2initializer list二.声明2.1auto2.2decltype2.3nullptr三.左值和右值3.1左值引用和右值引用3.2 左值和右值比较3.3右值引用场景(移动构造和移动赋值)3.4完美转发与万能引用3.5针对move一些补充四.lambda表达式4.1基本使用4.2捕捉列表五.新的类功能六.可变参数模板    6.1输出可变参数包的个数 6.2使用6.3emplace_back七.包装器        7.1function      ]]></description><category></category></item><item><title><![CDATA[Linux之重定向和缓冲区详细解析]]></title><link>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/140747700</link><guid>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/140747700</guid><author>Infernal_Puppet</author><pubDate>Wed, 31 Jul 2024 21:42:31 +0800</pubDate><description><![CDATA[一起努力，一起奔赴大厂。]]></description><category></category></item><item><title><![CDATA[C++之map和set封装以及哈希（unordered_map和unordered_set）的封装（仅代码）]]></title><link>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/140742473</link><guid>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/140742473</guid><author>Infernal_Puppet</author><pubDate>Sat, 27 Jul 2024 23:00:26 +0800</pubDate><description><![CDATA[一起努力，一起奔赴大厂。]]></description><category></category></item><item><title><![CDATA[C++进阶之红黑树详细解析]]></title><link>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/140447034</link><guid>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/140447034</guid><author>Infernal_Puppet</author><pubDate>Mon, 15 Jul 2024 20:50:14 +0800</pubDate><description><![CDATA[一起努力，一起奔赴大厂。]]></description><category></category></item><item><title><![CDATA[Linux之文件fd]]></title><link>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/140277773</link><guid>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/140277773</guid><author>Infernal_Puppet</author><pubDate>Fri, 12 Jul 2024 08:58:08 +0800</pubDate><description><![CDATA[一起努力，一起奔赴大厂。]]></description><category></category></item><item><title><![CDATA[C++进阶之AVL树]]></title><link>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/139566952</link><guid>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/139566952</guid><author>Infernal_Puppet</author><pubDate>Fri, 21 Jun 2024 23:25:01 +0800</pubDate><description><![CDATA[在看这篇博客之前需要了解二叉搜索树的相关内容，可以看这篇博客二叉搜索树，AVL树可以看成为了解决二叉搜索树的问题，它保证了左右子树高度差不超过1。本次的内容的重点就是对AVL树的旋转。]]></description><category></category></item><item><title><![CDATA[C++进阶之二叉搜索树]]></title><link>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/139494164</link><guid>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/139494164</guid><author>Infernal_Puppet</author><pubDate>Fri, 07 Jun 2024 17:32:00 +0800</pubDate><description><![CDATA[一起努力，一起奔赴大厂。]]></description><category></category></item><item><title><![CDATA[C++进阶之多态]]></title><link>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/139310209</link><guid>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/139310209</guid><author>Infernal_Puppet</author><pubDate>Wed, 05 Jun 2024 20:09:34 +0800</pubDate><description><![CDATA[a.需要继承，通过基类的指针或者引用的调用虚函数b.被调用的必须是虚函数，且派生类需要对基类虚函数进行重写public:cout << "买票--全价" << endl;public:cout << "买票--半价" << endl;Person p;func(p);Student s;func(s);运行可以看到。]]></description><category></category></item><item><title><![CDATA[C++进阶之继承]]></title><link>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/139197646</link><guid>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/139197646</guid><author>Infernal_Puppet</author><pubDate>Sun, 26 May 2024 12:32:19 +0800</pubDate><description><![CDATA[继承(inheritance)机制是面向对象程序设计使代码可以复用的最重要的手段，它允许程序员在保 持原有类特性的基础上进行扩展，增加功能，这样产生新的类，称派生类。继承呈现了面向对象 程序设计的层次结构，体现了由简单到复杂的认知过程。以前我们接触的复用都是函数复用，继 承是类设计层次的复用。简单来说就是继承就是一个类获得另一个类的一些成员，我们把一个成为派生类，父类为基类。继承就是针对一些特殊的情况所产生的，当几个类有一些相同的成员我们可以把这些成员给到一个类中，然后继承。]]></description><category></category></item><item><title><![CDATA[C++初阶之模板进阶]]></title><link>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/139102306</link><guid>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/139102306</guid><author>Infernal_Puppet</author><pubDate>Wed, 22 May 2024 19:56:16 +0800</pubDate><description><![CDATA[一起努力，一起奔赴大厂。]]></description><category></category></item><item><title><![CDATA[C++初阶之stack，queue，priority_queue的使用和模拟以及仿函数的创建和使用]]></title><link>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/138450958</link><guid>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/138450958</guid><author>Infernal_Puppet</author><pubDate>Sat, 11 May 2024 10:00:00 +0800</pubDate><description><![CDATA[在这里我们的stack,queue,priority_queue是适配器，适配器就是不需要我们自己去写，只需要使用我们已有的容器来写，可以使用vector，特可以使用list，但是我们默认使用的是deque，我们看看是如何实现stack,queue,priority_queue这三个的，我们可以直接看代码。这里的大部分内容我在前面写过，可以看博客栈和队列堆。]]></description><category></category></item><item><title><![CDATA[C++初阶之list的使用和模拟以及反向迭代器的模拟实现]]></title><link>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/138379077</link><guid>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/138379077</guid><author>Infernal_Puppet</author><pubDate>Tue, 07 May 2024 10:00:00 +0800</pubDate><description><![CDATA[list是一个带头双向链表，在数据结构的时候，我写过关于带头双向循环链表的实现，可以看博客，我们可以看下面的图，是list的存储结构，本次的内容包括list的使用，list的模拟实现，list的迭代器以及反向迭代器的原理，模拟实现和使用，最重要的是迭代器和反向迭代器的内容，在前面string和vector中迭代器是原生的指针，但是在这里不是，具体是什么样子的我们可以看后面的内容。]]></description><category></category></item><item><title><![CDATA[Linux之进程等待（wait,waitpid,WIFEXITED(),WEXITATATUS(),WNOHA）和进程替换(execl*)]]></title><link>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/137902512</link><guid>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/137902512</guid><author>Infernal_Puppet</author><pubDate>Thu, 02 May 2024 10:30:00 +0800</pubDate><description><![CDATA[一起努力，一起奔赴大厂。]]></description><category></category></item><item><title><![CDATA[C++初阶之vector的使用和模拟实现]]></title><link>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/138167120</link><guid>https://blog.youkuaiyun.com/Infernal_Puppet/article/details/138167120</guid><author>Infernal_Puppet</author><pubDate>Sun, 28 Apr 2024 10:00:00 +0800</pubDate><description><![CDATA[一起努力，一起奔赴大厂。]]></description><category></category></item></channel></rss>