<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[qq_43638113的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/qq_43638113</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_43638113]]></copyright><item><title><![CDATA[seaweedfs使用说明]]></title><link>https://blog.youkuaiyun.com/qq_43638113/article/details/85049078</link><guid>https://blog.youkuaiyun.com/qq_43638113/article/details/85049078</guid><author>qq_43638113</author><pubDate>Mon, 17 Dec 2018 14:34:40 +0800</pubDate><description><![CDATA[基本概念
master 存储映射关系，文件和fid的映射关系 weed master
Node  系统抽象的结点，抽象为datacenter、rack、datanode
datacenter 数据中心，包含多个rack，类似一个机房
rack ：属于一个datacenter，类似机房中的一个机架
datanode ： 存储节点，存储多个volume，类似机架中的一个机器 weed volume
v...]]></description><category></category></item><item><title><![CDATA[seaweedfs]]></title><link>https://blog.youkuaiyun.com/qq_43638113/article/details/85007811</link><guid>https://blog.youkuaiyun.com/qq_43638113/article/details/85007811</guid><author>qq_43638113</author><pubDate>Fri, 14 Dec 2018 18:06:22 +0800</pubDate><description><![CDATA[{
FastDFS
它只能通过专有API对文件进行存取访问，不支持POSIX接口方式，不能mount使用。
Seaweedfs （https://github.com/chrislusf/seaweedfs）
Seaweedfs 的设计原理是基于 Facebook 的一篇图片存储系统的论文 Facebook-Haystack 说到这个，毛剑也在依这个论文写bfs, 正在开发中，可以跟看从小到大一步...]]></description><category></category></item><item><title><![CDATA[九大排序算法]]></title><link>https://blog.youkuaiyun.com/qq_43638113/article/details/84993127</link><guid>https://blog.youkuaiyun.com/qq_43638113/article/details/84993127</guid><author>qq_43638113</author><pubDate>Thu, 13 Dec 2018 18:26:53 +0800</pubDate><description><![CDATA[https://blog.youkuaiyun.com/foreverling/article/details/43798223

]]></description><category></category></item><item><title><![CDATA[为什么hashtable被弃用了]]></title><link>https://blog.youkuaiyun.com/qq_43638113/article/details/84991146</link><guid>https://blog.youkuaiyun.com/qq_43638113/article/details/84991146</guid><author>qq_43638113</author><pubDate>Thu, 13 Dec 2018 16:46:01 +0800</pubDate><description><![CDATA[作者
Hashtable的作者：

HashMap的作者：

Hash Map的作者比Hashtable的作者多了著名顶顶的并发大神Doug Lea。他写了util.concurrent包。著有并发编程圣经Concurrent Programming in Java: Design Principles and Patterns 一书。他的个人主页： http://g.oswego.edu/
Jo...]]></description><category></category></item><item><title><![CDATA[五大常用算法总结]]></title><link>https://blog.youkuaiyun.com/qq_43638113/article/details/84989985</link><guid>https://blog.youkuaiyun.com/qq_43638113/article/details/84989985</guid><author>qq_43638113</author><pubDate>Thu, 13 Dec 2018 15:54:08 +0800</pubDate><description><![CDATA[引言
据说有人归纳了计算机的五大常用算法，它们是贪婪算法，动态规划算法，分治算法，回溯算法以及分支限界算法。虽然不知道为何要将这五个算法归为最常用的算法，但是毫无疑问，这五个算法是有很多应用场景的，最优化问题大多可以利用这些算法解决。算法的本质就是解决问题。当数据量比较小时，其实根本就不需要什么算法，写一些for循环完全就可以很快速的搞定了，但是当数据量比较大，场景比较复杂的时候，编写for循环就...]]></description><category></category></item><item><title><![CDATA[五大常用算法]]></title><link>https://blog.youkuaiyun.com/qq_43638113/article/details/84989667</link><guid>https://blog.youkuaiyun.com/qq_43638113/article/details/84989667</guid><author>qq_43638113</author><pubDate>Thu, 13 Dec 2018 15:39:59 +0800</pubDate><description><![CDATA[https://www.cnblogs.com/xsyfl/p/6921687.html

]]></description><category></category></item><item><title><![CDATA[timestamp字段的“诡异”规则]]></title><link>https://blog.youkuaiyun.com/qq_43638113/article/details/84983386</link><guid>https://blog.youkuaiyun.com/qq_43638113/article/details/84983386</guid><author>qq_43638113</author><pubDate>Thu, 13 Dec 2018 10:24:57 +0800</pubDate><description><![CDATA[有同学说timestamp字段的规则比较“诡异”。手册里面说的比较复杂，这里简单说明一下MySQL中 timestamp字段的一些规则。
分为两部分
定义规则：
1、  timestamp字段有三个属性：
a)           是否允许NULL。默认为not null。
b)           默认值。可以设定为default CURRENT_TIMESTAMP 或default 某个常量。...]]></description><category></category></item><item><title><![CDATA[golang中map使用channel串行化多读多写]]></title><link>https://blog.youkuaiyun.com/qq_43638113/article/details/84942493</link><guid>https://blog.youkuaiyun.com/qq_43638113/article/details/84942493</guid><author>qq_43638113</author><pubDate>Mon, 10 Dec 2018 16:47:09 +0800</pubDate><description><![CDATA[type MyMap struct {
	Data map[int]string
	ch   chan func()
}

