├── .cproject
├── .project
├── COPYING
├── README
├── lib_hash.c
├── lib_hash.h
├── lib_ll.c
├── lib_ll.h
├── lib_random.c
├── lib_random.h
├── lib_sort.c
├── lib_sort.h
├── lib_term_color.c
├── lib_test.c
├── lib_test.h
├── lib_vbtree.c
├── lib_vbtree.h
├── lib_vqueue.h
└── lib_vstack.h
/.cproject:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
10 |
11 |
12 |
13 |
14 |
15 |
16 |
17 |
18 |
19 |
20 |
21 |
22 |
23 |
24 |
25 |
26 |
27 |
28 |
29 |
30 |
31 |
32 |
33 |
34 |
35 |
36 |
37 |
38 |
39 |
40 |
41 |
42 |
43 |
44 |
45 |
46 |
47 |
48 |
49 |
50 |
51 |
52 |
53 |
54 |
55 |
56 |
57 |
58 |
59 |
60 |
61 |
62 |
63 |
64 |
65 |
66 |
67 |
68 |
69 |
70 |
71 |
72 |
73 |
74 |
75 |
76 |
77 |
78 |
79 |
80 |
81 |
82 |
83 |
84 |
85 |
86 |
87 |
88 |
89 |
90 |
91 |
92 |
93 |
94 |
95 |
96 |
97 |
98 |
99 |
100 |
101 |
102 |
103 |
104 |
105 |
106 |
107 |
--------------------------------------------------------------------------------
/.project:
--------------------------------------------------------------------------------
1 |
2 |
3 | C-Data-Structures
4 |
5 |
6 |
7 |
8 |
9 | org.eclipse.cdt.managedbuilder.core.genmakebuilder
10 | clean,full,incremental,
11 |
12 |
13 |
14 |
15 | org.eclipse.cdt.managedbuilder.core.ScannerConfigBuilder
16 | full,incremental,
17 |
18 |
19 |
20 |
21 |
22 | org.eclipse.cdt.core.cnature
23 | org.eclipse.cdt.managedbuilder.core.managedBuildNature
24 | org.eclipse.cdt.managedbuilder.core.ScannerConfigNature
25 |
26 |
27 |
--------------------------------------------------------------------------------
/COPYING:
--------------------------------------------------------------------------------
1 | GNU GENERAL PUBLIC LICENSE
2 | Version 3, 29 June 2007
3 |
4 | Copyright (C) 2007 Free Software Foundation, Inc.
5 | Everyone is permitted to copy and distribute verbatim copies
6 | of this license document, but changing it is not allowed.
7 |
8 | Preamble
9 |
10 | The GNU General Public License is a free, copyleft license for
11 | software and other kinds of works.
12 |
13 | The licenses for most software and other practical works are designed
14 | to take away your freedom to share and change the works. By contrast,
15 | the GNU General Public License is intended to guarantee your freedom to
16 | share and change all versions of a program--to make sure it remains free
17 | software for all its users. We, the Free Software Foundation, use the
18 | GNU General Public License for most of our software; it applies also to
19 | any other work released this way by its authors. You can apply it to
20 | your programs, too.
21 |
22 | When we speak of free software, we are referring to freedom, not
23 | price. Our General Public Licenses are designed to make sure that you
24 | have the freedom to distribute copies of free software (and charge for
25 | them if you wish), that you receive source code or can get it if you
26 | want it, that you can change the software or use pieces of it in new
27 | free programs, and that you know you can do these things.
28 |
29 | To protect your rights, we need to prevent others from denying you
30 | these rights or asking you to surrender the rights. Therefore, you have
31 | certain responsibilities if you distribute copies of the software, or if
32 | you modify it: responsibilities to respect the freedom of others.
33 |
34 | For example, if you distribute copies of such a program, whether
35 | gratis or for a fee, you must pass on to the recipients the same
36 | freedoms that you received. You must make sure that they, too, receive
37 | or can get the source code. And you must show them these terms so they
38 | know their rights.
39 |
40 | Developers that use the GNU GPL protect your rights with two steps:
41 | (1) assert copyright on the software, and (2) offer you this License
42 | giving you legal permission to copy, distribute and/or modify it.
43 |
44 | For the developers' and authors' protection, the GPL clearly explains
45 | that there is no warranty for this free software. For both users' and
46 | authors' sake, the GPL requires that modified versions be marked as
47 | changed, so that their problems will not be attributed erroneously to
48 | authors of previous versions.
49 |
50 | Some devices are designed to deny users access to install or run
51 | modified versions of the software inside them, although the manufacturer
52 | can do so. This is fundamentally incompatible with the aim of
53 | protecting users' freedom to change the software. The systematic
54 | pattern of such abuse occurs in the area of products for individuals to
55 | use, which is precisely where it is most unacceptable. Therefore, we
56 | have designed this version of the GPL to prohibit the practice for those
57 | products. If such problems arise substantially in other domains, we
58 | stand ready to extend this provision to those domains in future versions
59 | of the GPL, as needed to protect the freedom of users.
60 |
61 | Finally, every program is threatened constantly by software patents.
62 | States should not allow patents to restrict development and use of
63 | software on general-purpose computers, but in those that do, we wish to
64 | avoid the special danger that patents applied to a free program could
65 | make it effectively proprietary. To prevent this, the GPL assures that
66 | patents cannot be used to render the program non-free.
67 |
68 | The precise terms and conditions for copying, distribution and
69 | modification follow.
70 |
71 | TERMS AND CONDITIONS
72 |
73 | 0. Definitions.
74 |
75 | "This License" refers to version 3 of the GNU General Public License.
76 |
77 | "Copyright" also means copyright-like laws that apply to other kinds of
78 | works, such as semiconductor masks.
79 |
80 | "The Program" refers to any copyrightable work licensed under this
81 | License. Each licensee is addressed as "you". "Licensees" and
82 | "recipients" may be individuals or organizations.
83 |
84 | To "modify" a work means to copy from or adapt all or part of the work
85 | in a fashion requiring copyright permission, other than the making of an
86 | exact copy. The resulting work is called a "modified version" of the
87 | earlier work or a work "based on" the earlier work.
88 |
89 | A "covered work" means either the unmodified Program or a work based
90 | on the Program.
91 |
92 | To "propagate" a work means to do anything with it that, without
93 | permission, would make you directly or secondarily liable for
94 | infringement under applicable copyright law, except executing it on a
95 | computer or modifying a private copy. Propagation includes copying,
96 | distribution (with or without modification), making available to the
97 | public, and in some countries other activities as well.
98 |
99 | To "convey" a work means any kind of propagation that enables other
100 | parties to make or receive copies. Mere interaction with a user through
101 | a computer network, with no transfer of a copy, is not conveying.
102 |
103 | An interactive user interface displays "Appropriate Legal Notices"
104 | to the extent that it includes a convenient and prominently visible
105 | feature that (1) displays an appropriate copyright notice, and (2)
106 | tells the user that there is no warranty for the work (except to the
107 | extent that warranties are provided), that licensees may convey the
108 | work under this License, and how to view a copy of this License. If
109 | the interface presents a list of user commands or options, such as a
110 | menu, a prominent item in the list meets this criterion.
111 |
112 | 1. Source Code.
113 |
114 | The "source code" for a work means the preferred form of the work
115 | for making modifications to it. "Object code" means any non-source
116 | form of a work.
117 |
118 | A "Standard Interface" means an interface that either is an official
119 | standard defined by a recognized standards body, or, in the case of
120 | interfaces specified for a particular programming language, one that
121 | is widely used among developers working in that language.
122 |
123 | The "System Libraries" of an executable work include anything, other
124 | than the work as a whole, that (a) is included in the normal form of
125 | packaging a Major Component, but which is not part of that Major
126 | Component, and (b) serves only to enable use of the work with that
127 | Major Component, or to implement a Standard Interface for which an
128 | implementation is available to the public in source code form. A
129 | "Major Component", in this context, means a major essential component
130 | (kernel, window system, and so on) of the specific operating system
131 | (if any) on which the executable work runs, or a compiler used to
132 | produce the work, or an object code interpreter used to run it.
133 |
134 | The "Corresponding Source" for a work in object code form means all
135 | the source code needed to generate, install, and (for an executable
136 | work) run the object code and to modify the work, including scripts to
137 | control those activities. However, it does not include the work's
138 | System Libraries, or general-purpose tools or generally available free
139 | programs which are used unmodified in performing those activities but
140 | which are not part of the work. For example, Corresponding Source
141 | includes interface definition files associated with source files for
142 | the work, and the source code for shared libraries and dynamically
143 | linked subprograms that the work is specifically designed to require,
144 | such as by intimate data communication or control flow between those
145 | subprograms and other parts of the work.
146 |
147 | The Corresponding Source need not include anything that users
148 | can regenerate automatically from other parts of the Corresponding
149 | Source.
150 |
151 | The Corresponding Source for a work in source code form is that
152 | same work.
153 |
154 | 2. Basic Permissions.
155 |
156 | All rights granted under this License are granted for the term of
157 | copyright on the Program, and are irrevocable provided the stated
158 | conditions are met. This License explicitly affirms your unlimited
159 | permission to run the unmodified Program. The output from running a
160 | covered work is covered by this License only if the output, given its
161 | content, constitutes a covered work. This License acknowledges your
162 | rights of fair use or other equivalent, as provided by copyright law.
163 |
164 | You may make, run and propagate covered works that you do not
165 | convey, without conditions so long as your license otherwise remains
166 | in force. You may convey covered works to others for the sole purpose
167 | of having them make modifications exclusively for you, or provide you
168 | with facilities for running those works, provided that you comply with
169 | the terms of this License in conveying all material for which you do
170 | not control copyright. Those thus making or running the covered works
171 | for you must do so exclusively on your behalf, under your direction
172 | and control, on terms that prohibit them from making any copies of
173 | your copyrighted material outside their relationship with you.
174 |
175 | Conveying under any other circumstances is permitted solely under
176 | the conditions stated below. Sublicensing is not allowed; section 10
177 | makes it unnecessary.
178 |
179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180 |
181 | No covered work shall be deemed part of an effective technological
182 | measure under any applicable law fulfilling obligations under article
183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
184 | similar laws prohibiting or restricting circumvention of such
185 | measures.
186 |
187 | When you convey a covered work, you waive any legal power to forbid
188 | circumvention of technological measures to the extent such circumvention
189 | is effected by exercising rights under this License with respect to
190 | the covered work, and you disclaim any intention to limit operation or
191 | modification of the work as a means of enforcing, against the work's
192 | users, your or third parties' legal rights to forbid circumvention of
193 | technological measures.
194 |
195 | 4. Conveying Verbatim Copies.
196 |
197 | You may convey verbatim copies of the Program's source code as you
198 | receive it, in any medium, provided that you conspicuously and
199 | appropriately publish on each copy an appropriate copyright notice;
200 | keep intact all notices stating that this License and any
201 | non-permissive terms added in accord with section 7 apply to the code;
202 | keep intact all notices of the absence of any warranty; and give all
203 | recipients a copy of this License along with the Program.
204 |
205 | You may charge any price or no price for each copy that you convey,
206 | and you may offer support or warranty protection for a fee.
207 |
208 | 5. Conveying Modified Source Versions.
209 |
210 | You may convey a work based on the Program, or the modifications to
211 | produce it from the Program, in the form of source code under the
212 | terms of section 4, provided that you also meet all of these conditions:
213 |
214 | a) The work must carry prominent notices stating that you modified
215 | it, and giving a relevant date.
216 |
217 | b) The work must carry prominent notices stating that it is
218 | released under this License and any conditions added under section
219 | 7. This requirement modifies the requirement in section 4 to
220 | "keep intact all notices".
221 |
222 | c) You must license the entire work, as a whole, under this
223 | License to anyone who comes into possession of a copy. This
224 | License will therefore apply, along with any applicable section 7
225 | additional terms, to the whole of the work, and all its parts,
226 | regardless of how they are packaged. This License gives no
227 | permission to license the work in any other way, but it does not
228 | invalidate such permission if you have separately received it.
229 |
230 | d) If the work has interactive user interfaces, each must display
231 | Appropriate Legal Notices; however, if the Program has interactive
232 | interfaces that do not display Appropriate Legal Notices, your
233 | work need not make them do so.
234 |
235 | A compilation of a covered work with other separate and independent
236 | works, which are not by their nature extensions of the covered work,
237 | and which are not combined with it such as to form a larger program,
238 | in or on a volume of a storage or distribution medium, is called an
239 | "aggregate" if the compilation and its resulting copyright are not
240 | used to limit the access or legal rights of the compilation's users
241 | beyond what the individual works permit. Inclusion of a covered work
242 | in an aggregate does not cause this License to apply to the other
243 | parts of the aggregate.
244 |
245 | 6. Conveying Non-Source Forms.
246 |
247 | You may convey a covered work in object code form under the terms
248 | of sections 4 and 5, provided that you also convey the
249 | machine-readable Corresponding Source under the terms of this License,
250 | in one of these ways:
251 |
252 | a) Convey the object code in, or embodied in, a physical product
253 | (including a physical distribution medium), accompanied by the
254 | Corresponding Source fixed on a durable physical medium
255 | customarily used for software interchange.
256 |
257 | b) Convey the object code in, or embodied in, a physical product
258 | (including a physical distribution medium), accompanied by a
259 | written offer, valid for at least three years and valid for as
260 | long as you offer spare parts or customer support for that product
261 | model, to give anyone who possesses the object code either (1) a
262 | copy of the Corresponding Source for all the software in the
263 | product that is covered by this License, on a durable physical
264 | medium customarily used for software interchange, for a price no
265 | more than your reasonable cost of physically performing this
266 | conveying of source, or (2) access to copy the
267 | Corresponding Source from a network server at no charge.
268 |
269 | c) Convey individual copies of the object code with a copy of the
270 | written offer to provide the Corresponding Source. This
271 | alternative is allowed only occasionally and noncommercially, and
272 | only if you received the object code with such an offer, in accord
273 | with subsection 6b.
274 |
275 | d) Convey the object code by offering access from a designated
276 | place (gratis or for a charge), and offer equivalent access to the
277 | Corresponding Source in the same way through the same place at no
278 | further charge. You need not require recipients to copy the
279 | Corresponding Source along with the object code. If the place to
280 | copy the object code is a network server, the Corresponding Source
281 | may be on a different server (operated by you or a third party)
282 | that supports equivalent copying facilities, provided you maintain
283 | clear directions next to the object code saying where to find the
284 | Corresponding Source. Regardless of what server hosts the
285 | Corresponding Source, you remain obligated to ensure that it is
286 | available for as long as needed to satisfy these requirements.
287 |
288 | e) Convey the object code using peer-to-peer transmission, provided
289 | you inform other peers where the object code and Corresponding
290 | Source of the work are being offered to the general public at no
291 | charge under subsection 6d.
292 |
293 | A separable portion of the object code, whose source code is excluded
294 | from the Corresponding Source as a System Library, need not be
295 | included in conveying the object code work.
296 |
297 | A "User Product" is either (1) a "consumer product", which means any
298 | tangible personal property which is normally used for personal, family,
299 | or household purposes, or (2) anything designed or sold for incorporation
300 | into a dwelling. In determining whether a product is a consumer product,
301 | doubtful cases shall be resolved in favor of coverage. For a particular
302 | product received by a particular user, "normally used" refers to a
303 | typical or common use of that class of product, regardless of the status
304 | of the particular user or of the way in which the particular user
305 | actually uses, or expects or is expected to use, the product. A product
306 | is a consumer product regardless of whether the product has substantial
307 | commercial, industrial or non-consumer uses, unless such uses represent
308 | the only significant mode of use of the product.
309 |
310 | "Installation Information" for a User Product means any methods,
311 | procedures, authorization keys, or other information required to install
312 | and execute modified versions of a covered work in that User Product from
313 | a modified version of its Corresponding Source. The information must
314 | suffice to ensure that the continued functioning of the modified object
315 | code is in no case prevented or interfered with solely because
316 | modification has been made.
317 |
318 | If you convey an object code work under this section in, or with, or
319 | specifically for use in, a User Product, and the conveying occurs as
320 | part of a transaction in which the right of possession and use of the
321 | User Product is transferred to the recipient in perpetuity or for a
322 | fixed term (regardless of how the transaction is characterized), the
323 | Corresponding Source conveyed under this section must be accompanied
324 | by the Installation Information. But this requirement does not apply
325 | if neither you nor any third party retains the ability to install
326 | modified object code on the User Product (for example, the work has
327 | been installed in ROM).
328 |
329 | The requirement to provide Installation Information does not include a
330 | requirement to continue to provide support service, warranty, or updates
331 | for a work that has been modified or installed by the recipient, or for
332 | the User Product in which it has been modified or installed. Access to a
333 | network may be denied when the modification itself materially and
334 | adversely affects the operation of the network or violates the rules and
335 | protocols for communication across the network.
336 |
337 | Corresponding Source conveyed, and Installation Information provided,
338 | in accord with this section must be in a format that is publicly
339 | documented (and with an implementation available to the public in
340 | source code form), and must require no special password or key for
341 | unpacking, reading or copying.
342 |
343 | 7. Additional Terms.
344 |
345 | "Additional permissions" are terms that supplement the terms of this
346 | License by making exceptions from one or more of its conditions.
347 | Additional permissions that are applicable to the entire Program shall
348 | be treated as though they were included in this License, to the extent
349 | that they are valid under applicable law. If additional permissions
350 | apply only to part of the Program, that part may be used separately
351 | under those permissions, but the entire Program remains governed by
352 | this License without regard to the additional permissions.
353 |
354 | When you convey a copy of a covered work, you may at your option
355 | remove any additional permissions from that copy, or from any part of
356 | it. (Additional permissions may be written to require their own
357 | removal in certain cases when you modify the work.) You may place
358 | additional permissions on material, added by you to a covered work,
359 | for which you have or can give appropriate copyright permission.
360 |
361 | Notwithstanding any other provision of this License, for material you
362 | add to a covered work, you may (if authorized by the copyright holders of
363 | that material) supplement the terms of this License with terms:
364 |
365 | a) Disclaiming warranty or limiting liability differently from the
366 | terms of sections 15 and 16 of this License; or
367 |
368 | b) Requiring preservation of specified reasonable legal notices or
369 | author attributions in that material or in the Appropriate Legal
370 | Notices displayed by works containing it; or
371 |
372 | c) Prohibiting misrepresentation of the origin of that material, or
373 | requiring that modified versions of such material be marked in
374 | reasonable ways as different from the original version; or
375 |
376 | d) Limiting the use for publicity purposes of names of licensors or
377 | authors of the material; or
378 |
379 | e) Declining to grant rights under trademark law for use of some
380 | trade names, trademarks, or service marks; or
381 |
382 | f) Requiring indemnification of licensors and authors of that
383 | material by anyone who conveys the material (or modified versions of
384 | it) with contractual assumptions of liability to the recipient, for
385 | any liability that these contractual assumptions directly impose on
386 | those licensors and authors.
387 |
388 | All other non-permissive additional terms are considered "further
389 | restrictions" within the meaning of section 10. If the Program as you
390 | received it, or any part of it, contains a notice stating that it is
391 | governed by this License along with a term that is a further
392 | restriction, you may remove that term. If a license document contains
393 | a further restriction but permits relicensing or conveying under this
394 | License, you may add to a covered work material governed by the terms
395 | of that license document, provided that the further restriction does
396 | not survive such relicensing or conveying.
397 |
398 | If you add terms to a covered work in accord with this section, you
399 | must place, in the relevant source files, a statement of the
400 | additional terms that apply to those files, or a notice indicating
401 | where to find the applicable terms.
402 |
403 | Additional terms, permissive or non-permissive, may be stated in the
404 | form of a separately written license, or stated as exceptions;
405 | the above requirements apply either way.
406 |
407 | 8. Termination.
408 |
409 | You may not propagate or modify a covered work except as expressly
410 | provided under this License. Any attempt otherwise to propagate or
411 | modify it is void, and will automatically terminate your rights under
412 | this License (including any patent licenses granted under the third
413 | paragraph of section 11).
414 |
415 | However, if you cease all violation of this License, then your
416 | license from a particular copyright holder is reinstated (a)
417 | provisionally, unless and until the copyright holder explicitly and
418 | finally terminates your license, and (b) permanently, if the copyright
419 | holder fails to notify you of the violation by some reasonable means
420 | prior to 60 days after the cessation.
421 |
422 | Moreover, your license from a particular copyright holder is
423 | reinstated permanently if the copyright holder notifies you of the
424 | violation by some reasonable means, this is the first time you have
425 | received notice of violation of this License (for any work) from that
426 | copyright holder, and you cure the violation prior to 30 days after
427 | your receipt of the notice.
428 |
429 | Termination of your rights under this section does not terminate the
430 | licenses of parties who have received copies or rights from you under
431 | this License. If your rights have been terminated and not permanently
432 | reinstated, you do not qualify to receive new licenses for the same
433 | material under section 10.
434 |
435 | 9. Acceptance Not Required for Having Copies.
436 |
437 | You are not required to accept this License in order to receive or
438 | run a copy of the Program. Ancillary propagation of a covered work
439 | occurring solely as a consequence of using peer-to-peer transmission
440 | to receive a copy likewise does not require acceptance. However,
441 | nothing other than this License grants you permission to propagate or
442 | modify any covered work. These actions infringe copyright if you do
443 | not accept this License. Therefore, by modifying or propagating a
444 | covered work, you indicate your acceptance of this License to do so.
445 |
446 | 10. Automatic Licensing of Downstream Recipients.
447 |
448 | Each time you convey a covered work, the recipient automatically
449 | receives a license from the original licensors, to run, modify and
450 | propagate that work, subject to this License. You are not responsible
451 | for enforcing compliance by third parties with this License.
452 |
453 | An "entity transaction" is a transaction transferring control of an
454 | organization, or substantially all assets of one, or subdividing an
455 | organization, or merging organizations. If propagation of a covered
456 | work results from an entity transaction, each party to that
457 | transaction who receives a copy of the work also receives whatever
458 | licenses to the work the party's predecessor in interest had or could
459 | give under the previous paragraph, plus a right to possession of the
460 | Corresponding Source of the work from the predecessor in interest, if
461 | the predecessor has it or can get it with reasonable efforts.
462 |
463 | You may not impose any further restrictions on the exercise of the
464 | rights granted or affirmed under this License. For example, you may
465 | not impose a license fee, royalty, or other charge for exercise of
466 | rights granted under this License, and you may not initiate litigation
467 | (including a cross-claim or counterclaim in a lawsuit) alleging that
468 | any patent claim is infringed by making, using, selling, offering for
469 | sale, or importing the Program or any portion of it.
470 |
471 | 11. Patents.
472 |
473 | A "contributor" is a copyright holder who authorizes use under this
474 | License of the Program or a work on which the Program is based. The
475 | work thus licensed is called the contributor's "contributor version".
476 |
477 | A contributor's "essential patent claims" are all patent claims
478 | owned or controlled by the contributor, whether already acquired or
479 | hereafter acquired, that would be infringed by some manner, permitted
480 | by this License, of making, using, or selling its contributor version,
481 | but do not include claims that would be infringed only as a
482 | consequence of further modification of the contributor version. For
483 | purposes of this definition, "control" includes the right to grant
484 | patent sublicenses in a manner consistent with the requirements of
485 | this License.
486 |
487 | Each contributor grants you a non-exclusive, worldwide, royalty-free
488 | patent license under the contributor's essential patent claims, to
489 | make, use, sell, offer for sale, import and otherwise run, modify and
490 | propagate the contents of its contributor version.
491 |
492 | In the following three paragraphs, a "patent license" is any express
493 | agreement or commitment, however denominated, not to enforce a patent
494 | (such as an express permission to practice a patent or covenant not to
495 | sue for patent infringement). To "grant" such a patent license to a
496 | party means to make such an agreement or commitment not to enforce a
497 | patent against the party.
498 |
499 | If you convey a covered work, knowingly relying on a patent license,
500 | and the Corresponding Source of the work is not available for anyone
501 | to copy, free of charge and under the terms of this License, through a
502 | publicly available network server or other readily accessible means,
503 | then you must either (1) cause the Corresponding Source to be so
504 | available, or (2) arrange to deprive yourself of the benefit of the
505 | patent license for this particular work, or (3) arrange, in a manner
506 | consistent with the requirements of this License, to extend the patent
507 | license to downstream recipients. "Knowingly relying" means you have
508 | actual knowledge that, but for the patent license, your conveying the
509 | covered work in a country, or your recipient's use of the covered work
510 | in a country, would infringe one or more identifiable patents in that
511 | country that you have reason to believe are valid.
512 |
513 | If, pursuant to or in connection with a single transaction or
514 | arrangement, you convey, or propagate by procuring conveyance of, a
515 | covered work, and grant a patent license to some of the parties
516 | receiving the covered work authorizing them to use, propagate, modify
517 | or convey a specific copy of the covered work, then the patent license
518 | you grant is automatically extended to all recipients of the covered
519 | work and works based on it.
520 |
521 | A patent license is "discriminatory" if it does not include within
522 | the scope of its coverage, prohibits the exercise of, or is
523 | conditioned on the non-exercise of one or more of the rights that are
524 | specifically granted under this License. You may not convey a covered
525 | work if you are a party to an arrangement with a third party that is
526 | in the business of distributing software, under which you make payment
527 | to the third party based on the extent of your activity of conveying
528 | the work, and under which the third party grants, to any of the
529 | parties who would receive the covered work from you, a discriminatory
530 | patent license (a) in connection with copies of the covered work
531 | conveyed by you (or copies made from those copies), or (b) primarily
532 | for and in connection with specific products or compilations that
533 | contain the covered work, unless you entered into that arrangement,
534 | or that patent license was granted, prior to 28 March 2007.
535 |
536 | Nothing in this License shall be construed as excluding or limiting
537 | any implied license or other defenses to infringement that may
538 | otherwise be available to you under applicable patent law.
539 |
540 | 12. No Surrender of Others' Freedom.
541 |
542 | If conditions are imposed on you (whether by court order, agreement or
543 | otherwise) that contradict the conditions of this License, they do not
544 | excuse you from the conditions of this License. If you cannot convey a
545 | covered work so as to satisfy simultaneously your obligations under this
546 | License and any other pertinent obligations, then as a consequence you may
547 | not convey it at all. For example, if you agree to terms that obligate you
548 | to collect a royalty for further conveying from those to whom you convey
549 | the Program, the only way you could satisfy both those terms and this
550 | License would be to refrain entirely from conveying the Program.
551 |
552 | 13. Use with the GNU Affero General Public License.
553 |
554 | Notwithstanding any other provision of this License, you have
555 | permission to link or combine any covered work with a work licensed
556 | under version 3 of the GNU Affero General Public License into a single
557 | combined work, and to convey the resulting work. The terms of this
558 | License will continue to apply to the part which is the covered work,
559 | but the special requirements of the GNU Affero General Public License,
560 | section 13, concerning interaction through a network will apply to the
561 | combination as such.
562 |
563 | 14. Revised Versions of this License.
564 |
565 | The Free Software Foundation may publish revised and/or new versions of
566 | the GNU General Public License from time to time. Such new versions will
567 | be similar in spirit to the present version, but may differ in detail to
568 | address new problems or concerns.
569 |
570 | Each version is given a distinguishing version number. If the
571 | Program specifies that a certain numbered version of the GNU General
572 | Public License "or any later version" applies to it, you have the
573 | option of following the terms and conditions either of that numbered
574 | version or of any later version published by the Free Software
575 | Foundation. If the Program does not specify a version number of the
576 | GNU General Public License, you may choose any version ever published
577 | by the Free Software Foundation.
578 |
579 | If the Program specifies that a proxy can decide which future
580 | versions of the GNU General Public License can be used, that proxy's
581 | public statement of acceptance of a version permanently authorizes you
582 | to choose that version for the Program.
583 |
584 | Later license versions may give you additional or different
585 | permissions. However, no additional obligations are imposed on any
586 | author or copyright holder as a result of your choosing to follow a
587 | later version.
588 |
589 | 15. Disclaimer of Warranty.
590 |
591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599 |
600 | 16. Limitation of Liability.
601 |
602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610 | SUCH DAMAGES.
611 |
612 | 17. Interpretation of Sections 15 and 16.
613 |
614 | If the disclaimer of warranty and limitation of liability provided
615 | above cannot be given local legal effect according to their terms,
616 | reviewing courts shall apply local law that most closely approximates
617 | an absolute waiver of all civil liability in connection with the
618 | Program, unless a warranty or assumption of liability accompanies a
619 | copy of the Program in return for a fee.
620 |
621 | END OF TERMS AND CONDITIONS
622 |
623 | How to Apply These Terms to Your New Programs
624 |
625 | If you develop a new program, and you want it to be of the greatest
626 | possible use to the public, the best way to achieve this is to make it
627 | free software which everyone can redistribute and change under these terms.
628 |
629 | To do so, attach the following notices to the program. It is safest
630 | to attach them to the start of each source file to most effectively
631 | state the exclusion of warranty; and each file should have at least
632 | the "copyright" line and a pointer to where the full notice is found.
633 |
634 |
635 | Copyright (C)
636 |
637 | This program is free software: you can redistribute it and/or modify
638 | it under the terms of the GNU General Public License as published by
639 | the Free Software Foundation, either version 3 of the License, or
640 | (at your option) any later version.
641 |
642 | This program is distributed in the hope that it will be useful,
643 | but WITHOUT ANY WARRANTY; without even the implied warranty of
644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
645 | GNU General Public License for more details.
646 |
647 | You should have received a copy of the GNU General Public License
648 | along with this program. If not, see .
649 |
650 | Also add information on how to contact you by electronic and paper mail.
651 |
652 | If the program does terminal interaction, make it output a short
653 | notice like this when it starts in an interactive mode:
654 |
655 | Copyright (C)
656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657 | This is free software, and you are welcome to redistribute it
658 | under certain conditions; type `show c' for details.
659 |
660 | The hypothetical commands `show w' and `show c' should show the appropriate
661 | parts of the General Public License. Of course, your program's commands
662 | might be different; for a GUI interface, you would use an "about box".
663 |
664 | You should also get your employer (if you work as a programmer) or school,
665 | if any, to sign a "copyright disclaimer" for the program, if necessary.
666 | For more information on this, and how to apply and follow the GNU GPL, see
667 | .
668 |
669 | The GNU General Public License does not permit incorporating your program
670 | into proprietary programs. If your program is a subroutine library, you
671 | may consider it more useful to permit linking proprietary applications with
672 | the library. If this is what you want to do, use the GNU Lesser General
673 | Public License instead of this License. But first, please read
674 | .
675 |
--------------------------------------------------------------------------------
/README:
--------------------------------------------------------------------------------
1 | Data Structures in C
2 |
3 | Collection of data structures for the C programming lanugage.
4 |
5 | Most of these currently are a work in progress. Use with caution.
6 |
--------------------------------------------------------------------------------
/lib_hash.c:
--------------------------------------------------------------------------------
1 | #include
2 | #include
3 | #include
4 | #include
5 |
6 | #include "lib_hash.h"
7 |
8 | int is_prime(int num)
9 | {
10 | int i;
11 | assert(num >= 0);
12 | if(num == 1 || num == 0) return 0;
13 | for(i = 2 ; i <= num / 2; i++)
14 | if(num % i == 0) return 0;
15 | return 1;
16 | }
17 |
18 | int next_twinprime(int num)
19 | {
20 | assert(num >= 2);
21 | while(num < INT_MAX) {
22 | num++;
23 | if(is_prime(num) && is_prime(num-2))return num;
24 | }
25 | return -1;
26 | }
27 |
28 | Hash hash_new(int len)
29 | {
30 | Hash h;
31 | assert(len >= 2);
32 | h.size = len;
33 | h.data = malloc(sizeof(int)*len);
34 | return h;
35 | }
36 |
37 | Hash hash_new_prime(int len)
38 | {
39 | Hash h;
40 | assert(len >= 2);
41 | len = next_twinprime(len);
42 | h.size = len;
43 | h.data = malloc(sizeof(int)*len);
44 | return h;
45 | }
46 |
47 | int hash_data(void *data, int num, size_t size)
48 | {
49 | int slot = 0;
50 | while(num >= 0)
51 | {
52 | /* slot += (void *) (data) + (num * size); */
53 | slot += (int)data + size * num;
54 | num--;
55 | }
56 | return slot;
57 | }
58 |
59 | int hash_insert(Hash h, void * data, size_t length)
60 | {
61 | int slot;
62 | assert(data != NULL);
63 | /*slot = hash_data(data, length);
64 | if(h[slot]->data == NULL) *//* insert data in first node */;
65 |
66 | return 0;
67 | }
68 |
69 | void * hash_search(Hash h, void * data, size_t length)
70 | {
71 | return NULL;
72 | }
73 |
74 | int hash_remove(Hash h, void * data, size_t length)
75 | {
76 | assert(data != NULL);
77 | return 0;
78 | }
79 |
80 | int hash_empty(Hash h)
81 | {
82 | return 0;
83 | }
84 |
85 | int hash_full(Hash h)
86 | {
87 | return 0;
88 | }
89 |
90 | void hash_clear(Hash h)
91 | {
92 |
93 | }
94 |
95 | void hash_print(Hash h)
96 | {
97 |
98 | }
99 |
100 | void hash_delete(Hash h)
101 | {
102 | free(&h);
103 | }
104 |
--------------------------------------------------------------------------------
/lib_hash.h:
--------------------------------------------------------------------------------
1 | #ifndef LIB_HASH_H_
2 | #define LIB_HASH_H_
3 |
4 | #define EMPTY 0
5 |
6 | typedef struct hash {
7 | int * data;
8 | int size;
9 | } Hash;
10 |
11 | /*
12 | create new hash with len length
13 | returns null pointer when hash could not be created.
14 | */
15 | Hash hash_new(int len);
16 |
17 | /*
18 | same as hash_new accept:
19 | tests input length - determine if number is double prime.
20 | If not, finds next larger double prime for size of hash.
21 | */
22 | Hash hash_new_prime(int len);
23 |
24 | /* insert data into hash, must be sent with size of data */
25 | int hash_insert(Hash h, void * data, size_t length);
26 |
27 | /* search hash for data value, return address of data */
28 | void * hash_search(Hash h, void * data, size_t length);
29 |
30 | /* remove data from hash, must be sent with size of data removed */
31 | int hash_remove(Hash h, void * data, size_t length);
32 |
33 | /* test for empty hash - no data stored */
34 | int hash_empty(Hash h);
35 |
36 | /* test for hash that is completely full */
37 | int hash_full(Hash h);
38 |
39 | /* remove all data from hash */
40 | void hash_clear(Hash h);
41 |
42 | /* print hash contents to stdout - used for debugging */
43 | void hash_print(Hash h);
44 |
45 | /* delete hash and all its contents */
46 | void hash_delete(Hash h);
47 |
48 | /* find next double prime number - used for lenth of arrays */
49 | int is_prime(int num);
50 |
51 | /* find next prime number where number-2 is also prime */
52 | int next_twinprime(int num);
53 |
54 | #endif /* LIB_HASH_H_ */
55 |
--------------------------------------------------------------------------------
/lib_ll.c:
--------------------------------------------------------------------------------
1 | #include
2 | #include
3 | #include
4 | #include
5 | #include
6 | #include
7 |
8 | #include "lib_ll.h"
9 |
10 | List_Head *list_new(void)
11 | {
12 | List_Head *pHead = malloc(sizeof(List_Head));
13 | if (pHead == NULL) return NULL;
14 | pHead->count = 0;
15 | pHead->pNext = NULL;
16 | return pHead;
17 | }
18 |
19 | void list_delete(List_Head *pHead)
20 | {
21 | List_Node *pTemp;
22 | assert(pHead != NULL);
23 | if(pHead->count == 0) { return; }
24 | pTemp = pHead->pNext;
25 | while(pTemp->pNext != NULL)
26 | {
27 | pTemp = pTemp->pNext;
28 | free(pTemp);
29 | }
30 | pHead->count = 0;
31 | pHead->pNext = NULL;
32 | free(pHead);
33 | }
34 |
35 | int list_len(List_Head *pHead)
36 | {
37 | assert(pHead != NULL);
38 | if (pHead == NULL) return -1;
39 | return pHead->count;
40 | }
41 |
42 | int list_search(List_Head *pHead, List_Node *pNode)
43 | {
44 | List_Node *pTemp = NULL;
45 | assert(pHead != NULL);
46 | if(pHead->count == 0) return 0;
47 | pTemp = pHead->pNext;
48 | while(pTemp != NULL) {
49 | if(pTemp == pNode) return 1;
50 | pTemp = pTemp->pNext;
51 | }
52 | return 0;
53 | }
54 |
55 | List_Node *list_tail(List_Head *pHead)
56 | {
57 | List_Node *pTemp = pHead->pNext;
58 |
59 | if(pHead->pNext == NULL) return NULL;
60 | while(pTemp->pNext != NULL)
61 | pTemp = pTemp->pNext;
62 | return pTemp;
63 | }
64 |
65 | List_Node *list_ins_head(List_Head *pHead)
66 | {
67 | List_Node *pTemp = pHead->pNext;
68 |
69 | List_Node *pNode = malloc(sizeof(List_Node));
70 | if (pNode == NULL) return NULL;
71 | pNode->pData = NULL;
72 | pNode->pNext = NULL;
73 | if(pHead->pNext == NULL) /* adding to empty list */
74 | {
75 | pHead->pNext = pNode;
76 | } else {
77 | pNode->pNext = pTemp;
78 | pHead->pNext = pNode;
79 | }
80 | pHead->count++;
81 | return pNode;
82 | }
83 |
84 | List_Node *list_ins_head_data(List_Head *pHead, void *Data)
85 | {
86 | List_Node *temp = list_ins_head(pHead);
87 | temp->pData = Data;
88 | return temp;
89 | }
90 |
91 | List_Node *list_ins_tail(List_Head *pHead)
92 | {
93 | List_Node *pTemp = pHead->pNext;
94 | List_Node *pNode = malloc(sizeof(List_Node));
95 | if (pNode == NULL) return NULL;
96 | pNode->pData = NULL;
97 | if(pHead->pNext == NULL) /* empty list */
98 | {
99 | pHead->pNext = pNode;
100 | } else {
101 | pTemp = list_tail(pHead);
102 | pTemp->pNext = pNode;
103 | pNode->pNext = NULL;
104 | }
105 | pHead->count++;
106 | return pNode;
107 | }
108 |
109 | List_Node *list_ins_tail_data(List_Head *pHead, void *Data)
110 | {
111 | List_Node *temp = list_ins_tail(pHead);
112 | temp->pData = Data;
113 | return temp;
114 | }
115 |
116 | List_Node *list_ins_before(List_Head *pHead, List_Node *pNode)
117 | {
118 | List_Node *pTemp = pHead->pNext;
119 | List_Node *pPrev = NULL;
120 | List_Node *pNew = malloc(sizeof(List_Node));
121 | if (pNew == NULL) return NULL;
122 | pNew->pData = NULL;
123 | if(pTemp == NULL) /* empty list */
124 | {
125 | pHead->pNext = pNode;
126 | } else {
127 | while(pTemp != pNode && pTemp != NULL)
128 | {
129 | pPrev = pTemp;
130 | pTemp = pTemp->pNext;
131 | }
132 | if(pTemp == NULL) /* did not find matching node */
133 | {
134 | free(pNew);
135 | return NULL;
136 | }
137 | if(pPrev == NULL) pHead->pNext = pNew;
138 | else pPrev->pNext = pNew; /* put new node at end of previous */
139 | pNew->pNext = pTemp; /* push current node down */
140 | }
141 | pHead->count++;
142 | return pNew;
143 | }
144 |
145 | List_Node *list_ins_after(List_Head *pHead, List_Node *pNode)
146 | {
147 | List_Node *pTemp = pHead->pNext;
148 | List_Node *pNew = malloc(sizeof(List_Node));
149 | if (pNew == NULL) return NULL;
150 | pNew->pData = NULL;
151 | if(pTemp == NULL) /* empty list */
152 | {
153 | pHead->pNext = pNode;
154 | } else {
155 | while(pTemp != pNode && pTemp != NULL)
156 | {
157 | pTemp = pTemp->pNext;
158 | }
159 | if(pTemp == NULL) /* did not find matching node */
160 | {
161 | free(pNew);
162 | return NULL;
163 | }
164 | pTemp->pNext = pNew;
165 | pNew->pNext = NULL;
166 | }
167 | pHead->count++;
168 | return pNew;
169 | }
170 |
171 | int list_rm_node(List_Head *pHead, List_Node *pNode)
172 | {
173 | List_Node *pPrev = NULL;
174 |
175 | if(pHead == NULL || pNode == NULL)
176 | return -1; /* Not valid data */
177 |
178 | if(list_size(pHead) == 0)
179 | return -1; /* list was empty */
180 |
181 | pPrev = list_prev_node(pHead, pNode);
182 | if(pNode->pNext == NULL) /* removing from end of list */
183 | {
184 | if(pPrev == NULL) /* no node before this one */
185 | {
186 | pHead->pNext = NULL;
187 | } else { /* previous node exists */
188 | /*pHead->pNext = pHead->pNext->pNext;*/
189 | pPrev->pNext = NULL;
190 | }
191 | } else { /* removing from middle */
192 | if(pPrev == NULL)
193 | {
194 | pHead->pNext = pNode->pNext;
195 | } else {
196 | pPrev->pNext = pNode->pNext;
197 | }
198 | }
199 | free(pNode);
200 | pHead->count--;
201 | return 1;
202 | }
203 |
204 |
205 | int list_rm_before(List_Head *pHead, List_Node *pNode)
206 | {
207 | List_Node *pPrev = list_prev_node(pHead, pNode);
208 | if(pPrev == NULL)
209 | return -1;
210 | return list_rm_node(pHead, pPrev);
211 | }
212 |
213 | int list_copy(List_Head *pDest, List_Head *pSrc)
214 | {
215 | int i = 1; /* start with head node */
216 | List_Node *pTemp = NULL;
217 | assert(pDest != NULL && pSrc != NULL);
218 | if(pSrc->count == 0) { return 0; } /* nothing to copy */
219 | list_clear(pDest);
220 | while (i <= pSrc->count) {
221 | pTemp = list_get_num(pSrc, i);
222 | list_ins_tail_data(pDest, pTemp->pData);
223 | i++;
224 | }
225 | return 0;
226 | }
227 |
228 | void list_print(List_Head *pHead)
229 | {
230 | int i = 0;
231 | List_Node *temp = NULL;
232 | assert(pHead != NULL);
233 | printf("\n");
234 | if(pHead->count == 0)
235 | printf("Empty List\n");
236 | else {
237 | temp = pHead->pNext;
238 | do {
239 | printf("List Item: %d -> Data: %p\n", i, (void *)temp);
240 | temp = temp->pNext;
241 | i++;
242 | } while (temp != NULL);
243 | }
244 | }
245 |
246 | List_Node *list_get_num(List_Head *pHead, int count)
247 | {
248 | int i = 1;
249 | List_Node *pNode;
250 | assert(count > 0);
251 | assert(pHead != NULL);
252 | if(pHead->count == 0) { return NULL; } /* list is empty */
253 | if(count > pHead->count) { return NULL; } /* node does not exist */
254 | pNode = pHead->pNext;
255 | while(i < count) {
256 | pNode = pNode->pNext;
257 | i++;
258 | }
259 | return pNode;
260 | }
261 |
262 | int list_node_swap(List_Node *pPrev, List_Node *pCurr)
263 | {
264 | List_Node* pTemp = NULL;
265 | assert(pCurr != NULL && pPrev != NULL);
266 | pTemp = pCurr->pNext;
267 | pCurr->pNext = pPrev->pNext;
268 | pPrev->pNext = pTemp;
269 | return 0;
270 | }
271 |
272 | List_Head *list_reverse(List_Head *pHead)
273 | {
274 | List_Head *newList = list_new();
275 | assert(pHead != NULL);
276 | while(pHead->count > 0)
277 | {
278 | list_ins_head_data(newList, pHead->pNext->pData);
279 | list_rm_node(pHead, pHead->pNext);
280 | }
281 | list_delete(pHead);
282 | return newList;
283 | }
284 |
285 | void list_append(List_Head *pLo, List_Head *pHi)
286 | {
287 | List_Node *pTemp = NULL;
288 | assert(pLo != NULL && pHi != NULL);
289 | pTemp = list_tail(pLo);
290 | pTemp->pNext = pHi->pNext;
291 | pLo->count = pLo->count + pHi->count;
292 | }
293 |
294 | int list_data_array(List_Head *pHead, void *pArr[], int len)
295 | {
296 | int i = 0;
297 | List_Node *pTemp = NULL;
298 | assert(pHead != NULL);
299 | assert(pArr != NULL);
300 | assert(len > 0);
301 | for(i = 0; i < len; i++) /* reset array */
302 | pArr[i] = NULL;
303 | if(pHead->count == 0) return 1;
304 | pTemp = pHead->pNext;
305 | i = 0;
306 | while(pTemp != NULL) {
307 | pArr[i++] = pTemp->pData;
308 | pTemp = pTemp->pNext;
309 | }
310 | return 0;
311 | }
312 |
313 | int list_node_array(List_Head *pHead, void *pArr[], int len)
314 | {
315 | int i = 0;
316 | List_Node *pTemp = NULL;
317 | assert(pHead != NULL);
318 | assert(pArr != NULL);
319 | assert(len > 0);
320 | for(i = 0; i < len; i++) /* reset array */
321 | pArr[i] = NULL;
322 | if(pHead->count == 0) return 1;
323 | pTemp = pHead->pNext;
324 | i = 0;
325 | while(pTemp != NULL){
326 | pArr[i++] = pTemp;
327 | pTemp = pTemp->pNext;
328 | }
329 | return 0;
330 | }
331 |
332 | void list_clear(List_Head *pHead)
333 | {
334 | List_Node *pTemp = pHead->pNext;
335 | assert(pHead != NULL);
336 | if(pTemp != NULL)
337 | {
338 | while(pTemp->pNext != NULL)
339 | {
340 | pTemp = pTemp->pNext;
341 | free(pTemp);
342 | }
343 | }
344 | pHead->count = 0;
345 | pHead->pNext = NULL;
346 | }
347 |
348 | List_Node *list_prev_node(List_Head *pHead, List_Node *pNode)
349 | {
350 | List_Node *pPrev = NULL, *pTemp;
351 | if(pHead == NULL || pNode == NULL)
352 | return NULL;
353 | pTemp = pHead->pNext;
354 | do {
355 | pPrev = pTemp;
356 | pTemp = pTemp->pNext;
357 | if(pTemp == NULL) return NULL; /* reached end of list */
358 | } while(pTemp != pNode);
359 | return pPrev;
360 | }
361 |
--------------------------------------------------------------------------------
/lib_ll.h:
--------------------------------------------------------------------------------
1 | #ifndef LIB_LL_H_
2 | #define LIB_LL_H_
3 |
4 | typedef struct list_node {
5 | void *pData;
6 | struct list_node *pNext;
7 | } List_Node;
8 |
9 | typedef struct {
10 | struct list_node *pNext;
11 | int count;
12 | } List_Head;
13 |
14 | /* return address of next node in list */
15 | #define list_next(element) ((element)->pNext)
16 |
17 | /* return address of data in this node */
18 | #define list_data(element) ((element)->pData)
19 |
20 | /* test node to determine if it is the head of list */
21 | #define list_is_head(list, element) ((element) == (list)->pNext ? 1 : 0)
22 |
23 | /* test node to determine if it is the tail of list */
24 | #define list_is_tail(element) ((element)->pNext == NULL ? 1 : 0)
25 |
26 | /* remove next node in list */
27 | #define list_rm_next(list, element) list_rm_node(list, (element)->pNext)
28 |
29 | /* return pointer to the head node in the list */
30 | #define list_head(list) ((list)->pNext)
31 |
32 | /* return integer value of the size of the list */
33 | #define list_size(list) ((list)->count)
34 |
35 | /* create new empty list */
36 | List_Head *list_new(void);
37 |
38 | /* completely delete list and return all memory to heap */
39 | void list_delete(List_Head *);
40 |
41 | /* returns length of list.
42 | returns integer count of number of nodes in list.
43 | if pointer passed to function is null, returns -1 value.
44 | */
45 | int list_len(List_Head *);
46 |
47 | /* search through list for pointer to node*/
48 | int list_search(List_Head *pHead, List_Node *pNode);
49 |
50 | /* return address of end of list */
51 | List_Node *list_tail(List_Head *);
52 |
53 | /* push new node on head of list */
54 | List_Node *list_ins_head(List_Head *);
55 |
56 | /* push new node on head of list - with data */
57 | List_Node *list_ins_head_data(List_Head *pHead, void *Data);
58 |
59 | /* push new node on tail of list */
60 | List_Node *list_ins_tail(List_Head *);
61 |
62 | /* push new node on tail of list - with data */
63 | List_Node *list_ins_tail_data(List_Head *pHead, void *Data);
64 |
65 | /* insert node before this node in list */
66 | List_Node *list_ins_before(List_Head *, List_Node *);
67 |
68 | /* insert node after this node in list */
69 | List_Node *list_ins_after(List_Head *, List_Node *);
70 |
71 | /* node remove (by address) */
72 | int list_rm_node(List_Head *pHead, List_Node *);
73 |
74 | /* remove node before this address if it exists
75 | returns 1 if ok, -1 list empty or did not contain specified node
76 | */
77 | int list_rm_before(List_Head *pHead, List_Node *);
78 |
79 | /* make a deep copy of list */
80 | int list_copy(List_Head *pDest, List_Head *pSrc);
81 |
82 | /* print out contents of list to stdout */
83 | void list_print(List_Head *pHead);
84 |
85 | /* get address of node at num - first node is 1 */
86 | List_Node *list_get_num(List_Head *pHead, int count);
87 |
88 | /* reverse current nodes - modify pointer to next in each */
89 | int list_node_swap(List_Node *pPrev, List_Node *pCurr);
90 |
91 | /* reverse contents of list */
92 | List_Head *list_reverse(List_Head *pHead);
93 |
94 | /* append high list to last node of low list - does not modify pHi list */
95 | void list_append(List_Head *pLo, List_Head *pHi);
96 |
97 | /* return an array of pointers to data payload in list - does not modify list */
98 | int list_data_array(List_Head *pHead, void *pArr[], int len);
99 |
100 | /* return an array of pointers to nodes in list - does not modify list */
101 | int list_node_array(List_Head *pHead, void *pArr[], int len);
102 |
103 | /* remove all nodes in list and free memory for each node */
104 | void list_clear(List_Head *);
105 |
106 | /* return address of previous node in list
107 | returns NULL if no node found -- address of node otherwise
108 | */
109 | List_Node *list_prev_node(List_Head *pHead, List_Node *pNode);
110 |
111 | #endif /* LIB_LL_H_ */
112 |
--------------------------------------------------------------------------------
/lib_random.c:
--------------------------------------------------------------------------------
1 | #include
2 | #include
3 | #include
4 | #include
5 |
6 | #include "lib_random.h"
7 |
8 | int random_int(int min, int max)
9 | {
10 | assert(min > INT_MIN);
11 | assert(max < INT_MAX / 2);
12 | assert(max >= min);
13 | return rand() % max + min;
14 | }
15 |
16 | void random_seed()
17 | {
18 | srand(time(0));
19 | }
20 |
--------------------------------------------------------------------------------
/lib_random.h:
--------------------------------------------------------------------------------
1 | #ifndef LIB_RANDOM_H_
2 | #define LIB_RANDOM_H_
3 |
4 | /* generate random number from min to max */
5 | int random_int(int min, int max);
6 |
7 | /* use clock in system to create random seed for number generator */
8 | void random_seed();
9 |
10 | #endif /* LIB_RANDOM_H_ */
11 |
--------------------------------------------------------------------------------
/lib_sort.c:
--------------------------------------------------------------------------------
1 | #include
2 | #include
3 |
4 | #include "lib_sort.h"
5 | #include "lib_ll.h"
6 | #include "lib_vstack.h"
7 |
8 | void sort_selection(int list[], int lo, int hi)
9 | {
10 | int s, j;
11 | for(j = lo; j < hi; j++)
12 | {
13 | s = sort_get_smallest(list, j ,hi);
14 | sort_swap(list, j, s);
15 | }
16 | }
17 |
18 | void sort_insertion(int list[], int lo, int hi)
19 | {
20 | int j, k, key;
21 | for(j = lo+1; j <= hi; j++)
22 | {
23 | key = list[j];
24 | k = j -1;
25 | while(k >= lo && key < list[k])
26 | {
27 | list[k+1] = list[k];
28 | --k;
29 | }
30 | list[k+1] = key;
31 | }
32 | }
33 |
34 | void sort_heap(int num[], int n)
35 | {
36 | int k, item;
37 | for(k = n/2; k >= 1; k--) sort_shift_down(num[k], num, k, n);
38 | for(k = n; k > 1; k--)
39 | {
40 | item = num[k];
41 | num[k] = num[1];
42 | sort_shift_down(item, num, 1, k-1);
43 | }
44 | }
45 |
46 | void sort_quick(int a[], int lo, int hi)
47 | {
48 | if(lo < hi)
49 | {
50 | int dp = sort_partition(a, lo, hi);
51 | sort_quick(a, lo, dp-1);
52 | sort_quick(a, dp+1, hi);
53 | }
54 | }
55 |
56 | void swap(int list[], int i, int j) {
57 | int hold = list[i];
58 | list[i] = list[j];
59 | list[j] = hold;
60 | }
61 |
62 | int partition2(int a[], int lo, int hi)
63 | {
64 | int pivot = a[lo];
65 | --lo; ++hi;
66 | while(lo < hi) {
67 | do --hi; while(a[hi] > pivot);
68 | do ++lo; while(a[lo] < pivot);
69 | if(lo < hi) swap(a, lo, hi);
70 | }
71 | return hi;
72 | }
73 |
74 | void sort_quick_norecurse(int a[], int lo, int hi)
75 | {
76 | int stackItems = 1, maxStackItems = 1;
77 | int dp;
78 | Stack_Head *pHead = vstack_new();
79 | Stack_Node *pNode = NULL;
80 | Sort_Data *pData = NULL;
81 | pNode = vstack_push(pHead);
82 | pNode->pData = sort_data_new(lo, hi);
83 | while(pHead->count != 0)
84 | {
85 | --stackItems;
86 | pNode = vstack_peek(pHead);
87 | pData = pNode->pData;
88 | vstack_pop(pHead);
89 | if(pData->left < pData->right){
90 | dp = partition2(a, pData->left, pData->right);
91 | if(dp - pData->left + 1 < pData->right - dp) {
92 | vstack_push_data(pHead, sort_data_new(dp+1, pData->right)); /* update the push function to accept data */
93 | vstack_push_data(pHead, sort_data_new(pData->left, dp));
94 | } else {
95 | vstack_push_data(pHead, sort_data_new(pData->left, dp));
96 | vstack_push_data(pHead, sort_data_new(dp+1, pData->right));
97 | }
98 | stackItems += 2;
99 | }
100 | if(stackItems > maxStackItems)maxStackItems = stackItems;
101 | }
102 | }
103 |
104 | void sort_shift_down(int key, int num[], int root, int last)
105 | {
106 | int bigger = 2 * root;
107 | while(bigger <= last)
108 | {
109 | if(bigger < last)
110 | if(num[bigger+1] > num[bigger]) bigger++;
111 | if(key >= num[bigger]) break;
112 | num[root] = num[bigger];
113 | root = bigger;
114 | bigger = 2 * root;
115 | }
116 | num[root] = key;
117 | }
118 |
119 | int sort_partition(int a[], int lo, int hi)
120 | {
121 | int pivot = a[lo];
122 | int last_sm = lo, j;
123 | for(j = lo + 1; j <= hi; j++)
124 | {
125 | if(a[j] < pivot)
126 | {
127 | ++last_sm;
128 | sort_swap(a, last_sm, j);
129 | }
130 | }
131 | sort_swap(a, lo, last_sm);
132 | return last_sm;
133 | }
134 |
135 | int sort_get_smallest(int list[], int lo, int hi)
136 | {
137 | int j, small = lo;
138 | for(j = lo + 1; j <= hi; j++)
139 | if(list[j] < list[small]) small = j;
140 | return small;
141 | }
142 |
143 | void sort_swap(int list[], int i , int j)
144 | {
145 | int hold = list[i];
146 | list[i] = list[j];
147 | list[j] = hold;
148 | }
149 |
150 | Sort_Data *sort_data_new(int a, int b)
151 | {
152 | Sort_Data *pData = malloc(sizeof(Sort_Data));
153 | pData->left = a;
154 | pData->right = b;
155 | return pData;
156 | }
157 |
--------------------------------------------------------------------------------
/lib_sort.h:
--------------------------------------------------------------------------------
1 | #ifndef LIB_SORT_H_
2 | #define LIB_SORT_H_
3 |
4 | typedef struct {
5 | int left;
6 | int right;
7 | } Sort_Data;
8 |
9 | int sort_get_smallest(int[], int, int);
10 |
11 | void sort_swap(int[], int, int);
12 |
13 | void sort_selection(int[] , int, int);
14 |
15 | void sort_insertion(int[], int, int);
16 |
17 | void sort_heap(int[], int);
18 |
19 | void sort_quick(int[], int, int);
20 |
21 | void sort_quick_norecurse(int[], int, int);
22 |
23 | int sort_partition(int[], int, int);
24 |
25 | void sort_shift_down(int, int[], int, int);
26 |
27 | Sort_Data *sort_data_new(int, int);
28 |
29 | #endif /* LIB_SORT_H_ */
30 |
--------------------------------------------------------------------------------
/lib_term_color.c:
--------------------------------------------------------------------------------
1 | #include
2 |
3 | #define RESET 0
4 | #define BRIGHT 1
5 | #define DIM 2
6 | #define UNDERLINE 3
7 | #define BLINK 4
8 | #define REVERSE 7
9 | #define HIDDENT 8
10 |
11 | #define BLACK 0
12 | #define RED 1
13 | #define GREEN 2
14 | #define YELLOW 3
15 | #define BLUE 4
16 | #define MAGENTA 5
17 | #define CYAN 6
18 | #define WHITE 7
19 |
20 | void clear_screen()
21 | {
22 | system("clear");
23 | }
24 |
25 | void color(int attr, int fg, int bg)
26 | {
27 | printf("%c[%d;%d;%dm", 0x1B, attr, fg+30, bg+40);
28 | }
29 |
--------------------------------------------------------------------------------
/lib_test.c:
--------------------------------------------------------------------------------
1 | #include
2 | #include
3 | #include
4 | #include
5 | #include
6 | #include
7 | #include
8 |
9 | #include "lib_test.h"
10 | #include "lib_hash.h"
11 | #include "lib_ll.h"
12 | #include "lib_random.h"
13 | #include "lib_sort.h"
14 | #include "lib_vbtree.h"
15 | #include "lib_vqueue.h"
16 | #include "lib_vstack.h"
17 |
18 | #define PASSED 0
19 | #define FAILED 1
20 |
21 | #define SORT_TESTS 1000
22 |
23 | void exit_error(const char *err_msg)
24 | {
25 | fprintf(stderr, "ERROR: %s\n", err_msg);
26 | exit(EXIT_FAILURE);
27 | }
28 |
29 | void test_msg_start(char *msg)
30 | {
31 | int msg_length = strlen(msg);
32 | printf("%s", msg);
33 |
34 | /* 74 is 80 - length of "PASSED" */
35 | while(msg_length < 74)
36 | {
37 | putchar('.');
38 | msg_length++;
39 | }
40 | }
41 |
42 | void test_msg_end(int pass)
43 | {
44 | if(pass == PASSED)
45 | {
46 | printf("PASSED\n");
47 | } else {
48 | printf("FAILED\n\n");
49 | exit_error("UNIT TESTING FAILED.\n\n");
50 | }
51 | }
52 |
53 | /* unit tests begin here */
54 |
55 | int test_random()
56 | {
57 | int i, j, result = 0;
58 | test_msg_start("Test Random Number Generator - Integers 0 to 100");
59 | random_seed();
60 | j = 0;
61 | while(j < 100000) {
62 | i = random_int(0,100);
63 | if(i < 0 || i > 100) result++;
64 | j++;
65 | }
66 | test_msg_end(result);
67 |
68 | return result;
69 | }
70 |
71 | int test_linked_list()
72 | {
73 | int i,j, result = 0;
74 | List_Node *test_node1 = NULL;
75 | List_Node *test_node2 = NULL;
76 | List_Node *test_node3 = NULL;
77 | List_Node *pTrack[5];
78 | void* pArr[6];
79 |
80 | List_Head *test_list1 = list_new();
81 | List_Head *test_list2 = list_new();
82 |
83 | test_msg_start("Test Linked List Creation");
84 | if(test_list1 == NULL) result++;
85 | test_msg_end(result);
86 |
87 | test_msg_start("Test Linked List Empty Length - Using Variable");
88 | if(test_list1->count != 0) result++;
89 | test_msg_end(result);
90 |
91 | test_msg_start("Test Linked List Empty Length - Using Length Function");
92 | if(list_len(test_list1) != 0 ) result++;
93 | test_msg_end(result);
94 |
95 | test_msg_start("Test Linked List - Adding Node To Empty List");
96 | if(list_ins_tail(test_list1) == NULL) result++;
97 | test_msg_end(result);
98 |
99 | test_msg_start("Test Linked List - Adding Node To Non-Empty List");
100 | if(list_ins_tail(test_list1) == NULL) result++;
101 | test_msg_end(result);
102 |
103 | test_msg_start("Test Linked List - Clearing List With More Than One Node");
104 | list_clear(test_list1);
105 | if(test_list1->count != 0) result++;
106 | if(list_len(test_list1) != 0 ) result++;
107 | test_msg_end(result);
108 |
109 | test_msg_start("Test Linked List - Clearing List With No Nodes");
110 | list_clear(test_list1);
111 | if(test_list1->count != 0) result++;
112 | if(list_len(test_list1) != 0 ) result++;
113 | test_msg_end(result);
114 |
115 | test_msg_start("Test Linked List End - No Nodes");
116 | list_clear(test_list1);
117 | if(list_tail(test_list1) != NULL) result++;
118 | test_msg_end(result);
119 |
120 | test_msg_start("Test Linked List End - One Node Only");
121 | list_clear(test_list1);
122 | test_node1 = list_ins_tail(test_list1);
123 | if(test_node1 == NULL) result++;
124 | if(list_tail(test_list1) != test_node1) result++;
125 | test_msg_end(result);
126 |
127 | test_msg_start("Test Linked List End - More Than One Node");
128 | list_clear(test_list1);
129 | list_ins_tail(test_list1);
130 | test_node1 = list_ins_tail(test_list1);
131 | if(test_node1 == NULL) result++;
132 | if(list_tail(test_list1) != test_node1) result++;
133 | test_msg_end(result);
134 |
135 | test_msg_start("Test Linked List - Removing Node From List With More Than One Node");
136 | list_clear(test_list1);
137 | test_node1 = list_ins_tail(test_list1);
138 | test_node2 = list_ins_head(test_list1);
139 | list_rm_node(test_list1, test_node1);
140 | if(test_list1->pNext != test_node2) result++;
141 | test_msg_end(result);
142 |
143 | test_msg_start("Test Linked List - Removing Node From Empty List");
144 | list_clear(test_list1);
145 | test_node1 = (List_Node*)&test_list1; /* pointer points to known bad location */
146 | /* should not crash but return gracefully */
147 | if(list_rm_node(test_list1, test_node1) != -1) result++;
148 | test_msg_end(result);
149 |
150 | test_msg_start("Test Linked List - Inserting Node After");
151 | list_clear(test_list1);
152 | test_node1 = NULL;
153 | test_node2 = NULL;
154 | test_node1 = list_ins_tail(test_list1);
155 | test_node2 = list_ins_after(test_list1, test_node1);
156 |
157 | /* test beginning */
158 | if(test_list1->pNext != test_node1) result++;
159 | /*...and end nodes. */
160 | if(list_tail(test_list1) != test_node2) result++;
161 | /* end node next should be null */
162 | if(list_tail(test_list1)->pNext != NULL) result++;
163 | test_msg_end(result);
164 |
165 | test_msg_start("Test Linked List - Inserting Node Before");
166 | list_clear(test_list1);
167 | test_node1 = NULL;
168 | test_node2 = NULL;
169 | test_node1 = list_ins_head(test_list1);
170 | test_node2 = list_ins_before(test_list1, test_node1);
171 |
172 | /* test beginning */
173 | if(test_list1->pNext != test_node2) result++;
174 | /*...and end nodes. */
175 | if(list_tail(test_list1) != test_node1) result++;
176 | /* end node next should be null */
177 | if(list_tail(test_list1)->pNext != NULL) result++;
178 | test_msg_end(result);
179 |
180 | test_msg_start("Test Linked List - Test Lengths");
181 | list_clear(test_list1);
182 | if(list_len(test_list1) != 0) result++;
183 |
184 | /* adding nodes using each function */
185 | list_ins_head(test_list1);
186 | if(list_len(test_list1) != 1) result++;
187 |
188 | list_ins_tail(test_list1);
189 | if(list_len(test_list1) != 2) result++;
190 |
191 | list_ins_before(test_list1, list_tail(test_list1));
192 | if(list_len(test_list1) != 3) result++;
193 |
194 | list_ins_after(test_list1, list_tail(test_list1));
195 | if(list_len(test_list1) != 4) result++;
196 | test_msg_end(result);
197 |
198 | test_msg_start("Test Linked List - Previous Node Check");
199 | list_clear(test_list1);
200 | test_node1 = NULL;
201 | test_node2 = NULL;
202 | if(list_prev_node(test_list1, NULL) != NULL) result++;
203 | if(list_prev_node(NULL, test_list1->pNext) != NULL) result++;
204 | if(list_prev_node(NULL, test_node1 + 1000) != NULL) result++;
205 | test_node1 = list_ins_head(test_list1);
206 | if(list_prev_node(test_list1, test_list1->pNext) != NULL) result++;
207 | test_node2 = list_ins_head(test_list1);
208 | if(list_prev_node(test_list1, test_node1) != test_node2) result++;
209 | if(list_prev_node(test_list1, test_node2) != NULL) result++;
210 | test_msg_end(result);
211 |
212 | test_msg_start("Test Linked List - Removing Nodes By Address");
213 | /* removing nodes from various places */
214 | list_clear(test_list1);
215 | test_node1 = NULL;
216 | test_node2 = NULL;
217 |
218 | if(list_rm_node(NULL, test_list1->pNext)!= -1) result++;
219 | if(list_rm_node(test_list1, NULL) != -1) result++;
220 | test_node1 = list_ins_head(test_list1);
221 | test_node2 = list_ins_head(test_list1);
222 | list_rm_node(test_list1, test_list1->pNext);
223 | if(list_len(test_list1) != 1) result++;
224 | test_node1 = list_tail(test_list1);
225 | list_rm_node(test_list1, test_node1);
226 | if(list_len(test_list1) != 0) result++;
227 | if(list_rm_node(test_list1, list_tail(test_list1)) != -1) result++;
228 | test_msg_end(result);
229 |
230 | test_msg_start("Test Linked List - Removing Nodes After Address");
231 | list_clear(test_list1);
232 | test_node1 = NULL;
233 | test_node2 = NULL;
234 | test_node1 = list_ins_tail(test_list1);
235 | test_node2 = list_ins_tail(test_list1);
236 | if(list_rm_next(test_list1, test_node1) != 1) result++;
237 | test_msg_end(result);
238 |
239 | test_msg_start("Test Linked List - Removing Nodes Before Address");
240 | list_clear(test_list1);
241 | test_node1 = NULL;
242 | test_node2 = NULL;
243 | if(list_rm_before(test_list1, NULL) != -1) result++;
244 | if(list_rm_before(NULL, NULL) != -1) result++;
245 | if(list_rm_before(test_list1 + 1000, NULL) != -1) result++;
246 | test_node1 = list_ins_tail(test_list1);
247 | test_node2 = list_ins_tail(test_list1);
248 | if(list_rm_before(test_list1, test_node2 + 1000) != -1) result++;
249 | if(list_rm_before(test_list1, test_node2) != 1) result++;
250 | test_msg_end(result);
251 |
252 | test_msg_start("Test Linked List - Copying List");
253 | list_clear(test_list1);
254 | list_clear(test_list2);
255 | test_node1 = list_ins_tail(test_list1);
256 | test_node1->pData = &result;
257 | test_node2 = list_ins_tail(test_list1);
258 | if(list_copy(test_list2, test_list1) != 0) result++;
259 | if(test_list1->pNext == test_list2->pNext) result++;
260 | if(test_list1->count != 2) result++;
261 | if(test_list2->count != 2) result++;
262 | if(test_list1->pNext->pData != test_list2->pNext->pData) result++;
263 | test_msg_end(result);
264 |
265 | test_msg_start("Test Linked List - Copying Empty List");
266 | list_clear(test_list1);
267 | list_clear(test_list2);
268 | if(list_copy(test_list2, test_list1) != 0) result++;
269 | if(test_list1->pNext != NULL) result++;
270 | if(test_list2->pNext != NULL) result++;
271 | if(test_list1->count != 0) result++;
272 | if(test_list2->count != 0) result++;
273 | test_msg_end(result);
274 |
275 | test_msg_start("Test Linked List - Get Node Address By Node Number - First Node");
276 | list_clear(test_list1);
277 | test_node1 = list_ins_head(test_list1);
278 | test_node2 = list_ins_head(test_list1);
279 | test_node3 = list_get_num(test_list1, 1);
280 | if(test_node3 != test_node2) result++;
281 | test_msg_end(result);
282 |
283 | test_msg_start("Test Linked List - Get Node Address By Node Number - Middle Node");
284 | list_clear(test_list1);
285 | list_ins_tail(test_list1);
286 | list_ins_tail(test_list1);
287 | list_ins_tail(test_list1);
288 | list_ins_tail(test_list1);
289 | test_node2 = list_ins_tail(test_list1);
290 | list_ins_tail(test_list1);
291 | list_ins_tail(test_list1);
292 | list_ins_tail(test_list1);
293 | list_ins_tail(test_list1);
294 | test_node3 = list_get_num(test_list1, 5);
295 | if(test_node3 != test_node2) result++;
296 | test_msg_end(result);
297 |
298 | test_msg_start("Test Linked List - Get Node Address By Node Number - Last Node");
299 | list_clear(test_list1);
300 | test_node1 = list_ins_tail(test_list1);
301 | test_node2 = list_ins_tail(test_list1);
302 | test_node3 = list_get_num(test_list1, 2);
303 | if(test_node3 != test_node2) result++;
304 | test_msg_end(result);
305 |
306 | test_msg_start("Test Linked List - Get Node Address By Node Number - Empty List");
307 | list_clear(test_list1);
308 | test_node1 = list_get_num(test_list1, 1);
309 | if(test_node1 != NULL) result++;
310 | test_node1 = list_get_num(test_list1, 55);
311 | if(test_node1 != NULL) result++;
312 | test_msg_end(result);
313 |
314 | test_msg_start("Test Linked List - Swap Nodes In List");
315 | list_clear(test_list1);
316 | test_node1 = list_ins_tail(test_list1);
317 | test_node2 = list_ins_tail(test_list1);
318 | test_node3 = list_ins_tail(test_list1);
319 | pTrack[1] = test_node1->pNext;
320 | pTrack[2] = test_node2->pNext;
321 | if(list_node_swap(test_node1, test_node2) != 0) result++;
322 | if(test_node1->pNext != pTrack[2]) result++;
323 | if(test_node2->pNext != pTrack[1]) result++;
324 | test_msg_end(result);
325 |
326 | test_msg_start("Test Linked List - List Reverse - Pointer Tracking");
327 | list_clear(test_list1);
328 | for(i = 0; i < 5; i++) {
329 | pTrack[i] = list_ins_tail(test_list1);
330 | pTrack[i]->pData = &pTrack[i]->pData;
331 | }
332 | test_list1 = list_reverse(test_list1);
333 | for(i = 1, j = 4; i <= 4; i++, j--) {
334 | test_node1 = list_get_num(test_list1, i);
335 | if(test_node1->pData != pTrack[j]) result++;
336 | }
337 | test_msg_end(result);
338 |
339 | test_msg_start("Test Linked List - List Next Preprocessor");
340 | list_clear(test_list1);
341 | list_clear(test_list2);
342 | test_node1 = NULL;
343 | test_node2 = NULL;
344 | test_node1 = list_ins_head(test_list1);
345 | test_node2 = list_ins_head(test_list1);
346 | if(list_next(test_node1) == test_node2) result++;
347 | test_msg_end(result);
348 |
349 | test_msg_start("Test Linked List - Default Payload");
350 | list_clear(test_list1);
351 | test_node1 = NULL;
352 | test_node2 = NULL;
353 | test_node1 = list_ins_tail(test_list1);
354 | test_node2 = list_ins_tail(test_list1);
355 | if(test_node1->pData != NULL) result++;
356 |
357 | /* make data point to something and test again... */
358 | test_node1->pData = test_node1;
359 | if(list_data(test_node1) != test_node1) result++;
360 | test_msg_end(result);
361 |
362 | test_msg_start("Test Linked List - List Is Head Preprocessor");
363 | if(list_is_head(test_list1, test_node2) != 0) result++;
364 | if(list_is_head(test_list1, test_node1) != 1) result++;
365 | test_msg_end(result);
366 |
367 | test_msg_start("Test Linked List - List Is Tail Preprocessor");
368 | if(list_is_tail(test_node2) != 1) result++;
369 | if(list_is_tail(test_node1) != 0) result++;
370 | test_msg_end(result);
371 |
372 | test_msg_start("Test Linked List - List Head Preprocessor");
373 | if(list_head(test_list1) != test_node1) result++;
374 | test_msg_end(result);
375 |
376 | test_msg_start("Test Linked List - Append Lists - Pointer Tracking");
377 | list_clear(test_list1);
378 | list_clear(test_list2);
379 | list_ins_tail(test_list1);
380 | list_ins_tail(test_list1);
381 | list_ins_tail(test_list1);
382 | pTrack[0] = list_ins_tail(test_list1);
383 | pTrack[1] = list_ins_tail(test_list2);
384 | list_ins_tail(test_list2);
385 | list_ins_tail(test_list2);
386 | list_append(test_list1, test_list2);
387 | if(test_list1->count != 7) result++;
388 | if(!list_search(test_list1, pTrack[0])) result++;
389 | if(!list_search(test_list1, pTrack[1])) result++;
390 | if(pTrack[0] != list_get_num(test_list1, 4)) result++;
391 | if(pTrack[1] != list_get_num(test_list1, 5)) result++;
392 | test_msg_end(result);
393 |
394 | test_msg_start("Test Linked List - Create Data Array - Pointer Tracking");
395 | list_clear(test_list1);
396 | pTrack[0] = list_ins_tail(test_list1);
397 | pTrack[0] = pTrack[0]->pData = &test_list1;
398 | pTrack[1] = list_ins_tail(test_list1);
399 | pTrack[1] = pTrack[1]->pData = &test_list2;
400 | pTrack[2] = list_ins_tail(test_list1);
401 | pTrack[2] = pTrack[2]->pData = &pTrack;
402 | pTrack[3] = list_ins_tail(test_list1);
403 | pTrack[3] = pTrack[3]->pData = &test_node1;
404 | pTrack[4] = list_ins_tail(test_list1);
405 | pTrack[4] = pTrack[4]->pData = &test_node2;
406 | pArr[5] = &test_list1;
407 | if(list_data_array(test_list1, pArr, 6) != 0) result++;
408 | if(pArr[0] != pTrack[0]) result++;
409 | if(pArr[1] != pTrack[1]) result++;
410 | if(pArr[2] != pTrack[2]) result++;
411 | if(pArr[3] != pTrack[3]) result++;
412 | if(pArr[4] != pTrack[4]) result++;
413 | if(pArr[5] != NULL) result++;
414 | test_msg_end(result);
415 |
416 | test_msg_start("Test Linked List - Create Node Array - Pointer Tracking");
417 | list_clear(test_list1);
418 | pTrack[0] = list_ins_tail(test_list1);
419 | pTrack[1] = list_ins_tail(test_list1);
420 | pTrack[2] = list_ins_tail(test_list1);
421 | pTrack[3] = list_ins_tail(test_list1);
422 | pTrack[4] = list_ins_tail(test_list1);
423 | pArr[5] = &test_list1;
424 | if(list_node_array(test_list1, pArr, 6) != 0) result++;
425 | if(pArr[0] != pTrack[0]) result++;
426 | if(pArr[1] != pTrack[1]) result++;
427 | if(pArr[2] != pTrack[2]) result++;
428 | if(pArr[3] != pTrack[3]) result++;
429 | if(pArr[4] != pTrack[4]) result++;
430 | if(pArr[5] != NULL) result++;
431 | test_msg_end(result);
432 |
433 | test_msg_start("Test Linked List - Search List");
434 | list_clear(test_list1);
435 | if(list_search(test_list1, test_node1) != 0) result++;
436 | test_node1 = list_ins_head(test_list1);
437 | if(list_search(test_list1, test_node1) != 1) result++;
438 | if(list_search(test_list1, test_node2) != 0) result++;
439 | if(list_search(test_list1, test_node3) != 0) result++;
440 | if(list_search(test_list1, NULL) != 0) result++;
441 | if(list_search(test_list1, (List_Node *)test_list1) != 0) result++;
442 | test_node2 = list_ins_head(test_list1);
443 | if(list_search(test_list1, test_node1) != 1) result++;
444 | if(list_search(test_list1, test_node2) != 1) result++;
445 | if(list_search(test_list1, test_node3) != 0) result++;
446 | if(list_search(test_list1, NULL) != 0) result++;
447 | if(list_search(test_list1, (List_Node *)test_list1) != 0) result++;
448 | list_clear(test_list1);
449 | if(list_search(test_list1, test_node1) != 0) result++;
450 | if(list_search(test_list1, test_node2) != 0) result++;
451 | if(list_search(test_list1, test_node3) != 0) result++;
452 | if(list_search(test_list1, NULL) != 0) result++;
453 | if(list_search(test_list1, (List_Node *)test_list1) != 0) result++;
454 | test_msg_end(result);
455 |
456 | return result;
457 | }
458 |
459 | int test_vstack()
460 | {
461 | int result = 0;
462 | int i = 0;
463 | char data[] = "This is some test data\n";
464 | char *pCh;
465 | Stack_Head *test_stack = vstack_new();
466 | Stack_Node *temp_node1 = NULL, *temp_node2 = NULL;
467 |
468 | test_msg_start("Test Variable Stack - Creating New Stack");
469 | if(!test_stack) result++;
470 | test_msg_end(result);
471 |
472 | test_msg_start("Test Variable Stack - Pushing Data Into Stack");
473 | while(data[i] != '\0')
474 | {
475 | temp_node1 = vstack_push(test_stack);
476 | /* reserve memory for node payload - pointer to memory in pData */
477 | pCh = malloc(sizeof(char));
478 | *pCh = data[i];
479 | temp_node1->pData = pCh;
480 | i++;
481 | }
482 | test_msg_end(result);
483 |
484 | test_msg_start("Test Variable Stack - Popping Data Off Of Stack");
485 | while(i > 0)
486 | {
487 | i--;
488 | temp_node1 = vstack_peek(test_stack);
489 | /* verify data of this node */
490 | pCh = temp_node1->pData;
491 | if(*pCh != data[i]) result++;
492 | vstack_pop(test_stack);
493 | }
494 | test_msg_end(result);
495 |
496 | test_msg_start("Test Variable Stack - Popping Data Off Empty Stack");
497 | vstack_clear(test_stack);
498 | if(vstack_pop(test_stack) != -1) result++;
499 | test_msg_end(result);
500 |
501 | test_msg_start("Test Variable Stack - Tracking Stack Size");
502 | vstack_clear(test_stack);
503 | if(vstack_size(test_stack) != 0) result++;
504 | vstack_push(test_stack);
505 | if(vstack_size(test_stack) != 1) result++;
506 | temp_node1 = vstack_peek(test_stack);
507 | if(vstack_size(test_stack) != 1) result++;
508 | vstack_pop(test_stack);
509 | if(vstack_size(test_stack) != 0) result++;
510 | test_msg_end(result);
511 |
512 | test_msg_start("Test Variable Stack - Tracking Node Address With Peek and Push");
513 | vstack_clear(test_stack);
514 | temp_node1 = NULL;
515 | temp_node1 = vstack_push(test_stack);
516 | temp_node2 = vstack_push(test_stack);
517 | if(vstack_peek(test_stack) != temp_node2) result++;
518 | vstack_pop(test_stack);
519 | if(vstack_peek(test_stack) != temp_node1) result++;
520 | test_msg_end(result);
521 |
522 | return result;
523 | }
524 |
525 | int test_vqueue()
526 | {
527 | int result = 0;
528 | int i = 0;
529 | char data[] = "T\n";
530 | char *pCh;
531 | Queue_Head *test_q1 = vq_new();
532 | Queue_Head *test_q2 = vq_new();
533 |
534 | Queue_Node *test_node1 = NULL;
535 | Queue_Node *test_node2 = NULL;
536 | Queue_Node *test_node3 = NULL;
537 |
538 | Queue_Node *pTrack[5];
539 |
540 | test_msg_start("Test Queue - Creating New Queue");
541 | if(!test_q1) result++;
542 | test_msg_end(result);
543 |
544 | test_msg_start("Test Queue - Pushing Data Into Queue");
545 | while(data[i] != '\0')
546 | {
547 | test_node1 = vq_enq(test_q1);
548 | /* reserve memory for node payload - pointer to memory in pData */
549 | pCh = malloc(sizeof(char));
550 | *pCh = data[i];
551 | test_node1->pData = pCh;
552 | i++;
553 | }
554 | test_msg_end(result);
555 |
556 | test_msg_start("Test Queue - Popping Data Off Of Queue");
557 | i = 0;
558 | while(data[i] != '\n')
559 | {
560 | test_node1 = vq_peek(test_q1);
561 | /* verify data of this node */
562 | pCh = test_node1->pData;
563 | if(*pCh != data[i]) result++;
564 | vq_deq(test_q1);
565 | i++;
566 | }
567 | test_msg_end(result);
568 |
569 | test_msg_start("Test Queue - Popping Data Off Empty Queue");
570 | vq_clear(test_q1);
571 | if(vq_deq(test_q1) != -1) result++;
572 | test_msg_end(result);
573 |
574 | test_msg_start("Test Queue - Tracking Queue Size");
575 | vq_clear(test_q1);
576 | if(vq_size(test_q1) != 0) result++;
577 | vq_enq(test_q1);
578 | if(vq_size(test_q1) != 1) result++;
579 | test_node1 = vq_peek(test_q1);
580 | if(vq_size(test_q1) != 1) result++;
581 | vq_deq(test_q1);
582 | if(vq_size(test_q1) != 0) result++;
583 | test_msg_end(result);
584 |
585 | test_msg_start("Test Queue - Tracking Node Address With Enqueue and Dequeue");
586 | vq_clear(test_q1); test_node1 = NULL; test_node2 = NULL;
587 | test_node1 = vq_enq(test_q1);
588 | test_node2 = vq_enq(test_q1);
589 | if(vq_peek(test_q1) != test_node1) result++;
590 | vq_deq(test_q1);
591 | if(vq_peek(test_q1) != test_node2) result++;
592 | test_msg_end(result);
593 |
594 | test_msg_start("Test Queue - Copying Queue");
595 | vq_clear(test_q1);
596 | vq_clear(test_q2);
597 | test_node1 = vq_enq(test_q1);
598 | test_node1->pData = &result;
599 | test_node2 = vq_enq(test_q1);
600 | if(vq_copy(test_q2, test_q1) != 0) result++;
601 | if(test_q1->pNext == test_q2->pNext) result++;
602 | if(test_q1->count != 2) result++;
603 | if(test_q2->count != 2) result++;
604 | if(test_q1->pNext->pData != test_q2->pNext->pData) result++;
605 | test_msg_end(result);
606 |
607 | test_msg_start("Test Queue - Copying Empty Queue");
608 | vq_clear(test_q1);
609 | vq_clear(test_q2);
610 | if(vq_copy(test_q2, test_q1) != 0) result++;
611 | if(test_q1->pNext != NULL) result++;
612 | if(test_q2->pNext != NULL) result++;
613 | if(test_q1->count != 0) result++;
614 | if(test_q2->count != 0) result++;
615 | test_msg_end(result);
616 |
617 | test_msg_start("Test Queue - Get Node Address By Node Number - First Node");
618 | vq_clear(test_q1);
619 | test_node1 = vq_enq(test_q1);
620 | test_node2 = vq_enq(test_q1);
621 | test_node3 = vq_get_num(test_q1, 1);
622 | if(test_node3 != test_node2) result++;
623 | test_msg_end(result);
624 |
625 | test_msg_start("Test Queue - Get Node Address By Node Number - Middle Node");
626 | vq_clear(test_q1);
627 | vq_enq(test_q1);
628 | vq_enq(test_q1);
629 | vq_enq(test_q1);
630 | vq_enq(test_q1);
631 | test_node2 = vq_enq(test_q1);
632 | vq_enq(test_q1);
633 | vq_enq(test_q1);
634 | vq_enq(test_q1);
635 | vq_enq(test_q1);
636 | test_node3 = vq_get_num(test_q1, 5);
637 | if(test_node3 != test_node2) result++;
638 | test_msg_end(result);
639 |
640 | test_msg_start("Test Queue - Get Node Address By Node Number - Last Node");
641 | vq_clear(test_q2);
642 | test_node1 = list_ins_tail(test_q2);
643 | test_node2 = list_ins_tail(test_q2);
644 | test_node3 = list_get_num(test_q2, 2);
645 | if(test_node3 != test_node2) result++;
646 | test_msg_end(result);
647 |
648 | test_msg_start("Test Queue - Get Node Address By Node Number - Empty List");
649 | vq_clear(test_q2);
650 | test_node1 = vq_get_num(test_q2, 1);
651 | if(test_node1 != NULL) result++;
652 | test_node1 = vq_get_num(test_q2, 55);
653 | if(test_node1 != NULL) result++;
654 | test_msg_end(result);
655 |
656 | test_msg_start("Test Queue - Swap Nodes In List");
657 | vq_clear(test_q2);
658 | test_node1 = vq_enq(test_q2);
659 | test_node2 = vq_enq(test_q2);
660 | test_node3 = vq_enq(test_q2);
661 | pTrack[1] = test_node1->pNext;
662 | pTrack[2] = test_node2->pNext;
663 | if(vq_node_swap(test_node1, test_node2) != 0) result++;
664 | if(test_node1->pNext != pTrack[2]) result++;
665 | if(test_node2->pNext != pTrack[1]) result++;
666 | test_msg_end(result);
667 |
668 | return result;
669 | }
670 |
671 | /* test outcome of sort algorithm - all data should be sorted */
672 | int test_sort_data(int data[], int lo, int hi)
673 | {
674 | int i = lo, result = 0;
675 | while(i < hi)
676 | {
677 | if(!(data[i] <= data[i+1])) result++;
678 | i++;
679 | }
680 | return result;
681 | }
682 |
683 | /* test specific position of data */
684 | int test_sort_data_loc(int data[])
685 | {
686 | int i = 0, result = 0;
687 | while(i < 10) {
688 | if(data[i] != i) result++;
689 | i++;
690 | }
691 | return result;
692 | }
693 |
694 | /* set pre-selected data in array */
695 | void sort_set_array(int data[])
696 | {
697 | assert(data != NULL);
698 | data[0] = 4;
699 | data[1] = 5;
700 | data[2] = 7;
701 | data[3] = 9;
702 | data[4] = 8;
703 | data[5] = 1;
704 | data[6] = 6;
705 | data[7] = 0;
706 | data[8] = 3;
707 | data[9] = 2;
708 | }
709 |
710 | /* fill random length array with random data */
711 | void sort_rnd_data_fill(int *data, int length, int min, int max)
712 | {
713 | int i = 0;
714 | random_seed();
715 | while(i < length) {
716 | data[i]= random_int(min, max);
717 | i++;
718 | }
719 | }
720 |
721 | int test_sort()
722 | {
723 | int i, result = 0, length, min_data_val, max_data_val;
724 | int *temp_data;
725 | int data[10];
726 |
727 | test_msg_start("Test Selection Sort - Preset Array");
728 | sort_set_array(data);
729 | sort_selection(data, 0, 9);
730 | result += test_sort_data(data, 0, 9);
731 | result += test_sort_data_loc(data);
732 | test_msg_end(result);
733 |
734 | test_msg_start("Test Selection Sort - Random Data");
735 | for(i = 0; i < SORT_TESTS; i++) {
736 | random_seed();
737 | min_data_val = random_int(INT_MIN+1, (INT_MAX/2)-1);
738 | max_data_val = random_int(min_data_val, (INT_MAX/2)-1);
739 | length = random_int(500, 1000); /* get length of a new array */
740 | temp_data = malloc(sizeof(int) * length);
741 | sort_rnd_data_fill(temp_data, length, min_data_val, max_data_val);
742 | sort_selection(temp_data, 0, length);
743 | result += test_sort_data(temp_data, 0, length);
744 | free(temp_data);
745 | temp_data = NULL;
746 | }
747 | test_msg_end(result);
748 |
749 | test_msg_start("Test Insertion Sort - Preset Array");
750 | sort_set_array(data);
751 | sort_insertion(data, 0, 9);
752 | result += test_sort_data(data, 0, 9);
753 | result += test_sort_data_loc(data);
754 | test_msg_end(result);
755 |
756 | test_msg_start("Test Insertion Sort - Random Data");
757 | for(i = 0; i < SORT_TESTS; i++) {
758 | random_seed();
759 | min_data_val = random_int(INT_MIN+1, (INT_MAX/2)-1);
760 | max_data_val = random_int(min_data_val, (INT_MAX/2)-1);
761 | length = random_int(500, 1000); /* get length of a new array */
762 | temp_data = malloc(sizeof(int) * length);
763 | sort_rnd_data_fill(temp_data, length, min_data_val, max_data_val);
764 | sort_insertion(temp_data, 0, length);
765 | result += test_sort_data(temp_data, 0, length);
766 | free(temp_data);
767 | temp_data = NULL;
768 | }
769 | test_msg_end(result);
770 |
771 | test_msg_start("Test Quick Sort (Recursive) - Preset Array");
772 | sort_set_array(data);
773 | sort_quick(data, 0, 9);
774 | result += test_sort_data(data, 0, 9);
775 | result += test_sort_data_loc(data);
776 | test_msg_end(result);
777 |
778 | test_msg_start("Test Quick Sort (Recursive) - Random Data");
779 | for(i = 0; i < SORT_TESTS; i++) {
780 | random_seed();
781 | min_data_val = random_int(INT_MIN+1, (INT_MAX/2)-1);
782 | max_data_val = random_int(min_data_val, (INT_MAX/2)-1);
783 | length = random_int(500, 1000); /* get length of a new array */
784 | temp_data = malloc(sizeof(int) * length);
785 | sort_rnd_data_fill(temp_data, length, min_data_val, max_data_val);
786 | sort_quick(temp_data, 0, length);
787 | result += test_sort_data(temp_data, 0, length);
788 | free(temp_data);
789 | temp_data = NULL;
790 | }
791 | test_msg_end(result);
792 |
793 | test_msg_start("Test Quick Sort - Preset Array");
794 | sort_set_array(data);
795 | sort_quick_norecurse(data, 0, 9);
796 | result += test_sort_data(data, 0, 9);
797 | result += test_sort_data_loc(data);
798 | test_msg_end(result);
799 |
800 | test_msg_start("Test Quick Sort - Random Data");
801 | for(i = 0; i < SORT_TESTS; i++) {
802 | random_seed();
803 | min_data_val = random_int(INT_MIN+1, (INT_MAX/2)-1);
804 | max_data_val = random_int(min_data_val, (INT_MAX/2)-1);
805 | length = random_int(500, 1000); /* get length of a new array */
806 | temp_data = malloc(sizeof(int) * length);
807 | sort_rnd_data_fill(temp_data, length, min_data_val, max_data_val);
808 | sort_quick_norecurse(temp_data, 0, length);
809 | result += test_sort_data(temp_data, 0, length);
810 | free(temp_data);
811 | temp_data = NULL;
812 | }
813 | test_msg_end(result);
814 |
815 | return result;
816 | }
817 |
818 | int test_hash()
819 | {
820 | int result = 0;
821 | Hash h;
822 | test_msg_start("Test Hash - Prime Number Generator");
823 | if(is_prime(0)) result++;
824 | if(is_prime(1)) result++;
825 | if(!is_prime(2)) result++;
826 | if(!is_prime(3571)) result++;
827 | if(is_prime(3570)) result++;
828 | test_msg_end(result);
829 |
830 | test_msg_start("Test Hash - Twin Prime Number Generator");
831 | if(next_twinprime(6) != 7) result++;
832 | if(next_twinprime(72) != 73) result++;
833 | if(next_twinprime(1000) != 1021) result++;
834 | if(next_twinprime(79154) != 79231) result++;
835 | if(next_twinprime(INT_MAX) != -1) result++;
836 | test_msg_end(result);
837 |
838 | test_msg_start("Test Hash - Create New Hash");
839 | h = hash_new_prime(100);
840 | if(hash_empty(h) != 0) result++;
841 | if(h.size != 103) result++;
842 | if(h.data == NULL) result++;
843 | test_msg_end(result);
844 |
845 | test_msg_start("Test Hash - Insert and Verify Data");
846 | hash_insert(h, "hello", 6);
847 | if(hash_search(h, "hello", 6) == NULL) result++;
848 | if(hash_search(h, "goodbye", 7) != NULL) result++;
849 | if(hash_search(h, "", 0) != NULL) result++;
850 | test_msg_end(result);
851 |
852 | test_msg_start("Test Hash - Fill Hash and Clear Data");
853 |
854 | /* if(hash_full(h) != 0) result++; */
855 | test_msg_end(result);
856 |
857 | test_msg_start("Test Hash - Fill Hash and Remove Specific Data");
858 | test_msg_end(result);
859 |
860 | test_msg_start("Test Hash - Insert and Verify Data");
861 | test_msg_end(result);
862 |
863 | return result;
864 | }
865 |
866 | int test_all()
867 | {
868 | int result = 0;
869 | result += test_random();
870 | result += test_linked_list();
871 | result += test_vstack();
872 | result += test_vqueue();
873 | result += test_sort();
874 | /* result += test_hash(); HASH IS NOT COMPLETE */
875 | return result;
876 | }
877 |
878 | int main()
879 | {
880 | printf("\nRUNNING ALL UNIT TESTS ON DATA STRUCTURES.\n\n");
881 | if(test_all() == 0)
882 | {
883 | printf("\nUNIT TEST COMPLETE - ALL TESTS RETURNED PASSED.\n\n");
884 | } else {
885 | exit_error("UNIT TEST FAILED.\n\n");
886 | }
887 | exit(EXIT_SUCCESS);
888 | }
889 |
--------------------------------------------------------------------------------
/lib_test.h:
--------------------------------------------------------------------------------
1 | #ifndef LIB_TEST_H_
2 | #define LIB_TEST_H_
3 |
4 | /* Unit tests for the data structures. */
5 |
6 | /* convenient method to exit with message for user */
7 | void exit_error(const char*);
8 |
9 | /* Prints standardized message about the type of test */
10 | void test_msg_start(char*);
11 |
12 | /* Prints results of test message - exits if failed */
13 | void test_msg_end(int);
14 |
15 | int test_ll_new();
16 |
17 | int test_all();
18 |
19 | #endif /* LIB_TEST_H_ */
20 |
--------------------------------------------------------------------------------
/lib_vbtree.c:
--------------------------------------------------------------------------------
1 | #include
2 | #include
3 | #include
4 |
5 | #include "lib_vbtree.h"
6 |
7 | /*
8 | TreeNode *buildTree(FILE *in)
9 | {
10 | TreeNode *p = (TreeNode *)malloc(sizeof(TreeNode));
11 | char str[MAX_WORD_SIZE+1];
12 |
13 | fscanf(in, "%s", str);
14 | if(strcmp(str, "@")==0) return NULL;
15 | strcpy(p->data.word, str);
16 | p->left = buildTree(in);
17 | p->right = buildTree(in);
18 | return p;
19 | }
20 | */
21 |
22 | void vbtree_pre_order(TreeNode *node)
23 | {
24 | if(node != NULL)
25 | {
26 | vbtree_pre_order(node->left);
27 | vbtree_pre_order(node->right);
28 | }
29 | }
30 |
31 | void vbtree_in_order(TreeNode *node)
32 | {
33 | if(node != NULL)
34 | {
35 | vbtree_in_order(node->left);
36 | vbtree_in_order(node->right);
37 | }
38 | }
39 |
40 | void vbtree_post_order(TreeNode *node)
41 | {
42 | if(node != NULL) {
43 | vbtree_post_order(node->left);
44 | vbtree_post_order(node->right);
45 | }
46 | }
47 |
48 | TreeNode *newTreeNode(void *d)
49 | {
50 | TreeNode *p = (TreeNode *)malloc(sizeof(TreeNode));
51 | p->pData = d;
52 | p->left = p->right = NULL;
53 | return p;
54 | }
55 |
56 | /*
57 | TreeNode *vbtree_find_insert(BinaryTree bt, TreeNode d)
58 | {
59 | int cmp;
60 | TreeNode *curr = bt.root;
61 |
62 | if(bt.root == NULL) return newTreeNode(NULL);
63 | while((cmp = strcmp(d.word, curr->pData.word))!= 0)
64 | {
65 | if(cmp < 0)
66 | {
67 | if(curr->left == NULL) return curr->left = newTreeNode(d);
68 | curr = curr->left;
69 | } else {
70 | if(curr->right == NULL) return curr->right = newTreeNode(d);
71 | curr = curr->right;
72 | }
73 | }
74 | return curr;
75 | }
76 | */
77 | int vbtree_node_count(TreeNode *root)
78 | {
79 | if(root == NULL) return 0;
80 | return 1 + vbtree_node_count(root->left) + vbtree_node_count(root->right);
81 | }
82 |
83 | int vbtree_leave_count(TreeNode *root)
84 | {
85 | if(root == NULL) return 0;
86 | if(root->left == NULL && root->right == NULL) return 1;
87 | return vbtree_leave_count(root->left) + vbtree_leave_count(root->right);
88 | }
89 |
90 | int vbtree_height(TreeNode *root)
91 | {
92 | int left = 0, right = 0;
93 | if(root == NULL) return 0;
94 | left = vbtree_height(root->left);
95 | right = vbtree_height(root->right);
96 |
97 | if(left > right) return 1 + left;
98 | else return 1 + right;
99 | }
100 |
101 | /*
102 | * FUNCTION NOT COMPLETED
103 | void deleteNode(TreeNode T)
104 | {
105 | if(T == NULL) return NULL;
106 | if(right(T) ++ NULL) return left(T)
107 | */
108 |
109 | int vbtree_node_level(int n)
110 | {
111 | int level = 0;
112 | while(n % 2 == 0)
113 | {
114 | level++;
115 | n /= 2;
116 | }
117 | return level;
118 | }
119 |
120 | void vbtree_insert_best(TreeNode *lastNode[])
121 | {
122 | static int numNodes = 0;
123 | int level = vbtree_node_level(numNodes);
124 | TreeNode *p = newTreeNode(NULL);
125 |
126 | numNodes++;
127 | if(level > 0) p->left = lastNode[level-1];
128 | if(lastNode[level+1] != NULL)
129 | if(lastNode[level+1]->right == NULL)
130 | lastNode[level+1]->right = p;
131 | lastNode[level] = p;
132 | }
133 |
134 | TreeNode *vbtree_finalize_best(TreeNode *lastNode[])
135 | {
136 | int m, n = MAX_HEIGHT - 1;
137 | TreeNode *root = lastNode[n];
138 | while(n > 0 && lastNode[n] == NULL) n--;
139 | while(n > 0)
140 | {
141 | if(lastNode[n]->right != NULL) n--;
142 | else {
143 | TreeNode *tn = lastNode[n]->left;
144 | m = n - 1;
145 | while(m >= 0 && tn == lastNode[m])
146 | {
147 | tn = tn->right;
148 | m--;
149 | }
150 | if(m >= 0) lastNode[n]->right = lastNode[m];
151 | n = m;
152 | }
153 | }
154 | return root;
155 | }
156 |
--------------------------------------------------------------------------------
/lib_vbtree.h:
--------------------------------------------------------------------------------
1 | #ifndef LIB_VBTREE_H_
2 | #define LIB_VBTREE_H_
3 |
4 | #define MAX_HEIGHT 20
5 |
6 | typedef struct TreeNode {
7 | void *pData;
8 | struct TreeNode *left;
9 | struct TreeNode *right;
10 | } TreeNode;
11 |
12 | typedef struct {
13 | TreeNode *root;
14 | } BinaryTree;
15 |
16 |
17 | TreeNode newNode(int n);
18 |
19 |
20 | TreeNode *newTreeNode(void *d);
21 |
22 |
23 | TreeNode *buildTree(FILE * in);
24 |
25 |
26 | void vbtree_pre_order(TreeNode *node);
27 |
28 |
29 | void vbtree_in_order(TreeNode *node);
30 |
31 |
32 | void vbtree_post_order(TreeNode *node);
33 |
34 |
35 | TreeNode *vbtree_find_insert(BinaryTree bt, TreeNode d);
36 |
37 |
38 | int vbtree_node_count(TreeNode *root);
39 |
40 |
41 | int vbtree_leave_count(TreeNode *root);
42 |
43 |
44 | int vbtree_height(TreeNode *root);
45 |
46 |
47 | int vbtree_node_level(int n);
48 |
49 |
50 | void vbtree_insert_best(TreeNode *lastNode[]);
51 |
52 |
53 | TreeNode *vbtree_finalize_best(TreeNode *lastNode[]);
54 |
55 | #endif /* LIB_VBTREE_H_ */
56 |
--------------------------------------------------------------------------------
/lib_vqueue.h:
--------------------------------------------------------------------------------
1 | #ifndef LIB_VQUEUE_H_
2 | #define LIB_VQUEUE_H_
3 |
4 | #define Queue_Head List_Head
5 | #define Queue_Node List_Node
6 |
7 | /* create a new queue */
8 | #define vq_new() list_new()
9 |
10 | /* add node to queue */
11 | #define vq_enq(pHead) list_ins_head(pHead)
12 |
13 | /* push node onto stack - with data */
14 | #define vq_enq_data(pHead, pData) list_ins_head_data(pHead, pData)
15 |
16 | /* remove node from queue */
17 | #define vq_deq(pHead) list_rm_node(pHead, list_tail(pHead))
18 |
19 | /* view next node in line */
20 | #define vq_peek(pHead) list_tail(pHead)
21 |
22 | /* number of elements in queue */
23 | #define vq_size(pHead) pHead->count
24 |
25 | /* empty contents of queue */
26 | #define vq_clear(pHead) list_clear(pHead)
27 |
28 | /* delete and free contents of this queue */
29 | #define vq_delete(pHead) list_delete(pHead)
30 |
31 | /* make a deep copy of queue */
32 | #define vq_copy(pDest, pSrc) list_copy(pDest, pSrc)
33 |
34 | /* print out contents of queue to stdout */
35 | #define vq_print(pHead) list_print(pHead)
36 |
37 | /* reverse contents of list */
38 | #define vq_reverse(pHead) list_reverse(pHead)
39 |
40 | /* get address of node at num - first node is 1 */
41 | #define vq_get_num(pHead, count) list_get_num(pHead, count)
42 |
43 | /* append high list to last node of low list - does not modify pHi list */
44 | #define vq_append(pLo, pHi) list_append(pLo, pHi)
45 |
46 | /* reverse current nodes - modify pointer to next in each */
47 | #define vq_node_swap(pPrev, pCurr) list_node_swap(pPrev, pCurr)
48 |
49 | /* return an array of pointers to data payload in list - does not modify list */
50 | #define vq_data_array(pHead, pArr, len) list_data_array(pHead, pArr, len)
51 |
52 | /* return an array of pointers to nodes in list - does not modify list */
53 | #define vq_node_array(pHead, pArr, len) list_node_array(pHead, pArr, len)
54 |
55 | #endif /* LIB_VQUEUE_H_ */
56 |
--------------------------------------------------------------------------------
/lib_vstack.h:
--------------------------------------------------------------------------------
1 | #ifndef LIB_VSTACK_H_
2 | #define LIB_VSTACK_H_
3 |
4 | #define Stack_Head List_Head
5 | #define Stack_Node List_Node
6 |
7 | /* create a new stack */
8 | #define vstack_new() list_new()
9 |
10 | /* push node onto stack */
11 | #define vstack_push(pHead) list_ins_head(pHead)
12 |
13 | /* push node onto stack - with data */
14 | #define vstack_push_data(pHead, pData) list_ins_head_data(pHead, pData)
15 |
16 | /* remove node from stack */
17 | #define vstack_pop(pHead) list_rm_node(pHead, pHead->pNext)
18 |
19 | /* view next node in stack */
20 | #define vstack_peek(pHead) pHead->pNext
21 |
22 | /* number of elements in stack */
23 | #define vstack_size(pHead) pHead->count
24 |
25 | /* empty contents of stack */
26 | #define vstack_clear(pHead) list_clear(pHead)
27 |
28 | /* delete and free contents of this queue */
29 | #define vstack_delete(pHead) list_delete(pHead)
30 |
31 | /* make a deep copy of list */
32 | #define vstack_copy(pHead) list_copy(pDest, pSrc)
33 |
34 | /* print out contents of list to stdout */
35 | #define vstack_print(pHead) list_print(pHead)
36 |
37 | /* reverse contents of list */
38 | #define vstack_reverse(pHead) list_reverse(pHead)
39 |
40 | /* append high list to last node of low list - does not modify pHi list */
41 | #define vstack_append(pLo, pHi) list_append(pLo, pHi)
42 |
43 | /* return an array of pointers to data payload in list - does not modify list */
44 | #define vstack_data_array(pHead, pArr, len) list_data_array(pHead, pArr, len)
45 |
46 | /* return an array of pointers to nodes in list - does not modify list */
47 | #define vstack_node_array(pHead, pArr, len) list_node_array(pHead, pArr, len)
48 |
49 | #endif /* LIB_VSTACK_H_ */
50 |
--------------------------------------------------------------------------------