|
Last change
on this file was
5646,
checked in by westram, 15 years ago
|
- replaced GB_mergesort() and GBT_quicksort() by GB_sort()
- implemented GB_sort() using qsort(). current qsort is implemented as intronsort, which has mean AND worst case complexity O(N*log N), w/o the memory complexity of mergesort.
- fixed constness of compare function type (hash and array)
- added and using standard comparators (GB_string_comparator, GBS_HCF_sortedByKey)
- fixed/reimplemented several custom comparators
|
-
Property svn:eol-style set to
native
-
Property svn:keywords set to
Author Date Id Revision
|
|
File size:
410 bytes
|
| Line | |
|---|
| 1 | extern GBDATA *GLOBAL_gb_main; |
|---|
| 2 | #define NT_RESORT_FILTER (1<<GB_STRING)|(1<<GB_INT)|(1<<GB_FLOAT) |
|---|
| 3 | |
|---|
| 4 | AW_window *NT_build_resort_window(AW_root *awr); |
|---|
| 5 | void NT_build_resort_awars(AW_root *awr, AW_default aw_def); |
|---|
| 6 | void NT_resort_data_by_phylogeny(AW_window *dummy, GBT_TREE **ptree); |
|---|
| 7 | GB_ERROR NT_resort_data_base(GBT_TREE *tree, const char *key1, const char *key2, const char *key3) __ATTR__USERESULT; |
|---|
Note: See
TracBrowser
for help on using the repository browser.
