<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ema_love_code的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ema_love_code</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ema_love_code]]></copyright><item><title><![CDATA[依赖图的环形检测，非环有向依赖图的子集的依赖检测]]></title><link>https://blog.youkuaiyun.com/ema_love_code/article/details/80366758</link><guid>https://blog.youkuaiyun.com/ema_love_code/article/details/80366758</guid><author>ema_love_code</author><pubDate>Fri, 18 May 2018 17:44:37 +0800</pubDate><description><![CDATA[class Item {
    private String name;
    private int helperInfo;

    public Item() {
        this.helperInfo = 0;
    }

    public Item(String name) {
        this.name = name;
        this.helperI...]]></description><category></category></item><item><title><![CDATA[可以多关注的blog]]></title><link>https://blog.youkuaiyun.com/ema_love_code/article/details/79458953</link><guid>https://blog.youkuaiyun.com/ema_love_code/article/details/79458953</guid><author>ema_love_code</author><pubDate>Tue, 06 Mar 2018 15:26:09 +0800</pubDate><description><![CDATA[心内求法 Holbrook的个人博客 地址：http://holbrook.github.io/]]></description><category></category></item><item><title><![CDATA[ODL中如何将配置文件打包到运行目录下]]></title><link>https://blog.youkuaiyun.com/ema_love_code/article/details/78695690</link><guid>https://blog.youkuaiyun.com/ema_love_code/article/details/78695690</guid><author>ema_love_code</author><pubDate>Sat, 02 Dec 2017 14:57:10 +0800</pubDate><description><![CDATA[如何将配置文件放到karaf/target/assembly/etc/opendaylight/datastore/initial/config目录下]]></description><category></category></item><item><title><![CDATA[ACE_INET_Addr::get_host_addr()令人抓狂的一面]]></title><link>https://blog.youkuaiyun.com/ema_love_code/article/details/6709675</link><guid>https://blog.youkuaiyun.com/ema_love_code/article/details/6709675</guid><author>ema_love_code</author><pubDate>Mon, 22 Aug 2011 20:15:58 +0800</pubDate><description><![CDATA[//file testAddr.cpp
#include "ace/INET_Addr.h"


