X-Git-Url: http://nitlanguage.org diff --git a/c_src/sorter._sep.h b/c_src/sorter._sep.h index 0249627..8495014 100644 --- a/c_src/sorter._sep.h +++ b/c_src/sorter._sep.h @@ -1,37 +1,51 @@ -#ifndef sorter__sep -#define sorter__sep +/* This C header file is generated by NIT to compile modules and programs that requires sorter. */ +#ifndef sorter_sep +#define sorter_sep #include "array._sep.h" #include extern const classtable_elt_t VFT_AbstractSorter[]; extern const classtable_elt_t VFT_ComparableSorter[]; +extern const char *LOCATE_sorter; extern const int SFT_sorter[]; -#define ID_AbstractSorter SFT_sorter[0] -#define COLOR_AbstractSorter SFT_sorter[1] -#define INIT_TABLE_POS_AbstractSorter SFT_sorter[2] -#define COLOR_sorter___AbstractSorter___compare SFT_sorter[3] -#define COLOR_sorter___AbstractSorter___sort SFT_sorter[4] -#define COLOR_sorter___AbstractSorter___sub_sort SFT_sorter[5] -#define COLOR_sorter___AbstractSorter___quick_sort SFT_sorter[6] -#define COLOR_sorter___AbstractSorter___bubble_sort SFT_sorter[7] -#define ID_ComparableSorter SFT_sorter[8] -#define COLOR_ComparableSorter SFT_sorter[9] -#define INIT_TABLE_POS_ComparableSorter SFT_sorter[10] -#define COLOR_sorter___ComparableSorter___init SFT_sorter[11] -typedef val_t (* sorter___AbstractSorter___compare_t)(val_t self, val_t param0, val_t param1); -val_t sorter___AbstractSorter___compare(val_t self, val_t param0, val_t param1); -typedef void (* sorter___AbstractSorter___sort_t)(val_t self, val_t param0); -void sorter___AbstractSorter___sort(val_t self, val_t param0); -typedef void (* sorter___AbstractSorter___sub_sort_t)(val_t self, val_t param0, val_t param1, val_t param2); -void sorter___AbstractSorter___sub_sort(val_t self, val_t param0, val_t param1, val_t param2); -typedef void (* sorter___AbstractSorter___quick_sort_t)(val_t self, val_t param0, val_t param1, val_t param2); -void sorter___AbstractSorter___quick_sort(val_t self, val_t param0, val_t param1, val_t param2); -typedef void (* sorter___AbstractSorter___bubble_sort_t)(val_t self, val_t param0, val_t param1, val_t param2); -void sorter___AbstractSorter___bubble_sort(val_t self, val_t param0, val_t param1, val_t param2); -typedef val_t (* sorter___ComparableSorter___compare_t)(val_t self, val_t param0, val_t param1); -val_t sorter___ComparableSorter___compare(val_t self, val_t param0, val_t param1); -typedef void (* sorter___ComparableSorter___init_t)(val_t self, int* init_table); -void sorter___ComparableSorter___init(val_t self, int* init_table); -val_t NEW_sorter___ComparableSorter___init(); +#define ID_AbstractSorter (SFT_sorter[0]) +#define COLOR_AbstractSorter (SFT_sorter[1]) +#define INIT_TABLE_POS_AbstractSorter (SFT_sorter[2] + 0) +#define CALL_sorter___AbstractSorter___compare(recv) ((sorter___AbstractSorter___compare_t)CALL((recv), (SFT_sorter[2] + 1))) +#define CALL_sorter___AbstractSorter___sort(recv) ((sorter___AbstractSorter___sort_t)CALL((recv), (SFT_sorter[2] + 2))) +#define CALL_sorter___AbstractSorter___sub_sort(recv) ((sorter___AbstractSorter___sub_sort_t)CALL((recv), (SFT_sorter[2] + 3))) +#define CALL_sorter___AbstractSorter___quick_sort(recv) ((sorter___AbstractSorter___quick_sort_t)CALL((recv), (SFT_sorter[2] + 4))) +#define CALL_sorter___AbstractSorter___bubble_sort(recv) ((sorter___AbstractSorter___bubble_sort_t)CALL((recv), (SFT_sorter[2] + 5))) +#define CALL_sorter___AbstractSorter___init(recv) ((sorter___AbstractSorter___init_t)CALL((recv), (SFT_sorter[2] + 6))) +#define ID_ComparableSorter (SFT_sorter[3]) +#define COLOR_ComparableSorter (SFT_sorter[4]) +#define INIT_TABLE_POS_ComparableSorter (SFT_sorter[5] + 0) +#define CALL_sorter___ComparableSorter___init(recv) ((sorter___ComparableSorter___init_t)CALL((recv), (SFT_sorter[5] + 1))) +static const char * const LOCATE_sorter___AbstractSorter___compare = "sorter::AbstractSorter::compare"; +val_t sorter___AbstractSorter___compare(val_t p0, val_t p1, val_t p2); +typedef val_t (*sorter___AbstractSorter___compare_t)(val_t p0, val_t p1, val_t p2); +static const char * const LOCATE_sorter___AbstractSorter___sort = "sorter::AbstractSorter::sort"; +void sorter___AbstractSorter___sort(val_t p0, val_t p1); +typedef void (*sorter___AbstractSorter___sort_t)(val_t p0, val_t p1); +static const char * const LOCATE_sorter___AbstractSorter___sub_sort = "sorter::AbstractSorter::sub_sort"; +void sorter___AbstractSorter___sub_sort(val_t p0, val_t p1, val_t p2, val_t p3); +typedef void (*sorter___AbstractSorter___sub_sort_t)(val_t p0, val_t p1, val_t p2, val_t p3); +static const char * const LOCATE_sorter___AbstractSorter___quick_sort = "sorter::AbstractSorter::quick_sort"; +void sorter___AbstractSorter___quick_sort(val_t p0, val_t p1, val_t p2, val_t p3); +typedef void (*sorter___AbstractSorter___quick_sort_t)(val_t p0, val_t p1, val_t p2, val_t p3); +static const char * const LOCATE_sorter___AbstractSorter___bubble_sort = "sorter::AbstractSorter::bubble_sort"; +void sorter___AbstractSorter___bubble_sort(val_t p0, val_t p1, val_t p2, val_t p3); +typedef void (*sorter___AbstractSorter___bubble_sort_t)(val_t p0, val_t p1, val_t p2, val_t p3); +static const char * const LOCATE_sorter___AbstractSorter___init = "sorter::AbstractSorter::init"; +void sorter___AbstractSorter___init(val_t p0, int* init_table); +typedef void (*sorter___AbstractSorter___init_t)(val_t p0, int* init_table); +val_t NEW_AbstractSorter_sorter___AbstractSorter___init(); +static const char * const LOCATE_sorter___ComparableSorter___compare = "sorter::ComparableSorter::(sorter::AbstractSorter::compare)"; +val_t sorter___ComparableSorter___compare(val_t p0, val_t p1, val_t p2); +typedef val_t (*sorter___ComparableSorter___compare_t)(val_t p0, val_t p1, val_t p2); +static const char * const LOCATE_sorter___ComparableSorter___init = "sorter::ComparableSorter::init"; +void sorter___ComparableSorter___init(val_t p0, int* init_table); +typedef void (*sorter___ComparableSorter___init_t)(val_t p0, int* init_table); +val_t NEW_ComparableSorter_sorter___ComparableSorter___init(); #endif