<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[朽木可雕_的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Ziputi</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Ziputi]]></copyright><item><title><![CDATA[Windows和Ubuntu网络文件共享]]></title><link>https://blog.youkuaiyun.com/Ziputi/article/details/140079588</link><guid>https://blog.youkuaiyun.com/Ziputi/article/details/140079588</guid><author>Ziputi</author><pubDate>Sun, 30 Jun 2024 13:09:05 +0800</pubDate><description><![CDATA[右键选中需要共享的文件夹，选择属性->本地网络共享；选中共享此目录、允许其他人创建和删除这个文件夹里的文件、允许匿名登陆；配置好之后，点击修改共享。如果没有安装过samba服务，则会提升安装samba相关依赖。右键 我的电脑 -> 映射网络驱动器；配置文件夹路径，然后点击完成。通过我的电脑（此电脑）访问共项目录。如有需要，重启samba服务。输入用户名，以及密码。]]></description><category></category></item><item><title><![CDATA[Ubuntu22.04安装qt-6.6.1]]></title><link>https://blog.youkuaiyun.com/Ziputi/article/details/135419112</link><guid>https://blog.youkuaiyun.com/Ziputi/article/details/135419112</guid><author>Ziputi</author><pubDate>Fri, 05 Jan 2024 22:51:41 +0800</pubDate><description><![CDATA[nodejsTODO。]]></description><category></category></item><item><title><![CDATA[LLVM基础系列--llvm::SmallVector与std::vector的区别]]></title><link>https://blog.youkuaiyun.com/Ziputi/article/details/131999975</link><guid>https://blog.youkuaiyun.com/Ziputi/article/details/131999975</guid><author>Ziputi</author><pubDate>Sat, 29 Jul 2023 21:50:16 +0800</pubDate><description><![CDATA[llvm::SmallVector是LLVM中独有的容器类，std::vector是C++标准库的容器类。简单来说，区别在于，llvm::SmallVector是一个针对小数组进行优化的结构。这种优化来自于对有限数量元素不执行堆分配。如果添加的元素数量超过了使用自动存储分配的元素数量，它将回退到的行为并分配越来越大的数组。当明确始终拥有少量元素时，可以带来性能优势。]]></description><category></category></item><item><title><![CDATA[火焰图基本使用教程]]></title><link>https://blog.youkuaiyun.com/Ziputi/article/details/118882851</link><guid>https://blog.youkuaiyun.com/Ziputi/article/details/118882851</guid><author>Ziputi</author><pubDate>Sun, 18 Jul 2021 20:51:58 +0800</pubDate><description><![CDATA[火焰图基本使用教程
1. 基本流程


下载FlameGrapth包：https://github.com/brendangregg/FlameGraph，无需安装，直接使用。也可以直接使用命令git clone https://github.com/brendangregg/FlameGraph.git


perf recocrd -g...
（记得要加-g，这样才会保留调用栈）抓去性能分析数据，会生成perf.data文件，在第二次使用perf record..后，新生成的perf数据为perf.da]]></description><category></category></item><item><title><![CDATA[Qt开发之QSound应用记录]]></title><link>https://blog.youkuaiyun.com/Ziputi/article/details/105483468</link><guid>https://blog.youkuaiyun.com/Ziputi/article/details/105483468</guid><author>Ziputi</author><pubDate>Mon, 13 Apr 2020 11:00:49 +0800</pubDate><description><![CDATA[Qt开发之QSound应用记录
头文件


平台：VS2019+Qt5.12.6


使用QSound类，需要添加multimedia
扩展-&gt;Qt VS Tools-&gt;Qt Project Settting-&gt;General下的Qt Modules-&gt;点击后面的Module选中添加Multimedia-&gt;Finfish。


源码中添加文件头#include &lt...]]></description><category></category></item><item><title><![CDATA[PAT_A1001 A+B Format (20 分)]]></title><link>https://blog.youkuaiyun.com/Ziputi/article/details/99872733</link><guid>https://blog.youkuaiyun.com/Ziputi/article/details/99872733</guid><author>Ziputi</author><pubDate>Tue, 20 Aug 2019 19:02:37 +0800</pubDate><description><![CDATA[题目


