|
1 | | -This documnet is the change log of cstl version. |
2 | 1 |
|
3 | | -cstl 0.0.0 : 2008-11-01 20:20:52 |
4 | | -* Create original Version. <Wangbo> |
| 2 | +2010-10-01 Bo Wang <activesys.wb@gmail.com |
5 | 3 |
|
6 | | -cstl 0.0.1 : 2008-11-13 23:16:10 |
7 | | -* Fixup the _ROUND_UP macro bug. <Wangbo> |
| 4 | + Version 2.0.1 |
| 5 | + * Release libcstl-2.0.1. |
| 6 | + * Fixup bug on 64-bit OS. |
8 | 7 |
|
9 | | -cstl 0.0.2 : 2008-11-13 23:32:20 |
10 | | -* Not assigen the equal function to the NULL during create new vector. <Wangbo> |
11 | | -* Initialize the vector when the element count less equal 0. <Wangbo> |
| 8 | +2010-06-09 Bo Wang <activesys.wb@gmail.com> |
12 | 9 |
|
13 | | -cstl 0.0.3 : 2008-11-14 19:45:06 |
14 | | -* Get the the variable prarmeter with va_list pointer. <Wangbo> |
15 | | -* Copy vector with the capacity of source vector. <Wangbo> |
16 | | -* Envalue the iterator distance error in vector_copy_range. <Wangbo> |
17 | | -* Envalue the pointer distance error in vector_equal. <Wangbo> |
18 | | -* No handle when the vector have no user defined equal function in vector_equal. <Wangbo> |
| 10 | + Version 2.0.0 |
| 11 | + * Release libcstl-2.0.0. |
| 12 | + * Add range_t type. |
| 13 | + * Add c-style string support. |
| 14 | + * Add VS project support. |
| 15 | + * Update default compare function in pair_t, map_t, multimap_t, hash_map_t and hash_multimap_t. |
| 16 | + * Update default hash function in hash_set_t, hash_multiset_t, hash_map_t and hash_multimap_t. |
| 17 | + * Add user defined type support. |
| 18 | + * Add type mechanism support. |
19 | 19 |
|
20 | | -cstl 0.0.4 : 2008-11-15 09:27:52 |
21 | | -* The logic of vector_less is error. <Wangbo> |
| 20 | +2009-04-25 Bo Wang <activesys.wb@gmail.com> |
22 | 21 |
|
23 | | -cstl 0.1.0 : 2008-11-15 10:47:26 |
24 | | -* Replace the less and equal user defined function with the compare user defined function in the vector struct. <Wangbo> |
25 | | -* Change the destroy element function name from pfun_destroy_elem to _pfun_destroy_elem. <Wangbo> |
| 22 | + Version 1.0.1 |
| 23 | + * Release libcstl-1.0.1. |
| 24 | + * Fixup bugs in initialization operation of all containers. |
| 25 | + * Fixup bugs in Makefile. |
26 | 26 |
|
27 | | -cstl 0.1.1 : 2008-11-15 10:51:29 |
28 | | -* Replace the less and equal user defined function with compare user defined function in the vector_init. <Wangbo> |
| 27 | +2009-04-20 Bo Wang <activesys.wb@gmail.com> |
29 | 28 |
|
30 | | -cstl 0.1.2 : 2008-11-15 10:54:05 |
31 | | -* Replace the less and equal user defined function with the compare user defined function in the vector struct. <Wangbo> |
32 | | -* Change the destroy element function name from pfun_destroy_elem to _pfun_destroy_elem. <Wangbo> |
33 | | -* Call the deallocate function user the byte size instead of element count in vector_reserve. <Wangbo> |
34 | | - |
35 | | -cstl 0.1.3 : 2008-11-16 10:42:09 |
36 | | -* Use vector_size instead of vector_capacity in vector_assign_range. <Wangbo> |
37 | | -* Fix the invalid iterator when the vecotr reserve new length and move the memory use the overlength in vector insert function family. <Wangbo> |
38 | | -* The length of memory for moving error in vector_erase. <Wangbo> |
39 | | -* Insert the element into vector use vector_insert instead of vector_insert_n in vector_resize. <Wangbo> |
40 | | -* Reserve the vector size whitout check the grow size if great then the capacity of vector in vector_resize_with_elem. <Wangbo> |
41 | | -* The return value of two iterator minus is signed int. <Wangbo> |
42 | | - |
43 | | -cstl 0.1.4 : 2008-11-16 19:52:22 |
44 | | -* The distance of two iterator is signed int. <Wangbo> |
45 | | - |
46 | | -cstl 0.1.5 : 2008-11-16 19:52:22 |
47 | | -* Assign the iterator._t_pos. <Wangbo> |
48 | | - |
49 | | -cstl 0.1.6 : 2008-11-24 21:35:28 |
50 | | -* Copy element use _ELEM_TYPE_NAME_SIZE instead of type size, so destroy the memory of next node in list_copy function. <Wangbo> |
51 | | -* The end node iterator is belong to list in the _iterator_belong_to_list function. <Wangbo> |
52 | | -* Return true when both list equal in list_less. <Wangbo> |
53 | | - |
54 | | -cstl 0.1.7 : 2008-11-26 20:57:11 |
55 | | -* Erase the end node in list_erase and list_erase_range. <Wangbo> |
56 | | -* Forget update the t_begin that lead to refree memory in list_erase_range. <Wangbo> |
57 | | -* Forget update the t_pos that lead to refree memory in list_remove and list_remove_if. <Wangbo> |
58 | | - |
59 | | -cstl 0.1.8 : 2008-11-27 19:57:58 |
60 | | -* Usage of condition function is error in list_unique_if function. <Wangbo> |
61 | | -* Move the initialization from _create_list to list_init. <Wangbo> |
62 | | -* Ensure the pt_list is difference from pt_listsrc in list_splice, list_splice_pos, list_splice_range. <Wangbo> |
63 | | -* Use the list iterator without initialization in _quick_sort. <Wangbo> |
64 | | - |
65 | | -cstl 0.1.9 : 2008-11-28 21:26:27 |
66 | | -* If the first node equal to second node is false in _iterator_before. <Wangbo> |
67 | | - |
68 | | -cstl 0.1.10 : 2008-11-29 12:23:03 |
69 | | -* Fixup a lot of bugs in _quick_sort. <Wangbo> |
70 | | -* Iterator to source initialized with begin of dest in list_megre and list_megre_if. <Wangbo> |
71 | | - |
72 | | -cstl 0.2.0 : 2008-11-30 09:06:14 |
73 | | -* Change the struct of iterator for the flexibility. <Wangbo> |
74 | | - |
75 | | -cstl 0.2.1 : 2008-12-05 20:59:08 |
76 | | -* Bad equal to condition in _deque_iterator_equal. <Wangbo> |
77 | | -* When two iterator is equal to return 0 in _deque_iterator_minus. <Wangbo> |
78 | | - |
79 | | -cstl 0.2.2 : 2008-12-06 15:29:32 |
80 | | -* Invalid iterator size in deque_init function. <Wangbo> |
81 | | - |
82 | | -cstl 0.2.3 : 2008-12-08 19:55:22 |
83 | | -* Initialize the deque start and finish with local pointer in _create_deque. <Wangbo> |
84 | | -* Initialize the map with no loop in deque_init. <Wangbo> |
85 | | -* When the corepos equal to afterlast is error. <Wangbo> |
86 | | -* Compute the step for loop error in _iterator_belong_to_deque. <Wangbo> |
87 | | -* Deallocate the element container error in deque_destroy. <Wangbo> |
88 | | -* Grow count error in deque_init. <Wangbo> |
89 | | - |
90 | | -cstl 0.2.4 : 2008-12-10 19:59:28 |
91 | | -* When the iterator beyond the range in _vector_iterator_get_value and _vector_iterator_set_value. <Wangbo> |
92 | | - |
93 | | -cstl 0.2.5 : 2008-12-10 20:03:57 |
94 | | -* When iterator pointer beyond the range in _list_iterator_get_value and _list_iterator_set_value. <Wangbo> |
95 | | -* Don't check the result in _list_iterator_next and _list_iterator_prev. <Wangbo> |
96 | | - |
97 | | -cstl 0.2.6 : 2008-12-10 20:14:40 |
98 | | -* When iterator pointer beyond the range in _deque_iterator_get_value and _deque_iterator_set_value. <Wangbo> |
99 | | -* Don't containe the begin iterator when corepos equal to afterlast in _deque_iterator_next. <Wangbo> |
100 | | -* Increase the map element error in _deque_iterator_next. <Wangbo> |
101 | | - |
102 | | -cstl 0.2.7 : 2008-12-11 13:23:20 |
103 | | -* Omit the break after case _DEQUE_CONTAINER in iterator_next_n and iterator_at. <Wangbo> |
104 | | - |
105 | | -cstl 0.2.8 : 2008-12-11 13:59:51 |
106 | | -* Make the implement of _deque_iterator_at simplier. <Wangbo> |
107 | | -* When the second iterator equal to end iterator, the _iterator_before return false. <Wangbo> |
108 | | -* State the distance in _deque_iterator_minus error. <Wangbo> |
109 | | - |
110 | | -cstl 0.2.9 : 2008-12-11 13:59:51 |
111 | | -* When the default map count is not enough the new map count error. <Wangbo> |
112 | | -* Use the element count instead of element type size in deque_rend. <Wangbo> |
113 | | -* The bad usage of distance in deque_copy_range. <Wangbo> |
114 | | -* Use the t_end instead of t_src in deque_copy_range. <Wangbo> |
115 | | - |
116 | | -cstl 0.2.10 : 2008-12-12 10:24:11 |
117 | | -* Iterate the first deque iterator use the second deque iterator range. <Wangbo> |
118 | | -* Invalid range in deque_at. <Wangbo> |
119 | | -* Swap the container pointer in deque_swap. <Wangbo> |
120 | | -* Omit the else portion in deque_insert, deque_insert_n, deque_insert_range. <Wangbo> |
121 | | -* It is not handle the iterator equal condition in _move_elem_to_back. <Wangbo> |
122 | | -* It is not handle the iterator equal condition in _move_elem_to_front. <Wangbo> |
123 | | -* Insert after the t_pos in deque_insert_n. <Wangbo> |
124 | | -* Change the _expand_at_back and _expand_at_front interface. <Wangbo> |
125 | | -* Testing of insert family and _expand _shrink family function don't complete. <Wangbo> |
126 | | - |
127 | | -cstl 0.2.11 : 2008-12-12 20:13:43 |
128 | | -* Fixup all bugs in _expand_at_back. <Wangbo> |
129 | | -* Fixup the bug in _iterator_belong_to_deque and _expand_at_front. <Wangbo> |
130 | | -* Change the implement of _expand_at_front. <Wangbo> |
131 | | - |
132 | | -cstl 0.2.12 : 2008-12-13 20:13:43 |
133 | | -* Fixup the bug in _expand_at_front. <Wangbo> |
134 | | -* Fixup the distance between t_pos and t_gap in deque_insert_range. <Wangbo> |
135 | | -* Fixup the using _ELEM_TYPE_NAME_SIZE instead of _DEQUE_MAP_COUNT in _shrink_at_back and _shrink_at_front. <Wangbo> |
136 | | - |
137 | | -cstl 0.2.13 : 2008-12-14 20:16:53 |
138 | | -* When vector pointer is NULL then reserve vector error. <Wangbo> |
139 | | - |
140 | | -cstl 0.2.14 : 2008-12-15 16:20:42 |
141 | | -* When the begin iterator equal to end iterator then error in _list_iterator_distance. <Wangbo> |
142 | | - |
143 | | -cstl 0.2.15 : 2008-12-17 16:01:36 |
144 | | -* Copy element from src slist to dest slist use the next in slist_copy. <Wangbo> |
145 | | -* Save the compare and destroy element function after destroy slist in slist_assign. <Wangbo> |
146 | | -* Use end iterator instead of t_pos in slist_previous. <Wangbo> |
147 | | - |
148 | | -cstl 0.2.16 : 2008-12-18 14:24:30 |
149 | | -* _slist_insert_after_n use the slist_end iterator. <Wangbo> |
150 | | -* slist_insert doesn't return the new element iterator. <Wangbo> |
151 | | -* slist_insert_after_range use the slist_end iterator. <Wangbo> |
152 | | -* Making the insert range list error in slist_insert_after_range and slist_insert_range. <Wangbo> |
153 | | -* Fixup bugs when resize size equal original size of slist and list. <Wangbo> |
154 | | - |
155 | | -cstl 0.2.17 : 2008-12-19 10:27:51 |
156 | | -* Initialization of first slist iterator is error in slist_less. <Wangbo> |
157 | | - |
158 | | -cstl 0.2.18 : 2008-12-22 15:38:37 |
159 | | -* Update the interface of slist_splice_after_pos and slist_splice_after_range. <Wangbo> |
160 | | -* Fixup bug in slist_reverse. <Wangbo> |
161 | | - |
162 | | -cstl 0.2.19 : 2008-12-22 21:26:11 |
163 | | -* Use the insert sort in slist_sort, and fixup some bugs in megre function. <Wangbo> |
164 | | - |
165 | | -cstl 0.3.0 : 2008-12-22 21:50:21 |
166 | | -* Add element type unification. <Wangbo> |
167 | | - |
168 | | -cstl 0.3.1 : 2008-12-23 09:27:12 |
169 | | -* Does't handle the type long char short when CSTL_TYPES_UNIFICATION=4. <Wangbo> |
170 | | -* Avoid all warning with -DNDEBUG compiler option. <Wangbo> |
171 | | - |
172 | | -cstl 0.3.2 : 2008-12-27 11:00:46 |
173 | | -* Forget copy the value in _insert_avlnode. <Wangbo> |
174 | | -* Change parent with NULL node in signal rotate function. <Wangbo> |
175 | | -* The iterator returned by _avl_tree_insert_equal is error. <Wangbo> |
176 | | -* The iterator returned by _avl_tree_find is error. <Wangbo> |
177 | | -* The get_pointer function of iterator return const void*. <Wangbo> |
178 | | - |
179 | | -cstl 0.3.3 : 2008-12-28 08:51:46 |
180 | | -* The last iterator returned by _avl_tree_upper_bound. <Wangbo> |
181 | | -* When the left node is NULL, the _avl_tree_erase_pos is error. <Wangbo> |
182 | | -* Fixup bugs in _avl_tree_lower_bound, when lower bound is begin. <Wangbo> |
183 | | - |
184 | | -cstl 0.4.0 : 2008-12-29 10:31:46 |
185 | | -* Update the allocator architecture. <Wangbo> |
186 | | - |
187 | | -cstl 0.4.1 : 2009-01-04 10:02:17 |
188 | | -* When the sibling parent node is NULL error. <Wangbo> |
189 | | -* Compare value error. <Wangbo> |
190 | | -* Must be check root first in _rebalance_rb_tree. <Wangbo> |
191 | | -* rbegin and rend is error. <Wangbo> |
192 | | - |
193 | | -cstl 0.4.2 : 2009-01-05 10:52:40 |
194 | | -* Fixup bugs in swap function of rb tree and avl tree. <Wangbo> |
195 | | -* Fixup bugs in _fixup_deletion function. <Wangbo> |
196 | | -* Fixup bugs in lower bound and upper bound function. <Wangbo> |
197 | | - |
198 | | -cstl 0.4.3 : 2009-01-07 19:37:02 |
199 | | -* Fixup bugs in _create_set. <Wangbo> |
200 | | -* Fixup bugs in interface of set. <Wangbo> |
201 | | -* Fixup bugs in _set_iterator_equal. <Wangbo> |
202 | | - |
203 | | -cstl 0.4.4 : 2009-01-09 21:14:46 |
204 | | -* Fixup bugs in _fixup_deletion. <Wangbo> |
205 | | -* Fixup bugs in map_at. <Wangbo> |
206 | | - |
207 | | -cstl 0.4.5 : 2009-01-12 16:53:42 |
208 | | -* Modify the vector_at interface. <Wangbo> |
209 | | -* Modify the deque_at interface. <Wangbo> |
210 | | - |
211 | | -cstl 0.4.6 : 2009-01-14 11:10:25 |
212 | | -* Fixup bugs in _iterator_belong_to_vector. <Wangbo> |
213 | | -* Fixup bugs in _hash_function. <Wangbo> |
214 | | -* Fixup bugs in _hashtable_iterator_next. <Wangbo> |
215 | | - |
216 | | -cstl 0.4.7 : 2009-01-16 17:09:16 |
217 | | -* Add hash function for c build-in types. <Wangbo> |
218 | | -* Fixup bugs in _unify_types. <Wangbo> |
219 | | -* Fixup bugs in _hashtable_erase_pos. <Wangbo> |
220 | | - |
221 | | -cstl 0.5.0 : 2009-01-19 15:38:25 |
222 | | -* Update the copy constructor and assignment operator interface of all containers. <Wangbo> |
223 | | - |
224 | | -cstl 0.5.1 : 2009-02-03 14:12:02 |
225 | | -* Fixup bugs in basic_string_c_str() and basic_string_data(). <Wangbo> |
226 | | -* Fixup bugs in basic_string_init_cstr() and basic_string_init_elem(). <Wangbo> |
227 | | -* Fixup bugs in vector_init_copy_range(). <Wangbo> |
228 | | -* Fixup bugs in basic_string_connect_elem(). <Wangbo> |
229 | | -* Fixup bugs in basic_string find functions. <Wangbo> |
230 | | -* Fixup bugs in vector resize functions. <Wangbo> |
231 | | -* Fixup bugs in _vector_iterator_minus(). <Wangbo> |
232 | | -* Fixup bugs in basic_string insert function(). <Wangbo> |
233 | | - |
234 | | -cstl 0.6.0 : 2009-02-05 17:27:10 |
235 | | -* Update interface and implemention of all containers. <Wangbo> |
236 | | - |
237 | | -cstl 0.6.1 : 2009-02-12 17:02:28 |
238 | | -* Fixup bug in _hash_map_at(), infinity recursive. <Wangbo> |
239 | | - |
240 | | -cstl 0.7.0 : 2009-02-17 14:51:04 |
241 | | -* Update the element list mechanism. <Wangbo> |
242 | | - |
243 | | -cstl 0.7.1 : 2009-02-18 09:46:44 |
244 | | -* Fixup bugs in slist_push_front. <Wangbo> |
245 | | -* Fixup bugs for memory leak. <Wangbo> |
246 | | -* Update default compare function for all container. <Wangbo> |
247 | | -* Fixup bugs in deque_erase_range(). <Wangbo> |
248 | | - |
249 | | -cstl 0.7.2 : 2009-02-19 11:16:55 |
250 | | -* Fixup bugs in _avl_tree_iterator_prev() and _rb_tree_iterator_prev(). <Wangbo> |
251 | | - |
252 | | -cstl 0.7.3 : 2009-03-05 15:28:28 |
253 | | -* Fixup bugs in heap algorithm with operator < and operator >. <Wangbo> |
254 | | - |
255 | | -cstl 0.8.0 : 2009-03-09 13:25:49 |
256 | | -* Take out all destroy element function and element compare function. <Wangbo> |
257 | | - |
258 | | -cstl 1.0.0 : 2009-03-10 11:16:29 |
259 | | -* Build release version cstl-1.0.0. <Wangbo> |
260 | | - |
261 | | -libcstl 1.0.0 : 2009-04-20 20:33:23 |
262 | | -* Change project name from cstl to libcstl. <Wangbo> |
263 | | - |
264 | | -libcstl 1.0.1 : 2009-04-25 14:59:49 |
265 | | -* Fixup bugs in initialization operation of all containers. |
266 | | -* Fixup bugs in Makefile. |
267 | | - |
268 | | -libcstl 2.0.0-preview : 2009-11-01 08:45:22 |
269 | | -* Release preview version for libcstl-2.0.0. <Wangbo> |
270 | | - |
271 | | -libcstl 2.0.0-beta : 2010-04-21 11:26:34 |
272 | | -* Release bate version for libcstl-2.0.0. <Wangbo> |
273 | | - |
274 | | -libcstl 2.0.0 : 2010-06-09 19:46:33 |
275 | | -* Release libcstl-2.0.0. <Wangbo> |
| 29 | + Version 1.0.0 |
| 30 | + * Release libcstl-1.0.0. |
0 commit comments