QT下的DRAW程序，是一个UNIX和WINDOWS跨平台的DEMO，版本QT3.1.1。

ip包检测工具，可以检测ipv4，ipv6数据包详细情况-ip packet inspection tools, can detect ipv4, ipv6 data packet details

linux 应用程序automake 使用详细范例-the use of detailed examples of linux application automake

Nxdoom真的满好用的-Nxdoom really full of handy.

width = gdk_pixbuf_animation_get_width(ani) height = gdk_pixbuf_animation_get_height(ani) current_frame_list = gdk_pixbuf_animation_get_frames(ani) pixmap = gdk_pixmap_new(w->window, width, height, -1) clean_pixmap = gdk_pixmap_new(w->window, width, height, -1) if (w->style->bg_pixmap[GTK_STATE_NORMAL]) { GdkPixmap *bg = w->style->bg_pixmap[GTK_STATE_NORMAL] GdkGC *gc GdkGCValues values values.tile = bg values.fill = GDK_TILED gc = gdk_gc_new_with_values(w->window, &values, GDK_GC_FILL|GDK_GC_TILE) gdk_gc_set_ts_origin(gc, (w->allocation.width - width)/2, (w->allocation.height-height)/2) gdk_draw_rectangle(clean_pixmap,gc, TRUE, 0, 0, width, height) gdk_gc_destroy(gc) } else { gdk_draw_rectangle(clean_pixmap, w->style->bg_gc[GTK_STATE_NORMAL], TRUE, 0, 0, width, height) }- width = gdk_pixbuf_animation_get_width(ani)

The Valgrind distribution has multiple tools. The most popular is the memory checking tool (called Memcheck) which can detect many common memory errors such as: * touching memory you shouldn t (eg. overrunning heap block boundaries) * using values before they have been initialized * incorrect freeing of memory, such as double-freeing heap blocks * memory leaks. -The Valgrind distribution has to multiple ols. The most popular is the memory checking too l (called Memcheck) which can detect many commo n memory errors such as :* touching memory you should not (eg. overrunnin g heap block boundaries)* t values before using hey have been initialized* incorrect freeing o f memory, such as double-freeing heap memory blocks* lea ks.

本代码文件是S3C44B0X板的测试程序，包括汇编初始化文件和C语言测试代码。-The code file is S3C44B0X plate test procedures, including the compilation of documents and C language to initialize test code.

哈夫曼程序设计课程-Huffman program design courses

qt3.8开发的例子, 做linux下qt编程可以参考-qt3.8 development example, so under linux programming can refer qt

arp的源代码实现,linux学C的可以看看了-achieve the source code, the C linux school can look at the

著名图论问题之一。邮递员从邮局出发送信，要求对辖区内每条街，都至少通过一次，再回邮局。在此条件下，怎样选择一条最短路线?此问题由中国数学家管梅谷于1960年首先研究并给出算法，故名。-Well-known graph theory problems. Postman deliver a letter from the post office proceed to require every street within the right area, at least through the time, return to post office. Under these conditions, how to select a shortest route? This issue by the Chinese mathematician Mei Gu tube study in 1960, and gives the first algorithm, hence the name.