int main(int argc, char * argv[])
{
  ACE_INET_Addr addr;
  ACE_INET_Addr addr2;
  addr.set]]></description><category></category></item><item><title><![CDATA[StateStreet 笔试后的记忆（有些答案还不知道）]]></title><link>https://blog.youkuaiyun.com/ema_love_code/article/details/1835803</link><guid>https://blog.youkuaiyun.com/ema_love_code/article/details/1835803</guid><author>ema_love_code</author><pubDate>Sun, 21 Oct 2007 17:04:00 +0800</pubDate><description><![CDATA[1.智力题10个圆最多可以将平面分成多少个？A与B依次从A报到T，可以报一个或两个连续字母，谁先报道T，谁获胜，问A,B谁的获胜几率大？还是一样大？2.专业知识题1) sizeof32biwindows平台struct big {  long a;  struct big *next;  double b; }; printf("%d/n",sizeof(struct ]]></description><category></category></item><item><title><![CDATA[大数乘法]]></title><link>https://blog.youkuaiyun.com/ema_love_code/article/details/1826284</link><guid>https://blog.youkuaiyun.com/ema_love_code/article/details/1826284</guid><author>ema_love_code</author><pubDate>Mon, 15 Oct 2007 19:50:00 +0800</pubDate><description><![CDATA[500)this.width=500;" border="0" alt="" />500)this.width=500;" border="0" alt="" />很容易发现这样的规律:　　１、计算结果的最后一位的下标最大，其下标之和为6；倒数第二位的下标之和为5，以此类推，第一位的下标之和是0。因此，下标之和的顺序刚好是结果位的位序，我们可以据此求出结果的各个位。　　２、最大的下标之和刚好是]]></description><category></category></item><item><title><![CDATA[快速排序--（参考算法导论p146）]]></title><link>https://blog.youkuaiyun.com/ema_love_code/article/details/1826272</link><guid>https://blog.youkuaiyun.com/ema_love_code/article/details/1826272</guid><author>ema_love_code</author><pubDate>Mon, 15 Oct 2007 19:41:00 +0800</pubDate><description><![CDATA[#includevoid qsort(int a[],int begin, int end);int main(){ int a[]={6,7,3,4,5,2,9,10}; qsort(a,0,sizeof(a)/sizeof(a[0])-1); for(int i=0;i {  printf("%d, ",a[i]); } return 0;}void qsort(int a[],int]]></description><category></category></item><item><title><![CDATA[堆和栈]]></title><link>https://blog.youkuaiyun.com/ema_love_code/article/details/1685871</link><guid>https://blog.youkuaiyun.com/ema_love_code/article/details/1685871</guid><author>ema_love_code</author><pubDate>Wed, 11 Jul 2007 22:55:00 +0800</pubDate><description><![CDATA[一、预备知识—程序的内存分配 一个由c/C++编译的程序占用的内存分为以下几个部分 1、栈区（stack）— 由编译器自动分配释放 ，存放函数的参数值，局部变量的值等。其操作方式类似于数据结构中的栈。 2、堆区（heap） — 一般由程序员分配释放， 若程序员不释放，程序结束时可能由OS回收 。注意它与数据结构中的堆是两回事，分配方式倒是类似于链表，呵呵。 3、全局区（静态区）（static）—，]]></description><category></category></item><item><title><![CDATA[c语言中static 变量]]></title><link>https://blog.youkuaiyun.com/ema_love_code/article/details/1685864</link><guid>https://blog.youkuaiyun.com/ema_love_code/article/details/1685864</guid><author>ema_love_code</author><pubDate>Wed, 11 Jul 2007 22:46:00 +0800</pubDate><description><![CDATA[c语言中static 变量1.  static 变量静态变量的类型 说明符是static。 静态变量当然是属于静态存储方式，但是属于静态存储方式的量不一定就是静态变量。 例如外部变量虽属于静态 存储方式，但不一定是静态变量，必须由 static加以定义后才能成为静态外部变量，或称静态全局变量。2. 静态局部变量静态局部变量属于静态存储方式，它具有以下特点：(1)静态局部变量]]></description><category></category></item><item><title><![CDATA[工作中用到的shell命令或脚本收集]]></title><link>https://blog.youkuaiyun.com/ema_love_code/article/details/1661679</link><guid>https://blog.youkuaiyun.com/ema_love_code/article/details/1661679</guid><author>ema_love_code</author><pubDate>Fri, 22 Jun 2007 10:48:00 +0800</pubDate><description><![CDATA[1. 批量杀死test进程 ps -A | awk  /test/ {print $1} | xargs kill -9解释：ps -A 列出所有进程awk 匹配有test字符的行并打印第一列 即进程号xargs 得到标准输出，作为kill杀死的进程号 ]]></description><category></category></item><item><title><![CDATA[c 语言小的程序]]></title><link>https://blog.youkuaiyun.com/ema_love_code/article/details/1642747</link><guid>https://blog.youkuaiyun.com/ema_love_code/article/details/1642747</guid><author>ema_love_code</author><pubDate>Thu, 07 Jun 2007 17:34:00 +0800</pubDate><description><![CDATA[ 1. 随机数： #include #includeint main(int argc,char *argv[])｛    srand((unsigned)time( NULL ));    int k = rand()%26;    return 0;｝如果没有没有srand更新随机种子，每次的执行总是一样的，现在去当前时间之后，每次的执行就不一样了。2.分离字符串：      #include]]></description><category></category></item><item><title><![CDATA[linux c 多线程]]></title><link>https://blog.youkuaiyun.com/ema_love_code/article/details/1639670</link><guid>https://blog.youkuaiyun.com/ema_love_code/article/details/1639670</guid><author>ema_love_code</author><pubDate>Tue, 05 Jun 2007 20:26:00 +0800</pubDate><description><![CDATA[pthread_t 在头文件/usr/include/bits/pthreadtypes.h中定义：typedef unsigned long int pthread_t;extern int pthread_create __P ((pthread_t *__thread, __const pthread_attr_t *__attr,　　void *(*__start_routine) (vo]]></description><category></category></item><item><title><![CDATA[linux c 内存相关函数]]></title><link>https://blog.youkuaiyun.com/ema_love_code/article/details/1639545</link><guid>https://blog.youkuaiyun.com/ema_love_code/article/details/1639545</guid><author>ema_love_code</author><pubDate>Tue, 05 Jun 2007 18:02:00 +0800</pubDate><description><![CDATA[                         calloc（配置内存空间）                                         相关函数                         malloc，free，realloc，brk                                        ]]></description><category></category></item><item><title><![CDATA[字节序--小端大端]]></title><link>https://blog.youkuaiyun.com/ema_love_code/article/details/1627932</link><guid>https://blog.youkuaiyun.com/ema_love_code/article/details/1627932</guid><author>ema_love_code</author><pubDate>Mon, 28 May 2007 11:02:00 +0800</pubDate><description><![CDATA[ 字节序a) Little-Endian就是低位字节排放在内存的低地址端，高位字节排放在内存的高地址端，Intel386   体系结构用的是littleendianb) Big-Endian就是高位字节排放在内存的低地址端，低位字节排放在内存的高地址端，sunSparc体系结构用的是bigendianc) 网络字节序：TCP/IP各层协议将字节序定义为Big-Endian，因此TCP/IP]]></description><category></category></item><item><title><![CDATA[IBM暑期实习笔试后总结]]></title><link>https://blog.youkuaiyun.com/ema_love_code/article/details/1627592</link><guid>https://blog.youkuaiyun.com/ema_love_code/article/details/1627592</guid><author>ema_love_code</author><pubDate>Sun, 27 May 2007 22:32:00 +0800</pubDate><description><![CDATA[ 今天2：00IBM暑期实习笔试，一百来号人。去年，我曾经做过一次IBM笔试题，那时没有智力测试。我选做的JAVA + LINUX，一小时。今年,加了智力题。时间加长到2个半小时，但都是每部分做完就收卷，根本没有匀时间的余地。  第一部分1.矩阵元素空间变换 13min我花了太多时间在长题目上推敲，结果浪费了简短题目的答题时间所以以后如果是一个题的多个小题，而且之间没有什么]]></description><category></category></item></channel></rss>