Linux and the Unix Philosophy Summary
1,小即是美
2.讓每一個程式只做好一件事
3.儘快建立原型 》 適當工程方法
4.可移植性的優先權——————捨棄高效率而取可移植性
可移植到資料才是真正的資料————採用純文字形式儲存資料,將資料儲存為二進位制格式是嚴格禁止的
5.將一切操作進行自動化處理
6.Shell的槓桿效應
7.小模組意味著更大的靈活性,同時帶來的問題卻是互動的難以掌控
8.避免使用CUI的原因:
CUI程式難以組合,擴充套件性差,難以發揮槓桿效應,CUI解析器龐大,CUI偏向大即是美,
9.讓每一個程式都成為過濾器: 程式並不產生資料,程式只修改資料
sample: Linux 下的Stdin/Stdout/Stderr (再次反應CUI的不必要性)
10.沉默是金
sample: UNIX下的ls命令(空白資料夾生成管道會直接斷裂,而不是將輸出傳下去)
11.並行思維
12. 尋求90%的解決方案 ------> 割捨不必要的 solution從而提高效率和效能
13.層次化思考 目錄結構/程序
相關推薦
Linux and the Unix Philosophy Summary
讀完Linux and the Unix Philosophy 後自己寫的一個小 Summary 1,小即是美 2.讓每一個程式只做好一件事 3.儘快建立原型 》 適當工程方法 4.可移植性的優先權——————捨棄高效率而取可移植性 可移植到資
Kernel parameters for Db2 database server installation (Linux and UNIX)
enter settings running server ems aced esc token word Db2 11.1 For root installations, the database manager uses a formula to automatical
Install the AWS CLI Using the Bundled Installer (Linux, macOS, or Unix)
On Linux, macOS, or Unix, you can also use the bundled installer to install the AWS CLI. The bundled installer includes all dependencies and can be used of
Top 5 Courses to Learn Shell Scripting in Linux and UNIX Online
A huge chunk of a developer's time is wasted in trying to repeat tasks and commands, especially when it comes to working with a bunch of UNIX or Linux mac
Linux and Unix ps command tutorial with examples
Tutorial on using ps, a UNIX and Linux command for reporting information on running processes. Examples of searching by user, group, executable name a
Set Up an HTTP Proxy for Docker and the ECS Agent in Enterprise Linux
docker run --name ecs-agent \ --env=ECS_ENABLE_TASK_IAM_ROLE_NETWORK_HOST=true \ --env=ECS_ENABLE_TASK_IAM_ROLE=true \ --env "NO_PROXY=169.254.1
OpenStack Queens指南 :Install and configure the dashboard for Red Hat Enterprise Linux and CentOS
[[email protected] ~]# yum install openstack-dashboard -yLoaded plugins: fastestmirror, langpacksRHEL-Repository
LightOJ 1341 Aladdin and the Flying Carpet(唯一分解定理)
void 都是 scanf esp for space tar sqrt lld http://lightoj.com/volume_showproblem.php?problem=1341 題意:給你矩形的面積(矩形的邊長都是正整數),讓你求最小的邊大於等於b的矩形的個
HDU 1028 Ignatius and the Princess III dp
cep 大數 style code 代碼 des for each 狀態轉移方程 遞推 題目鏈接:http://acm.hdu.edu.cn/showproblem.php?pid=1028 一道經典題,也是算法設計與分析上的一道題,可以用遞推,動態規劃,母函數求解,我用的
Ignatius and the Princess III(杭電1028)(母函數)
mission des panel mes content nat strong pro accepted Ignatius and the Princess III Time Limit: 2000/1000 MS (Java/Others) Memory L
Harry Potter and the Goblet of Fire
opaque 外殼 葡萄酒 revel luna 道德 說明 剪裁 指揮 書名:Harry Potter and the Goblet of Fire 作者:J.K. Rowling 篇幅: 752頁 藍思值:880L 用時: 17天 工具:
HDU Ignatius and the Princess III (母函數)
tex namespace class .net author def urn rst isp Problem Description "Well, it seems the first problem is too easy. I will let you know h
J - Ignatius and the Princess II
() tdi after pretty assume pen inpu def show Now our hero finds the door to the BEelzebub feng5166. He opens the door and finds feng5166
gym-101343I-Husam and the Broken Present 1
cnblogs bit using space namespace for bsp pri () 1 ///水題 2 #include <bits/stdc++.h> 3 using namespace std; 4 int main() 5 {
[ACM] hdu 1029 Ignatius and the Princess IV (動歸或hash)
inner other for each sam 代碼 test case break accep bre Ignatius and the Princess IV Time Limit : 2000/1000ms (Java/Other) Memory Li
[Git]Please make sure you have the correct access rights and the repository exists
perm not 配置 兩個 需要 acc repos http 機器 這個問題是這樣,需要在已有github賬號的A機器上,再創建一個github賬號,新賬號創建完畢,將代碼通過機器A push上之後,再另一臺機器B,clone 這個項目時報出了如下錯誤: Permiss
HOJ13907 Diana and the Golden Apples
per turn memset 背包 put cstring ret open tdi 簡單背包題,寫上是因為這個板子還不錯,本校OJ有個惡心的地方,單kas輸入的時候寫成多kas會wa~~ #include<cstdio> #include<cstri
HDOJ 1026 Ignatius and the Princess I
urn weight col str using n+1 them appear ... Ignatius and the Princess IV Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/3
poj 1912 A highway and the seven dwarfs
n) visit += clock build lan opera script following A highway and the seven dwarfs Time Limit: 8000MS Memory Limit: 30000K Total S
HDU 1026 Ignatius and the Princess I(BFS+路徑輸出)
namespace any who 相同 i++ cmp fine and spa Ignatius and the Princess I Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768