小编cjr*_*oth的帖子

我有一个有趣的问题.我想在Java中交叉两组Longs,每组有1B成员 - 每组4GB.这将不适合我需要运行它的服务器上的内存.

我想知道有什么有趣的方法来解决这个问题.

What I've come up with so far is reading subsets of each original set from disk that are small enough to fit into memory, then intersecting each subset, and writing those to disk temporarily. Finally, I could go through and intersect these subsets. I get a feeling that this may turn into a map reduce job.

Maybe you'll have some better ideas :) I doubt I'm the first person to have come up with this problem.

我正在尝试在我的Ubuntu 11.10安装上安装node.js和npm,而且我有一个棘手的时间.我决定从最新的源代码下载和编译,因为我想使用新版本的node.js - v0.6.0而不是synaptic包管理器将安装的旧版本.但是,由于"找不到模块"错误,我无法正确设置npm.我完全惊讶于我在错误上找到的信息很少.

无论如何,我的目标是学习node.js,而不是运行生产环境.我应该放弃并使用v4.9还是为了学习而真的值得获得最新版本,即使我必须经历更新并自行配置它的痛苦？