<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[for_what_why的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/for_what_why</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; for_what_why]]></copyright><item><title><![CDATA[mysql8.0加密]]></title><link>https://blog.youkuaiyun.com/for_what_why/article/details/102999523</link><guid>https://blog.youkuaiyun.com/for_what_why/article/details/102999523</guid><author>for_what_why</author><pubDate>Sun, 10 Nov 2019 17:23:33 +0800</pubDate><description><![CDATA[1.配置my.ini文件

#加密插件

early-plugin-load=keyring_file.dll

#生成key的路径

keyring_file_data=D:\mysql-8.0.18-winx64\key

2.查看keyring插件是否生效

登陆mysql mysql -u root -proot

use test;

show plugins;或select pl...]]></description><category></category></item><item><title><![CDATA[栈、队列和堆]]></title><link>https://blog.youkuaiyun.com/for_what_why/article/details/102532883</link><guid>https://blog.youkuaiyun.com/for_what_why/article/details/102532883</guid><author>for_what_why</author><pubDate>Thu, 17 Oct 2019 23:19:04 +0800</pubDate><description><![CDATA[一、栈

a)栈的定义

栈是一种线性结构，采用先进后出（Last In First Out）的原则，可以理解为‘’客栈‘’，只有一个正门，方便记忆。

在栈中进行插入和删除操作的一端被称为栈顶（Top）,另一端成为栈底（Bottom）。

栈的顺序存储是指用一组连续的存储单元依次存储自栈顶到栈底的数据元素，栈需要预先申请栈的存储空间，也就是说栈空间的容量是有限的。

b)栈的特点

基本类型的变...]]></description><category></category></item><item><title><![CDATA[MySQL的下载与安装(以zip格式为例)]]></title><link>https://blog.youkuaiyun.com/for_what_why/article/details/102597020</link><guid>https://blog.youkuaiyun.com/for_what_why/article/details/102597020</guid><author>for_what_why</author><pubDate>Thu, 17 Oct 2019 00:03:20 +0800</pubDate><description><![CDATA[1.下载

MySQL的安装文件有msi和zip两种（需要注册oracle用户，mysql被oracle收购）

msi格式的下载地址:https://dev.mysql.com/downloads/windows/installer/5.7.html

zip格式的下载地址:https://dev.mysql.com/downloads/mysql/

2.安装MySQL

在此以mysql-a...]]></description><category></category></item></channel></rss>