<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[记得别人忘了自己]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/iteye_5392</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; iteye_5392]]></copyright><item><title><![CDATA[基于apache drill 的HDFS查询json 单机实例]]></title><link>https://blog.youkuaiyun.com/iteye_5392/article/details/82680643</link><guid>https://blog.youkuaiyun.com/iteye_5392/article/details/82680643</guid><author>iteye_5392</author><pubDate>Mon, 27 Mar 2017 18:09:22 +0800</pubDate><description><![CDATA[参考 https://drill.apache.org/docs/json-data-model/

假设有原始数据在hdfs上：
hdfs://dc1:8020/xf/mytest/ia/2017/0208/details/part-00000
多条数据，按行存储的json文件，实际上是spark saveAsTextFile方法生成。
格式如下(已删除部分数据）

{
    ...]]></description><category></category></item><item><title><![CDATA[java.lang Enum Thread.State，jstack显示的线程状态说明]]></title><link>https://blog.youkuaiyun.com/iteye_5392/article/details/82652279</link><guid>https://blog.youkuaiyun.com/iteye_5392/article/details/82652279</guid><author>iteye_5392</author><pubDate>Fri, 20 May 2016 12:06:22 +0800</pubDate><description><![CDATA[
java docs 写道
http://docs.oracle.com/javase/8/docs/api/java/lang/Thread.State.html
 
public static enum Thread.State
extends Enum&amp;lt;Thread.State&amp;gt;
A thread state. A thread can be in one of th...]]></description><category></category></item><item><title><![CDATA[Spring Cloud （1）——config server使用SVN作为远程例子的运行与配置]]></title><link>https://blog.youkuaiyun.com/iteye_5392/article/details/82648682</link><guid>https://blog.youkuaiyun.com/iteye_5392/article/details/82648682</guid><author>iteye_5392</author><pubDate>Sat, 12 Mar 2016 19:15:01 +0800</pubDate><description><![CDATA[
 
官方链接与文档 写道
 
https://spring.io/guides/gs/centralized-configuration/
 
 
Spring cloud config Server基于Spring boot构建，
 

建议下载使用官方的Eclipse （ sts-3.7.2.RELEASE）
下载config server sample 的源码，并导入到...]]></description><category></category></item><item><title><![CDATA[Could not find creator property with name 'id'（local spark debug）]]></title><link>https://blog.youkuaiyun.com/iteye_5392/article/details/82645984</link><guid>https://blog.youkuaiyun.com/iteye_5392/article/details/82645984</guid><author>iteye_5392</author><pubDate>Wed, 06 Jan 2016 11:04:58 +0800</pubDate><description><![CDATA[
       spark本地IDE调试模式下：
JavaRDD&amp;lt;String&amp;gt; textFile = sc.textFile(&quot;E:\\json.txt&quot;,1);
 
执行异常：
com.fasterxml.jackson.databind.JsonMappingException: Could not find creator property with name 'id'...]]></description><category></category></item><item><title><![CDATA[cloudermanager添加主机时的安装错误整理]]></title><link>https://blog.youkuaiyun.com/iteye_5392/article/details/82640768</link><guid>https://blog.youkuaiyun.com/iteye_5392/article/details/82640768</guid><author>iteye_5392</author><pubDate>Tue, 15 Sep 2015 18:01:03 +0800</pubDate><description><![CDATA[
 

错误1:host

host -t PTR XXX
domain name pointer localhost.
错误原因：
DNS反解析，域名没有配置dns
解决办法：
去掉/usr/bin/host
mv /usr/host host.bak
然后再次添加主机
 
heipark.iteye.com/blog/2010432
https://community...]]></description><category></category></item><item><title><![CDATA[mysql 2006 错误]]></title><link>https://blog.youkuaiyun.com/iteye_5392/article/details/82638552</link><guid>https://blog.youkuaiyun.com/iteye_5392/article/details/82638552</guid><author>iteye_5392</author><pubDate>Thu, 06 Aug 2015 15:43:16 +0800</pubDate><description><![CDATA[
使用libmysqlclient出现core，日志显示
mysql 遇到2013 ，2006错误（MySQL server has gone away）
core文件信息如下：
 
(gdb) bt
#0  0x000000000051eb12 in my_real_read (net=0x7fc8e80009e0, complen=0x7fc9ce1fb438) at /opt/m...]]></description><category></category></item><item><title><![CDATA[使用autoconf ，autogen遇到的问题]]></title><link>https://blog.youkuaiyun.com/iteye_5392/article/details/82637907</link><guid>https://blog.youkuaiyun.com/iteye_5392/article/details/82637907</guid><author>iteye_5392</author><pubDate>Thu, 23 Jul 2015 12:08:20 +0800</pubDate><description><![CDATA[
一般需要安装下（centos）
yum -y install libtool automake 
 
