最近公司需要对CarbonData进一步应用,或许封装进产品,或许是为了解析CarbonData元数据,于是开始预研CarbonData,下面将保持每天一篇以上的阅读CarbonData源码博客,由于自己基础薄弱,会记录自己所有觉得有价值的点,内容或旁杂或简单,海涵. 阅读方式以example或test类为入口,后期熟悉整体项目后将走完整流程,并与parquet进行对比. 源码整体结构如下: 第一篇 common package 一:首先浏览Test类LoggingServiceTest_FT,…

这次是逆雪寒分析common.inc.php的数据库部分: <?php // 包含数据库操作类,下章详说 require PHPCMS_ROOT.'/include/'.$db_file.'.class.php'; // 遇到再说 require PHPCMS_ROOT.'/include/tag.func.php'; // 遇到再说 require PHPCMS_ROOT.'/include/extension.inc.php'; // 实例化数据库类 $db = new $db_class;…

  其实就是从网上找到的的逆雪寒的分析, 我下来之后发现格式和错字的问题,非常影响阅读,现在我就是做了下搬运工的角色, 同时将格式调整到可读性提高点而已,让各位看官稍微舒心点: 下面进入整体: <?php /* 国内著名CMS: PHPCMS 整站代码分析讲解 -2008-1-2已更新(# 20页)(第三章继续进行中..) CMS, 著名, 代码, 讲解 本帖最后由 逆雪寒 于 2010-2-20 17:21 编辑 谢谢. 代码讲解分析全部是本人.按照本人的知识水平来讲解.如果有说得不对的.请指…

Problem Description A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = <x1, x2, ..., xm> another sequence Z = <z1, z2, ..., zk> is a subsequence of X if there exists a stri…

前提: product项目下有三个module,分别是: driver module domain-perf module common module 问题: driver 和 domain-perf 都依赖common, common install正常,domain-perf 在install的时候,提示: Could not resolve dependencies -SNAPSHOT: Failed to collect dependencies at com.fanxl:product…

Common Subsequence Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 41957   Accepted: 16927 Description A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, ..…

Description A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, ..., xm > another sequence Z = < z1, z2, ..., zk > is a subsequence of X if there exists a strictly…

Common Subsequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 48378    Accepted Submission(s): 22242 Problem Description A subsequence of a given sequence is the given sequence with some e…

http://acm.hdu.edu.cn/showproblem.php?pid=1159 Common Subsequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38176    Accepted Submission(s): 17504 Problem Description A subsequence of a gi…

http://poj.org/problem?id=3415 给定两个字符串A 和B,求长度不小于k 的公共子串的个数(可以相同). 论文题,和上道题(POJ2774)类似,首先想到现将AB串合并,然后子串可以表示成字符串后缀的前缀,于是我们比较任意两个A后缀和B后缀,用height求出他们的公共子串长度就很好做了. (不懂为什么好做的可以看SPOJ694) 那么最坏的想法就是每遇到B后缀就和前面遇到的A后缀比较,这样显然TLE,也没用到height数组的优越性. 但是我们A后缀可以用单调栈维护…