Â¥Ö÷

The C Container Library The C Container Library ¡¡¡¡This page describes the work presented to the French C standardization committee of the AFNOR to be included in the next C standard. This is a preliminary work with the objective of finding out problems and issues with the sample implementation or the specifications of the container library. ¡¡¡¡The objective here is to allow C programmers to use lists, hash tables, flexible arrays, bitstrings and many other containers without being forced to reinvent the wheel each time, and offering a standard interface that allows programs to use this library and remain portable. ¡¡¡¡This proposal is divided in two parts: ¡¡¡¡The specifications of a portable interface to be added to the future C standard. Each interface is described in detail and some sample code is added at the end. This document is both the specification and the documentation of the sample implementation. ¡¡¡¡The sample implementation. This is proposed here to give an idea of how each compiler vendor could implement the library. It is NOT "the" implementation, it is one among many possible implementations. The code hasn't been tested a lot and may contain errors. To find those errors is one of the objectives here. ¡¡¡¡Note: To avoid line endings problems (DOS or Unix line endings). ¡¡¡¡to unzip the file. That will unzip the C text files with the correct line endings of your system Within that zip file you will find:(0) The changelog. ¡¡¡¡(1) The complete specifications so far. Format odt (OpenOffice) or .doc (Microsoft). ¡¡¡¡(2) The code for the sample implementation. ¡¡¡¡(3) A makefile for unix systems. ¡¡¡¡The containers implemented so far in the sample implementation are: ¡¡¡¡Lists (single and double linked) ¡¡¡¡String collection ¡¡¡¡Array list (flexible arrays) ¡¡¡¡Dictionary (Hash table) ¡¡¡¡Hash table (resizable, more sophisticated than dictionary) ¡¡¡¡Bitstrings ¡¡¡¡AVL-Tree ¡¡¡¡Red/Black trees ¡¡¡¡Scapegoat trees ¡¡¡¡Queue ¡¡¡¡Deque ¡¡¡¡Bloom filter ¡¡¡¡The specifications are still incomplete for some containers like AVL trees, Red-black trees and scapegoat trees. ¡¡¡¡Auxiliary interfaces are provided to: ¡¡¡¡heaps ¡¡¡¡memory pools ¡¡¡¡debugging malloc ¡¡¡¡error handling    Êղؠ  ·ÖÏí   ¶¥(0)

----------------------------------------------
³õ´ÓÎÄ£¬ÈýÄê²»ÖУ»ºóÏ°Î䣬У³¡·¢Ò»Ê¸£¬ÖйÄÀô£¬ÖðÖ®³ö£»Ëìѧҽ£¬ÓÐËù³É¡£×Ô׫һÁ¼·½£¬·þÖ®£¬×ä¡« 
http://hjx221.blogger.org.cn/