否则可能遇到如下问题：
possibly undefined macro: AC_PROG_LIBTOOL
]]></description><category></category></item><item><title><![CDATA[mysql utf8编码设置 C 函数调用乱码问题]]></title><link>https://blog.youkuaiyun.com/iteye_5392/article/details/82637563</link><guid>https://blog.youkuaiyun.com/iteye_5392/article/details/82637563</guid><author>iteye_5392</author><pubDate>Thu, 16 Jul 2015 18:28:43 +0800</pubDate><description><![CDATA[
（1）mysql服务启动时，指定编码，（mysql client连接时，也可以指定）
（2）C 库client调用，通过函数指定 mysql_set_character_set(con,&quot;utf8&quot;);
]]></description><category></category></item><item><title><![CDATA[zookeeper windows  C++ 编译，__imp_zookeeper_init错误备忘]]></title><link>https://blog.youkuaiyun.com/iteye_5392/article/details/82637548</link><guid>https://blog.youkuaiyun.com/iteye_5392/article/details/82637548</guid><author>iteye_5392</author><pubDate>Thu, 16 Jul 2015 16:03:13 +0800</pubDate><description><![CDATA[
原因：
zk是用C语言写的，如果C++工程中，使用 zookeeper 库（作为静态库编译），需要在所有使用zk的工程中加入编译宏
USE_STATIC_LIB
否则会出现 __imp_XXXX错误，imp 链接错误是因为C++的函数签名方式不是直接使用函数名的原因。
 
在windows如果需要编译recipes的lock和queue的话，需要修改一些文件。这里有修改后的文件，可以...]]></description><category></category></item><item><title><![CDATA[几个java 面试题备忘]]></title><link>https://blog.youkuaiyun.com/iteye_5392/article/details/82635572</link><guid>https://blog.youkuaiyun.com/iteye_5392/article/details/82635572</guid><author>iteye_5392</author><pubDate>Wed, 03 Jun 2015 21:21:35 +0800</pubDate><description><![CDATA[

java：
（1）希望so/dll文件只被某个特定的class调用，其他class不能调用，怎么办？
（2）如何防止用户反编译，有什么有效手段？
A)混淆编译
B)自己实现ClassLoader，同时实现一个DLL，DLL将原生成的class文件进行处理，然后程序启动的时候，只要入口Class（这个是原生态的）加载dll，dll解析相应的class，然后加载。这样如果想反编译，就需...]]></description><category></category></item><item><title><![CDATA[Epoll 轮询机制 和libevent的多线程实现]]></title><link>https://blog.youkuaiyun.com/iteye_5392/article/details/82618811</link><guid>https://blog.youkuaiyun.com/iteye_5392/article/details/82618811</guid><author>iteye_5392</author><pubDate>Thu, 07 May 2015 20:03:02 +0800</pubDate><description><![CDATA[
最近需要使用Linux开发，需要在网络连接上复用。原有程序是使用每个请求进行一次创建线程，执行事务，销毁线程，这种模式来实现多个请求。现在希望能够基于线程池实现请求复用。实际上效果应该不会太好,因为:

请求都是内部高速Lan连接
单台服务器请求数不会超过500

属于CPU计算密集型；I/O较少。因此，主要耗时，还是服务本身，平均100ms/每核；假设线程创建销毁1ms，那么这1%即使...]]></description><category></category></item><item><title><![CDATA[终于成功编译gcc5.1.0]]></title><link>https://blog.youkuaiyun.com/iteye_5392/article/details/82618470</link><guid>https://blog.youkuaiyun.com/iteye_5392/article/details/82618470</guid><author>iteye_5392</author><pubDate>Wed, 29 Apr 2015 20:35:16 +0800</pubDate><description><![CDATA[

三步搞定，网上一堆资料，但太啰嗦，而且没有必要所有组件都自定义编译。

 
 

下载&amp;amp;编译

下载地址：https://gcc.gnu.org/gcc-5/
 

 ./contrib/download_prerequisites  
./configure --prefix=/tools --disable-multilib
make &amp;amp;&amp;amp; mak...]]></description><category></category></item><item><title><![CDATA[41	First Missing Positive——leetcode]]></title><link>https://blog.youkuaiyun.com/iteye_5392/article/details/82617510</link><guid>https://blog.youkuaiyun.com/iteye_5392/article/details/82617510</guid><author>iteye_5392</author><pubDate>Sun, 12 Apr 2015 10:52:58 +0800</pubDate><description><![CDATA[
 
Given an unsorted integer array, find the first missing positive integer.
For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.
Your algorithm should run in O(n) time and uses constant spa...]]></description><category></category></item><item><title><![CDATA[146	LRU Cache——leetcode]]></title><link>https://blog.youkuaiyun.com/iteye_5392/article/details/82617508</link><guid>https://blog.youkuaiyun.com/iteye_5392/article/details/82617508</guid><author>iteye_5392</author><pubDate>Sun, 12 Apr 2015 09:43:38 +0800</pubDate><description><![CDATA[

