Moved all collections from ext to cmc

ext no longer exists
This commit is contained in:
Leonardo committed 2019-10-22 23:51:39 -03:00
1 parent de744f5822
commit 616327f054
14 files changed
+31 -31

No files matched your search

+3 -4
View File
@@ -34,7 +34,6 @@
* __src__ - All headers part of the C Macro Collections Library
* __cmc__ - The main C Macro Collections Library
* __dev__ - The main C Macro Collections Library for development (containing logging)
* __ext__ - Extra collections
* __sac__ - Statically Allocated Collections
* __utl__ - Utility like ForEach macros, logging, etc
* __macro\_collections.h__ - Master header containing all collections and utilities
@@ -75,8 +74,8 @@
In the long term, these are the steps left for the completion of this library:
* Complete the implementation of all the functions in the scope of the TODO file for the main collections (all those included in `cmc` and `ext`);
* Reorganize and complete all tests for `cmc` and `ext`;
* Complete the implementation of all the functions in the scope of the TODO file for the main collections;
* Reorganize and complete all tests for the `cmc` collections;
* Make an exact copy of all collections to `dev` with many logging utility, for them to be used under development;
* Port all of these collections to be statically allocated and be part of the `sac` library;
* Complete all tests for `sac`.
@@ -176,7 +175,7 @@ Check out some code reviews that covers some parts the project:
| About | Link |
|-------|--------|
| Unit Test *./utl/test.h* | [![Code Review](http://www.zomis.net/codereview/shield/?qid=222954)](http://codereview.stackexchange.com/q/222954/178948) |
| Interval Heap *./ext/intervalheap.h* | [![Code Review](http://www.zomis.net/codereview/shield/?qid=223595)](http://codereview.stackexchange.com/q/223595/178948) |
| Interval Heap *./cmc/intervalheap.h* | [![Code Review](http://www.zomis.net/codereview/shield/?qid=223595)](http://codereview.stackexchange.com/q/223595/178948) |
| Hash Set *./cmc/hashset.h* | [![Code Review](http://www.zomis.net/codereview/shield/?qid=217333)](http://codereview.stackexchange.com/q/217333/178948) |
| Linked List *./cmc/linkedlist.h* | [![Code Review](http://www.zomis.net/codereview/shield/?qid=216737)](http://codereview.stackexchange.com/q/216737/178948) |
| Others | [![Code Review](http://www.zomis.net/codereview/shield/?qid=213553)](http://codereview.stackexchange.com/q/213553/178948) |
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
@@ -17,7 +17,8 @@
* as you like and when its capacity is full, the buffer is reallocated. The
* elements are only sorted when a certain action requires that the array is
* sorted like accessing min() or max(). This prevents the array from being
* sorted after every insertion or removal of elements.
* sorted after every insertion or removal. The array is sorted using a
* variation of quick sort that uses insertion sort for small partitions.
*/
#ifndef CMC_SORTEDLIST_H
+20 -19
View File
@@ -27,28 +27,29 @@
#define CMC_COLLECTION_GENERATE_SOURCE(C, PFX, SNAME, K, V) \
CMC_CONCATC(C)(PFX, SNAME, K, V)
#include "cmc/deque.h"
#include "cmc/hashmap.h"
#include "cmc/hashset.h"
#include "cmc/heap.h"
#include "cmc/linkedlist.h"
#include "cmc/list.h"
#include "cmc/queue.h"
#include "cmc/stack.h"
#include "cmc/treemap.h"
#include "cmc/treeset.h"
#include "ext/intervalheap.h"
#include "ext/multimap.h"
#include "ext/multiset.h"
#include "cmc/bidimap.h" /* Added in 26/09/2019 */
#include "cmc/deque.h" /* Added in 20/03/2019 */
#include "cmc/hashmap.h" /* Added in 03/04/2019 */
#include "cmc/hashset.h" /* Added in 01/04/2019 */
#include "cmc/heap.h" /* Added in 25/03/2019 */
#include "cmc/intervalheap.h" /* Added in 06/07/2019 */
#include "cmc/linkedlist.h" /* Added in 22/03/2019 */
#include "cmc/list.h" /* Added in 12/02/2019 */
#include "cmc/multimap.h" /* Added in 26/04/2019 */
#include "cmc/multiset.h" /* Added in 10/04/2019 */
#include "cmc/queue.h" /* Added in 15/02/2019 */
#include "cmc/sortedlist.h" /* Added in 17/09/2019 */
#include "cmc/stack.h" /* Added in 14/02/2019 */
#include "cmc/treemap.h" /* Added in 28/03/2019 */
#include "cmc/treeset.h" /* Added in 27/03/2019 */
#include "sac/queue.h"
#include "sac/stack.h"
#include "utl/assert.h"
#include "utl/foreach.h"
#include "utl/log.h"
#include "utl/test.h"
#include "utl/timer.h"
#include "utl/assert.h" /* Added in 27/06/2019 */
#include "utl/foreach.h" /* Added in 25/02/2019 */
#include "utl/log.h" /* Added in 21/06/2109 */
#include "utl/test.h" /* Added in 26/06/2019 */
#include "utl/timer.h" /* Added in 12/04/2019 */
#endif /* CMC_MACRO_COLLECTIONS_H */
+1 -1
View File
@@ -1,5 +1,5 @@
/**
* for_each.h
* foreach.h
*
* Creation Date: 25/02/2019
*
-1
View File
@@ -91,7 +91,6 @@ enum cmc_log_type
CMC_LOG_WARN = 4,
CMC_LOG_ERROR = 5,
CMC_LOG_FATAL = 6
};
#define cmc_log_trace(fmt, ...) cmc_log(CMC_LOG_TRACE, __FILE__, __func__, __LINE__, fmt, __VA_ARGS__)
+1 -1
View File
@@ -3,7 +3,7 @@
#include <utl/log.h>
#include <utl/test.h>
#include <ext/bidimap.h>
#include <cmc/bidimap.h>
CMC_GENERATE_BIDIMAP(bm, bidimap, size_t, size_t)
+1 -1
View File
@@ -3,7 +3,7 @@
#include <utl/log.h>
#include <utl/test.h>
#include <ext/intervalheap.h>
#include <cmc/intervalheap.h>
CMC_GENERATE_INTERVALHEAP(ih, intervalheap, size_t)
+1 -1
View File
@@ -3,7 +3,7 @@
#include <utl/log.h>
#include <utl/test.h>
#include <ext/multimap.h>
#include <cmc/multimap.h>
CMC_GENERATE_MULTIMAP(mm, multimap, size_t, size_t)
+1 -1
View File
@@ -3,7 +3,7 @@
#include <utl/log.h>
#include <utl/test.h>
#include <ext/multiset.h>
#include <cmc/multiset.h>
CMC_GENERATE_MULTISET(ms, multiset, size_t)
+1 -1
View File
@@ -3,7 +3,7 @@
#include <utl/log.h>
#include <utl/test.h>
#include <ext/sortedlist.h>
#include <cmc/sortedlist.h>
CMC_GENERATE_SORTEDLIST(sl, sortedlist, size_t)