Calculate a+b and output the sum in standard format – that is, the digits must be separated into groups of three by commas (unless there are less than four digits).
Input Specification:
Each inpu...]]></description><category></category></item><item><title><![CDATA[PAT_A1006 Sign In and Sign Out (25 分)]]></title><link>https://blog.youkuaiyun.com/Ziputi/article/details/99240158</link><guid>https://blog.youkuaiyun.com/Ziputi/article/details/99240158</guid><author>Ziputi</author><pubDate>Sun, 11 Aug 2019 22:46:00 +0800</pubDate><description><![CDATA[题目


At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door. Given the records of signing in’s and out’s...]]></description><category></category></item><item><title><![CDATA[PAT_A1002 A+B for Polynomials (25 分)]]></title><link>https://blog.youkuaiyun.com/Ziputi/article/details/99234872</link><guid>https://blog.youkuaiyun.com/Ziputi/article/details/99234872</guid><author>Ziputi</author><pubDate>Sun, 11 Aug 2019 22:04:01 +0800</pubDate><description><![CDATA[题目


This time, you are supposed to find A+B where A and B are two polynomials.
Input Specification:
Each input file contains one test case. Each case occupies 2 lines, and each line contains the info...]]></description><category></category></item><item><title><![CDATA[PAT_A1065 A+B and C (64bit) (20 分)]]></title><link>https://blog.youkuaiyun.com/Ziputi/article/details/98786469</link><guid>https://blog.youkuaiyun.com/Ziputi/article/details/98786469</guid><author>Ziputi</author><pubDate>Wed, 07 Aug 2019 21:49:52 +0800</pubDate><description><![CDATA[题目


Given three integers A, B and C in [−263,263][−2^{63},2^{63}][−263,263], you are supposed to tell whether A+B&amp;gt;CA+B&amp;gt;CA+B&gt;C.
Input Specification:
The first line of the input gives ...]]></description><category></category></item><item><title><![CDATA[PAT_A1046 1046 Shortest Distance (20 分)]]></title><link>https://blog.youkuaiyun.com/Ziputi/article/details/98781761</link><guid>https://blog.youkuaiyun.com/Ziputi/article/details/98781761</guid><author>Ziputi</author><pubDate>Wed, 07 Aug 2019 21:40:07 +0800</pubDate><description><![CDATA[题目


The task is really simple: given N exits on a highway which forms a simple cycle, you are supposed to tell the shortest distance between any pair of exits.
Input Specification:
Each input file co...]]></description><category></category></item><item><title><![CDATA[PAT_A1042 Shuffling Machine (20 分)]]></title><link>https://blog.youkuaiyun.com/Ziputi/article/details/98776761</link><guid>https://blog.youkuaiyun.com/Ziputi/article/details/98776761</guid><author>Ziputi</author><pubDate>Wed, 07 Aug 2019 19:37:27 +0800</pubDate><description><![CDATA[题目


Shuffling is a procedure used to randomize a deck of playing cards. Because standard shuffling techniques are seen as weak, and in order to avoid “inside jobs” where employees collaborate with ga...]]></description><category></category></item><item><title><![CDATA[PAT_A1041 Be Unique (20 分)]]></title><link>https://blog.youkuaiyun.com/Ziputi/article/details/98773023</link><guid>https://blog.youkuaiyun.com/Ziputi/article/details/98773023</guid><author>Ziputi</author><pubDate>Wed, 07 Aug 2019 19:24:19 +0800</pubDate><description><![CDATA[题目：


Being unique is so important to people on Mars that even their lottery is designed in a unique way. The rule of winning is simple: one bets on a number chosen from [1,104]. The first one who bet...]]></description><category></category></item><item><title><![CDATA[编译原理例题]]></title><link>https://blog.youkuaiyun.com/Ziputi/article/details/91357371</link><guid>https://blog.youkuaiyun.com/Ziputi/article/details/91357371</guid><author>Ziputi</author><pubDate>Sun, 09 Jun 2019 21:11:23 +0800</pubDate><description><![CDATA[编译原理例题
写出算术表达式：A+B∗(C−D)+E/(C−D)↑NA+B*(C-D)+E/(C-D)↑NA+B∗(C−D)+E/(C−D)↑N(↑指乘方)

(1)四元式
(2)三元式
(3)间接三元式
(4)逆波兰记号


解：

四元式：
(1)&nbsp;(−,&nbsp;C,&nbsp;D,&nbsp;t1)(1)\ (-,\ C,\ D,\ t_1)(1)&nbsp;(−,&nbsp;...]]></description><category></category></item></channel></rss>