func NewMyMap() *MyMap {
	m := &amp;amp;MyMap{
		Data: make(map[int]string),
		ch:   make(chan func()),
	}
	go func() {
		for {
			(&amp;lt;-m.ch)...]]></description><category></category></item><item><title><![CDATA[给你一个字符串，写出所有可能的ip]]></title><link>https://blog.youkuaiyun.com/qq_43638113/article/details/84940983</link><guid>https://blog.youkuaiyun.com/qq_43638113/article/details/84940983</guid><author>qq_43638113</author><pubDate>Mon, 10 Dec 2018 15:40:56 +0800</pubDate><description><![CDATA[package main

import (
    &quot;fmt&quot;
    &quot;os&quot;
    &quot;strconv&quot;
)

func getip(source string) (ips []string) {

    length := len(source)
    if length &amp;gt; 12 || length &amp;lt; 4 {
        return nil
    }
    i...]]></description><category></category></item><item><title><![CDATA[UUID]]></title><link>https://blog.youkuaiyun.com/qq_43638113/article/details/84875308</link><guid>https://blog.youkuaiyun.com/qq_43638113/article/details/84875308</guid><author>qq_43638113</author><pubDate>Fri, 07 Dec 2018 15:24:36 +0800</pubDate><description><![CDATA[package main

import (
	&quot;fmt&quot;

	&quot;github.com/satori/go.uuid&quot;
)

