[Node.js] 01 - How to learn node.js
基本概念链接：https://www.zhihu.com/question/47244505/answer/105026648链接：How to decide when to use Node.js?JavaScript 是一种(最好的)编程语言, 主要作为前端开发中用来增加网页的动态功能,比如操作...
How to Add Trust Sites into IE before IE10 through Group Policy
Due to IE10 published, I’ll conclude the methods that how to add trust sites in to IE of the version before IE10.General, there are three methods to s...
How do I convert an enum to a list in C#?
How do I convert an enum to a list in C#?This will return an IEnumerable<SomeEnum> of all the values of an Enum.Enum.GetValues(typeof(SomeEnum))...
第二百一十七天 how can I 坚持
JavaScript document.getElementByName()获取数组，for循环，搞了一天，好笨。明天要下雪了，好冷。双十一，天猫搞的挺特别啊，晚上抢了个小米红包，不知道买啥，哎。睡觉。
java:找出占用CPU资源最多的那个线程(HOW TO)
在这里对linux下、sun(oracle) JDK的线程资源占用问题的查找步骤做一个小结；linux环境下，当发现java进程占用CPU资源很高，且又要想更进一步查出哪一个java线程占用了CPU资源时，按照以下步骤进行查找：先用top命令找出占用资源厉害的java进程id，如：如上图所示，jav...
DELPHI - How to use opendialog1 for choosing a folder? TOpenDialog, TFileOpenDialog
DELPHI - How to use opendialog1 for choosing a folder?On Vista and up you can show a more modern looking dialog using TFileOpenDialog.var OpenDialog:...
HDU 2609 How many
最小表示法+Map或者字典树，最小表示法找了个模板，还没学习呢...#include<cstdio>#include<cstring>#include<cmath>#include<string>#include<map>#include&...
How to install java and eclipse on linux
First of all, download from the website of java.I download 'jdk-8u102-linux-i586.tar.gz'unzip it to the specifical derictory.with the command:tar -zxv...
How Javascript works (Javascript工作原理) (十四) 解析，语法抽象树及最小化解析时间的 5 条小技巧
个人总结:读完这篇文章需要15分钟，文章介绍了抽象语法树与js引擎解析这些语法树的过程，提到了懒解析——即转换为AST的过程中不直接进入函数体解析，当这个函数体需要执行的时候才进行相应转换。(因为有的函数体只是声明了，并没有实际被调用)解析，语法抽象树及最小化解析时间的 5 条小技巧这是 JavaS...
第二百三十九天 how can I 坚持
去看了个电影，消失的凶手，乐视会员送的电影票，有点虐心，不过看着感觉还挺不错。下了班就去看了，也没有吃饭，不过没感觉到饿，回来吃了份泡面，还喝了袋冰凉的酸奶，现在已经感觉肚子有点疼了，哎。。哲学是什么--生活的意义是什么。我们嘲笑友方是傻逼，其实我们也是傻逼---雷军。股市今天大跌。跌的好干脆啊。-...
View and Data API Tips: how to make viewer full screen
By Daniel DuIf you have not heard of View and Data API, here is the idea, the View & Data API enables web developers to very easily display 3D (an...
How Many Sets I（容斥定理）
题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3556How Many Sets ITime Limit: 2 Seconds Memory Limit: 65536 KBGive a set S, |S...
hdu 2586 How far away?（LCA模板题+离线tarjan算法）
How far away ？Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 25408 Accepted Submission(s):...
【HDU 2586 How far away?】LCA问题 Tarjan算法
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2586题意：给出一棵n个节点的无根树，每条边有各自的权值。给出m个查询，对于每条查询返回节点u到v的最短路径的权值和，按查询顺序输出结果。数据范围：n [2, 40000], m[1, 200]思路：Ta...
HDU 2586 How far away ？ (LCA)
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2586LCA模版题。RMQ+LCA： #include <iostream> #include <cstdio> #include <cstring> #include...
hdu 2586 How far away ? ( 离线 LCA ， tarjan )
How far away ？Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10312 Accepted Submission(s):...
hdu 2586 How far away? （LCA模板）
题意：N个点，形成一棵树，边有长度。M个询问，每个询问(a,b)，询问a和b的距离思路：模板题，看代码。DFS预处理算出每个结点离根结点的距离。注意：qhead[maxn]，而不是qhead[maxm]。输出用%I64d，不要用%lld。C++ RE后 尝试用 G++交。代码：struct node...
How to Simulate the Price Order or Price Line Function using API QP_PREQ_PUB.PRICE_REQUEST Includes
How to Simulate the Price Order or Price Line Function using API QP_PREQ_PUB.PRICE_REQUEST Includes Example Scripts (文档 ID 412545.1)转到底部In this Docume...
How to remove ROM in MAME
/usr/share/games/mame/roms//usr/local/share/games/mame/roms/sudo rm /usr/local/share/games/mame/roms/*sudo cp -r /home/cuthead/Downloads/* /usr/local/
How to simplify a PHP code with the help of the façade pattern?
原文：https://phpenthusiast.com/blog/simplify-your-php-code-with-facade-class----------------------------------------------------------------How to simpl...