146
LRU Cache

这个基于双向链表+Map表


第一步：分析LRU特点

2大特点：

保持顺序，即访问顺序FIFO。保持顺序的只有顺序类型如链表、数组
快速查找，给定的KEY，能够快速查找的有：二叉搜索树、Hash表、跳表SkipList

再细化各特点
 
《1》链表特点是：插入、删除、移动都是O(1)操作，随机访问O(N)
《2》数组特点是：插入、删除...]]></description><category></category></item><item><title><![CDATA[56	Merge Intervals——leetcode]]></title><link>https://blog.youkuaiyun.com/iteye_5392/article/details/82617494</link><guid>https://blog.youkuaiyun.com/iteye_5392/article/details/82617494</guid><author>iteye_5392</author><pubDate>Sat, 11 Apr 2015 20:55:46 +0800</pubDate><description><![CDATA[
这个是基于排序库实现的

56
Merge Intervals

/**
 * Definition for an interval.
 * struct Interval {
 *     int start;
 *     int end;
 *     Interval() : start(0), end(0) {}
 *     Interval(int s, int ...]]></description><category></category></item><item><title><![CDATA[57	Insert Interval——leetcode]]></title><link>https://blog.youkuaiyun.com/iteye_5392/article/details/82617493</link><guid>https://blog.youkuaiyun.com/iteye_5392/article/details/82617493</guid><author>iteye_5392</author><pubDate>Sat, 11 Apr 2015 20:52:03 +0800</pubDate><description><![CDATA[

57
Insert Interval

/**
 * Definition for an interval.
 * struct Interval {
 *     int start;
 *     int end;
 *     Interval() : start(0), end(0) {}
 *     Interval(int s, int e) : start(s)...]]></description><category></category></item><item><title><![CDATA[68	Text Justification——leetcode]]></title><link>https://blog.youkuaiyun.com/iteye_5392/article/details/82617492</link><guid>https://blog.youkuaiyun.com/iteye_5392/article/details/82617492</guid><author>iteye_5392</author><pubDate>Sat, 11 Apr 2015 20:39:13 +0800</pubDate><description><![CDATA[

68
Text Justification

class Solution {
public:
vector&amp;lt;string&amp;gt; fullJustify(vector&amp;lt;string&amp;gt; &amp;amp;words, int L)
    {
        if(words.empty()){
            return words;
        }...]]></description><category></category></item><item><title><![CDATA[188	Best Time to Buy and Sell Stock IV——leetcode]]></title><link>https://blog.youkuaiyun.com/iteye_5392/article/details/82617491</link><guid>https://blog.youkuaiyun.com/iteye_5392/article/details/82617491</guid><author>iteye_5392</author><pubDate>Sat, 11 Apr 2015 20:29:49 +0800</pubDate><description><![CDATA[
 
class Solution {
public:
    Solution(){}

    int maxProfit(int K, vector&amp;lt;int&amp;gt; &amp;amp;prices) {
        vector&amp;lt;int&amp;gt; lowVec;
        vector&amp;lt;int &amp;gt; highVec;

        if(price...]]></description><category></category></item><item><title><![CDATA[200	Number of Islands——leetcode]]></title><link>https://blog.youkuaiyun.com/iteye_5392/article/details/82617490</link><guid>https://blog.youkuaiyun.com/iteye_5392/article/details/82617490</guid><author>iteye_5392</author><pubDate>Sat, 11 Apr 2015 20:18:38 +0800</pubDate><description><![CDATA[
这个是图像中的填充技术，即选择一个种子，然后对其周边联通的的依次填充。
代码未必最快，但很容易理解。
算法复杂度O(M*N)
空间复杂度O(M*N),最坏情况。
算法说明：
&amp;lt;1&amp;gt;初始化 访问标记
&amp;lt;2&amp;gt;对每一个没有访问的cell，进行填充算法
 
填充算法：（使用栈）
&amp;lt;1&amp;gt;设置初始种子，入栈
&amp;lt;2&amp;gt;如果栈空，结束
&amp;lt;...]]></description><category></category></item><item><title><![CDATA[zookeeper__leader选举——翻译官方recipes文档]]></title><link>https://blog.youkuaiyun.com/iteye_5392/article/details/82613891</link><guid>https://blog.youkuaiyun.com/iteye_5392/article/details/82613891</guid><author>iteye_5392</author><pubDate>Sat, 31 Jan 2015 23:22:41 +0800</pubDate><description><![CDATA[
zookeeper-3.4.6/docs/recipes.html
Leader Election
A simple way of doing leader election with ZooKeeper is to use the SEQUENCE|EPHEMERAL flags when creating znodes that represent &quot;proposals&quot; of clie...]]></description><category></category></item></channel></rss>