func main() {
	// Creating UUID Version 4
	// panic on error
	u1 := uuid.Must(uuid.NewV4())
	fmt.Printf(&quot;UUIDv4: %s\n&quot;, u1.String())

	//...]]></description><category></category></item><item><title><![CDATA[分享一个日志系统]]></title><link>https://blog.youkuaiyun.com/qq_43638113/article/details/84856634</link><guid>https://blog.youkuaiyun.com/qq_43638113/article/details/84856634</guid><author>qq_43638113</author><pubDate>Thu, 06 Dec 2018 15:34:02 +0800</pubDate><description><![CDATA[https://github.com/uber-go/zap

]]></description><category></category></item><item><title><![CDATA[Go 2.0终于要来了！]]></title><link>https://blog.youkuaiyun.com/qq_43638113/article/details/84851175</link><guid>https://blog.youkuaiyun.com/qq_43638113/article/details/84851175</guid><author>qq_43638113</author><pubDate>Thu, 06 Dec 2018 12:23:23 +0800</pubDate><description><![CDATA[Go Language 2.0 终于要来了！
早在今年8月份，Go团队便提出了2.0版本的设计草案，包括两大主题：错误处理和泛型。而今天，团队开发人员发话了：“是时候采取行动了！”
Go 1和Go 2主要的区别在于决策的制定——Go 1的诞生是一个小团队的努力，而Go 2将更受其社区的影响。
目前在Go 2的提案中，大约有120个未解决的问题被标记为Go 2的提案，每一个问题都与重要的库或语言更改...]]></description><category></category></item><item><title><![CDATA[grpc报错]]></title><link>https://blog.youkuaiyun.com/qq_43638113/article/details/84666837</link><guid>https://blog.youkuaiyun.com/qq_43638113/article/details/84666837</guid><author>qq_43638113</author><pubDate>Fri, 30 Nov 2018 19:28:13 +0800</pubDate><description><![CDATA[1.消息体太小
error: “grpc: received message larger than max (6115095 vs. 4194304)”
message: “grpc: received message larger than max (6115095 vs. 4194304)”
s := grpc.NewServer(grpc.MaxMsgSize(size), grpc.Ma...]]></description><category></category></item><item><title><![CDATA[Linux三剑客之awk命令]]></title><link>https://blog.youkuaiyun.com/qq_43638113/article/details/84657421</link><guid>https://blog.youkuaiyun.com/qq_43638113/article/details/84657421</guid><author>qq_43638113</author><pubDate>Fri, 30 Nov 2018 16:10:46 +0800</pubDate><description><![CDATA[https://www.cnblogs.com/ginvip/p/6352157.html

]]></description><category></category></item><item><title><![CDATA[MySQL 分区建索引]]></title><link>https://blog.youkuaiyun.com/qq_43638113/article/details/84633046</link><guid>https://blog.youkuaiyun.com/qq_43638113/article/details/84633046</guid><author>qq_43638113</author><pubDate>Thu, 29 Nov 2018 15:04:40 +0800</pubDate><description><![CDATA[介绍
mysql分区后每个分区成了独立的文件，虽然从逻辑上还是一张表其实已经分成了多张独立的表，从“information_schema.INNODB_SYS_TABLES”系统表可以看到每个分区都存在独立的TABLE_ID,由于Innodb数据和索引都是保存在&quot;.ibd&quot;文件当中（从INNODB_SYS_INDEXES系统表中也可以得到每个索引都是对应各自的分区(primary key和uniq...]]></description><category></category></item><item><title><![CDATA[MYSQL优化流程]]></title><link>https://blog.youkuaiyun.com/qq_43638113/article/details/84586585</link><guid>https://blog.youkuaiyun.com/qq_43638113/article/details/84586585</guid><author>qq_43638113</author><pubDate>Wed, 28 Nov 2018 16:32:58 +0800</pubDate><description><![CDATA[使用 show status 了解执行情况
慢查询
mysql&amp;amp;amp;gt; show status like ‘%slow%’;
±--------------------±------+
| Variable_name       | Value |
±--------------------±------+
| Slow_launch_threads | 0     |
| Slow_querie...]]></description><category></category></item><item><title><![CDATA[ID生成器方案]]></title><link>https://blog.youkuaiyun.com/qq_43638113/article/details/84582128</link><guid>https://blog.youkuaiyun.com/qq_43638113/article/details/84582128</guid><author>qq_43638113</author><pubDate>Wed, 28 Nov 2018 12:07:56 +0800</pubDate><description><![CDATA[Snowflake算法
百度的：https://github.com/baidu/uid-generator/blob/master/README.zh_cn.md
sony的;https://github.com/sony/sonyflake
其他：https://github.com/bwmarrin/snowflake

]]></description><category></category></item><item><title><![CDATA[MYSQL数据库分区、分表、分库和读写分离使用场景和注意事项]]></title><link>https://blog.youkuaiyun.com/qq_43638113/article/details/84580163</link><guid>https://blog.youkuaiyun.com/qq_43638113/article/details/84580163</guid><author>qq_43638113</author><pubDate>Wed, 28 Nov 2018 10:32:16 +0800</pubDate><description><![CDATA[https://www.cnblogs.com/bluebluesky/articles/6413831.html

]]></description><category></category></item><item><title><![CDATA[Go高性能日志库zap详细分析]]></title><link>https://blog.youkuaiyun.com/qq_43638113/article/details/84346430</link><guid>https://blog.youkuaiyun.com/qq_43638113/article/details/84346430</guid><author>qq_43638113</author><pubDate>Thu, 22 Nov 2018 18:14:20 +0800</pubDate><description><![CDATA[https://mp.weixin.qq.com/s/i0bMh_gLLrdnhAEWlF-xDw

]]></description><category></category></item><item><title><![CDATA[Golang(Go语言)内置函数之append]]></title><link>https://blog.youkuaiyun.com/qq_43638113/article/details/84305971</link><guid>https://blog.youkuaiyun.com/qq_43638113/article/details/84305971</guid><author>qq_43638113</author><pubDate>Tue, 20 Nov 2018 17:10:19 +0800</pubDate><description><![CDATA[append主要用于给某个切片（slice）追加元素
如果该切片存储空间（cap）足够，就直接追加，长度（len）变长；如果空间不足，就会重新开辟内存，并将之前的元素和新的元素一同拷贝进去
第一个参数为切片，后面是该切片存储元素类型的可变参数

slice := append([]int{1,2,3},[]int{4,5,6}...)
fmt.Println(slice) //[1 2 3 4 5...]]></description><category></category></item></channel></rss>