Development log - red & black (1)

原创 2003年09月19日 00:00:00

Development log - red & black (1)

Red

Software that easy to test.
By Zhang Hui

Mr Z add some backdoor in the debug version of software. He even add a small
console for the application. It's more easy for him to do some kind of testing.
 For example, if we want to test the case of what display when there are over
10000 message. No one will send 10000 message to do such test, it's so expensive
and time-consuming! What he does is add a small language parser in the application.
When inputting words can be parsed by the small language engine, it will trigle
some actions. Because it supports parameters, it's very handy for us to do various
testing. What a great idea! Supposing we add "add inbox 1000", that means to create
1000 messages and store them in inbox. It's so easy, isn't?

Yesterday, I read the chapter of "unit test" of "Dive into python". From the example,
we know that the more early we add "unit test", the more we can get from them.
By "testing first", we can avoid over-design, we can release ealier, we can code
with full confidence, we can code in a graceful way, we can refactor the code anytime,
anywhere without worry about break something else.

To write a programe is not difficult, While it's much more difficult and complicated
to finish a "software". The core idea of developing software is to ensure quality,
meet schedule, within bugdet. So the core of the core is the software quality.
An procedure or mechanism is needed to ensure quality. It's natural for me to adopt
the idea of "test driven development" or "test centered development".

The mature level of development is decided by the level of testing.
===================================
版权所有 /copyright 张辉 2003
本文可原封不动的拷贝和自由地再发行,但在拷贝和再发行的拷贝中必须
原封不动地含有这段版权声明。 
http://forestsong.blogone.net

 

 


 

Development log - red & black (1)

Development log - red & black (1) RedSoftware that easy to test.By Zhang HuiMr Z add some backdoor i...
  • forestsong78
  • forestsong78
  • 2003年09月19日 00:00
  • 526

Development log - red & black (2)

Development log - red & black (2) Black - If I can do this again. By Zhang HuiWhen the SA date is co...
  • forestsong78
  • forestsong78
  • 2003年09月19日 00:01
  • 476

POJ 1979 Red and Black(红与黑)

原文DescriptionThere is a rectangular room, covered with square tiles. Each tile is colored either red...
  • NoMasp
  • NoMasp
  • 2015年12月09日 20:13
  • 3041

杭电(hdu)ACM 1312 Red and Black

Red and Black Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...
  • IT142546355
  • IT142546355
  • 2015年08月13日 08:31
  • 557

C语言对DFS简单应用(Red and Black

#include int dir[4][2]={{1,0},{0,-1},{0,1},{-1,0}}; char maze[25][25]; int num,m,n; void DFS(int x,i...
  • LieYingZhiYan
  • LieYingZhiYan
  • 2015年02月03日 19:56
  • 771

红黑树—Red Black Tree

红黑树是具有以下五条性质的二叉查找树: 1、每个结点要么是红的要么是黑的。 2、根结点是黑的。 3、每个叶结点(叶结点即指树尾端NIL指针或NULL结点)都是黑的。 4、如果一个结点是红的...
  • yuyixinye
  • yuyixinye
  • 2015年03月28日 21:47
  • 684

HDU 1312 Red and Black(经典搜索,DFS&BFS三种方式)

Red and Black Problem Description There is a rectangular room, covered with square tiles. Each...
  • hurmishine
  • hurmishine
  • 2016年03月18日 23:19
  • 1282

杭电 1312 Red and Black 递归 附翻译

Red and Black Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) To...
  • qq_24678203
  • qq_24678203
  • 2015年08月03日 11:19
  • 510

杭电 HDU 1312 Red and Black(超级简单dfs)

Red and Black Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...
  • lsgqjh
  • lsgqjh
  • 2015年07月31日 10:22
  • 684

poj 1979 Red and Black(BFS)

Red and Black Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 31221   Accepted: 1...
  • llwwlql
  • llwwlql
  • 2016年09月04日 11:16
  • 194
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Development log - red & black (1)
举报原因:
原因补充:

(最多只允许输入30个字)