|
aqbanking
5.7.8
|
Go to the source code of this file.
| typedef struct AB_ACCOUNT_CONSTLIST2 AB_ACCOUNT_CONSTLIST2 |
| typedef const AB_ACCOUNT*() AB_ACCOUNT_CONSTLIST2_FOREACH(const AB_ACCOUNT *element, void *user_data) |
| typedef struct AB_ACCOUNT_CONSTLIST2_ITERATOR AB_ACCOUNT_CONSTLIST2_ITERATOR |
| struct AB_ACCOUNT_LIST AB_ACCOUNT_LIST |
This represents a list of AB_ACCOUNT (see AB_Account_List_new). This list may contain any number of elements. However, every element can only exist within a single list. If you need a better list please check GWEN_LIST.
| typedef struct AB_ACCOUNT_LIST2 AB_ACCOUNT_LIST2 |
Defines a list of pointers to AB_ACCOUNT. The pointers stored in a list are not taken over by the list, so you must take care of freeing the elements of the list yourself. (see AB_Account_List2_new)
| typedef AB_ACCOUNT*() AB_ACCOUNT_LIST2_FOREACH(AB_ACCOUNT *element, void *user_data) |
| typedef struct AB_ACCOUNT_LIST2_ITERATOR AB_ACCOUNT_LIST2_ITERATOR |
| typedef struct AB_ACCOUNT_LIST_ELEMENT AB_ACCOUNT_LIST__ELEMENT |
| typedef int GWENHYWFAR_CB(* AB_ACCOUNT_LIST_SORT_FN) (const AB_ACCOUNT *a, const AB_ACCOUNT *b, int ascending) |
This function is called from within AB_Account_List_SetSortFn().
| typedef struct AB_ACCOUNT_STATUS_CONSTLIST2 AB_ACCOUNT_STATUS_CONSTLIST2 |
| typedef const AB_ACCOUNT_STATUS*() AB_ACCOUNT_STATUS_CONSTLIST2_FOREACH(const AB_ACCOUNT_STATUS *element, void *user_data) |
| typedef struct AB_ACCOUNT_STATUS_LIST2 AB_ACCOUNT_STATUS_LIST2 |
Defines a list of pointers to AB_ACCOUNT_STATUS. The pointers stored in a list are not taken over by the list, so you must take care of freeing the elements of the list yourself. (see AB_AccountStatus_List2_new)
| typedef AB_ACCOUNT_STATUS*() AB_ACCOUNT_STATUS_LIST2_FOREACH(AB_ACCOUNT_STATUS *element, void *user_data) |
| typedef struct AB_ACCOUNT_STATUS_LIST2_ITERATOR AB_ACCOUNT_STATUS_LIST2_ITERATOR |
This represents a list of AB_ACCOUNTQUEUE (see AB_AccountQueue_List_new). This list may contain any number of elements. However, every element can only exist within a single list. If you need a better list please check GWEN_LIST.
| typedef struct AB_ACCOUNTQUEUE_LIST_ELEMENT AB_ACCOUNTQUEUE_LIST__ELEMENT |
| typedef int GWENHYWFAR_CB(* AB_ACCOUNTQUEUE_LIST_SORT_FN) (const AB_ACCOUNTQUEUE *a, const AB_ACCOUNTQUEUE *b, int ascending) |
This function is called from within AB_AccountQueue_List_SetSortFn().
| typedef struct AB_BANKINFO_CONSTLIST2 AB_BANKINFO_CONSTLIST2 |
| typedef const AB_BANKINFO*() AB_BANKINFO_CONSTLIST2_FOREACH(const AB_BANKINFO *element, void *user_data) |
| typedef struct AB_BANKINFO_CONSTLIST2_ITERATOR AB_BANKINFO_CONSTLIST2_ITERATOR |
| struct AB_BANKINFO_LIST AB_BANKINFO_LIST |
This represents a list of AB_BANKINFO (see AB_BankInfo_List_new). This list may contain any number of elements. However, every element can only exist within a single list. If you need a better list please check GWEN_LIST.
| typedef struct AB_BANKINFO_LIST2 AB_BANKINFO_LIST2 |
Defines a list of pointers to AB_BANKINFO. The pointers stored in a list are not taken over by the list, so you must take care of freeing the elements of the list yourself. (see AB_BankInfo_List2_new)
| typedef AB_BANKINFO*() AB_BANKINFO_LIST2_FOREACH(AB_BANKINFO *element, void *user_data) |
| typedef struct AB_BANKINFO_LIST2_ITERATOR AB_BANKINFO_LIST2_ITERATOR |
| typedef struct AB_BANKINFO_LIST_ELEMENT AB_BANKINFO_LIST__ELEMENT |
| typedef int GWENHYWFAR_CB(* AB_BANKINFO_LIST_SORT_FN) (const AB_BANKINFO *a, const AB_BANKINFO *b, int ascending) |
This function is called from within AB_BankInfo_List_SetSortFn().
| typedef struct AB_BANKINFO_PLUGIN_CONSTLIST2 AB_BANKINFO_PLUGIN_CONSTLIST2 |
| typedef const AB_BANKINFO_PLUGIN*() AB_BANKINFO_PLUGIN_CONSTLIST2_FOREACH(const AB_BANKINFO_PLUGIN *element, void *user_data) |
| typedef struct AB_BANKINFO_PLUGIN_LIST2 AB_BANKINFO_PLUGIN_LIST2 |
Defines a list of pointers to AB_BANKINFO_PLUGIN. The pointers stored in a list are not taken over by the list, so you must take care of freeing the elements of the list yourself. (see AB_BankInfoPlugin_List2_new)
| typedef AB_BANKINFO_PLUGIN*() AB_BANKINFO_PLUGIN_LIST2_FOREACH(AB_BANKINFO_PLUGIN *element, void *user_data) |
| typedef struct AB_BANKINFO_SERVICE_CONSTLIST2 AB_BANKINFO_SERVICE_CONSTLIST2 |
| typedef const AB_BANKINFO_SERVICE*() AB_BANKINFO_SERVICE_CONSTLIST2_FOREACH(const AB_BANKINFO_SERVICE *element, void *user_data) |
This represents a list of AB_BANKINFO_SERVICE (see AB_BankInfoService_List_new). This list may contain any number of elements. However, every element can only exist within a single list. If you need a better list please check GWEN_LIST.
| typedef struct AB_BANKINFO_SERVICE_LIST2 AB_BANKINFO_SERVICE_LIST2 |
Defines a list of pointers to AB_BANKINFO_SERVICE. The pointers stored in a list are not taken over by the list, so you must take care of freeing the elements of the list yourself. (see AB_BankInfoService_List2_new)
| typedef AB_BANKINFO_SERVICE*() AB_BANKINFO_SERVICE_LIST2_FOREACH(AB_BANKINFO_SERVICE *element, void *user_data) |
| typedef int GWENHYWFAR_CB(* AB_BANKINFO_SERVICE_LIST_SORT_FN) (const AB_BANKINFO_SERVICE *a, const AB_BANKINFO_SERVICE *b, int ascending) |
This function is called from within AB_BankInfoService_List_SetSortFn().
| typedef struct AB_CELLPHONE_PRODUCT_CONSTLIST2 AB_CELLPHONE_PRODUCT_CONSTLIST2 |
| typedef const AB_CELLPHONE_PRODUCT*() AB_CELLPHONE_PRODUCT_CONSTLIST2_FOREACH(const AB_CELLPHONE_PRODUCT *element, void *user_data) |
This represents a list of AB_CELLPHONE_PRODUCT (see AB_CellPhoneProduct_List_new). This list may contain any number of elements. However, every element can only exist within a single list. If you need a better list please check GWEN_LIST.
| typedef struct AB_CELLPHONE_PRODUCT_LIST2 AB_CELLPHONE_PRODUCT_LIST2 |
Defines a list of pointers to AB_CELLPHONE_PRODUCT. The pointers stored in a list are not taken over by the list, so you must take care of freeing the elements of the list yourself. (see AB_CellPhoneProduct_List2_new)
| typedef AB_CELLPHONE_PRODUCT*() AB_CELLPHONE_PRODUCT_LIST2_FOREACH(AB_CELLPHONE_PRODUCT *element, void *user_data) |
| typedef int GWENHYWFAR_CB(* AB_CELLPHONE_PRODUCT_LIST_SORT_FN) (const AB_CELLPHONE_PRODUCT *a, const AB_CELLPHONE_PRODUCT *b, int ascending) |
This function is called from within AB_CellPhoneProduct_List_SetSortFn().
| typedef struct AB_COUNTRY_CONSTLIST2 AB_COUNTRY_CONSTLIST2 |
| typedef const AB_COUNTRY*() AB_COUNTRY_CONSTLIST2_FOREACH(const AB_COUNTRY *element, void *user_data) |
| typedef struct AB_COUNTRY_CONSTLIST2_ITERATOR AB_COUNTRY_CONSTLIST2_ITERATOR |
| typedef struct AB_COUNTRY_LIST2 AB_COUNTRY_LIST2 |
Defines a list of pointers to AB_COUNTRY. The pointers stored in a list are not taken over by the list, so you must take care of freeing the elements of the list yourself. (see AB_Country_List2_new)
| typedef AB_COUNTRY*() AB_COUNTRY_LIST2_FOREACH(AB_COUNTRY *element, void *user_data) |
| typedef struct AB_COUNTRY_LIST2_ITERATOR AB_COUNTRY_LIST2_ITERATOR |
| typedef struct AB_EUTRANSFER_INFO_CONSTLIST2 AB_EUTRANSFER_INFO_CONSTLIST2 |
| typedef const AB_EUTRANSFER_INFO*() AB_EUTRANSFER_INFO_CONSTLIST2_FOREACH(const AB_EUTRANSFER_INFO *element, void *user_data) |
This represents a list of AB_EUTRANSFER_INFO (see AB_EuTransferInfo_List_new). This list may contain any number of elements. However, every element can only exist within a single list. If you need a better list please check GWEN_LIST.
| typedef struct AB_EUTRANSFER_INFO_LIST2 AB_EUTRANSFER_INFO_LIST2 |
Defines a list of pointers to AB_EUTRANSFER_INFO. The pointers stored in a list are not taken over by the list, so you must take care of freeing the elements of the list yourself. (see AB_EuTransferInfo_List2_new)
| typedef AB_EUTRANSFER_INFO*() AB_EUTRANSFER_INFO_LIST2_FOREACH(AB_EUTRANSFER_INFO *element, void *user_data) |
| typedef struct AB_EUTRANSFER_INFO_LIST_ELEMENT AB_EUTRANSFER_INFO_LIST__ELEMENT |
| typedef int GWENHYWFAR_CB(* AB_EUTRANSFER_INFO_LIST_SORT_FN) (const AB_EUTRANSFER_INFO *a, const AB_EUTRANSFER_INFO *b, int ascending) |
This function is called from within AB_EuTransferInfo_List_SetSortFn().
| typedef struct AB_JOB_CONSTLIST2 AB_JOB_CONSTLIST2 |
| typedef struct AB_JOB_CONSTLIST2_ITERATOR AB_JOB_CONSTLIST2_ITERATOR |
| typedef struct AB_JOB_LIST2 AB_JOB_LIST2 |
Defines a list of pointers to AB_JOB. The pointers stored in a list are not taken over by the list, so you must take care of freeing the elements of the list yourself. (see AB_Job_List2_new)
See AB_Job_List2_ForEach.
| typedef struct AB_JOB_LIST2_ITERATOR AB_JOB_LIST2_ITERATOR |
| struct AB_JOBQUEUE_LIST AB_JOBQUEUE_LIST |
This represents a list of AB_JOBQUEUE (see AB_JobQueue_List_new). This list may contain any number of elements. However, every element can only exist within a single list. If you need a better list please check GWEN_LIST.
| typedef struct AB_JOBQUEUE_LIST_ELEMENT AB_JOBQUEUE_LIST__ELEMENT |
| typedef int GWENHYWFAR_CB(* AB_JOBQUEUE_LIST_SORT_FN) (const AB_JOBQUEUE *a, const AB_JOBQUEUE *b, int ascending) |
This function is called from within AB_JobQueue_List_SetSortFn().
| typedef struct AB_MESSAGE_CONSTLIST2 AB_MESSAGE_CONSTLIST2 |
| typedef const AB_MESSAGE*() AB_MESSAGE_CONSTLIST2_FOREACH(const AB_MESSAGE *element, void *user_data) |
| typedef struct AB_MESSAGE_CONSTLIST2_ITERATOR AB_MESSAGE_CONSTLIST2_ITERATOR |
| struct AB_MESSAGE_LIST AB_MESSAGE_LIST |
This represents a list of AB_MESSAGE (see AB_Message_List_new). This list may contain any number of elements. However, every element can only exist within a single list. If you need a better list please check GWEN_LIST.
| typedef struct AB_MESSAGE_LIST2 AB_MESSAGE_LIST2 |
Defines a list of pointers to AB_MESSAGE. The pointers stored in a list are not taken over by the list, so you must take care of freeing the elements of the list yourself. (see AB_Message_List2_new)
| typedef AB_MESSAGE*() AB_MESSAGE_LIST2_FOREACH(AB_MESSAGE *element, void *user_data) |
| typedef struct AB_MESSAGE_LIST2_ITERATOR AB_MESSAGE_LIST2_ITERATOR |
| typedef struct AB_MESSAGE_LIST_ELEMENT AB_MESSAGE_LIST__ELEMENT |
| typedef int GWENHYWFAR_CB(* AB_MESSAGE_LIST_SORT_FN) (const AB_MESSAGE *a, const AB_MESSAGE *b, int ascending) |
This function is called from within AB_Message_List_SetSortFn().
| typedef const AB_PROVIDER_DESCRIPTION*() AB_PROVIDER_DESCRIPTION_CONSTLIST2_FOREACH(const AB_PROVIDER_DESCRIPTION *element, void *user_data) |
This represents a list of AB_PROVIDER_DESCRIPTION (see AB_ProviderDescription_List_new). This list may contain any number of elements. However, every element can only exist within a single list. If you need a better list please check GWEN_LIST.
| typedef struct AB_PROVIDER_DESCRIPTION_LIST2 AB_PROVIDER_DESCRIPTION_LIST2 |
Defines a list of pointers to AB_PROVIDER_DESCRIPTION. The pointers stored in a list are not taken over by the list, so you must take care of freeing the elements of the list yourself. (see AB_ProviderDescription_List2_new)
| typedef AB_PROVIDER_DESCRIPTION*() AB_PROVIDER_DESCRIPTION_LIST2_FOREACH(AB_PROVIDER_DESCRIPTION *element, void *user_data) |
| typedef int GWENHYWFAR_CB(* AB_PROVIDER_DESCRIPTION_LIST_SORT_FN) (const AB_PROVIDER_DESCRIPTION *a, const AB_PROVIDER_DESCRIPTION *b, int ascending) |
This function is called from within AB_ProviderDescription_List_SetSortFn().
| typedef struct AB_SECURITY_CONSTLIST2 AB_SECURITY_CONSTLIST2 |
| typedef const AB_SECURITY*() AB_SECURITY_CONSTLIST2_FOREACH(const AB_SECURITY *element, void *user_data) |
| typedef struct AB_SECURITY_CONSTLIST2_ITERATOR AB_SECURITY_CONSTLIST2_ITERATOR |
| struct AB_SECURITY_LIST AB_SECURITY_LIST |
This represents a list of AB_SECURITY (see AB_Security_List_new). This list may contain any number of elements. However, every element can only exist within a single list. If you need a better list please check GWEN_LIST.
| typedef struct AB_SECURITY_LIST2 AB_SECURITY_LIST2 |
Defines a list of pointers to AB_SECURITY. The pointers stored in a list are not taken over by the list, so you must take care of freeing the elements of the list yourself. (see AB_Security_List2_new)
| typedef AB_SECURITY*() AB_SECURITY_LIST2_FOREACH(AB_SECURITY *element, void *user_data) |
| typedef struct AB_SECURITY_LIST2_ITERATOR AB_SECURITY_LIST2_ITERATOR |
| typedef struct AB_SECURITY_LIST_ELEMENT AB_SECURITY_LIST__ELEMENT |
| typedef int GWENHYWFAR_CB(* AB_SECURITY_LIST_SORT_FN) (const AB_SECURITY *a, const AB_SECURITY *b, int ascending) |
This function is called from within AB_Security_List_SetSortFn().
| typedef struct AB_TEXTKEY_DESCR_CONSTLIST2 AB_TEXTKEY_DESCR_CONSTLIST2 |
| typedef const AB_TEXTKEY_DESCR*() AB_TEXTKEY_DESCR_CONSTLIST2_FOREACH(const AB_TEXTKEY_DESCR *element, void *user_data) |
This represents a list of AB_TEXTKEY_DESCR (see AB_TextKeyDescr_List_new). This list may contain any number of elements. However, every element can only exist within a single list. If you need a better list please check GWEN_LIST.
| typedef struct AB_TEXTKEY_DESCR_LIST2 AB_TEXTKEY_DESCR_LIST2 |
Defines a list of pointers to AB_TEXTKEY_DESCR. The pointers stored in a list are not taken over by the list, so you must take care of freeing the elements of the list yourself. (see AB_TextKeyDescr_List2_new)
| typedef AB_TEXTKEY_DESCR*() AB_TEXTKEY_DESCR_LIST2_FOREACH(AB_TEXTKEY_DESCR *element, void *user_data) |
| typedef struct AB_TEXTKEY_DESCR_LIST2_ITERATOR AB_TEXTKEY_DESCR_LIST2_ITERATOR |
| typedef struct AB_TEXTKEY_DESCR_LIST_ELEMENT AB_TEXTKEY_DESCR_LIST__ELEMENT |
| typedef int GWENHYWFAR_CB(* AB_TEXTKEY_DESCR_LIST_SORT_FN) (const AB_TEXTKEY_DESCR *a, const AB_TEXTKEY_DESCR *b, int ascending) |
This function is called from within AB_TextKeyDescr_List_SetSortFn().
| typedef struct AB_TRANSACTION_CONSTLIST2 AB_TRANSACTION_CONSTLIST2 |
| typedef const AB_TRANSACTION*() AB_TRANSACTION_CONSTLIST2_FOREACH(const AB_TRANSACTION *element, void *user_data) |
| typedef struct AB_TRANSACTION_LIMITS_CONSTLIST2 AB_TRANSACTION_LIMITS_CONSTLIST2 |
| typedef const AB_TRANSACTION_LIMITS*() AB_TRANSACTION_LIMITS_CONSTLIST2_FOREACH(const AB_TRANSACTION_LIMITS *element, void *user_data) |
This represents a list of AB_TRANSACTION_LIMITS (see AB_TransactionLimits_List_new). This list may contain any number of elements. However, every element can only exist within a single list. If you need a better list please check GWEN_LIST.
| typedef struct AB_TRANSACTION_LIMITS_LIST2 AB_TRANSACTION_LIMITS_LIST2 |
Defines a list of pointers to AB_TRANSACTION_LIMITS. The pointers stored in a list are not taken over by the list, so you must take care of freeing the elements of the list yourself. (see AB_TransactionLimits_List2_new)
| typedef AB_TRANSACTION_LIMITS*() AB_TRANSACTION_LIMITS_LIST2_FOREACH(AB_TRANSACTION_LIMITS *element, void *user_data) |
| typedef int GWENHYWFAR_CB(* AB_TRANSACTION_LIMITS_LIST_SORT_FN) (const AB_TRANSACTION_LIMITS *a, const AB_TRANSACTION_LIMITS *b, int ascending) |
This function is called from within AB_TransactionLimits_List_SetSortFn().
This represents a list of AB_TRANSACTION (see AB_Transaction_List_new). This list may contain any number of elements. However, every element can only exist within a single list. If you need a better list please check GWEN_LIST.
| typedef struct AB_TRANSACTION_LIST2 AB_TRANSACTION_LIST2 |
Defines a list of pointers to AB_TRANSACTION. The pointers stored in a list are not taken over by the list, so you must take care of freeing the elements of the list yourself. (see AB_Transaction_List2_new)
| typedef AB_TRANSACTION*() AB_TRANSACTION_LIST2_FOREACH(AB_TRANSACTION *element, void *user_data) |
| typedef struct AB_TRANSACTION_LIST2_ITERATOR AB_TRANSACTION_LIST2_ITERATOR |
| typedef struct AB_TRANSACTION_LIST_ELEMENT AB_TRANSACTION_LIST__ELEMENT |
| typedef int GWENHYWFAR_CB(* AB_TRANSACTION_LIST_SORT_FN) (const AB_TRANSACTION *a, const AB_TRANSACTION *b, int ascending) |
This function is called from within AB_Transaction_List_SetSortFn().
| typedef struct AB_USER_CONSTLIST2 AB_USER_CONSTLIST2 |
| typedef struct AB_USER_CONSTLIST2_ITERATOR AB_USER_CONSTLIST2_ITERATOR |
| typedef struct AB_USER_LIST2 AB_USER_LIST2 |
Defines a list of pointers to AB_USER. The pointers stored in a list are not taken over by the list, so you must take care of freeing the elements of the list yourself. (see AB_User_List2_new)
| typedef struct AB_USER_LIST2_ITERATOR AB_USER_LIST2_ITERATOR |
This represents a list of AB_USERQUEUE (see AB_UserQueue_List_new). This list may contain any number of elements. However, every element can only exist within a single list. If you need a better list please check GWEN_LIST.
| typedef struct AB_USERQUEUE_LIST_ELEMENT AB_USERQUEUE_LIST__ELEMENT |
| typedef int GWENHYWFAR_CB(* AB_USERQUEUE_LIST_SORT_FN) (const AB_USERQUEUE *a, const AB_USERQUEUE *b, int ascending) |
This function is called from within AB_UserQueue_List_SetSortFn().
| struct AB_VALUE_LIST AB_VALUE_LIST |
This represents a list of AB_VALUE (see AB_Value_List_new). This list may contain any number of elements. However, every element can only exist within a single list. If you need a better list please check GWEN_LIST.
| typedef struct AB_VALUE_LIST_ELEMENT AB_VALUE_LIST__ELEMENT |
| typedef int GWENHYWFAR_CB(* AB_VALUE_LIST_SORT_FN) (const AB_VALUE *a, const AB_VALUE *b, int ascending) |
This function is called from within AB_Value_List_SetSortFn().
| typedef struct AH_TAN_METHOD_CONSTLIST2 AH_TAN_METHOD_CONSTLIST2 |
| typedef const AH_TAN_METHOD*() AH_TAN_METHOD_CONSTLIST2_FOREACH(const AH_TAN_METHOD *element, void *user_data) |
This represents a list of AH_TAN_METHOD (see AH_TanMethod_List_new). This list may contain any number of elements. However, every element can only exist within a single list. If you need a better list please check GWEN_LIST.
| typedef struct AH_TAN_METHOD_LIST2 AH_TAN_METHOD_LIST2 |
Defines a list of pointers to AH_TAN_METHOD. The pointers stored in a list are not taken over by the list, so you must take care of freeing the elements of the list yourself. (see AH_TanMethod_List2_new)
| typedef AH_TAN_METHOD*() AH_TAN_METHOD_LIST2_FOREACH(AH_TAN_METHOD *element, void *user_data) |
| typedef struct AH_TAN_METHOD_LIST2_ITERATOR AH_TAN_METHOD_LIST2_ITERATOR |
| typedef struct AH_TAN_METHOD_LIST_ELEMENT AH_TAN_METHOD_LIST__ELEMENT |
| typedef int GWENHYWFAR_CB(* AH_TAN_METHOD_LIST_SORT_FN) (const AH_TAN_METHOD *a, const AH_TAN_METHOD *b, int ascending) |
This function is called from within AH_TanMethod_List_SetSortFn().
| struct EB_EU_LIST EB_EU_LIST |
This represents a list of EB_EU (see EB_Eu_List_new). This list may contain any number of elements. However, every element can only exist within a single list. If you need a better list please check GWEN_LIST.
| typedef struct EB_EU_LIST_ELEMENT EB_EU_LIST__ELEMENT |
This function is called from within EB_Eu_List_SetSortFn().
| typedef struct OH_INSTITUTE_DATA_CONSTLIST2 OH_INSTITUTE_DATA_CONSTLIST2 |
| typedef const OH_INSTITUTE_DATA*() OH_INSTITUTE_DATA_CONSTLIST2_FOREACH(const OH_INSTITUTE_DATA *element, void *user_data) |
This represents a list of OH_INSTITUTE_DATA (see OH_InstituteData_List_new). This list may contain any number of elements. However, every element can only exist within a single list. If you need a better list please check GWEN_LIST.
| typedef struct OH_INSTITUTE_DATA_LIST2 OH_INSTITUTE_DATA_LIST2 |
Defines a list of pointers to OH_INSTITUTE_DATA. The pointers stored in a list are not taken over by the list, so you must take care of freeing the elements of the list yourself. (see OH_InstituteData_List2_new)
| typedef OH_INSTITUTE_DATA*() OH_INSTITUTE_DATA_LIST2_FOREACH(OH_INSTITUTE_DATA *element, void *user_data) |
| typedef struct OH_INSTITUTE_DATA_LIST2_ITERATOR OH_INSTITUTE_DATA_LIST2_ITERATOR |
| typedef struct OH_INSTITUTE_DATA_LIST_ELEMENT OH_INSTITUTE_DATA_LIST__ELEMENT |
| typedef int GWENHYWFAR_CB(* OH_INSTITUTE_DATA_LIST_SORT_FN) (const OH_INSTITUTE_DATA *a, const OH_INSTITUTE_DATA *b, int ascending) |
This function is called from within OH_InstituteData_List_SetSortFn().
| typedef struct OH_INSTITUTE_SPEC_CONSTLIST2 OH_INSTITUTE_SPEC_CONSTLIST2 |
| typedef const OH_INSTITUTE_SPEC*() OH_INSTITUTE_SPEC_CONSTLIST2_FOREACH(const OH_INSTITUTE_SPEC *element, void *user_data) |
This represents a list of OH_INSTITUTE_SPEC (see OH_InstituteSpec_List_new). This list may contain any number of elements. However, every element can only exist within a single list. If you need a better list please check GWEN_LIST.
| typedef struct OH_INSTITUTE_SPEC_LIST2 OH_INSTITUTE_SPEC_LIST2 |
Defines a list of pointers to OH_INSTITUTE_SPEC. The pointers stored in a list are not taken over by the list, so you must take care of freeing the elements of the list yourself. (see OH_InstituteSpec_List2_new)
| typedef OH_INSTITUTE_SPEC*() OH_INSTITUTE_SPEC_LIST2_FOREACH(OH_INSTITUTE_SPEC *element, void *user_data) |
| typedef struct OH_INSTITUTE_SPEC_LIST2_ITERATOR OH_INSTITUTE_SPEC_LIST2_ITERATOR |
| typedef struct OH_INSTITUTE_SPEC_LIST_ELEMENT OH_INSTITUTE_SPEC_LIST__ELEMENT |
| typedef int GWENHYWFAR_CB(* OH_INSTITUTE_SPEC_LIST_SORT_FN) (const OH_INSTITUTE_SPEC *a, const OH_INSTITUTE_SPEC *b, int ascending) |
This function is called from within OH_InstituteSpec_List_SetSortFn().
| void AB_Account_ConstList2_Clear | ( | AB_ACCOUNT_CONSTLIST2 * | l | ) |
| AB_ACCOUNT_CONSTLIST2_ITERATOR* AB_Account_ConstList2_First | ( | AB_ACCOUNT_CONSTLIST2 * | l | ) |
| const AB_ACCOUNT* AB_Account_ConstList2_ForEach | ( | AB_ACCOUNT_CONSTLIST2 * | list, |
| AB_ACCOUNT_CONSTLIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_Account_ConstList2_free | ( | AB_ACCOUNT_CONSTLIST2 * | l | ) |
| const AB_ACCOUNT* AB_Account_ConstList2_GetBack | ( | AB_ACCOUNT_CONSTLIST2 * | l | ) |
| const AB_ACCOUNT* AB_Account_ConstList2_GetFront | ( | AB_ACCOUNT_CONSTLIST2 * | l | ) |
| unsigned int AB_Account_ConstList2_GetSize | ( | AB_ACCOUNT_CONSTLIST2 * | l | ) |
| AB_ACCOUNT_CONSTLIST2_ITERATOR* AB_Account_ConstList2_Last | ( | AB_ACCOUNT_CONSTLIST2 * | l | ) |
| AB_ACCOUNT_CONSTLIST2* AB_Account_ConstList2_new | ( | ) |
| void AB_Account_ConstList2_PopBack | ( | AB_ACCOUNT_CONSTLIST2 * | l | ) |
| void AB_Account_ConstList2_PopFront | ( | AB_ACCOUNT_CONSTLIST2 * | l | ) |
| void AB_Account_ConstList2_PushBack | ( | AB_ACCOUNT_CONSTLIST2 * | l, |
| const AB_ACCOUNT * | p | ||
| ) |
| void AB_Account_ConstList2_PushFront | ( | AB_ACCOUNT_CONSTLIST2 * | l, |
| const AB_ACCOUNT * | p | ||
| ) |
| const AB_ACCOUNT* AB_Account_ConstList2Iterator_Data | ( | AB_ACCOUNT_CONSTLIST2_ITERATOR * | li | ) |
| void AB_Account_ConstList2Iterator_free | ( | AB_ACCOUNT_CONSTLIST2_ITERATOR * | li | ) |
| AB_ACCOUNT_CONSTLIST2_ITERATOR* AB_Account_ConstList2Iterator_new | ( | AB_ACCOUNT_CONSTLIST2 * | l | ) |
| const AB_ACCOUNT* AB_Account_ConstList2Iterator_Next | ( | AB_ACCOUNT_CONSTLIST2_ITERATOR * | li | ) |
| const AB_ACCOUNT* AB_Account_ConstList2Iterator_Previous | ( | AB_ACCOUNT_CONSTLIST2_ITERATOR * | li | ) |
| void AB_Account_List2_Clear | ( | AB_ACCOUNT_LIST2 * | l | ) |
Removes all list elements from the list. (The elements are not freed.)
| void AB_Account_List2_Dump | ( | AB_ACCOUNT_LIST2 * | l, |
| FILE * | f, | ||
| unsigned int | indent | ||
| ) |
Dumps the contents of the list to an open file (e.g. stderr).
| void AB_Account_List2_Erase | ( | AB_ACCOUNT_LIST2 * | l, |
| AB_ACCOUNT_LIST2_ITERATOR * | it | ||
| ) |
Removes the element currently pointed to by the given iterator from the list.
| AB_ACCOUNT_LIST2_ITERATOR* AB_Account_List2_First | ( | AB_ACCOUNT_LIST2 * | l | ) |
Returns a list iterator pointing to the first element.
| AB_ACCOUNT* AB_Account_List2_ForEach | ( | AB_ACCOUNT_LIST2 * | list, |
| AB_ACCOUNT_LIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_Account_List2_free | ( | AB_ACCOUNT_LIST2 * | l | ) |
Destroys the list. Please note that the members in this list are not destroyed!
| AB_ACCOUNT* AB_Account_List2_GetBack | ( | AB_ACCOUNT_LIST2 * | l | ) |
Returns the last element of the list. (The element is not removed from the list.)
| AB_ACCOUNT* AB_Account_List2_GetFront | ( | AB_ACCOUNT_LIST2 * | l | ) |
Returns the first element of the list. (The element is not removed from the list.)
| unsigned int AB_Account_List2_GetSize | ( | AB_ACCOUNT_LIST2 * | l | ) |
Returns the size of this list, i.e. the number of elements in this list.
This number is counted in the list metadata, so this is a cheap operation.
| AB_ACCOUNT_LIST2_ITERATOR* AB_Account_List2_Last | ( | AB_ACCOUNT_LIST2 * | l | ) |
Returns a list iterator pointing to the last element.
| AB_ACCOUNT_LIST2* AB_Account_List2_new | ( | ) |
Creates a new list. This mus be freed using AB_Account_List2_free.
| void AB_Account_List2_PopBack | ( | AB_ACCOUNT_LIST2 * | l | ) |
Removes the list's last element from the list. (The element is not freed.)
| void AB_Account_List2_PopFront | ( | AB_ACCOUNT_LIST2 * | l | ) |
Removes the list's first element from the list. (The element is not freed.)
| void AB_Account_List2_PushBack | ( | AB_ACCOUNT_LIST2 * | l, |
| AB_ACCOUNT * | p | ||
| ) |
Appends an element to a list making it the new last element.
| void AB_Account_List2_PushFront | ( | AB_ACCOUNT_LIST2 * | l, |
| AB_ACCOUNT * | p | ||
| ) |
Inserts an element at the start of the list, making it the new first element.
| AB_ACCOUNT* AB_Account_List2Iterator_Data | ( | AB_ACCOUNT_LIST2_ITERATOR * | li | ) |
Returns the pointer to the element stored at the list position the iterator currently points to.
| void AB_Account_List2Iterator_free | ( | AB_ACCOUNT_LIST2_ITERATOR * | li | ) |
Destroys the list iterator.
| AB_ACCOUNT_LIST2_ITERATOR* AB_Account_List2Iterator_new | ( | AB_ACCOUNT_LIST2 * | l | ) |
Creates a list iterator for the given list. (FIXME: Should be private).
| AB_ACCOUNT* AB_Account_List2Iterator_Next | ( | AB_ACCOUNT_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the successor of the currenty selected element and returns that successor element.
| AB_ACCOUNT* AB_Account_List2Iterator_Previous | ( | AB_ACCOUNT_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the predecessor of the currenty selected element and returns that predecessor element.
| void AB_Account_List_Add | ( | AB_ACCOUNT * | element, |
| AB_ACCOUNT_LIST * | list | ||
| ) |
Adds the given element to the given list making it the new tail.
| void AB_Account_List_AddList | ( | AB_ACCOUNT_LIST * | dst, |
| AB_ACCOUNT_LIST * | l | ||
| ) |
Moves the content of one list to another list thus leaving the old list empty.
| void AB_Account_List_Clear | ( | AB_ACCOUNT_LIST * | l | ) |
Clears the given list (thus leaving it empty). All elements of this list are deleted via AB_Account_free();
| void AB_Account_List_Del | ( | AB_ACCOUNT * | element | ) |
Unlinks the given element from whatever list it may currently be enlisted. If the element is not member of any list the program is aborted. Please note: The element is just unlinked, not deleted.
| AB_ACCOUNT* AB_Account_List_First | ( | const AB_ACCOUNT_LIST * | l | ) |
Returns the first element of the list.
| void AB_Account_List_free | ( | AB_ACCOUNT_LIST * | l | ) |
Destroys the list and frees all its elements.
| uint32_t AB_Account_List_GetCount | ( | const AB_ACCOUNT_LIST * | l | ) |
Returns the number of elements currently in the given list.
| void AB_Account_List_Insert | ( | AB_ACCOUNT * | element, |
| AB_ACCOUNT_LIST * | list | ||
| ) |
Inserts the given element into the given list thus making it the new head of the list.
| AB_ACCOUNT* AB_Account_List_Last | ( | const AB_ACCOUNT_LIST * | l | ) |
Returns the last element of the list.
| AB_ACCOUNT_LIST* AB_Account_List_new | ( | ) |
Creates a new list of AB_ACCOUNT.
| AB_ACCOUNT* AB_Account_List_Next | ( | const AB_ACCOUNT * | element | ) |
Returns the successor of the given element.
| AB_ACCOUNT* AB_Account_List_Previous | ( | const AB_ACCOUNT * | element | ) |
Returns the predecessor of the given element.
| AB_ACCOUNT_LIST_SORT_FN AB_Account_List_SetSortFn | ( | AB_ACCOUNT_LIST * | l, |
| AB_ACCOUNT_LIST_SORT_FN | fn | ||
| ) |
Set the sort function for the next calls to AB_Account_List_Sort().
| void AB_Account_List_Sort | ( | AB_ACCOUNT_LIST * | l, |
| int | ascending | ||
| ) |
Sort the list. Within the course of this function the sort function set via AB_Account_List_SetSortFn is called with the arguments "const AB_ACCOUNT *a, const AB_ACCOUNT *b, int ascending".
| void AB_AccountQueue_List_Add | ( | AB_ACCOUNTQUEUE * | element, |
| AB_ACCOUNTQUEUE_LIST * | list | ||
| ) |
Adds the given element to the given list making it the new tail.
| void AB_AccountQueue_List_AddList | ( | AB_ACCOUNTQUEUE_LIST * | dst, |
| AB_ACCOUNTQUEUE_LIST * | l | ||
| ) |
Moves the content of one list to another list thus leaving the old list empty.
| void AB_AccountQueue_List_Clear | ( | AB_ACCOUNTQUEUE_LIST * | l | ) |
Clears the given list (thus leaving it empty). All elements of this list are deleted via AB_AccountQueue_free();
| void AB_AccountQueue_List_Del | ( | AB_ACCOUNTQUEUE * | element | ) |
Unlinks the given element from whatever list it may currently be enlisted. If the element is not member of any list the program is aborted. Please note: The element is just unlinked, not deleted.
| AB_ACCOUNTQUEUE* AB_AccountQueue_List_First | ( | const AB_ACCOUNTQUEUE_LIST * | l | ) |
Returns the first element of the list.
| void AB_AccountQueue_List_free | ( | AB_ACCOUNTQUEUE_LIST * | l | ) |
Destroys the list and frees all its elements.
| uint32_t AB_AccountQueue_List_GetCount | ( | const AB_ACCOUNTQUEUE_LIST * | l | ) |
Returns the number of elements currently in the given list.
| void AB_AccountQueue_List_Insert | ( | AB_ACCOUNTQUEUE * | element, |
| AB_ACCOUNTQUEUE_LIST * | list | ||
| ) |
Inserts the given element into the given list thus making it the new head of the list.
| AB_ACCOUNTQUEUE* AB_AccountQueue_List_Last | ( | const AB_ACCOUNTQUEUE_LIST * | l | ) |
Returns the last element of the list.
| AB_ACCOUNTQUEUE_LIST* AB_AccountQueue_List_new | ( | ) |
Creates a new list of AB_ACCOUNTQUEUE.
| AB_ACCOUNTQUEUE* AB_AccountQueue_List_Next | ( | const AB_ACCOUNTQUEUE * | element | ) |
Returns the successor of the given element.
| AB_ACCOUNTQUEUE* AB_AccountQueue_List_Previous | ( | const AB_ACCOUNTQUEUE * | element | ) |
Returns the predecessor of the given element.
| AB_ACCOUNTQUEUE_LIST_SORT_FN AB_AccountQueue_List_SetSortFn | ( | AB_ACCOUNTQUEUE_LIST * | l, |
| AB_ACCOUNTQUEUE_LIST_SORT_FN | fn | ||
| ) |
Set the sort function for the next calls to AB_AccountQueue_List_Sort().
| void AB_AccountQueue_List_Sort | ( | AB_ACCOUNTQUEUE_LIST * | l, |
| int | ascending | ||
| ) |
Sort the list. Within the course of this function the sort function set via AB_AccountQueue_List_SetSortFn is called with the arguments "const AB_ACCOUNTQUEUE *a, const AB_ACCOUNTQUEUE *b, int ascending".
| void AB_AccountStatus_ConstList2_Clear | ( | AB_ACCOUNT_STATUS_CONSTLIST2 * | l | ) |
| AB_ACCOUNT_STATUS_CONSTLIST2_ITERATOR* AB_AccountStatus_ConstList2_First | ( | AB_ACCOUNT_STATUS_CONSTLIST2 * | l | ) |
| const AB_ACCOUNT_STATUS* AB_AccountStatus_ConstList2_ForEach | ( | AB_ACCOUNT_STATUS_CONSTLIST2 * | list, |
| AB_ACCOUNT_STATUS_CONSTLIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_AccountStatus_ConstList2_free | ( | AB_ACCOUNT_STATUS_CONSTLIST2 * | l | ) |
| const AB_ACCOUNT_STATUS* AB_AccountStatus_ConstList2_GetBack | ( | AB_ACCOUNT_STATUS_CONSTLIST2 * | l | ) |
| const AB_ACCOUNT_STATUS* AB_AccountStatus_ConstList2_GetFront | ( | AB_ACCOUNT_STATUS_CONSTLIST2 * | l | ) |
| unsigned int AB_AccountStatus_ConstList2_GetSize | ( | AB_ACCOUNT_STATUS_CONSTLIST2 * | l | ) |
| AB_ACCOUNT_STATUS_CONSTLIST2_ITERATOR* AB_AccountStatus_ConstList2_Last | ( | AB_ACCOUNT_STATUS_CONSTLIST2 * | l | ) |
| AB_ACCOUNT_STATUS_CONSTLIST2* AB_AccountStatus_ConstList2_new | ( | ) |
| void AB_AccountStatus_ConstList2_PopBack | ( | AB_ACCOUNT_STATUS_CONSTLIST2 * | l | ) |
| void AB_AccountStatus_ConstList2_PopFront | ( | AB_ACCOUNT_STATUS_CONSTLIST2 * | l | ) |
| void AB_AccountStatus_ConstList2_PushBack | ( | AB_ACCOUNT_STATUS_CONSTLIST2 * | l, |
| const AB_ACCOUNT_STATUS * | p | ||
| ) |
| void AB_AccountStatus_ConstList2_PushFront | ( | AB_ACCOUNT_STATUS_CONSTLIST2 * | l, |
| const AB_ACCOUNT_STATUS * | p | ||
| ) |
| const AB_ACCOUNT_STATUS* AB_AccountStatus_ConstList2Iterator_Data | ( | AB_ACCOUNT_STATUS_CONSTLIST2_ITERATOR * | li | ) |
| void AB_AccountStatus_ConstList2Iterator_free | ( | AB_ACCOUNT_STATUS_CONSTLIST2_ITERATOR * | li | ) |
| AB_ACCOUNT_STATUS_CONSTLIST2_ITERATOR* AB_AccountStatus_ConstList2Iterator_new | ( | AB_ACCOUNT_STATUS_CONSTLIST2 * | l | ) |
| const AB_ACCOUNT_STATUS* AB_AccountStatus_ConstList2Iterator_Next | ( | AB_ACCOUNT_STATUS_CONSTLIST2_ITERATOR * | li | ) |
| const AB_ACCOUNT_STATUS* AB_AccountStatus_ConstList2Iterator_Previous | ( | AB_ACCOUNT_STATUS_CONSTLIST2_ITERATOR * | li | ) |
| void AB_AccountStatus_List2_Clear | ( | AB_ACCOUNT_STATUS_LIST2 * | l | ) |
Removes all list elements from the list. (The elements are not freed.)
| void AB_AccountStatus_List2_Dump | ( | AB_ACCOUNT_STATUS_LIST2 * | l, |
| FILE * | f, | ||
| unsigned int | indent | ||
| ) |
Dumps the contents of the list to an open file (e.g. stderr).
| void AB_AccountStatus_List2_Erase | ( | AB_ACCOUNT_STATUS_LIST2 * | l, |
| AB_ACCOUNT_STATUS_LIST2_ITERATOR * | it | ||
| ) |
Removes the element currently pointed to by the given iterator from the list.
| AB_ACCOUNT_STATUS_LIST2_ITERATOR* AB_AccountStatus_List2_First | ( | AB_ACCOUNT_STATUS_LIST2 * | l | ) |
Returns a list iterator pointing to the first element.
| AB_ACCOUNT_STATUS* AB_AccountStatus_List2_ForEach | ( | AB_ACCOUNT_STATUS_LIST2 * | list, |
| AB_ACCOUNT_STATUS_LIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_AccountStatus_List2_free | ( | AB_ACCOUNT_STATUS_LIST2 * | l | ) |
Destroys the list. Please note that the members in this list are not destroyed!
| AB_ACCOUNT_STATUS* AB_AccountStatus_List2_GetBack | ( | AB_ACCOUNT_STATUS_LIST2 * | l | ) |
Returns the last element of the list. (The element is not removed from the list.)
| AB_ACCOUNT_STATUS* AB_AccountStatus_List2_GetFront | ( | AB_ACCOUNT_STATUS_LIST2 * | l | ) |
Returns the first element of the list. (The element is not removed from the list.)
| unsigned int AB_AccountStatus_List2_GetSize | ( | AB_ACCOUNT_STATUS_LIST2 * | l | ) |
Returns the size of this list, i.e. the number of elements in this list.
This number is counted in the list metadata, so this is a cheap operation.
| AB_ACCOUNT_STATUS_LIST2_ITERATOR* AB_AccountStatus_List2_Last | ( | AB_ACCOUNT_STATUS_LIST2 * | l | ) |
Returns a list iterator pointing to the last element.
| AB_ACCOUNT_STATUS_LIST2* AB_AccountStatus_List2_new | ( | ) |
Creates a new list. This mus be freed using AB_AccountStatus_List2_free.
| void AB_AccountStatus_List2_PopBack | ( | AB_ACCOUNT_STATUS_LIST2 * | l | ) |
Removes the list's last element from the list. (The element is not freed.)
| void AB_AccountStatus_List2_PopFront | ( | AB_ACCOUNT_STATUS_LIST2 * | l | ) |
Removes the list's first element from the list. (The element is not freed.)
| void AB_AccountStatus_List2_PushBack | ( | AB_ACCOUNT_STATUS_LIST2 * | l, |
| AB_ACCOUNT_STATUS * | p | ||
| ) |
Appends an element to a list making it the new last element.
| void AB_AccountStatus_List2_PushFront | ( | AB_ACCOUNT_STATUS_LIST2 * | l, |
| AB_ACCOUNT_STATUS * | p | ||
| ) |
Inserts an element at the start of the list, making it the new first element.
| AB_ACCOUNT_STATUS* AB_AccountStatus_List2Iterator_Data | ( | AB_ACCOUNT_STATUS_LIST2_ITERATOR * | li | ) |
Returns the pointer to the element stored at the list position the iterator currently points to.
| void AB_AccountStatus_List2Iterator_free | ( | AB_ACCOUNT_STATUS_LIST2_ITERATOR * | li | ) |
Destroys the list iterator.
| AB_ACCOUNT_STATUS_LIST2_ITERATOR* AB_AccountStatus_List2Iterator_new | ( | AB_ACCOUNT_STATUS_LIST2 * | l | ) |
Creates a list iterator for the given list. (FIXME: Should be private).
| AB_ACCOUNT_STATUS* AB_AccountStatus_List2Iterator_Next | ( | AB_ACCOUNT_STATUS_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the successor of the currenty selected element and returns that successor element.
| AB_ACCOUNT_STATUS* AB_AccountStatus_List2Iterator_Previous | ( | AB_ACCOUNT_STATUS_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the predecessor of the currenty selected element and returns that predecessor element.
| void AB_BankInfo_ConstList2_Clear | ( | AB_BANKINFO_CONSTLIST2 * | l | ) |
| AB_BANKINFO_CONSTLIST2_ITERATOR* AB_BankInfo_ConstList2_First | ( | AB_BANKINFO_CONSTLIST2 * | l | ) |
| const AB_BANKINFO* AB_BankInfo_ConstList2_ForEach | ( | AB_BANKINFO_CONSTLIST2 * | list, |
| AB_BANKINFO_CONSTLIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_BankInfo_ConstList2_free | ( | AB_BANKINFO_CONSTLIST2 * | l | ) |
| const AB_BANKINFO* AB_BankInfo_ConstList2_GetBack | ( | AB_BANKINFO_CONSTLIST2 * | l | ) |
| const AB_BANKINFO* AB_BankInfo_ConstList2_GetFront | ( | AB_BANKINFO_CONSTLIST2 * | l | ) |
| unsigned int AB_BankInfo_ConstList2_GetSize | ( | AB_BANKINFO_CONSTLIST2 * | l | ) |
| AB_BANKINFO_CONSTLIST2_ITERATOR* AB_BankInfo_ConstList2_Last | ( | AB_BANKINFO_CONSTLIST2 * | l | ) |
| AB_BANKINFO_CONSTLIST2* AB_BankInfo_ConstList2_new | ( | ) |
| void AB_BankInfo_ConstList2_PopBack | ( | AB_BANKINFO_CONSTLIST2 * | l | ) |
| void AB_BankInfo_ConstList2_PopFront | ( | AB_BANKINFO_CONSTLIST2 * | l | ) |
| void AB_BankInfo_ConstList2_PushBack | ( | AB_BANKINFO_CONSTLIST2 * | l, |
| const AB_BANKINFO * | p | ||
| ) |
| void AB_BankInfo_ConstList2_PushFront | ( | AB_BANKINFO_CONSTLIST2 * | l, |
| const AB_BANKINFO * | p | ||
| ) |
| const AB_BANKINFO* AB_BankInfo_ConstList2Iterator_Data | ( | AB_BANKINFO_CONSTLIST2_ITERATOR * | li | ) |
| void AB_BankInfo_ConstList2Iterator_free | ( | AB_BANKINFO_CONSTLIST2_ITERATOR * | li | ) |
| AB_BANKINFO_CONSTLIST2_ITERATOR* AB_BankInfo_ConstList2Iterator_new | ( | AB_BANKINFO_CONSTLIST2 * | l | ) |
| const AB_BANKINFO* AB_BankInfo_ConstList2Iterator_Next | ( | AB_BANKINFO_CONSTLIST2_ITERATOR * | li | ) |
| const AB_BANKINFO* AB_BankInfo_ConstList2Iterator_Previous | ( | AB_BANKINFO_CONSTLIST2_ITERATOR * | li | ) |
| void AB_BankInfo_List2_Clear | ( | AB_BANKINFO_LIST2 * | l | ) |
Removes all list elements from the list. (The elements are not freed.)
| void AB_BankInfo_List2_Dump | ( | AB_BANKINFO_LIST2 * | l, |
| FILE * | f, | ||
| unsigned int | indent | ||
| ) |
Dumps the contents of the list to an open file (e.g. stderr).
| void AB_BankInfo_List2_Erase | ( | AB_BANKINFO_LIST2 * | l, |
| AB_BANKINFO_LIST2_ITERATOR * | it | ||
| ) |
Removes the element currently pointed to by the given iterator from the list.
| AB_BANKINFO_LIST2_ITERATOR* AB_BankInfo_List2_First | ( | AB_BANKINFO_LIST2 * | l | ) |
Returns a list iterator pointing to the first element.
| AB_BANKINFO* AB_BankInfo_List2_ForEach | ( | AB_BANKINFO_LIST2 * | list, |
| AB_BANKINFO_LIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_BankInfo_List2_free | ( | AB_BANKINFO_LIST2 * | l | ) |
Destroys the list. Please note that the members in this list are not destroyed!
| AB_BANKINFO* AB_BankInfo_List2_GetBack | ( | AB_BANKINFO_LIST2 * | l | ) |
Returns the last element of the list. (The element is not removed from the list.)
| AB_BANKINFO* AB_BankInfo_List2_GetFront | ( | AB_BANKINFO_LIST2 * | l | ) |
Returns the first element of the list. (The element is not removed from the list.)
| unsigned int AB_BankInfo_List2_GetSize | ( | AB_BANKINFO_LIST2 * | l | ) |
Returns the size of this list, i.e. the number of elements in this list.
This number is counted in the list metadata, so this is a cheap operation.
| AB_BANKINFO_LIST2_ITERATOR* AB_BankInfo_List2_Last | ( | AB_BANKINFO_LIST2 * | l | ) |
Returns a list iterator pointing to the last element.
| AB_BANKINFO_LIST2* AB_BankInfo_List2_new | ( | ) |
Creates a new list. This mus be freed using AB_BankInfo_List2_free.
| void AB_BankInfo_List2_PopBack | ( | AB_BANKINFO_LIST2 * | l | ) |
Removes the list's last element from the list. (The element is not freed.)
| void AB_BankInfo_List2_PopFront | ( | AB_BANKINFO_LIST2 * | l | ) |
Removes the list's first element from the list. (The element is not freed.)
| void AB_BankInfo_List2_PushBack | ( | AB_BANKINFO_LIST2 * | l, |
| AB_BANKINFO * | p | ||
| ) |
Appends an element to a list making it the new last element.
| void AB_BankInfo_List2_PushFront | ( | AB_BANKINFO_LIST2 * | l, |
| AB_BANKINFO * | p | ||
| ) |
Inserts an element at the start of the list, making it the new first element.
| AB_BANKINFO* AB_BankInfo_List2Iterator_Data | ( | AB_BANKINFO_LIST2_ITERATOR * | li | ) |
Returns the pointer to the element stored at the list position the iterator currently points to.
| void AB_BankInfo_List2Iterator_free | ( | AB_BANKINFO_LIST2_ITERATOR * | li | ) |
Destroys the list iterator.
| AB_BANKINFO_LIST2_ITERATOR* AB_BankInfo_List2Iterator_new | ( | AB_BANKINFO_LIST2 * | l | ) |
Creates a list iterator for the given list. (FIXME: Should be private).
| AB_BANKINFO* AB_BankInfo_List2Iterator_Next | ( | AB_BANKINFO_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the successor of the currenty selected element and returns that successor element.
| AB_BANKINFO* AB_BankInfo_List2Iterator_Previous | ( | AB_BANKINFO_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the predecessor of the currenty selected element and returns that predecessor element.
| void AB_BankInfo_List_Add | ( | AB_BANKINFO * | element, |
| AB_BANKINFO_LIST * | list | ||
| ) |
Adds the given element to the given list making it the new tail.
| void AB_BankInfo_List_AddList | ( | AB_BANKINFO_LIST * | dst, |
| AB_BANKINFO_LIST * | l | ||
| ) |
Moves the content of one list to another list thus leaving the old list empty.
| void AB_BankInfo_List_Clear | ( | AB_BANKINFO_LIST * | l | ) |
Clears the given list (thus leaving it empty). All elements of this list are deleted via AB_BankInfo_free();
| void AB_BankInfo_List_Del | ( | AB_BANKINFO * | element | ) |
Unlinks the given element from whatever list it may currently be enlisted. If the element is not member of any list the program is aborted. Please note: The element is just unlinked, not deleted.
| AB_BANKINFO* AB_BankInfo_List_First | ( | const AB_BANKINFO_LIST * | l | ) |
Returns the first element of the list.
| void AB_BankInfo_List_free | ( | AB_BANKINFO_LIST * | l | ) |
Destroys the list and frees all its elements.
| uint32_t AB_BankInfo_List_GetCount | ( | const AB_BANKINFO_LIST * | l | ) |
Returns the number of elements currently in the given list.
| void AB_BankInfo_List_Insert | ( | AB_BANKINFO * | element, |
| AB_BANKINFO_LIST * | list | ||
| ) |
Inserts the given element into the given list thus making it the new head of the list.
| AB_BANKINFO* AB_BankInfo_List_Last | ( | const AB_BANKINFO_LIST * | l | ) |
Returns the last element of the list.
| AB_BANKINFO_LIST* AB_BankInfo_List_new | ( | ) |
Creates a new list of AB_BANKINFO.
| AB_BANKINFO* AB_BankInfo_List_Next | ( | const AB_BANKINFO * | element | ) |
Returns the successor of the given element.
| AB_BANKINFO* AB_BankInfo_List_Previous | ( | const AB_BANKINFO * | element | ) |
Returns the predecessor of the given element.
| AB_BANKINFO_LIST_SORT_FN AB_BankInfo_List_SetSortFn | ( | AB_BANKINFO_LIST * | l, |
| AB_BANKINFO_LIST_SORT_FN | fn | ||
| ) |
Set the sort function for the next calls to AB_BankInfo_List_Sort().
| void AB_BankInfo_List_Sort | ( | AB_BANKINFO_LIST * | l, |
| int | ascending | ||
| ) |
Sort the list. Within the course of this function the sort function set via AB_BankInfo_List_SetSortFn is called with the arguments "const AB_BANKINFO *a, const AB_BANKINFO *b, int ascending".
| void AB_BankInfoPlugin_ConstList2_Clear | ( | AB_BANKINFO_PLUGIN_CONSTLIST2 * | l | ) |
| AB_BANKINFO_PLUGIN_CONSTLIST2_ITERATOR* AB_BankInfoPlugin_ConstList2_First | ( | AB_BANKINFO_PLUGIN_CONSTLIST2 * | l | ) |
| const AB_BANKINFO_PLUGIN* AB_BankInfoPlugin_ConstList2_ForEach | ( | AB_BANKINFO_PLUGIN_CONSTLIST2 * | list, |
| AB_BANKINFO_PLUGIN_CONSTLIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_BankInfoPlugin_ConstList2_free | ( | AB_BANKINFO_PLUGIN_CONSTLIST2 * | l | ) |
| const AB_BANKINFO_PLUGIN* AB_BankInfoPlugin_ConstList2_GetBack | ( | AB_BANKINFO_PLUGIN_CONSTLIST2 * | l | ) |
| const AB_BANKINFO_PLUGIN* AB_BankInfoPlugin_ConstList2_GetFront | ( | AB_BANKINFO_PLUGIN_CONSTLIST2 * | l | ) |
| unsigned int AB_BankInfoPlugin_ConstList2_GetSize | ( | AB_BANKINFO_PLUGIN_CONSTLIST2 * | l | ) |
| AB_BANKINFO_PLUGIN_CONSTLIST2_ITERATOR* AB_BankInfoPlugin_ConstList2_Last | ( | AB_BANKINFO_PLUGIN_CONSTLIST2 * | l | ) |
| AB_BANKINFO_PLUGIN_CONSTLIST2* AB_BankInfoPlugin_ConstList2_new | ( | ) |
| void AB_BankInfoPlugin_ConstList2_PopBack | ( | AB_BANKINFO_PLUGIN_CONSTLIST2 * | l | ) |
| void AB_BankInfoPlugin_ConstList2_PopFront | ( | AB_BANKINFO_PLUGIN_CONSTLIST2 * | l | ) |
| void AB_BankInfoPlugin_ConstList2_PushBack | ( | AB_BANKINFO_PLUGIN_CONSTLIST2 * | l, |
| const AB_BANKINFO_PLUGIN * | p | ||
| ) |
| void AB_BankInfoPlugin_ConstList2_PushFront | ( | AB_BANKINFO_PLUGIN_CONSTLIST2 * | l, |
| const AB_BANKINFO_PLUGIN * | p | ||
| ) |
| const AB_BANKINFO_PLUGIN* AB_BankInfoPlugin_ConstList2Iterator_Data | ( | AB_BANKINFO_PLUGIN_CONSTLIST2_ITERATOR * | li | ) |
| void AB_BankInfoPlugin_ConstList2Iterator_free | ( | AB_BANKINFO_PLUGIN_CONSTLIST2_ITERATOR * | li | ) |
| AB_BANKINFO_PLUGIN_CONSTLIST2_ITERATOR* AB_BankInfoPlugin_ConstList2Iterator_new | ( | AB_BANKINFO_PLUGIN_CONSTLIST2 * | l | ) |
| const AB_BANKINFO_PLUGIN* AB_BankInfoPlugin_ConstList2Iterator_Next | ( | AB_BANKINFO_PLUGIN_CONSTLIST2_ITERATOR * | li | ) |
| const AB_BANKINFO_PLUGIN* AB_BankInfoPlugin_ConstList2Iterator_Previous | ( | AB_BANKINFO_PLUGIN_CONSTLIST2_ITERATOR * | li | ) |
| void AB_BankInfoPlugin_List2_Clear | ( | AB_BANKINFO_PLUGIN_LIST2 * | l | ) |
Removes all list elements from the list. (The elements are not freed.)
| void AB_BankInfoPlugin_List2_Dump | ( | AB_BANKINFO_PLUGIN_LIST2 * | l, |
| FILE * | f, | ||
| unsigned int | indent | ||
| ) |
Dumps the contents of the list to an open file (e.g. stderr).
| void AB_BankInfoPlugin_List2_Erase | ( | AB_BANKINFO_PLUGIN_LIST2 * | l, |
| AB_BANKINFO_PLUGIN_LIST2_ITERATOR * | it | ||
| ) |
Removes the element currently pointed to by the given iterator from the list.
| AB_BANKINFO_PLUGIN_LIST2_ITERATOR* AB_BankInfoPlugin_List2_First | ( | AB_BANKINFO_PLUGIN_LIST2 * | l | ) |
Returns a list iterator pointing to the first element.
| AB_BANKINFO_PLUGIN* AB_BankInfoPlugin_List2_ForEach | ( | AB_BANKINFO_PLUGIN_LIST2 * | list, |
| AB_BANKINFO_PLUGIN_LIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_BankInfoPlugin_List2_free | ( | AB_BANKINFO_PLUGIN_LIST2 * | l | ) |
Destroys the list. Please note that the members in this list are not destroyed!
| AB_BANKINFO_PLUGIN* AB_BankInfoPlugin_List2_GetBack | ( | AB_BANKINFO_PLUGIN_LIST2 * | l | ) |
Returns the last element of the list. (The element is not removed from the list.)
| AB_BANKINFO_PLUGIN* AB_BankInfoPlugin_List2_GetFront | ( | AB_BANKINFO_PLUGIN_LIST2 * | l | ) |
Returns the first element of the list. (The element is not removed from the list.)
| unsigned int AB_BankInfoPlugin_List2_GetSize | ( | AB_BANKINFO_PLUGIN_LIST2 * | l | ) |
Returns the size of this list, i.e. the number of elements in this list.
This number is counted in the list metadata, so this is a cheap operation.
| AB_BANKINFO_PLUGIN_LIST2_ITERATOR* AB_BankInfoPlugin_List2_Last | ( | AB_BANKINFO_PLUGIN_LIST2 * | l | ) |
Returns a list iterator pointing to the last element.
| AB_BANKINFO_PLUGIN_LIST2* AB_BankInfoPlugin_List2_new | ( | ) |
Creates a new list. This mus be freed using AB_BankInfoPlugin_List2_free.
| void AB_BankInfoPlugin_List2_PopBack | ( | AB_BANKINFO_PLUGIN_LIST2 * | l | ) |
Removes the list's last element from the list. (The element is not freed.)
| void AB_BankInfoPlugin_List2_PopFront | ( | AB_BANKINFO_PLUGIN_LIST2 * | l | ) |
Removes the list's first element from the list. (The element is not freed.)
| void AB_BankInfoPlugin_List2_PushBack | ( | AB_BANKINFO_PLUGIN_LIST2 * | l, |
| AB_BANKINFO_PLUGIN * | p | ||
| ) |
Appends an element to a list making it the new last element.
| void AB_BankInfoPlugin_List2_PushFront | ( | AB_BANKINFO_PLUGIN_LIST2 * | l, |
| AB_BANKINFO_PLUGIN * | p | ||
| ) |
Inserts an element at the start of the list, making it the new first element.
| AB_BANKINFO_PLUGIN* AB_BankInfoPlugin_List2Iterator_Data | ( | AB_BANKINFO_PLUGIN_LIST2_ITERATOR * | li | ) |
Returns the pointer to the element stored at the list position the iterator currently points to.
| void AB_BankInfoPlugin_List2Iterator_free | ( | AB_BANKINFO_PLUGIN_LIST2_ITERATOR * | li | ) |
Destroys the list iterator.
| AB_BANKINFO_PLUGIN_LIST2_ITERATOR* AB_BankInfoPlugin_List2Iterator_new | ( | AB_BANKINFO_PLUGIN_LIST2 * | l | ) |
Creates a list iterator for the given list. (FIXME: Should be private).
| AB_BANKINFO_PLUGIN* AB_BankInfoPlugin_List2Iterator_Next | ( | AB_BANKINFO_PLUGIN_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the successor of the currenty selected element and returns that successor element.
| AB_BANKINFO_PLUGIN* AB_BankInfoPlugin_List2Iterator_Previous | ( | AB_BANKINFO_PLUGIN_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the predecessor of the currenty selected element and returns that predecessor element.
| void AB_BankInfoService_ConstList2_Clear | ( | AB_BANKINFO_SERVICE_CONSTLIST2 * | l | ) |
| AB_BANKINFO_SERVICE_CONSTLIST2_ITERATOR* AB_BankInfoService_ConstList2_First | ( | AB_BANKINFO_SERVICE_CONSTLIST2 * | l | ) |
| const AB_BANKINFO_SERVICE* AB_BankInfoService_ConstList2_ForEach | ( | AB_BANKINFO_SERVICE_CONSTLIST2 * | list, |
| AB_BANKINFO_SERVICE_CONSTLIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_BankInfoService_ConstList2_free | ( | AB_BANKINFO_SERVICE_CONSTLIST2 * | l | ) |
| const AB_BANKINFO_SERVICE* AB_BankInfoService_ConstList2_GetBack | ( | AB_BANKINFO_SERVICE_CONSTLIST2 * | l | ) |
| const AB_BANKINFO_SERVICE* AB_BankInfoService_ConstList2_GetFront | ( | AB_BANKINFO_SERVICE_CONSTLIST2 * | l | ) |
| unsigned int AB_BankInfoService_ConstList2_GetSize | ( | AB_BANKINFO_SERVICE_CONSTLIST2 * | l | ) |
| AB_BANKINFO_SERVICE_CONSTLIST2_ITERATOR* AB_BankInfoService_ConstList2_Last | ( | AB_BANKINFO_SERVICE_CONSTLIST2 * | l | ) |
| AB_BANKINFO_SERVICE_CONSTLIST2* AB_BankInfoService_ConstList2_new | ( | ) |
| void AB_BankInfoService_ConstList2_PopBack | ( | AB_BANKINFO_SERVICE_CONSTLIST2 * | l | ) |
| void AB_BankInfoService_ConstList2_PopFront | ( | AB_BANKINFO_SERVICE_CONSTLIST2 * | l | ) |
| void AB_BankInfoService_ConstList2_PushBack | ( | AB_BANKINFO_SERVICE_CONSTLIST2 * | l, |
| const AB_BANKINFO_SERVICE * | p | ||
| ) |
| void AB_BankInfoService_ConstList2_PushFront | ( | AB_BANKINFO_SERVICE_CONSTLIST2 * | l, |
| const AB_BANKINFO_SERVICE * | p | ||
| ) |
| const AB_BANKINFO_SERVICE* AB_BankInfoService_ConstList2Iterator_Data | ( | AB_BANKINFO_SERVICE_CONSTLIST2_ITERATOR * | li | ) |
| void AB_BankInfoService_ConstList2Iterator_free | ( | AB_BANKINFO_SERVICE_CONSTLIST2_ITERATOR * | li | ) |
| AB_BANKINFO_SERVICE_CONSTLIST2_ITERATOR* AB_BankInfoService_ConstList2Iterator_new | ( | AB_BANKINFO_SERVICE_CONSTLIST2 * | l | ) |
| const AB_BANKINFO_SERVICE* AB_BankInfoService_ConstList2Iterator_Next | ( | AB_BANKINFO_SERVICE_CONSTLIST2_ITERATOR * | li | ) |
| const AB_BANKINFO_SERVICE* AB_BankInfoService_ConstList2Iterator_Previous | ( | AB_BANKINFO_SERVICE_CONSTLIST2_ITERATOR * | li | ) |
| void AB_BankInfoService_List2_Clear | ( | AB_BANKINFO_SERVICE_LIST2 * | l | ) |
Removes all list elements from the list. (The elements are not freed.)
| void AB_BankInfoService_List2_Dump | ( | AB_BANKINFO_SERVICE_LIST2 * | l, |
| FILE * | f, | ||
| unsigned int | indent | ||
| ) |
Dumps the contents of the list to an open file (e.g. stderr).
| void AB_BankInfoService_List2_Erase | ( | AB_BANKINFO_SERVICE_LIST2 * | l, |
| AB_BANKINFO_SERVICE_LIST2_ITERATOR * | it | ||
| ) |
Removes the element currently pointed to by the given iterator from the list.
| AB_BANKINFO_SERVICE_LIST2_ITERATOR* AB_BankInfoService_List2_First | ( | AB_BANKINFO_SERVICE_LIST2 * | l | ) |
Returns a list iterator pointing to the first element.
| AB_BANKINFO_SERVICE* AB_BankInfoService_List2_ForEach | ( | AB_BANKINFO_SERVICE_LIST2 * | list, |
| AB_BANKINFO_SERVICE_LIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_BankInfoService_List2_free | ( | AB_BANKINFO_SERVICE_LIST2 * | l | ) |
Destroys the list. Please note that the members in this list are not destroyed!
| AB_BANKINFO_SERVICE* AB_BankInfoService_List2_GetBack | ( | AB_BANKINFO_SERVICE_LIST2 * | l | ) |
Returns the last element of the list. (The element is not removed from the list.)
| AB_BANKINFO_SERVICE* AB_BankInfoService_List2_GetFront | ( | AB_BANKINFO_SERVICE_LIST2 * | l | ) |
Returns the first element of the list. (The element is not removed from the list.)
| unsigned int AB_BankInfoService_List2_GetSize | ( | AB_BANKINFO_SERVICE_LIST2 * | l | ) |
Returns the size of this list, i.e. the number of elements in this list.
This number is counted in the list metadata, so this is a cheap operation.
| AB_BANKINFO_SERVICE_LIST2_ITERATOR* AB_BankInfoService_List2_Last | ( | AB_BANKINFO_SERVICE_LIST2 * | l | ) |
Returns a list iterator pointing to the last element.
| AB_BANKINFO_SERVICE_LIST2* AB_BankInfoService_List2_new | ( | ) |
Creates a new list. This mus be freed using AB_BankInfoService_List2_free.
| void AB_BankInfoService_List2_PopBack | ( | AB_BANKINFO_SERVICE_LIST2 * | l | ) |
Removes the list's last element from the list. (The element is not freed.)
| void AB_BankInfoService_List2_PopFront | ( | AB_BANKINFO_SERVICE_LIST2 * | l | ) |
Removes the list's first element from the list. (The element is not freed.)
| void AB_BankInfoService_List2_PushBack | ( | AB_BANKINFO_SERVICE_LIST2 * | l, |
| AB_BANKINFO_SERVICE * | p | ||
| ) |
Appends an element to a list making it the new last element.
| void AB_BankInfoService_List2_PushFront | ( | AB_BANKINFO_SERVICE_LIST2 * | l, |
| AB_BANKINFO_SERVICE * | p | ||
| ) |
Inserts an element at the start of the list, making it the new first element.
| AB_BANKINFO_SERVICE* AB_BankInfoService_List2Iterator_Data | ( | AB_BANKINFO_SERVICE_LIST2_ITERATOR * | li | ) |
Returns the pointer to the element stored at the list position the iterator currently points to.
| void AB_BankInfoService_List2Iterator_free | ( | AB_BANKINFO_SERVICE_LIST2_ITERATOR * | li | ) |
Destroys the list iterator.
| AB_BANKINFO_SERVICE_LIST2_ITERATOR* AB_BankInfoService_List2Iterator_new | ( | AB_BANKINFO_SERVICE_LIST2 * | l | ) |
Creates a list iterator for the given list. (FIXME: Should be private).
| AB_BANKINFO_SERVICE* AB_BankInfoService_List2Iterator_Next | ( | AB_BANKINFO_SERVICE_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the successor of the currenty selected element and returns that successor element.
| AB_BANKINFO_SERVICE* AB_BankInfoService_List2Iterator_Previous | ( | AB_BANKINFO_SERVICE_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the predecessor of the currenty selected element and returns that predecessor element.
| void AB_BankInfoService_List_Add | ( | AB_BANKINFO_SERVICE * | element, |
| AB_BANKINFO_SERVICE_LIST * | list | ||
| ) |
Adds the given element to the given list making it the new tail.
| void AB_BankInfoService_List_AddList | ( | AB_BANKINFO_SERVICE_LIST * | dst, |
| AB_BANKINFO_SERVICE_LIST * | l | ||
| ) |
Moves the content of one list to another list thus leaving the old list empty.
| void AB_BankInfoService_List_Clear | ( | AB_BANKINFO_SERVICE_LIST * | l | ) |
Clears the given list (thus leaving it empty). All elements of this list are deleted via AB_BankInfoService_free();
| void AB_BankInfoService_List_Del | ( | AB_BANKINFO_SERVICE * | element | ) |
Unlinks the given element from whatever list it may currently be enlisted. If the element is not member of any list the program is aborted. Please note: The element is just unlinked, not deleted.
| AB_BANKINFO_SERVICE* AB_BankInfoService_List_First | ( | const AB_BANKINFO_SERVICE_LIST * | l | ) |
Returns the first element of the list.
| void AB_BankInfoService_List_free | ( | AB_BANKINFO_SERVICE_LIST * | l | ) |
Destroys the list and frees all its elements.
| uint32_t AB_BankInfoService_List_GetCount | ( | const AB_BANKINFO_SERVICE_LIST * | l | ) |
Returns the number of elements currently in the given list.
| void AB_BankInfoService_List_Insert | ( | AB_BANKINFO_SERVICE * | element, |
| AB_BANKINFO_SERVICE_LIST * | list | ||
| ) |
Inserts the given element into the given list thus making it the new head of the list.
| AB_BANKINFO_SERVICE* AB_BankInfoService_List_Last | ( | const AB_BANKINFO_SERVICE_LIST * | l | ) |
Returns the last element of the list.
| AB_BANKINFO_SERVICE_LIST* AB_BankInfoService_List_new | ( | ) |
Creates a new list of AB_BANKINFO_SERVICE.
| AB_BANKINFO_SERVICE* AB_BankInfoService_List_Next | ( | const AB_BANKINFO_SERVICE * | element | ) |
Returns the successor of the given element.
| AB_BANKINFO_SERVICE* AB_BankInfoService_List_Previous | ( | const AB_BANKINFO_SERVICE * | element | ) |
Returns the predecessor of the given element.
| AB_BANKINFO_SERVICE_LIST_SORT_FN AB_BankInfoService_List_SetSortFn | ( | AB_BANKINFO_SERVICE_LIST * | l, |
| AB_BANKINFO_SERVICE_LIST_SORT_FN | fn | ||
| ) |
Set the sort function for the next calls to AB_BankInfoService_List_Sort().
| void AB_BankInfoService_List_Sort | ( | AB_BANKINFO_SERVICE_LIST * | l, |
| int | ascending | ||
| ) |
Sort the list. Within the course of this function the sort function set via AB_BankInfoService_List_SetSortFn is called with the arguments "const AB_BANKINFO_SERVICE *a, const AB_BANKINFO_SERVICE *b, int ascending".
| void AB_CellPhoneProduct_ConstList2_Clear | ( | AB_CELLPHONE_PRODUCT_CONSTLIST2 * | l | ) |
| AB_CELLPHONE_PRODUCT_CONSTLIST2_ITERATOR* AB_CellPhoneProduct_ConstList2_First | ( | AB_CELLPHONE_PRODUCT_CONSTLIST2 * | l | ) |
| const AB_CELLPHONE_PRODUCT* AB_CellPhoneProduct_ConstList2_ForEach | ( | AB_CELLPHONE_PRODUCT_CONSTLIST2 * | list, |
| AB_CELLPHONE_PRODUCT_CONSTLIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_CellPhoneProduct_ConstList2_free | ( | AB_CELLPHONE_PRODUCT_CONSTLIST2 * | l | ) |
| const AB_CELLPHONE_PRODUCT* AB_CellPhoneProduct_ConstList2_GetBack | ( | AB_CELLPHONE_PRODUCT_CONSTLIST2 * | l | ) |
| const AB_CELLPHONE_PRODUCT* AB_CellPhoneProduct_ConstList2_GetFront | ( | AB_CELLPHONE_PRODUCT_CONSTLIST2 * | l | ) |
| unsigned int AB_CellPhoneProduct_ConstList2_GetSize | ( | AB_CELLPHONE_PRODUCT_CONSTLIST2 * | l | ) |
| AB_CELLPHONE_PRODUCT_CONSTLIST2_ITERATOR* AB_CellPhoneProduct_ConstList2_Last | ( | AB_CELLPHONE_PRODUCT_CONSTLIST2 * | l | ) |
| AB_CELLPHONE_PRODUCT_CONSTLIST2* AB_CellPhoneProduct_ConstList2_new | ( | ) |
| void AB_CellPhoneProduct_ConstList2_PopBack | ( | AB_CELLPHONE_PRODUCT_CONSTLIST2 * | l | ) |
| void AB_CellPhoneProduct_ConstList2_PopFront | ( | AB_CELLPHONE_PRODUCT_CONSTLIST2 * | l | ) |
| void AB_CellPhoneProduct_ConstList2_PushBack | ( | AB_CELLPHONE_PRODUCT_CONSTLIST2 * | l, |
| const AB_CELLPHONE_PRODUCT * | p | ||
| ) |
| void AB_CellPhoneProduct_ConstList2_PushFront | ( | AB_CELLPHONE_PRODUCT_CONSTLIST2 * | l, |
| const AB_CELLPHONE_PRODUCT * | p | ||
| ) |
| const AB_CELLPHONE_PRODUCT* AB_CellPhoneProduct_ConstList2Iterator_Data | ( | AB_CELLPHONE_PRODUCT_CONSTLIST2_ITERATOR * | li | ) |
| void AB_CellPhoneProduct_ConstList2Iterator_free | ( | AB_CELLPHONE_PRODUCT_CONSTLIST2_ITERATOR * | li | ) |
| AB_CELLPHONE_PRODUCT_CONSTLIST2_ITERATOR* AB_CellPhoneProduct_ConstList2Iterator_new | ( | AB_CELLPHONE_PRODUCT_CONSTLIST2 * | l | ) |
| const AB_CELLPHONE_PRODUCT* AB_CellPhoneProduct_ConstList2Iterator_Next | ( | AB_CELLPHONE_PRODUCT_CONSTLIST2_ITERATOR * | li | ) |
| const AB_CELLPHONE_PRODUCT* AB_CellPhoneProduct_ConstList2Iterator_Previous | ( | AB_CELLPHONE_PRODUCT_CONSTLIST2_ITERATOR * | li | ) |
| void AB_CellPhoneProduct_List2_Clear | ( | AB_CELLPHONE_PRODUCT_LIST2 * | l | ) |
Removes all list elements from the list. (The elements are not freed.)
| void AB_CellPhoneProduct_List2_Dump | ( | AB_CELLPHONE_PRODUCT_LIST2 * | l, |
| FILE * | f, | ||
| unsigned int | indent | ||
| ) |
Dumps the contents of the list to an open file (e.g. stderr).
| void AB_CellPhoneProduct_List2_Erase | ( | AB_CELLPHONE_PRODUCT_LIST2 * | l, |
| AB_CELLPHONE_PRODUCT_LIST2_ITERATOR * | it | ||
| ) |
Removes the element currently pointed to by the given iterator from the list.
| AB_CELLPHONE_PRODUCT_LIST2_ITERATOR* AB_CellPhoneProduct_List2_First | ( | AB_CELLPHONE_PRODUCT_LIST2 * | l | ) |
Returns a list iterator pointing to the first element.
| AB_CELLPHONE_PRODUCT* AB_CellPhoneProduct_List2_ForEach | ( | AB_CELLPHONE_PRODUCT_LIST2 * | list, |
| AB_CELLPHONE_PRODUCT_LIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_CellPhoneProduct_List2_free | ( | AB_CELLPHONE_PRODUCT_LIST2 * | l | ) |
Destroys the list. Please note that the members in this list are not destroyed!
| AB_CELLPHONE_PRODUCT* AB_CellPhoneProduct_List2_GetBack | ( | AB_CELLPHONE_PRODUCT_LIST2 * | l | ) |
Returns the last element of the list. (The element is not removed from the list.)
| AB_CELLPHONE_PRODUCT* AB_CellPhoneProduct_List2_GetFront | ( | AB_CELLPHONE_PRODUCT_LIST2 * | l | ) |
Returns the first element of the list. (The element is not removed from the list.)
| unsigned int AB_CellPhoneProduct_List2_GetSize | ( | AB_CELLPHONE_PRODUCT_LIST2 * | l | ) |
Returns the size of this list, i.e. the number of elements in this list.
This number is counted in the list metadata, so this is a cheap operation.
| AB_CELLPHONE_PRODUCT_LIST2_ITERATOR* AB_CellPhoneProduct_List2_Last | ( | AB_CELLPHONE_PRODUCT_LIST2 * | l | ) |
Returns a list iterator pointing to the last element.
| AB_CELLPHONE_PRODUCT_LIST2* AB_CellPhoneProduct_List2_new | ( | ) |
Creates a new list. This mus be freed using AB_CellPhoneProduct_List2_free.
| void AB_CellPhoneProduct_List2_PopBack | ( | AB_CELLPHONE_PRODUCT_LIST2 * | l | ) |
Removes the list's last element from the list. (The element is not freed.)
| void AB_CellPhoneProduct_List2_PopFront | ( | AB_CELLPHONE_PRODUCT_LIST2 * | l | ) |
Removes the list's first element from the list. (The element is not freed.)
| void AB_CellPhoneProduct_List2_PushBack | ( | AB_CELLPHONE_PRODUCT_LIST2 * | l, |
| AB_CELLPHONE_PRODUCT * | p | ||
| ) |
Appends an element to a list making it the new last element.
| void AB_CellPhoneProduct_List2_PushFront | ( | AB_CELLPHONE_PRODUCT_LIST2 * | l, |
| AB_CELLPHONE_PRODUCT * | p | ||
| ) |
Inserts an element at the start of the list, making it the new first element.
| AB_CELLPHONE_PRODUCT* AB_CellPhoneProduct_List2Iterator_Data | ( | AB_CELLPHONE_PRODUCT_LIST2_ITERATOR * | li | ) |
Returns the pointer to the element stored at the list position the iterator currently points to.
| void AB_CellPhoneProduct_List2Iterator_free | ( | AB_CELLPHONE_PRODUCT_LIST2_ITERATOR * | li | ) |
Destroys the list iterator.
| AB_CELLPHONE_PRODUCT_LIST2_ITERATOR* AB_CellPhoneProduct_List2Iterator_new | ( | AB_CELLPHONE_PRODUCT_LIST2 * | l | ) |
Creates a list iterator for the given list. (FIXME: Should be private).
| AB_CELLPHONE_PRODUCT* AB_CellPhoneProduct_List2Iterator_Next | ( | AB_CELLPHONE_PRODUCT_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the successor of the currenty selected element and returns that successor element.
| AB_CELLPHONE_PRODUCT* AB_CellPhoneProduct_List2Iterator_Previous | ( | AB_CELLPHONE_PRODUCT_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the predecessor of the currenty selected element and returns that predecessor element.
| void AB_CellPhoneProduct_List_Add | ( | AB_CELLPHONE_PRODUCT * | element, |
| AB_CELLPHONE_PRODUCT_LIST * | list | ||
| ) |
Adds the given element to the given list making it the new tail.
| void AB_CellPhoneProduct_List_AddList | ( | AB_CELLPHONE_PRODUCT_LIST * | dst, |
| AB_CELLPHONE_PRODUCT_LIST * | l | ||
| ) |
Moves the content of one list to another list thus leaving the old list empty.
| void AB_CellPhoneProduct_List_Clear | ( | AB_CELLPHONE_PRODUCT_LIST * | l | ) |
Clears the given list (thus leaving it empty). All elements of this list are deleted via AB_CellPhoneProduct_free();
| void AB_CellPhoneProduct_List_Del | ( | AB_CELLPHONE_PRODUCT * | element | ) |
Unlinks the given element from whatever list it may currently be enlisted. If the element is not member of any list the program is aborted. Please note: The element is just unlinked, not deleted.
| AB_CELLPHONE_PRODUCT* AB_CellPhoneProduct_List_First | ( | const AB_CELLPHONE_PRODUCT_LIST * | l | ) |
Returns the first element of the list.
| void AB_CellPhoneProduct_List_free | ( | AB_CELLPHONE_PRODUCT_LIST * | l | ) |
Destroys the list and frees all its elements.
| uint32_t AB_CellPhoneProduct_List_GetCount | ( | const AB_CELLPHONE_PRODUCT_LIST * | l | ) |
Returns the number of elements currently in the given list.
| void AB_CellPhoneProduct_List_Insert | ( | AB_CELLPHONE_PRODUCT * | element, |
| AB_CELLPHONE_PRODUCT_LIST * | list | ||
| ) |
Inserts the given element into the given list thus making it the new head of the list.
| AB_CELLPHONE_PRODUCT* AB_CellPhoneProduct_List_Last | ( | const AB_CELLPHONE_PRODUCT_LIST * | l | ) |
Returns the last element of the list.
| AB_CELLPHONE_PRODUCT_LIST* AB_CellPhoneProduct_List_new | ( | ) |
Creates a new list of AB_CELLPHONE_PRODUCT.
| AB_CELLPHONE_PRODUCT* AB_CellPhoneProduct_List_Next | ( | const AB_CELLPHONE_PRODUCT * | element | ) |
Returns the successor of the given element.
| AB_CELLPHONE_PRODUCT* AB_CellPhoneProduct_List_Previous | ( | const AB_CELLPHONE_PRODUCT * | element | ) |
Returns the predecessor of the given element.
| AB_CELLPHONE_PRODUCT_LIST_SORT_FN AB_CellPhoneProduct_List_SetSortFn | ( | AB_CELLPHONE_PRODUCT_LIST * | l, |
| AB_CELLPHONE_PRODUCT_LIST_SORT_FN | fn | ||
| ) |
Set the sort function for the next calls to AB_CellPhoneProduct_List_Sort().
| void AB_CellPhoneProduct_List_Sort | ( | AB_CELLPHONE_PRODUCT_LIST * | l, |
| int | ascending | ||
| ) |
Sort the list. Within the course of this function the sort function set via AB_CellPhoneProduct_List_SetSortFn is called with the arguments "const AB_CELLPHONE_PRODUCT *a, const AB_CELLPHONE_PRODUCT *b, int ascending".
| void AB_Country_ConstList2_Clear | ( | AB_COUNTRY_CONSTLIST2 * | l | ) |
| AB_COUNTRY_CONSTLIST2_ITERATOR* AB_Country_ConstList2_First | ( | AB_COUNTRY_CONSTLIST2 * | l | ) |
| const AB_COUNTRY* AB_Country_ConstList2_ForEach | ( | AB_COUNTRY_CONSTLIST2 * | list, |
| AB_COUNTRY_CONSTLIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_Country_ConstList2_free | ( | AB_COUNTRY_CONSTLIST2 * | l | ) |
| const AB_COUNTRY* AB_Country_ConstList2_GetBack | ( | AB_COUNTRY_CONSTLIST2 * | l | ) |
| const AB_COUNTRY* AB_Country_ConstList2_GetFront | ( | AB_COUNTRY_CONSTLIST2 * | l | ) |
| unsigned int AB_Country_ConstList2_GetSize | ( | AB_COUNTRY_CONSTLIST2 * | l | ) |
| AB_COUNTRY_CONSTLIST2_ITERATOR* AB_Country_ConstList2_Last | ( | AB_COUNTRY_CONSTLIST2 * | l | ) |
| AB_COUNTRY_CONSTLIST2* AB_Country_ConstList2_new | ( | ) |
| void AB_Country_ConstList2_PopBack | ( | AB_COUNTRY_CONSTLIST2 * | l | ) |
| void AB_Country_ConstList2_PopFront | ( | AB_COUNTRY_CONSTLIST2 * | l | ) |
| void AB_Country_ConstList2_PushBack | ( | AB_COUNTRY_CONSTLIST2 * | l, |
| const AB_COUNTRY * | p | ||
| ) |
| void AB_Country_ConstList2_PushFront | ( | AB_COUNTRY_CONSTLIST2 * | l, |
| const AB_COUNTRY * | p | ||
| ) |
| const AB_COUNTRY* AB_Country_ConstList2Iterator_Data | ( | AB_COUNTRY_CONSTLIST2_ITERATOR * | li | ) |
| void AB_Country_ConstList2Iterator_free | ( | AB_COUNTRY_CONSTLIST2_ITERATOR * | li | ) |
| AB_COUNTRY_CONSTLIST2_ITERATOR* AB_Country_ConstList2Iterator_new | ( | AB_COUNTRY_CONSTLIST2 * | l | ) |
| const AB_COUNTRY* AB_Country_ConstList2Iterator_Next | ( | AB_COUNTRY_CONSTLIST2_ITERATOR * | li | ) |
| const AB_COUNTRY* AB_Country_ConstList2Iterator_Previous | ( | AB_COUNTRY_CONSTLIST2_ITERATOR * | li | ) |
| void AB_Country_List2_Clear | ( | AB_COUNTRY_LIST2 * | l | ) |
Removes all list elements from the list. (The elements are not freed.)
| void AB_Country_List2_Dump | ( | AB_COUNTRY_LIST2 * | l, |
| FILE * | f, | ||
| unsigned int | indent | ||
| ) |
Dumps the contents of the list to an open file (e.g. stderr).
| void AB_Country_List2_Erase | ( | AB_COUNTRY_LIST2 * | l, |
| AB_COUNTRY_LIST2_ITERATOR * | it | ||
| ) |
Removes the element currently pointed to by the given iterator from the list.
| AB_COUNTRY_LIST2_ITERATOR* AB_Country_List2_First | ( | AB_COUNTRY_LIST2 * | l | ) |
Returns a list iterator pointing to the first element.
| AB_COUNTRY* AB_Country_List2_ForEach | ( | AB_COUNTRY_LIST2 * | list, |
| AB_COUNTRY_LIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_Country_List2_free | ( | AB_COUNTRY_LIST2 * | l | ) |
Destroys the list. Please note that the members in this list are not destroyed!
| AB_COUNTRY* AB_Country_List2_GetBack | ( | AB_COUNTRY_LIST2 * | l | ) |
Returns the last element of the list. (The element is not removed from the list.)
| AB_COUNTRY* AB_Country_List2_GetFront | ( | AB_COUNTRY_LIST2 * | l | ) |
Returns the first element of the list. (The element is not removed from the list.)
| unsigned int AB_Country_List2_GetSize | ( | AB_COUNTRY_LIST2 * | l | ) |
Returns the size of this list, i.e. the number of elements in this list.
This number is counted in the list metadata, so this is a cheap operation.
| AB_COUNTRY_LIST2_ITERATOR* AB_Country_List2_Last | ( | AB_COUNTRY_LIST2 * | l | ) |
Returns a list iterator pointing to the last element.
| AB_COUNTRY_LIST2* AB_Country_List2_new | ( | ) |
Creates a new list. This mus be freed using AB_Country_List2_free.
| void AB_Country_List2_PopBack | ( | AB_COUNTRY_LIST2 * | l | ) |
Removes the list's last element from the list. (The element is not freed.)
| void AB_Country_List2_PopFront | ( | AB_COUNTRY_LIST2 * | l | ) |
Removes the list's first element from the list. (The element is not freed.)
| void AB_Country_List2_PushBack | ( | AB_COUNTRY_LIST2 * | l, |
| AB_COUNTRY * | p | ||
| ) |
Appends an element to a list making it the new last element.
| void AB_Country_List2_PushFront | ( | AB_COUNTRY_LIST2 * | l, |
| AB_COUNTRY * | p | ||
| ) |
Inserts an element at the start of the list, making it the new first element.
| AB_COUNTRY* AB_Country_List2Iterator_Data | ( | AB_COUNTRY_LIST2_ITERATOR * | li | ) |
Returns the pointer to the element stored at the list position the iterator currently points to.
| void AB_Country_List2Iterator_free | ( | AB_COUNTRY_LIST2_ITERATOR * | li | ) |
Destroys the list iterator.
| AB_COUNTRY_LIST2_ITERATOR* AB_Country_List2Iterator_new | ( | AB_COUNTRY_LIST2 * | l | ) |
Creates a list iterator for the given list. (FIXME: Should be private).
| AB_COUNTRY* AB_Country_List2Iterator_Next | ( | AB_COUNTRY_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the successor of the currenty selected element and returns that successor element.
| AB_COUNTRY* AB_Country_List2Iterator_Previous | ( | AB_COUNTRY_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the predecessor of the currenty selected element and returns that predecessor element.
| void AB_EuTransferInfo_ConstList2_Clear | ( | AB_EUTRANSFER_INFO_CONSTLIST2 * | l | ) |
| AB_EUTRANSFER_INFO_CONSTLIST2_ITERATOR* AB_EuTransferInfo_ConstList2_First | ( | AB_EUTRANSFER_INFO_CONSTLIST2 * | l | ) |
| const AB_EUTRANSFER_INFO* AB_EuTransferInfo_ConstList2_ForEach | ( | AB_EUTRANSFER_INFO_CONSTLIST2 * | list, |
| AB_EUTRANSFER_INFO_CONSTLIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_EuTransferInfo_ConstList2_free | ( | AB_EUTRANSFER_INFO_CONSTLIST2 * | l | ) |
| const AB_EUTRANSFER_INFO* AB_EuTransferInfo_ConstList2_GetBack | ( | AB_EUTRANSFER_INFO_CONSTLIST2 * | l | ) |
| const AB_EUTRANSFER_INFO* AB_EuTransferInfo_ConstList2_GetFront | ( | AB_EUTRANSFER_INFO_CONSTLIST2 * | l | ) |
| unsigned int AB_EuTransferInfo_ConstList2_GetSize | ( | AB_EUTRANSFER_INFO_CONSTLIST2 * | l | ) |
| AB_EUTRANSFER_INFO_CONSTLIST2_ITERATOR* AB_EuTransferInfo_ConstList2_Last | ( | AB_EUTRANSFER_INFO_CONSTLIST2 * | l | ) |
| AB_EUTRANSFER_INFO_CONSTLIST2* AB_EuTransferInfo_ConstList2_new | ( | ) |
| void AB_EuTransferInfo_ConstList2_PopBack | ( | AB_EUTRANSFER_INFO_CONSTLIST2 * | l | ) |
| void AB_EuTransferInfo_ConstList2_PopFront | ( | AB_EUTRANSFER_INFO_CONSTLIST2 * | l | ) |
| void AB_EuTransferInfo_ConstList2_PushBack | ( | AB_EUTRANSFER_INFO_CONSTLIST2 * | l, |
| const AB_EUTRANSFER_INFO * | p | ||
| ) |
| void AB_EuTransferInfo_ConstList2_PushFront | ( | AB_EUTRANSFER_INFO_CONSTLIST2 * | l, |
| const AB_EUTRANSFER_INFO * | p | ||
| ) |
| const AB_EUTRANSFER_INFO* AB_EuTransferInfo_ConstList2Iterator_Data | ( | AB_EUTRANSFER_INFO_CONSTLIST2_ITERATOR * | li | ) |
| void AB_EuTransferInfo_ConstList2Iterator_free | ( | AB_EUTRANSFER_INFO_CONSTLIST2_ITERATOR * | li | ) |
| AB_EUTRANSFER_INFO_CONSTLIST2_ITERATOR* AB_EuTransferInfo_ConstList2Iterator_new | ( | AB_EUTRANSFER_INFO_CONSTLIST2 * | l | ) |
| const AB_EUTRANSFER_INFO* AB_EuTransferInfo_ConstList2Iterator_Next | ( | AB_EUTRANSFER_INFO_CONSTLIST2_ITERATOR * | li | ) |
| const AB_EUTRANSFER_INFO* AB_EuTransferInfo_ConstList2Iterator_Previous | ( | AB_EUTRANSFER_INFO_CONSTLIST2_ITERATOR * | li | ) |
| void AB_EuTransferInfo_List2_Clear | ( | AB_EUTRANSFER_INFO_LIST2 * | l | ) |
Removes all list elements from the list. (The elements are not freed.)
| void AB_EuTransferInfo_List2_Dump | ( | AB_EUTRANSFER_INFO_LIST2 * | l, |
| FILE * | f, | ||
| unsigned int | indent | ||
| ) |
Dumps the contents of the list to an open file (e.g. stderr).
| void AB_EuTransferInfo_List2_Erase | ( | AB_EUTRANSFER_INFO_LIST2 * | l, |
| AB_EUTRANSFER_INFO_LIST2_ITERATOR * | it | ||
| ) |
Removes the element currently pointed to by the given iterator from the list.
| AB_EUTRANSFER_INFO_LIST2_ITERATOR* AB_EuTransferInfo_List2_First | ( | AB_EUTRANSFER_INFO_LIST2 * | l | ) |
Returns a list iterator pointing to the first element.
| AB_EUTRANSFER_INFO* AB_EuTransferInfo_List2_ForEach | ( | AB_EUTRANSFER_INFO_LIST2 * | list, |
| AB_EUTRANSFER_INFO_LIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_EuTransferInfo_List2_free | ( | AB_EUTRANSFER_INFO_LIST2 * | l | ) |
Destroys the list. Please note that the members in this list are not destroyed!
| AB_EUTRANSFER_INFO* AB_EuTransferInfo_List2_GetBack | ( | AB_EUTRANSFER_INFO_LIST2 * | l | ) |
Returns the last element of the list. (The element is not removed from the list.)
| AB_EUTRANSFER_INFO* AB_EuTransferInfo_List2_GetFront | ( | AB_EUTRANSFER_INFO_LIST2 * | l | ) |
Returns the first element of the list. (The element is not removed from the list.)
| unsigned int AB_EuTransferInfo_List2_GetSize | ( | AB_EUTRANSFER_INFO_LIST2 * | l | ) |
Returns the size of this list, i.e. the number of elements in this list.
This number is counted in the list metadata, so this is a cheap operation.
| AB_EUTRANSFER_INFO_LIST2_ITERATOR* AB_EuTransferInfo_List2_Last | ( | AB_EUTRANSFER_INFO_LIST2 * | l | ) |
Returns a list iterator pointing to the last element.
| AB_EUTRANSFER_INFO_LIST2* AB_EuTransferInfo_List2_new | ( | ) |
Creates a new list. This mus be freed using AB_EuTransferInfo_List2_free.
| void AB_EuTransferInfo_List2_PopBack | ( | AB_EUTRANSFER_INFO_LIST2 * | l | ) |
Removes the list's last element from the list. (The element is not freed.)
| void AB_EuTransferInfo_List2_PopFront | ( | AB_EUTRANSFER_INFO_LIST2 * | l | ) |
Removes the list's first element from the list. (The element is not freed.)
| void AB_EuTransferInfo_List2_PushBack | ( | AB_EUTRANSFER_INFO_LIST2 * | l, |
| AB_EUTRANSFER_INFO * | p | ||
| ) |
Appends an element to a list making it the new last element.
| void AB_EuTransferInfo_List2_PushFront | ( | AB_EUTRANSFER_INFO_LIST2 * | l, |
| AB_EUTRANSFER_INFO * | p | ||
| ) |
Inserts an element at the start of the list, making it the new first element.
| AB_EUTRANSFER_INFO* AB_EuTransferInfo_List2Iterator_Data | ( | AB_EUTRANSFER_INFO_LIST2_ITERATOR * | li | ) |
Returns the pointer to the element stored at the list position the iterator currently points to.
| void AB_EuTransferInfo_List2Iterator_free | ( | AB_EUTRANSFER_INFO_LIST2_ITERATOR * | li | ) |
Destroys the list iterator.
| AB_EUTRANSFER_INFO_LIST2_ITERATOR* AB_EuTransferInfo_List2Iterator_new | ( | AB_EUTRANSFER_INFO_LIST2 * | l | ) |
Creates a list iterator for the given list. (FIXME: Should be private).
| AB_EUTRANSFER_INFO* AB_EuTransferInfo_List2Iterator_Next | ( | AB_EUTRANSFER_INFO_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the successor of the currenty selected element and returns that successor element.
| AB_EUTRANSFER_INFO* AB_EuTransferInfo_List2Iterator_Previous | ( | AB_EUTRANSFER_INFO_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the predecessor of the currenty selected element and returns that predecessor element.
| void AB_EuTransferInfo_List_Add | ( | AB_EUTRANSFER_INFO * | element, |
| AB_EUTRANSFER_INFO_LIST * | list | ||
| ) |
Adds the given element to the given list making it the new tail.
| void AB_EuTransferInfo_List_AddList | ( | AB_EUTRANSFER_INFO_LIST * | dst, |
| AB_EUTRANSFER_INFO_LIST * | l | ||
| ) |
Moves the content of one list to another list thus leaving the old list empty.
| void AB_EuTransferInfo_List_Clear | ( | AB_EUTRANSFER_INFO_LIST * | l | ) |
Clears the given list (thus leaving it empty). All elements of this list are deleted via AB_EuTransferInfo_free();
| void AB_EuTransferInfo_List_Del | ( | AB_EUTRANSFER_INFO * | element | ) |
Unlinks the given element from whatever list it may currently be enlisted. If the element is not member of any list the program is aborted. Please note: The element is just unlinked, not deleted.
| AB_EUTRANSFER_INFO* AB_EuTransferInfo_List_First | ( | const AB_EUTRANSFER_INFO_LIST * | l | ) |
Returns the first element of the list.
| void AB_EuTransferInfo_List_free | ( | AB_EUTRANSFER_INFO_LIST * | l | ) |
Destroys the list and frees all its elements.
| uint32_t AB_EuTransferInfo_List_GetCount | ( | const AB_EUTRANSFER_INFO_LIST * | l | ) |
Returns the number of elements currently in the given list.
| void AB_EuTransferInfo_List_Insert | ( | AB_EUTRANSFER_INFO * | element, |
| AB_EUTRANSFER_INFO_LIST * | list | ||
| ) |
Inserts the given element into the given list thus making it the new head of the list.
| AB_EUTRANSFER_INFO* AB_EuTransferInfo_List_Last | ( | const AB_EUTRANSFER_INFO_LIST * | l | ) |
Returns the last element of the list.
| AB_EUTRANSFER_INFO_LIST* AB_EuTransferInfo_List_new | ( | ) |
Creates a new list of AB_EUTRANSFER_INFO.
| AB_EUTRANSFER_INFO* AB_EuTransferInfo_List_Next | ( | const AB_EUTRANSFER_INFO * | element | ) |
Returns the successor of the given element.
| AB_EUTRANSFER_INFO* AB_EuTransferInfo_List_Previous | ( | const AB_EUTRANSFER_INFO * | element | ) |
Returns the predecessor of the given element.
| AB_EUTRANSFER_INFO_LIST_SORT_FN AB_EuTransferInfo_List_SetSortFn | ( | AB_EUTRANSFER_INFO_LIST * | l, |
| AB_EUTRANSFER_INFO_LIST_SORT_FN | fn | ||
| ) |
Set the sort function for the next calls to AB_EuTransferInfo_List_Sort().
| void AB_EuTransferInfo_List_Sort | ( | AB_EUTRANSFER_INFO_LIST * | l, |
| int | ascending | ||
| ) |
Sort the list. Within the course of this function the sort function set via AB_EuTransferInfo_List_SetSortFn is called with the arguments "const AB_EUTRANSFER_INFO *a, const AB_EUTRANSFER_INFO *b, int ascending".
| void AB_Job_ConstList2_Clear | ( | AB_JOB_CONSTLIST2 * | l | ) |
| AB_JOB_CONSTLIST2_ITERATOR* AB_Job_ConstList2_First | ( | AB_JOB_CONSTLIST2 * | l | ) |
| const AB_JOB* AB_Job_ConstList2_ForEach | ( | AB_JOB_CONSTLIST2 * | list, |
| AB_JOB_CONSTLIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_Job_ConstList2_free | ( | AB_JOB_CONSTLIST2 * | l | ) |
| const AB_JOB* AB_Job_ConstList2_GetBack | ( | AB_JOB_CONSTLIST2 * | l | ) |
| const AB_JOB* AB_Job_ConstList2_GetFront | ( | AB_JOB_CONSTLIST2 * | l | ) |
| unsigned int AB_Job_ConstList2_GetSize | ( | AB_JOB_CONSTLIST2 * | l | ) |
| AB_JOB_CONSTLIST2_ITERATOR* AB_Job_ConstList2_Last | ( | AB_JOB_CONSTLIST2 * | l | ) |
| AB_JOB_CONSTLIST2* AB_Job_ConstList2_new | ( | ) |
| void AB_Job_ConstList2_PopBack | ( | AB_JOB_CONSTLIST2 * | l | ) |
| void AB_Job_ConstList2_PopFront | ( | AB_JOB_CONSTLIST2 * | l | ) |
| void AB_Job_ConstList2_PushBack | ( | AB_JOB_CONSTLIST2 * | l, |
| const AB_JOB * | p | ||
| ) |
| void AB_Job_ConstList2_PushFront | ( | AB_JOB_CONSTLIST2 * | l, |
| const AB_JOB * | p | ||
| ) |
| const AB_JOB* AB_Job_ConstList2Iterator_Data | ( | AB_JOB_CONSTLIST2_ITERATOR * | li | ) |
| void AB_Job_ConstList2Iterator_free | ( | AB_JOB_CONSTLIST2_ITERATOR * | li | ) |
| AB_JOB_CONSTLIST2_ITERATOR* AB_Job_ConstList2Iterator_new | ( | AB_JOB_CONSTLIST2 * | l | ) |
| const AB_JOB* AB_Job_ConstList2Iterator_Next | ( | AB_JOB_CONSTLIST2_ITERATOR * | li | ) |
| const AB_JOB* AB_Job_ConstList2Iterator_Previous | ( | AB_JOB_CONSTLIST2_ITERATOR * | li | ) |
| void AB_Job_List2_Clear | ( | AB_JOB_LIST2 * | l | ) |
Removes all list elements from the list. (The elements are not freed.)
| void AB_Job_List2_Dump | ( | AB_JOB_LIST2 * | l, |
| FILE * | f, | ||
| unsigned int | indent | ||
| ) |
Dumps the contents of the list to an open file (e.g. stderr).
| void AB_Job_List2_Erase | ( | AB_JOB_LIST2 * | l, |
| AB_JOB_LIST2_ITERATOR * | it | ||
| ) |
Removes the element currently pointed to by the given iterator from the list.
| AB_JOB_LIST2_ITERATOR* AB_Job_List2_First | ( | AB_JOB_LIST2 * | l | ) |
Returns a list iterator pointing to the first element.
| AB_JOB* AB_Job_List2_ForEach | ( | AB_JOB_LIST2 * | list, |
| AB_JOB_LIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_Job_List2_free | ( | AB_JOB_LIST2 * | l | ) |
Destroys the list. Please note that the members in this list are not destroyed!
| AB_JOB* AB_Job_List2_GetBack | ( | AB_JOB_LIST2 * | l | ) |
Returns the last element of the list. (The element is not removed from the list.)
| AB_JOB* AB_Job_List2_GetFront | ( | AB_JOB_LIST2 * | l | ) |
Returns the first element of the list. (The element is not removed from the list.)
| unsigned int AB_Job_List2_GetSize | ( | AB_JOB_LIST2 * | l | ) |
Returns the size of this list, i.e. the number of elements in this list.
This number is counted in the list metadata, so this is a cheap operation.
| AB_JOB_LIST2_ITERATOR* AB_Job_List2_Last | ( | AB_JOB_LIST2 * | l | ) |
Returns a list iterator pointing to the last element.
| AB_JOB_LIST2* AB_Job_List2_new | ( | ) |
Creates a new list. This mus be freed using AB_Job_List2_free.
| void AB_Job_List2_PopBack | ( | AB_JOB_LIST2 * | l | ) |
Removes the list's last element from the list. (The element is not freed.)
| void AB_Job_List2_PopFront | ( | AB_JOB_LIST2 * | l | ) |
Removes the list's first element from the list. (The element is not freed.)
| void AB_Job_List2_PushBack | ( | AB_JOB_LIST2 * | l, |
| AB_JOB * | p | ||
| ) |
Appends an element to a list making it the new last element.
| void AB_Job_List2_PushFront | ( | AB_JOB_LIST2 * | l, |
| AB_JOB * | p | ||
| ) |
Inserts an element at the start of the list, making it the new first element.
| AB_JOB* AB_Job_List2Iterator_Data | ( | AB_JOB_LIST2_ITERATOR * | li | ) |
Returns the pointer to the element stored at the list position the iterator currently points to.
| void AB_Job_List2Iterator_free | ( | AB_JOB_LIST2_ITERATOR * | li | ) |
Destroys the list iterator.
| AB_JOB_LIST2_ITERATOR* AB_Job_List2Iterator_new | ( | AB_JOB_LIST2 * | l | ) |
Creates a list iterator for the given list. (FIXME: Should be private).
| AB_JOB* AB_Job_List2Iterator_Next | ( | AB_JOB_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the successor of the currenty selected element and returns that successor element.
| AB_JOB* AB_Job_List2Iterator_Previous | ( | AB_JOB_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the predecessor of the currenty selected element and returns that predecessor element.
| void AB_JobQueue_List_Add | ( | AB_JOBQUEUE * | element, |
| AB_JOBQUEUE_LIST * | list | ||
| ) |
Adds the given element to the given list making it the new tail.
| void AB_JobQueue_List_AddList | ( | AB_JOBQUEUE_LIST * | dst, |
| AB_JOBQUEUE_LIST * | l | ||
| ) |
Moves the content of one list to another list thus leaving the old list empty.
| void AB_JobQueue_List_Clear | ( | AB_JOBQUEUE_LIST * | l | ) |
Clears the given list (thus leaving it empty). All elements of this list are deleted via AB_JobQueue_free();
| void AB_JobQueue_List_Del | ( | AB_JOBQUEUE * | element | ) |
Unlinks the given element from whatever list it may currently be enlisted. If the element is not member of any list the program is aborted. Please note: The element is just unlinked, not deleted.
| AB_JOBQUEUE* AB_JobQueue_List_First | ( | const AB_JOBQUEUE_LIST * | l | ) |
Returns the first element of the list.
| void AB_JobQueue_List_free | ( | AB_JOBQUEUE_LIST * | l | ) |
Destroys the list and frees all its elements.
| uint32_t AB_JobQueue_List_GetCount | ( | const AB_JOBQUEUE_LIST * | l | ) |
Returns the number of elements currently in the given list.
| void AB_JobQueue_List_Insert | ( | AB_JOBQUEUE * | element, |
| AB_JOBQUEUE_LIST * | list | ||
| ) |
Inserts the given element into the given list thus making it the new head of the list.
| AB_JOBQUEUE* AB_JobQueue_List_Last | ( | const AB_JOBQUEUE_LIST * | l | ) |
Returns the last element of the list.
| AB_JOBQUEUE_LIST* AB_JobQueue_List_new | ( | ) |
Creates a new list of AB_JOBQUEUE.
| AB_JOBQUEUE* AB_JobQueue_List_Next | ( | const AB_JOBQUEUE * | element | ) |
Returns the successor of the given element.
| AB_JOBQUEUE* AB_JobQueue_List_Previous | ( | const AB_JOBQUEUE * | element | ) |
Returns the predecessor of the given element.
| AB_JOBQUEUE_LIST_SORT_FN AB_JobQueue_List_SetSortFn | ( | AB_JOBQUEUE_LIST * | l, |
| AB_JOBQUEUE_LIST_SORT_FN | fn | ||
| ) |
Set the sort function for the next calls to AB_JobQueue_List_Sort().
| void AB_JobQueue_List_Sort | ( | AB_JOBQUEUE_LIST * | l, |
| int | ascending | ||
| ) |
Sort the list. Within the course of this function the sort function set via AB_JobQueue_List_SetSortFn is called with the arguments "const AB_JOBQUEUE *a, const AB_JOBQUEUE *b, int ascending".
| void AB_Message_ConstList2_Clear | ( | AB_MESSAGE_CONSTLIST2 * | l | ) |
| AB_MESSAGE_CONSTLIST2_ITERATOR* AB_Message_ConstList2_First | ( | AB_MESSAGE_CONSTLIST2 * | l | ) |
| const AB_MESSAGE* AB_Message_ConstList2_ForEach | ( | AB_MESSAGE_CONSTLIST2 * | list, |
| AB_MESSAGE_CONSTLIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_Message_ConstList2_free | ( | AB_MESSAGE_CONSTLIST2 * | l | ) |
| const AB_MESSAGE* AB_Message_ConstList2_GetBack | ( | AB_MESSAGE_CONSTLIST2 * | l | ) |
| const AB_MESSAGE* AB_Message_ConstList2_GetFront | ( | AB_MESSAGE_CONSTLIST2 * | l | ) |
| unsigned int AB_Message_ConstList2_GetSize | ( | AB_MESSAGE_CONSTLIST2 * | l | ) |
| AB_MESSAGE_CONSTLIST2_ITERATOR* AB_Message_ConstList2_Last | ( | AB_MESSAGE_CONSTLIST2 * | l | ) |
| AB_MESSAGE_CONSTLIST2* AB_Message_ConstList2_new | ( | ) |
| void AB_Message_ConstList2_PopBack | ( | AB_MESSAGE_CONSTLIST2 * | l | ) |
| void AB_Message_ConstList2_PopFront | ( | AB_MESSAGE_CONSTLIST2 * | l | ) |
| void AB_Message_ConstList2_PushBack | ( | AB_MESSAGE_CONSTLIST2 * | l, |
| const AB_MESSAGE * | p | ||
| ) |
| void AB_Message_ConstList2_PushFront | ( | AB_MESSAGE_CONSTLIST2 * | l, |
| const AB_MESSAGE * | p | ||
| ) |
| const AB_MESSAGE* AB_Message_ConstList2Iterator_Data | ( | AB_MESSAGE_CONSTLIST2_ITERATOR * | li | ) |
| void AB_Message_ConstList2Iterator_free | ( | AB_MESSAGE_CONSTLIST2_ITERATOR * | li | ) |
| AB_MESSAGE_CONSTLIST2_ITERATOR* AB_Message_ConstList2Iterator_new | ( | AB_MESSAGE_CONSTLIST2 * | l | ) |
| const AB_MESSAGE* AB_Message_ConstList2Iterator_Next | ( | AB_MESSAGE_CONSTLIST2_ITERATOR * | li | ) |
| const AB_MESSAGE* AB_Message_ConstList2Iterator_Previous | ( | AB_MESSAGE_CONSTLIST2_ITERATOR * | li | ) |
| void AB_Message_List2_Clear | ( | AB_MESSAGE_LIST2 * | l | ) |
Removes all list elements from the list. (The elements are not freed.)
| void AB_Message_List2_Dump | ( | AB_MESSAGE_LIST2 * | l, |
| FILE * | f, | ||
| unsigned int | indent | ||
| ) |
Dumps the contents of the list to an open file (e.g. stderr).
| void AB_Message_List2_Erase | ( | AB_MESSAGE_LIST2 * | l, |
| AB_MESSAGE_LIST2_ITERATOR * | it | ||
| ) |
Removes the element currently pointed to by the given iterator from the list.
| AB_MESSAGE_LIST2_ITERATOR* AB_Message_List2_First | ( | AB_MESSAGE_LIST2 * | l | ) |
Returns a list iterator pointing to the first element.
| AB_MESSAGE* AB_Message_List2_ForEach | ( | AB_MESSAGE_LIST2 * | list, |
| AB_MESSAGE_LIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_Message_List2_free | ( | AB_MESSAGE_LIST2 * | l | ) |
Destroys the list. Please note that the members in this list are not destroyed!
| AB_MESSAGE* AB_Message_List2_GetBack | ( | AB_MESSAGE_LIST2 * | l | ) |
Returns the last element of the list. (The element is not removed from the list.)
| AB_MESSAGE* AB_Message_List2_GetFront | ( | AB_MESSAGE_LIST2 * | l | ) |
Returns the first element of the list. (The element is not removed from the list.)
| unsigned int AB_Message_List2_GetSize | ( | AB_MESSAGE_LIST2 * | l | ) |
Returns the size of this list, i.e. the number of elements in this list.
This number is counted in the list metadata, so this is a cheap operation.
| AB_MESSAGE_LIST2_ITERATOR* AB_Message_List2_Last | ( | AB_MESSAGE_LIST2 * | l | ) |
Returns a list iterator pointing to the last element.
| AB_MESSAGE_LIST2* AB_Message_List2_new | ( | ) |
Creates a new list. This mus be freed using AB_Message_List2_free.
| void AB_Message_List2_PopBack | ( | AB_MESSAGE_LIST2 * | l | ) |
Removes the list's last element from the list. (The element is not freed.)
| void AB_Message_List2_PopFront | ( | AB_MESSAGE_LIST2 * | l | ) |
Removes the list's first element from the list. (The element is not freed.)
| void AB_Message_List2_PushBack | ( | AB_MESSAGE_LIST2 * | l, |
| AB_MESSAGE * | p | ||
| ) |
Appends an element to a list making it the new last element.
| void AB_Message_List2_PushFront | ( | AB_MESSAGE_LIST2 * | l, |
| AB_MESSAGE * | p | ||
| ) |
Inserts an element at the start of the list, making it the new first element.
| AB_MESSAGE* AB_Message_List2Iterator_Data | ( | AB_MESSAGE_LIST2_ITERATOR * | li | ) |
Returns the pointer to the element stored at the list position the iterator currently points to.
| void AB_Message_List2Iterator_free | ( | AB_MESSAGE_LIST2_ITERATOR * | li | ) |
Destroys the list iterator.
| AB_MESSAGE_LIST2_ITERATOR* AB_Message_List2Iterator_new | ( | AB_MESSAGE_LIST2 * | l | ) |
Creates a list iterator for the given list. (FIXME: Should be private).
| AB_MESSAGE* AB_Message_List2Iterator_Next | ( | AB_MESSAGE_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the successor of the currenty selected element and returns that successor element.
| AB_MESSAGE* AB_Message_List2Iterator_Previous | ( | AB_MESSAGE_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the predecessor of the currenty selected element and returns that predecessor element.
| void AB_Message_List_Add | ( | AB_MESSAGE * | element, |
| AB_MESSAGE_LIST * | list | ||
| ) |
Adds the given element to the given list making it the new tail.
| void AB_Message_List_AddList | ( | AB_MESSAGE_LIST * | dst, |
| AB_MESSAGE_LIST * | l | ||
| ) |
Moves the content of one list to another list thus leaving the old list empty.
| void AB_Message_List_Clear | ( | AB_MESSAGE_LIST * | l | ) |
Clears the given list (thus leaving it empty). All elements of this list are deleted via AB_Message_free();
| void AB_Message_List_Del | ( | AB_MESSAGE * | element | ) |
Unlinks the given element from whatever list it may currently be enlisted. If the element is not member of any list the program is aborted. Please note: The element is just unlinked, not deleted.
| AB_MESSAGE* AB_Message_List_First | ( | const AB_MESSAGE_LIST * | l | ) |
Returns the first element of the list.
| void AB_Message_List_free | ( | AB_MESSAGE_LIST * | l | ) |
Destroys the list and frees all its elements.
| uint32_t AB_Message_List_GetCount | ( | const AB_MESSAGE_LIST * | l | ) |
Returns the number of elements currently in the given list.
| void AB_Message_List_Insert | ( | AB_MESSAGE * | element, |
| AB_MESSAGE_LIST * | list | ||
| ) |
Inserts the given element into the given list thus making it the new head of the list.
| AB_MESSAGE* AB_Message_List_Last | ( | const AB_MESSAGE_LIST * | l | ) |
Returns the last element of the list.
| AB_MESSAGE_LIST* AB_Message_List_new | ( | ) |
Creates a new list of AB_MESSAGE.
| AB_MESSAGE* AB_Message_List_Next | ( | const AB_MESSAGE * | element | ) |
Returns the successor of the given element.
| AB_MESSAGE* AB_Message_List_Previous | ( | const AB_MESSAGE * | element | ) |
Returns the predecessor of the given element.
| AB_MESSAGE_LIST_SORT_FN AB_Message_List_SetSortFn | ( | AB_MESSAGE_LIST * | l, |
| AB_MESSAGE_LIST_SORT_FN | fn | ||
| ) |
Set the sort function for the next calls to AB_Message_List_Sort().
| void AB_Message_List_Sort | ( | AB_MESSAGE_LIST * | l, |
| int | ascending | ||
| ) |
Sort the list. Within the course of this function the sort function set via AB_Message_List_SetSortFn is called with the arguments "const AB_MESSAGE *a, const AB_MESSAGE *b, int ascending".
| void AB_ProviderDescription_ConstList2_Clear | ( | AB_PROVIDER_DESCRIPTION_CONSTLIST2 * | l | ) |
| AB_PROVIDER_DESCRIPTION_CONSTLIST2_ITERATOR* AB_ProviderDescription_ConstList2_First | ( | AB_PROVIDER_DESCRIPTION_CONSTLIST2 * | l | ) |
| const AB_PROVIDER_DESCRIPTION* AB_ProviderDescription_ConstList2_ForEach | ( | AB_PROVIDER_DESCRIPTION_CONSTLIST2 * | list, |
| AB_PROVIDER_DESCRIPTION_CONSTLIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_ProviderDescription_ConstList2_free | ( | AB_PROVIDER_DESCRIPTION_CONSTLIST2 * | l | ) |
| const AB_PROVIDER_DESCRIPTION* AB_ProviderDescription_ConstList2_GetBack | ( | AB_PROVIDER_DESCRIPTION_CONSTLIST2 * | l | ) |
| const AB_PROVIDER_DESCRIPTION* AB_ProviderDescription_ConstList2_GetFront | ( | AB_PROVIDER_DESCRIPTION_CONSTLIST2 * | l | ) |
| unsigned int AB_ProviderDescription_ConstList2_GetSize | ( | AB_PROVIDER_DESCRIPTION_CONSTLIST2 * | l | ) |
| AB_PROVIDER_DESCRIPTION_CONSTLIST2_ITERATOR* AB_ProviderDescription_ConstList2_Last | ( | AB_PROVIDER_DESCRIPTION_CONSTLIST2 * | l | ) |
| AB_PROVIDER_DESCRIPTION_CONSTLIST2* AB_ProviderDescription_ConstList2_new | ( | ) |
| void AB_ProviderDescription_ConstList2_PopBack | ( | AB_PROVIDER_DESCRIPTION_CONSTLIST2 * | l | ) |
| void AB_ProviderDescription_ConstList2_PopFront | ( | AB_PROVIDER_DESCRIPTION_CONSTLIST2 * | l | ) |
| void AB_ProviderDescription_ConstList2_PushBack | ( | AB_PROVIDER_DESCRIPTION_CONSTLIST2 * | l, |
| const AB_PROVIDER_DESCRIPTION * | p | ||
| ) |
| void AB_ProviderDescription_ConstList2_PushFront | ( | AB_PROVIDER_DESCRIPTION_CONSTLIST2 * | l, |
| const AB_PROVIDER_DESCRIPTION * | p | ||
| ) |
| const AB_PROVIDER_DESCRIPTION* AB_ProviderDescription_ConstList2Iterator_Data | ( | AB_PROVIDER_DESCRIPTION_CONSTLIST2_ITERATOR * | li | ) |
| void AB_ProviderDescription_ConstList2Iterator_free | ( | AB_PROVIDER_DESCRIPTION_CONSTLIST2_ITERATOR * | li | ) |
| AB_PROVIDER_DESCRIPTION_CONSTLIST2_ITERATOR* AB_ProviderDescription_ConstList2Iterator_new | ( | AB_PROVIDER_DESCRIPTION_CONSTLIST2 * | l | ) |
| const AB_PROVIDER_DESCRIPTION* AB_ProviderDescription_ConstList2Iterator_Next | ( | AB_PROVIDER_DESCRIPTION_CONSTLIST2_ITERATOR * | li | ) |
| const AB_PROVIDER_DESCRIPTION* AB_ProviderDescription_ConstList2Iterator_Previous | ( | AB_PROVIDER_DESCRIPTION_CONSTLIST2_ITERATOR * | li | ) |
| void AB_ProviderDescription_List2_Clear | ( | AB_PROVIDER_DESCRIPTION_LIST2 * | l | ) |
Removes all list elements from the list. (The elements are not freed.)
| void AB_ProviderDescription_List2_Dump | ( | AB_PROVIDER_DESCRIPTION_LIST2 * | l, |
| FILE * | f, | ||
| unsigned int | indent | ||
| ) |
Dumps the contents of the list to an open file (e.g. stderr).
| void AB_ProviderDescription_List2_Erase | ( | AB_PROVIDER_DESCRIPTION_LIST2 * | l, |
| AB_PROVIDER_DESCRIPTION_LIST2_ITERATOR * | it | ||
| ) |
Removes the element currently pointed to by the given iterator from the list.
| AB_PROVIDER_DESCRIPTION_LIST2_ITERATOR* AB_ProviderDescription_List2_First | ( | AB_PROVIDER_DESCRIPTION_LIST2 * | l | ) |
Returns a list iterator pointing to the first element.
| AB_PROVIDER_DESCRIPTION* AB_ProviderDescription_List2_ForEach | ( | AB_PROVIDER_DESCRIPTION_LIST2 * | list, |
| AB_PROVIDER_DESCRIPTION_LIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_ProviderDescription_List2_free | ( | AB_PROVIDER_DESCRIPTION_LIST2 * | l | ) |
Destroys the list. Please note that the members in this list are not destroyed!
| AB_PROVIDER_DESCRIPTION* AB_ProviderDescription_List2_GetBack | ( | AB_PROVIDER_DESCRIPTION_LIST2 * | l | ) |
Returns the last element of the list. (The element is not removed from the list.)
| AB_PROVIDER_DESCRIPTION* AB_ProviderDescription_List2_GetFront | ( | AB_PROVIDER_DESCRIPTION_LIST2 * | l | ) |
Returns the first element of the list. (The element is not removed from the list.)
| unsigned int AB_ProviderDescription_List2_GetSize | ( | AB_PROVIDER_DESCRIPTION_LIST2 * | l | ) |
Returns the size of this list, i.e. the number of elements in this list.
This number is counted in the list metadata, so this is a cheap operation.
| AB_PROVIDER_DESCRIPTION_LIST2_ITERATOR* AB_ProviderDescription_List2_Last | ( | AB_PROVIDER_DESCRIPTION_LIST2 * | l | ) |
Returns a list iterator pointing to the last element.
| AB_PROVIDER_DESCRIPTION_LIST2* AB_ProviderDescription_List2_new | ( | ) |
Creates a new list. This mus be freed using AB_ProviderDescription_List2_free.
| void AB_ProviderDescription_List2_PopBack | ( | AB_PROVIDER_DESCRIPTION_LIST2 * | l | ) |
Removes the list's last element from the list. (The element is not freed.)
| void AB_ProviderDescription_List2_PopFront | ( | AB_PROVIDER_DESCRIPTION_LIST2 * | l | ) |
Removes the list's first element from the list. (The element is not freed.)
| void AB_ProviderDescription_List2_PushBack | ( | AB_PROVIDER_DESCRIPTION_LIST2 * | l, |
| AB_PROVIDER_DESCRIPTION * | p | ||
| ) |
Appends an element to a list making it the new last element.
| void AB_ProviderDescription_List2_PushFront | ( | AB_PROVIDER_DESCRIPTION_LIST2 * | l, |
| AB_PROVIDER_DESCRIPTION * | p | ||
| ) |
Inserts an element at the start of the list, making it the new first element.
| AB_PROVIDER_DESCRIPTION* AB_ProviderDescription_List2Iterator_Data | ( | AB_PROVIDER_DESCRIPTION_LIST2_ITERATOR * | li | ) |
Returns the pointer to the element stored at the list position the iterator currently points to.
| void AB_ProviderDescription_List2Iterator_free | ( | AB_PROVIDER_DESCRIPTION_LIST2_ITERATOR * | li | ) |
Destroys the list iterator.
| AB_PROVIDER_DESCRIPTION_LIST2_ITERATOR* AB_ProviderDescription_List2Iterator_new | ( | AB_PROVIDER_DESCRIPTION_LIST2 * | l | ) |
Creates a list iterator for the given list. (FIXME: Should be private).
| AB_PROVIDER_DESCRIPTION* AB_ProviderDescription_List2Iterator_Next | ( | AB_PROVIDER_DESCRIPTION_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the successor of the currenty selected element and returns that successor element.
| AB_PROVIDER_DESCRIPTION* AB_ProviderDescription_List2Iterator_Previous | ( | AB_PROVIDER_DESCRIPTION_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the predecessor of the currenty selected element and returns that predecessor element.
| void AB_ProviderDescription_List_Add | ( | AB_PROVIDER_DESCRIPTION * | element, |
| AB_PROVIDER_DESCRIPTION_LIST * | list | ||
| ) |
Adds the given element to the given list making it the new tail.
| void AB_ProviderDescription_List_AddList | ( | AB_PROVIDER_DESCRIPTION_LIST * | dst, |
| AB_PROVIDER_DESCRIPTION_LIST * | l | ||
| ) |
Moves the content of one list to another list thus leaving the old list empty.
| void AB_ProviderDescription_List_Clear | ( | AB_PROVIDER_DESCRIPTION_LIST * | l | ) |
Clears the given list (thus leaving it empty). All elements of this list are deleted via AB_ProviderDescription_free();
| void AB_ProviderDescription_List_Del | ( | AB_PROVIDER_DESCRIPTION * | element | ) |
Unlinks the given element from whatever list it may currently be enlisted. If the element is not member of any list the program is aborted. Please note: The element is just unlinked, not deleted.
| AB_PROVIDER_DESCRIPTION* AB_ProviderDescription_List_First | ( | const AB_PROVIDER_DESCRIPTION_LIST * | l | ) |
Returns the first element of the list.
| void AB_ProviderDescription_List_free | ( | AB_PROVIDER_DESCRIPTION_LIST * | l | ) |
Destroys the list and frees all its elements.
| uint32_t AB_ProviderDescription_List_GetCount | ( | const AB_PROVIDER_DESCRIPTION_LIST * | l | ) |
Returns the number of elements currently in the given list.
| void AB_ProviderDescription_List_Insert | ( | AB_PROVIDER_DESCRIPTION * | element, |
| AB_PROVIDER_DESCRIPTION_LIST * | list | ||
| ) |
Inserts the given element into the given list thus making it the new head of the list.
| AB_PROVIDER_DESCRIPTION* AB_ProviderDescription_List_Last | ( | const AB_PROVIDER_DESCRIPTION_LIST * | l | ) |
Returns the last element of the list.
| AB_PROVIDER_DESCRIPTION_LIST* AB_ProviderDescription_List_new | ( | ) |
Creates a new list of AB_PROVIDER_DESCRIPTION.
| AB_PROVIDER_DESCRIPTION* AB_ProviderDescription_List_Next | ( | const AB_PROVIDER_DESCRIPTION * | element | ) |
Returns the successor of the given element.
| AB_PROVIDER_DESCRIPTION* AB_ProviderDescription_List_Previous | ( | const AB_PROVIDER_DESCRIPTION * | element | ) |
Returns the predecessor of the given element.
| AB_PROVIDER_DESCRIPTION_LIST_SORT_FN AB_ProviderDescription_List_SetSortFn | ( | AB_PROVIDER_DESCRIPTION_LIST * | l, |
| AB_PROVIDER_DESCRIPTION_LIST_SORT_FN | fn | ||
| ) |
Set the sort function for the next calls to AB_ProviderDescription_List_Sort().
| void AB_ProviderDescription_List_Sort | ( | AB_PROVIDER_DESCRIPTION_LIST * | l, |
| int | ascending | ||
| ) |
Sort the list. Within the course of this function the sort function set via AB_ProviderDescription_List_SetSortFn is called with the arguments "const AB_PROVIDER_DESCRIPTION *a, const AB_PROVIDER_DESCRIPTION *b, int ascending".
| void AB_Security_ConstList2_Clear | ( | AB_SECURITY_CONSTLIST2 * | l | ) |
| AB_SECURITY_CONSTLIST2_ITERATOR* AB_Security_ConstList2_First | ( | AB_SECURITY_CONSTLIST2 * | l | ) |
| const AB_SECURITY* AB_Security_ConstList2_ForEach | ( | AB_SECURITY_CONSTLIST2 * | list, |
| AB_SECURITY_CONSTLIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_Security_ConstList2_free | ( | AB_SECURITY_CONSTLIST2 * | l | ) |
| const AB_SECURITY* AB_Security_ConstList2_GetBack | ( | AB_SECURITY_CONSTLIST2 * | l | ) |
| const AB_SECURITY* AB_Security_ConstList2_GetFront | ( | AB_SECURITY_CONSTLIST2 * | l | ) |
| unsigned int AB_Security_ConstList2_GetSize | ( | AB_SECURITY_CONSTLIST2 * | l | ) |
| AB_SECURITY_CONSTLIST2_ITERATOR* AB_Security_ConstList2_Last | ( | AB_SECURITY_CONSTLIST2 * | l | ) |
| AB_SECURITY_CONSTLIST2* AB_Security_ConstList2_new | ( | ) |
| void AB_Security_ConstList2_PopBack | ( | AB_SECURITY_CONSTLIST2 * | l | ) |
| void AB_Security_ConstList2_PopFront | ( | AB_SECURITY_CONSTLIST2 * | l | ) |
| void AB_Security_ConstList2_PushBack | ( | AB_SECURITY_CONSTLIST2 * | l, |
| const AB_SECURITY * | p | ||
| ) |
| void AB_Security_ConstList2_PushFront | ( | AB_SECURITY_CONSTLIST2 * | l, |
| const AB_SECURITY * | p | ||
| ) |
| const AB_SECURITY* AB_Security_ConstList2Iterator_Data | ( | AB_SECURITY_CONSTLIST2_ITERATOR * | li | ) |
| void AB_Security_ConstList2Iterator_free | ( | AB_SECURITY_CONSTLIST2_ITERATOR * | li | ) |
| AB_SECURITY_CONSTLIST2_ITERATOR* AB_Security_ConstList2Iterator_new | ( | AB_SECURITY_CONSTLIST2 * | l | ) |
| const AB_SECURITY* AB_Security_ConstList2Iterator_Next | ( | AB_SECURITY_CONSTLIST2_ITERATOR * | li | ) |
| const AB_SECURITY* AB_Security_ConstList2Iterator_Previous | ( | AB_SECURITY_CONSTLIST2_ITERATOR * | li | ) |
| void AB_Security_List2_Clear | ( | AB_SECURITY_LIST2 * | l | ) |
Removes all list elements from the list. (The elements are not freed.)
| void AB_Security_List2_Dump | ( | AB_SECURITY_LIST2 * | l, |
| FILE * | f, | ||
| unsigned int | indent | ||
| ) |
Dumps the contents of the list to an open file (e.g. stderr).
| void AB_Security_List2_Erase | ( | AB_SECURITY_LIST2 * | l, |
| AB_SECURITY_LIST2_ITERATOR * | it | ||
| ) |
Removes the element currently pointed to by the given iterator from the list.
| AB_SECURITY_LIST2_ITERATOR* AB_Security_List2_First | ( | AB_SECURITY_LIST2 * | l | ) |
Returns a list iterator pointing to the first element.
| AB_SECURITY* AB_Security_List2_ForEach | ( | AB_SECURITY_LIST2 * | list, |
| AB_SECURITY_LIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_Security_List2_free | ( | AB_SECURITY_LIST2 * | l | ) |
Destroys the list. Please note that the members in this list are not destroyed!
| AB_SECURITY* AB_Security_List2_GetBack | ( | AB_SECURITY_LIST2 * | l | ) |
Returns the last element of the list. (The element is not removed from the list.)
| AB_SECURITY* AB_Security_List2_GetFront | ( | AB_SECURITY_LIST2 * | l | ) |
Returns the first element of the list. (The element is not removed from the list.)
| unsigned int AB_Security_List2_GetSize | ( | AB_SECURITY_LIST2 * | l | ) |
Returns the size of this list, i.e. the number of elements in this list.
This number is counted in the list metadata, so this is a cheap operation.
| AB_SECURITY_LIST2_ITERATOR* AB_Security_List2_Last | ( | AB_SECURITY_LIST2 * | l | ) |
Returns a list iterator pointing to the last element.
| AB_SECURITY_LIST2* AB_Security_List2_new | ( | ) |
Creates a new list. This mus be freed using AB_Security_List2_free.
| void AB_Security_List2_PopBack | ( | AB_SECURITY_LIST2 * | l | ) |
Removes the list's last element from the list. (The element is not freed.)
| void AB_Security_List2_PopFront | ( | AB_SECURITY_LIST2 * | l | ) |
Removes the list's first element from the list. (The element is not freed.)
| void AB_Security_List2_PushBack | ( | AB_SECURITY_LIST2 * | l, |
| AB_SECURITY * | p | ||
| ) |
Appends an element to a list making it the new last element.
| void AB_Security_List2_PushFront | ( | AB_SECURITY_LIST2 * | l, |
| AB_SECURITY * | p | ||
| ) |
Inserts an element at the start of the list, making it the new first element.
| AB_SECURITY* AB_Security_List2Iterator_Data | ( | AB_SECURITY_LIST2_ITERATOR * | li | ) |
Returns the pointer to the element stored at the list position the iterator currently points to.
| void AB_Security_List2Iterator_free | ( | AB_SECURITY_LIST2_ITERATOR * | li | ) |
Destroys the list iterator.
| AB_SECURITY_LIST2_ITERATOR* AB_Security_List2Iterator_new | ( | AB_SECURITY_LIST2 * | l | ) |
Creates a list iterator for the given list. (FIXME: Should be private).
| AB_SECURITY* AB_Security_List2Iterator_Next | ( | AB_SECURITY_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the successor of the currenty selected element and returns that successor element.
| AB_SECURITY* AB_Security_List2Iterator_Previous | ( | AB_SECURITY_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the predecessor of the currenty selected element and returns that predecessor element.
| void AB_Security_List_Add | ( | AB_SECURITY * | element, |
| AB_SECURITY_LIST * | list | ||
| ) |
Adds the given element to the given list making it the new tail.
| void AB_Security_List_AddList | ( | AB_SECURITY_LIST * | dst, |
| AB_SECURITY_LIST * | l | ||
| ) |
Moves the content of one list to another list thus leaving the old list empty.
| void AB_Security_List_Clear | ( | AB_SECURITY_LIST * | l | ) |
Clears the given list (thus leaving it empty). All elements of this list are deleted via AB_Security_free();
| void AB_Security_List_Del | ( | AB_SECURITY * | element | ) |
Unlinks the given element from whatever list it may currently be enlisted. If the element is not member of any list the program is aborted. Please note: The element is just unlinked, not deleted.
| AB_SECURITY* AB_Security_List_First | ( | const AB_SECURITY_LIST * | l | ) |
Returns the first element of the list.
| void AB_Security_List_free | ( | AB_SECURITY_LIST * | l | ) |
Destroys the list and frees all its elements.
| uint32_t AB_Security_List_GetCount | ( | const AB_SECURITY_LIST * | l | ) |
Returns the number of elements currently in the given list.
| void AB_Security_List_Insert | ( | AB_SECURITY * | element, |
| AB_SECURITY_LIST * | list | ||
| ) |
Inserts the given element into the given list thus making it the new head of the list.
| AB_SECURITY* AB_Security_List_Last | ( | const AB_SECURITY_LIST * | l | ) |
Returns the last element of the list.
| AB_SECURITY_LIST* AB_Security_List_new | ( | ) |
Creates a new list of AB_SECURITY.
| AB_SECURITY* AB_Security_List_Next | ( | const AB_SECURITY * | element | ) |
Returns the successor of the given element.
| AB_SECURITY* AB_Security_List_Previous | ( | const AB_SECURITY * | element | ) |
Returns the predecessor of the given element.
| AB_SECURITY_LIST_SORT_FN AB_Security_List_SetSortFn | ( | AB_SECURITY_LIST * | l, |
| AB_SECURITY_LIST_SORT_FN | fn | ||
| ) |
Set the sort function for the next calls to AB_Security_List_Sort().
| void AB_Security_List_Sort | ( | AB_SECURITY_LIST * | l, |
| int | ascending | ||
| ) |
Sort the list. Within the course of this function the sort function set via AB_Security_List_SetSortFn is called with the arguments "const AB_SECURITY *a, const AB_SECURITY *b, int ascending".
| void AB_TextKeyDescr_ConstList2_Clear | ( | AB_TEXTKEY_DESCR_CONSTLIST2 * | l | ) |
| AB_TEXTKEY_DESCR_CONSTLIST2_ITERATOR* AB_TextKeyDescr_ConstList2_First | ( | AB_TEXTKEY_DESCR_CONSTLIST2 * | l | ) |
| const AB_TEXTKEY_DESCR* AB_TextKeyDescr_ConstList2_ForEach | ( | AB_TEXTKEY_DESCR_CONSTLIST2 * | list, |
| AB_TEXTKEY_DESCR_CONSTLIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_TextKeyDescr_ConstList2_free | ( | AB_TEXTKEY_DESCR_CONSTLIST2 * | l | ) |
| const AB_TEXTKEY_DESCR* AB_TextKeyDescr_ConstList2_GetBack | ( | AB_TEXTKEY_DESCR_CONSTLIST2 * | l | ) |
| const AB_TEXTKEY_DESCR* AB_TextKeyDescr_ConstList2_GetFront | ( | AB_TEXTKEY_DESCR_CONSTLIST2 * | l | ) |
| unsigned int AB_TextKeyDescr_ConstList2_GetSize | ( | AB_TEXTKEY_DESCR_CONSTLIST2 * | l | ) |
| AB_TEXTKEY_DESCR_CONSTLIST2_ITERATOR* AB_TextKeyDescr_ConstList2_Last | ( | AB_TEXTKEY_DESCR_CONSTLIST2 * | l | ) |
| AB_TEXTKEY_DESCR_CONSTLIST2* AB_TextKeyDescr_ConstList2_new | ( | ) |
| void AB_TextKeyDescr_ConstList2_PopBack | ( | AB_TEXTKEY_DESCR_CONSTLIST2 * | l | ) |
| void AB_TextKeyDescr_ConstList2_PopFront | ( | AB_TEXTKEY_DESCR_CONSTLIST2 * | l | ) |
| void AB_TextKeyDescr_ConstList2_PushBack | ( | AB_TEXTKEY_DESCR_CONSTLIST2 * | l, |
| const AB_TEXTKEY_DESCR * | p | ||
| ) |
| void AB_TextKeyDescr_ConstList2_PushFront | ( | AB_TEXTKEY_DESCR_CONSTLIST2 * | l, |
| const AB_TEXTKEY_DESCR * | p | ||
| ) |
| const AB_TEXTKEY_DESCR* AB_TextKeyDescr_ConstList2Iterator_Data | ( | AB_TEXTKEY_DESCR_CONSTLIST2_ITERATOR * | li | ) |
| void AB_TextKeyDescr_ConstList2Iterator_free | ( | AB_TEXTKEY_DESCR_CONSTLIST2_ITERATOR * | li | ) |
| AB_TEXTKEY_DESCR_CONSTLIST2_ITERATOR* AB_TextKeyDescr_ConstList2Iterator_new | ( | AB_TEXTKEY_DESCR_CONSTLIST2 * | l | ) |
| const AB_TEXTKEY_DESCR* AB_TextKeyDescr_ConstList2Iterator_Next | ( | AB_TEXTKEY_DESCR_CONSTLIST2_ITERATOR * | li | ) |
| const AB_TEXTKEY_DESCR* AB_TextKeyDescr_ConstList2Iterator_Previous | ( | AB_TEXTKEY_DESCR_CONSTLIST2_ITERATOR * | li | ) |
| void AB_TextKeyDescr_List2_Clear | ( | AB_TEXTKEY_DESCR_LIST2 * | l | ) |
Removes all list elements from the list. (The elements are not freed.)
| void AB_TextKeyDescr_List2_Dump | ( | AB_TEXTKEY_DESCR_LIST2 * | l, |
| FILE * | f, | ||
| unsigned int | indent | ||
| ) |
Dumps the contents of the list to an open file (e.g. stderr).
| void AB_TextKeyDescr_List2_Erase | ( | AB_TEXTKEY_DESCR_LIST2 * | l, |
| AB_TEXTKEY_DESCR_LIST2_ITERATOR * | it | ||
| ) |
Removes the element currently pointed to by the given iterator from the list.
| AB_TEXTKEY_DESCR_LIST2_ITERATOR* AB_TextKeyDescr_List2_First | ( | AB_TEXTKEY_DESCR_LIST2 * | l | ) |
Returns a list iterator pointing to the first element.
| AB_TEXTKEY_DESCR* AB_TextKeyDescr_List2_ForEach | ( | AB_TEXTKEY_DESCR_LIST2 * | list, |
| AB_TEXTKEY_DESCR_LIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_TextKeyDescr_List2_free | ( | AB_TEXTKEY_DESCR_LIST2 * | l | ) |
Destroys the list. Please note that the members in this list are not destroyed!
| AB_TEXTKEY_DESCR* AB_TextKeyDescr_List2_GetBack | ( | AB_TEXTKEY_DESCR_LIST2 * | l | ) |
Returns the last element of the list. (The element is not removed from the list.)
| AB_TEXTKEY_DESCR* AB_TextKeyDescr_List2_GetFront | ( | AB_TEXTKEY_DESCR_LIST2 * | l | ) |
Returns the first element of the list. (The element is not removed from the list.)
| unsigned int AB_TextKeyDescr_List2_GetSize | ( | AB_TEXTKEY_DESCR_LIST2 * | l | ) |
Returns the size of this list, i.e. the number of elements in this list.
This number is counted in the list metadata, so this is a cheap operation.
| AB_TEXTKEY_DESCR_LIST2_ITERATOR* AB_TextKeyDescr_List2_Last | ( | AB_TEXTKEY_DESCR_LIST2 * | l | ) |
Returns a list iterator pointing to the last element.
| AB_TEXTKEY_DESCR_LIST2* AB_TextKeyDescr_List2_new | ( | ) |
Creates a new list. This mus be freed using AB_TextKeyDescr_List2_free.
| void AB_TextKeyDescr_List2_PopBack | ( | AB_TEXTKEY_DESCR_LIST2 * | l | ) |
Removes the list's last element from the list. (The element is not freed.)
| void AB_TextKeyDescr_List2_PopFront | ( | AB_TEXTKEY_DESCR_LIST2 * | l | ) |
Removes the list's first element from the list. (The element is not freed.)
| void AB_TextKeyDescr_List2_PushBack | ( | AB_TEXTKEY_DESCR_LIST2 * | l, |
| AB_TEXTKEY_DESCR * | p | ||
| ) |
Appends an element to a list making it the new last element.
| void AB_TextKeyDescr_List2_PushFront | ( | AB_TEXTKEY_DESCR_LIST2 * | l, |
| AB_TEXTKEY_DESCR * | p | ||
| ) |
Inserts an element at the start of the list, making it the new first element.
| AB_TEXTKEY_DESCR* AB_TextKeyDescr_List2Iterator_Data | ( | AB_TEXTKEY_DESCR_LIST2_ITERATOR * | li | ) |
Returns the pointer to the element stored at the list position the iterator currently points to.
| void AB_TextKeyDescr_List2Iterator_free | ( | AB_TEXTKEY_DESCR_LIST2_ITERATOR * | li | ) |
Destroys the list iterator.
| AB_TEXTKEY_DESCR_LIST2_ITERATOR* AB_TextKeyDescr_List2Iterator_new | ( | AB_TEXTKEY_DESCR_LIST2 * | l | ) |
Creates a list iterator for the given list. (FIXME: Should be private).
| AB_TEXTKEY_DESCR* AB_TextKeyDescr_List2Iterator_Next | ( | AB_TEXTKEY_DESCR_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the successor of the currenty selected element and returns that successor element.
| AB_TEXTKEY_DESCR* AB_TextKeyDescr_List2Iterator_Previous | ( | AB_TEXTKEY_DESCR_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the predecessor of the currenty selected element and returns that predecessor element.
| void AB_TextKeyDescr_List_Add | ( | AB_TEXTKEY_DESCR * | element, |
| AB_TEXTKEY_DESCR_LIST * | list | ||
| ) |
Adds the given element to the given list making it the new tail.
| void AB_TextKeyDescr_List_AddList | ( | AB_TEXTKEY_DESCR_LIST * | dst, |
| AB_TEXTKEY_DESCR_LIST * | l | ||
| ) |
Moves the content of one list to another list thus leaving the old list empty.
| void AB_TextKeyDescr_List_Clear | ( | AB_TEXTKEY_DESCR_LIST * | l | ) |
Clears the given list (thus leaving it empty). All elements of this list are deleted via AB_TextKeyDescr_free();
| void AB_TextKeyDescr_List_Del | ( | AB_TEXTKEY_DESCR * | element | ) |
Unlinks the given element from whatever list it may currently be enlisted. If the element is not member of any list the program is aborted. Please note: The element is just unlinked, not deleted.
| AB_TEXTKEY_DESCR* AB_TextKeyDescr_List_First | ( | const AB_TEXTKEY_DESCR_LIST * | l | ) |
Returns the first element of the list.
| void AB_TextKeyDescr_List_free | ( | AB_TEXTKEY_DESCR_LIST * | l | ) |
Destroys the list and frees all its elements.
| uint32_t AB_TextKeyDescr_List_GetCount | ( | const AB_TEXTKEY_DESCR_LIST * | l | ) |
Returns the number of elements currently in the given list.
| void AB_TextKeyDescr_List_Insert | ( | AB_TEXTKEY_DESCR * | element, |
| AB_TEXTKEY_DESCR_LIST * | list | ||
| ) |
Inserts the given element into the given list thus making it the new head of the list.
| AB_TEXTKEY_DESCR* AB_TextKeyDescr_List_Last | ( | const AB_TEXTKEY_DESCR_LIST * | l | ) |
Returns the last element of the list.
| AB_TEXTKEY_DESCR_LIST* AB_TextKeyDescr_List_new | ( | ) |
Creates a new list of AB_TEXTKEY_DESCR.
| AB_TEXTKEY_DESCR* AB_TextKeyDescr_List_Next | ( | const AB_TEXTKEY_DESCR * | element | ) |
Returns the successor of the given element.
| AB_TEXTKEY_DESCR* AB_TextKeyDescr_List_Previous | ( | const AB_TEXTKEY_DESCR * | element | ) |
Returns the predecessor of the given element.
| AB_TEXTKEY_DESCR_LIST_SORT_FN AB_TextKeyDescr_List_SetSortFn | ( | AB_TEXTKEY_DESCR_LIST * | l, |
| AB_TEXTKEY_DESCR_LIST_SORT_FN | fn | ||
| ) |
Set the sort function for the next calls to AB_TextKeyDescr_List_Sort().
| void AB_TextKeyDescr_List_Sort | ( | AB_TEXTKEY_DESCR_LIST * | l, |
| int | ascending | ||
| ) |
Sort the list. Within the course of this function the sort function set via AB_TextKeyDescr_List_SetSortFn is called with the arguments "const AB_TEXTKEY_DESCR *a, const AB_TEXTKEY_DESCR *b, int ascending".
| void AB_Transaction_ConstList2_Clear | ( | AB_TRANSACTION_CONSTLIST2 * | l | ) |
| AB_TRANSACTION_CONSTLIST2_ITERATOR* AB_Transaction_ConstList2_First | ( | AB_TRANSACTION_CONSTLIST2 * | l | ) |
| const AB_TRANSACTION* AB_Transaction_ConstList2_ForEach | ( | AB_TRANSACTION_CONSTLIST2 * | list, |
| AB_TRANSACTION_CONSTLIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_Transaction_ConstList2_free | ( | AB_TRANSACTION_CONSTLIST2 * | l | ) |
| const AB_TRANSACTION* AB_Transaction_ConstList2_GetBack | ( | AB_TRANSACTION_CONSTLIST2 * | l | ) |
| const AB_TRANSACTION* AB_Transaction_ConstList2_GetFront | ( | AB_TRANSACTION_CONSTLIST2 * | l | ) |
| unsigned int AB_Transaction_ConstList2_GetSize | ( | AB_TRANSACTION_CONSTLIST2 * | l | ) |
| AB_TRANSACTION_CONSTLIST2_ITERATOR* AB_Transaction_ConstList2_Last | ( | AB_TRANSACTION_CONSTLIST2 * | l | ) |
| AB_TRANSACTION_CONSTLIST2* AB_Transaction_ConstList2_new | ( | ) |
| void AB_Transaction_ConstList2_PopBack | ( | AB_TRANSACTION_CONSTLIST2 * | l | ) |
| void AB_Transaction_ConstList2_PopFront | ( | AB_TRANSACTION_CONSTLIST2 * | l | ) |
| void AB_Transaction_ConstList2_PushBack | ( | AB_TRANSACTION_CONSTLIST2 * | l, |
| const AB_TRANSACTION * | p | ||
| ) |
| void AB_Transaction_ConstList2_PushFront | ( | AB_TRANSACTION_CONSTLIST2 * | l, |
| const AB_TRANSACTION * | p | ||
| ) |
| const AB_TRANSACTION* AB_Transaction_ConstList2Iterator_Data | ( | AB_TRANSACTION_CONSTLIST2_ITERATOR * | li | ) |
| void AB_Transaction_ConstList2Iterator_free | ( | AB_TRANSACTION_CONSTLIST2_ITERATOR * | li | ) |
| AB_TRANSACTION_CONSTLIST2_ITERATOR* AB_Transaction_ConstList2Iterator_new | ( | AB_TRANSACTION_CONSTLIST2 * | l | ) |
| const AB_TRANSACTION* AB_Transaction_ConstList2Iterator_Next | ( | AB_TRANSACTION_CONSTLIST2_ITERATOR * | li | ) |
| const AB_TRANSACTION* AB_Transaction_ConstList2Iterator_Previous | ( | AB_TRANSACTION_CONSTLIST2_ITERATOR * | li | ) |
| void AB_Transaction_List2_Clear | ( | AB_TRANSACTION_LIST2 * | l | ) |
Removes all list elements from the list. (The elements are not freed.)
| void AB_Transaction_List2_Dump | ( | AB_TRANSACTION_LIST2 * | l, |
| FILE * | f, | ||
| unsigned int | indent | ||
| ) |
Dumps the contents of the list to an open file (e.g. stderr).
| void AB_Transaction_List2_Erase | ( | AB_TRANSACTION_LIST2 * | l, |
| AB_TRANSACTION_LIST2_ITERATOR * | it | ||
| ) |
Removes the element currently pointed to by the given iterator from the list.
| AB_TRANSACTION_LIST2_ITERATOR* AB_Transaction_List2_First | ( | AB_TRANSACTION_LIST2 * | l | ) |
Returns a list iterator pointing to the first element.
| AB_TRANSACTION* AB_Transaction_List2_ForEach | ( | AB_TRANSACTION_LIST2 * | list, |
| AB_TRANSACTION_LIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_Transaction_List2_free | ( | AB_TRANSACTION_LIST2 * | l | ) |
Destroys the list. Please note that the members in this list are not destroyed!
| AB_TRANSACTION* AB_Transaction_List2_GetBack | ( | AB_TRANSACTION_LIST2 * | l | ) |
Returns the last element of the list. (The element is not removed from the list.)
| AB_TRANSACTION* AB_Transaction_List2_GetFront | ( | AB_TRANSACTION_LIST2 * | l | ) |
Returns the first element of the list. (The element is not removed from the list.)
| unsigned int AB_Transaction_List2_GetSize | ( | AB_TRANSACTION_LIST2 * | l | ) |
Returns the size of this list, i.e. the number of elements in this list.
This number is counted in the list metadata, so this is a cheap operation.
| AB_TRANSACTION_LIST2_ITERATOR* AB_Transaction_List2_Last | ( | AB_TRANSACTION_LIST2 * | l | ) |
Returns a list iterator pointing to the last element.
| AB_TRANSACTION_LIST2* AB_Transaction_List2_new | ( | ) |
Creates a new list. This mus be freed using AB_Transaction_List2_free.
| void AB_Transaction_List2_PopBack | ( | AB_TRANSACTION_LIST2 * | l | ) |
Removes the list's last element from the list. (The element is not freed.)
| void AB_Transaction_List2_PopFront | ( | AB_TRANSACTION_LIST2 * | l | ) |
Removes the list's first element from the list. (The element is not freed.)
| void AB_Transaction_List2_PushBack | ( | AB_TRANSACTION_LIST2 * | l, |
| AB_TRANSACTION * | p | ||
| ) |
Appends an element to a list making it the new last element.
| void AB_Transaction_List2_PushFront | ( | AB_TRANSACTION_LIST2 * | l, |
| AB_TRANSACTION * | p | ||
| ) |
Inserts an element at the start of the list, making it the new first element.
| AB_TRANSACTION* AB_Transaction_List2Iterator_Data | ( | AB_TRANSACTION_LIST2_ITERATOR * | li | ) |
Returns the pointer to the element stored at the list position the iterator currently points to.
| void AB_Transaction_List2Iterator_free | ( | AB_TRANSACTION_LIST2_ITERATOR * | li | ) |
Destroys the list iterator.
| AB_TRANSACTION_LIST2_ITERATOR* AB_Transaction_List2Iterator_new | ( | AB_TRANSACTION_LIST2 * | l | ) |
Creates a list iterator for the given list. (FIXME: Should be private).
| AB_TRANSACTION* AB_Transaction_List2Iterator_Next | ( | AB_TRANSACTION_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the successor of the currenty selected element and returns that successor element.
| AB_TRANSACTION* AB_Transaction_List2Iterator_Previous | ( | AB_TRANSACTION_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the predecessor of the currenty selected element and returns that predecessor element.
| void AB_Transaction_List_Add | ( | AB_TRANSACTION * | element, |
| AB_TRANSACTION_LIST * | list | ||
| ) |
Adds the given element to the given list making it the new tail.
| void AB_Transaction_List_AddList | ( | AB_TRANSACTION_LIST * | dst, |
| AB_TRANSACTION_LIST * | l | ||
| ) |
Moves the content of one list to another list thus leaving the old list empty.
| void AB_Transaction_List_Clear | ( | AB_TRANSACTION_LIST * | l | ) |
Clears the given list (thus leaving it empty). All elements of this list are deleted via AB_Transaction_free();
| void AB_Transaction_List_Del | ( | AB_TRANSACTION * | element | ) |
Unlinks the given element from whatever list it may currently be enlisted. If the element is not member of any list the program is aborted. Please note: The element is just unlinked, not deleted.
| AB_TRANSACTION* AB_Transaction_List_First | ( | const AB_TRANSACTION_LIST * | l | ) |
Returns the first element of the list.
| void AB_Transaction_List_free | ( | AB_TRANSACTION_LIST * | l | ) |
Destroys the list and frees all its elements.
| uint32_t AB_Transaction_List_GetCount | ( | const AB_TRANSACTION_LIST * | l | ) |
Returns the number of elements currently in the given list.
| void AB_Transaction_List_Insert | ( | AB_TRANSACTION * | element, |
| AB_TRANSACTION_LIST * | list | ||
| ) |
Inserts the given element into the given list thus making it the new head of the list.
| AB_TRANSACTION* AB_Transaction_List_Last | ( | const AB_TRANSACTION_LIST * | l | ) |
Returns the last element of the list.
| AB_TRANSACTION_LIST* AB_Transaction_List_new | ( | ) |
Creates a new list of AB_TRANSACTION.
| AB_TRANSACTION* AB_Transaction_List_Next | ( | const AB_TRANSACTION * | element | ) |
Returns the successor of the given element.
| AB_TRANSACTION* AB_Transaction_List_Previous | ( | const AB_TRANSACTION * | element | ) |
Returns the predecessor of the given element.
| AB_TRANSACTION_LIST_SORT_FN AB_Transaction_List_SetSortFn | ( | AB_TRANSACTION_LIST * | l, |
| AB_TRANSACTION_LIST_SORT_FN | fn | ||
| ) |
Set the sort function for the next calls to AB_Transaction_List_Sort().
| void AB_Transaction_List_Sort | ( | AB_TRANSACTION_LIST * | l, |
| int | ascending | ||
| ) |
Sort the list. Within the course of this function the sort function set via AB_Transaction_List_SetSortFn is called with the arguments "const AB_TRANSACTION *a, const AB_TRANSACTION *b, int ascending".
| void AB_TransactionLimits_ConstList2_Clear | ( | AB_TRANSACTION_LIMITS_CONSTLIST2 * | l | ) |
| AB_TRANSACTION_LIMITS_CONSTLIST2_ITERATOR* AB_TransactionLimits_ConstList2_First | ( | AB_TRANSACTION_LIMITS_CONSTLIST2 * | l | ) |
| const AB_TRANSACTION_LIMITS* AB_TransactionLimits_ConstList2_ForEach | ( | AB_TRANSACTION_LIMITS_CONSTLIST2 * | list, |
| AB_TRANSACTION_LIMITS_CONSTLIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_TransactionLimits_ConstList2_free | ( | AB_TRANSACTION_LIMITS_CONSTLIST2 * | l | ) |
| const AB_TRANSACTION_LIMITS* AB_TransactionLimits_ConstList2_GetBack | ( | AB_TRANSACTION_LIMITS_CONSTLIST2 * | l | ) |
| const AB_TRANSACTION_LIMITS* AB_TransactionLimits_ConstList2_GetFront | ( | AB_TRANSACTION_LIMITS_CONSTLIST2 * | l | ) |
| unsigned int AB_TransactionLimits_ConstList2_GetSize | ( | AB_TRANSACTION_LIMITS_CONSTLIST2 * | l | ) |
| AB_TRANSACTION_LIMITS_CONSTLIST2_ITERATOR* AB_TransactionLimits_ConstList2_Last | ( | AB_TRANSACTION_LIMITS_CONSTLIST2 * | l | ) |
| AB_TRANSACTION_LIMITS_CONSTLIST2* AB_TransactionLimits_ConstList2_new | ( | ) |
| void AB_TransactionLimits_ConstList2_PopBack | ( | AB_TRANSACTION_LIMITS_CONSTLIST2 * | l | ) |
| void AB_TransactionLimits_ConstList2_PopFront | ( | AB_TRANSACTION_LIMITS_CONSTLIST2 * | l | ) |
| void AB_TransactionLimits_ConstList2_PushBack | ( | AB_TRANSACTION_LIMITS_CONSTLIST2 * | l, |
| const AB_TRANSACTION_LIMITS * | p | ||
| ) |
| void AB_TransactionLimits_ConstList2_PushFront | ( | AB_TRANSACTION_LIMITS_CONSTLIST2 * | l, |
| const AB_TRANSACTION_LIMITS * | p | ||
| ) |
| const AB_TRANSACTION_LIMITS* AB_TransactionLimits_ConstList2Iterator_Data | ( | AB_TRANSACTION_LIMITS_CONSTLIST2_ITERATOR * | li | ) |
| void AB_TransactionLimits_ConstList2Iterator_free | ( | AB_TRANSACTION_LIMITS_CONSTLIST2_ITERATOR * | li | ) |
| AB_TRANSACTION_LIMITS_CONSTLIST2_ITERATOR* AB_TransactionLimits_ConstList2Iterator_new | ( | AB_TRANSACTION_LIMITS_CONSTLIST2 * | l | ) |
| const AB_TRANSACTION_LIMITS* AB_TransactionLimits_ConstList2Iterator_Next | ( | AB_TRANSACTION_LIMITS_CONSTLIST2_ITERATOR * | li | ) |
| const AB_TRANSACTION_LIMITS* AB_TransactionLimits_ConstList2Iterator_Previous | ( | AB_TRANSACTION_LIMITS_CONSTLIST2_ITERATOR * | li | ) |
| void AB_TransactionLimits_List2_Clear | ( | AB_TRANSACTION_LIMITS_LIST2 * | l | ) |
Removes all list elements from the list. (The elements are not freed.)
| void AB_TransactionLimits_List2_Dump | ( | AB_TRANSACTION_LIMITS_LIST2 * | l, |
| FILE * | f, | ||
| unsigned int | indent | ||
| ) |
Dumps the contents of the list to an open file (e.g. stderr).
| void AB_TransactionLimits_List2_Erase | ( | AB_TRANSACTION_LIMITS_LIST2 * | l, |
| AB_TRANSACTION_LIMITS_LIST2_ITERATOR * | it | ||
| ) |
Removes the element currently pointed to by the given iterator from the list.
| AB_TRANSACTION_LIMITS_LIST2_ITERATOR* AB_TransactionLimits_List2_First | ( | AB_TRANSACTION_LIMITS_LIST2 * | l | ) |
Returns a list iterator pointing to the first element.
| AB_TRANSACTION_LIMITS* AB_TransactionLimits_List2_ForEach | ( | AB_TRANSACTION_LIMITS_LIST2 * | list, |
| AB_TRANSACTION_LIMITS_LIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_TransactionLimits_List2_free | ( | AB_TRANSACTION_LIMITS_LIST2 * | l | ) |
Destroys the list. Please note that the members in this list are not destroyed!
| AB_TRANSACTION_LIMITS* AB_TransactionLimits_List2_GetBack | ( | AB_TRANSACTION_LIMITS_LIST2 * | l | ) |
Returns the last element of the list. (The element is not removed from the list.)
| AB_TRANSACTION_LIMITS* AB_TransactionLimits_List2_GetFront | ( | AB_TRANSACTION_LIMITS_LIST2 * | l | ) |
Returns the first element of the list. (The element is not removed from the list.)
| unsigned int AB_TransactionLimits_List2_GetSize | ( | AB_TRANSACTION_LIMITS_LIST2 * | l | ) |
Returns the size of this list, i.e. the number of elements in this list.
This number is counted in the list metadata, so this is a cheap operation.
| AB_TRANSACTION_LIMITS_LIST2_ITERATOR* AB_TransactionLimits_List2_Last | ( | AB_TRANSACTION_LIMITS_LIST2 * | l | ) |
Returns a list iterator pointing to the last element.
| AB_TRANSACTION_LIMITS_LIST2* AB_TransactionLimits_List2_new | ( | ) |
Creates a new list. This mus be freed using AB_TransactionLimits_List2_free.
| void AB_TransactionLimits_List2_PopBack | ( | AB_TRANSACTION_LIMITS_LIST2 * | l | ) |
Removes the list's last element from the list. (The element is not freed.)
| void AB_TransactionLimits_List2_PopFront | ( | AB_TRANSACTION_LIMITS_LIST2 * | l | ) |
Removes the list's first element from the list. (The element is not freed.)
| void AB_TransactionLimits_List2_PushBack | ( | AB_TRANSACTION_LIMITS_LIST2 * | l, |
| AB_TRANSACTION_LIMITS * | p | ||
| ) |
Appends an element to a list making it the new last element.
| void AB_TransactionLimits_List2_PushFront | ( | AB_TRANSACTION_LIMITS_LIST2 * | l, |
| AB_TRANSACTION_LIMITS * | p | ||
| ) |
Inserts an element at the start of the list, making it the new first element.
| AB_TRANSACTION_LIMITS* AB_TransactionLimits_List2Iterator_Data | ( | AB_TRANSACTION_LIMITS_LIST2_ITERATOR * | li | ) |
Returns the pointer to the element stored at the list position the iterator currently points to.
| void AB_TransactionLimits_List2Iterator_free | ( | AB_TRANSACTION_LIMITS_LIST2_ITERATOR * | li | ) |
Destroys the list iterator.
| AB_TRANSACTION_LIMITS_LIST2_ITERATOR* AB_TransactionLimits_List2Iterator_new | ( | AB_TRANSACTION_LIMITS_LIST2 * | l | ) |
Creates a list iterator for the given list. (FIXME: Should be private).
| AB_TRANSACTION_LIMITS* AB_TransactionLimits_List2Iterator_Next | ( | AB_TRANSACTION_LIMITS_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the successor of the currenty selected element and returns that successor element.
| AB_TRANSACTION_LIMITS* AB_TransactionLimits_List2Iterator_Previous | ( | AB_TRANSACTION_LIMITS_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the predecessor of the currenty selected element and returns that predecessor element.
| void AB_TransactionLimits_List_Add | ( | AB_TRANSACTION_LIMITS * | element, |
| AB_TRANSACTION_LIMITS_LIST * | list | ||
| ) |
Adds the given element to the given list making it the new tail.
| void AB_TransactionLimits_List_AddList | ( | AB_TRANSACTION_LIMITS_LIST * | dst, |
| AB_TRANSACTION_LIMITS_LIST * | l | ||
| ) |
Moves the content of one list to another list thus leaving the old list empty.
| void AB_TransactionLimits_List_Clear | ( | AB_TRANSACTION_LIMITS_LIST * | l | ) |
Clears the given list (thus leaving it empty). All elements of this list are deleted via AB_TransactionLimits_free();
| void AB_TransactionLimits_List_Del | ( | AB_TRANSACTION_LIMITS * | element | ) |
Unlinks the given element from whatever list it may currently be enlisted. If the element is not member of any list the program is aborted. Please note: The element is just unlinked, not deleted.
| AB_TRANSACTION_LIMITS* AB_TransactionLimits_List_First | ( | const AB_TRANSACTION_LIMITS_LIST * | l | ) |
Returns the first element of the list.
| void AB_TransactionLimits_List_free | ( | AB_TRANSACTION_LIMITS_LIST * | l | ) |
Destroys the list and frees all its elements.
| uint32_t AB_TransactionLimits_List_GetCount | ( | const AB_TRANSACTION_LIMITS_LIST * | l | ) |
Returns the number of elements currently in the given list.
| void AB_TransactionLimits_List_Insert | ( | AB_TRANSACTION_LIMITS * | element, |
| AB_TRANSACTION_LIMITS_LIST * | list | ||
| ) |
Inserts the given element into the given list thus making it the new head of the list.
| AB_TRANSACTION_LIMITS* AB_TransactionLimits_List_Last | ( | const AB_TRANSACTION_LIMITS_LIST * | l | ) |
Returns the last element of the list.
| AB_TRANSACTION_LIMITS_LIST* AB_TransactionLimits_List_new | ( | ) |
Creates a new list of AB_TRANSACTION_LIMITS.
| AB_TRANSACTION_LIMITS* AB_TransactionLimits_List_Next | ( | const AB_TRANSACTION_LIMITS * | element | ) |
Returns the successor of the given element.
| AB_TRANSACTION_LIMITS* AB_TransactionLimits_List_Previous | ( | const AB_TRANSACTION_LIMITS * | element | ) |
Returns the predecessor of the given element.
| AB_TRANSACTION_LIMITS_LIST_SORT_FN AB_TransactionLimits_List_SetSortFn | ( | AB_TRANSACTION_LIMITS_LIST * | l, |
| AB_TRANSACTION_LIMITS_LIST_SORT_FN | fn | ||
| ) |
Set the sort function for the next calls to AB_TransactionLimits_List_Sort().
| void AB_TransactionLimits_List_Sort | ( | AB_TRANSACTION_LIMITS_LIST * | l, |
| int | ascending | ||
| ) |
Sort the list. Within the course of this function the sort function set via AB_TransactionLimits_List_SetSortFn is called with the arguments "const AB_TRANSACTION_LIMITS *a, const AB_TRANSACTION_LIMITS *b, int ascending".
| void AB_User_ConstList2_Clear | ( | AB_USER_CONSTLIST2 * | l | ) |
| AB_USER_CONSTLIST2_ITERATOR* AB_User_ConstList2_First | ( | AB_USER_CONSTLIST2 * | l | ) |
| const AB_USER* AB_User_ConstList2_ForEach | ( | AB_USER_CONSTLIST2 * | list, |
| AB_USER_CONSTLIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_User_ConstList2_free | ( | AB_USER_CONSTLIST2 * | l | ) |
| const AB_USER* AB_User_ConstList2_GetBack | ( | AB_USER_CONSTLIST2 * | l | ) |
| const AB_USER* AB_User_ConstList2_GetFront | ( | AB_USER_CONSTLIST2 * | l | ) |
| unsigned int AB_User_ConstList2_GetSize | ( | AB_USER_CONSTLIST2 * | l | ) |
| AB_USER_CONSTLIST2_ITERATOR* AB_User_ConstList2_Last | ( | AB_USER_CONSTLIST2 * | l | ) |
| AB_USER_CONSTLIST2* AB_User_ConstList2_new | ( | ) |
| void AB_User_ConstList2_PopBack | ( | AB_USER_CONSTLIST2 * | l | ) |
| void AB_User_ConstList2_PopFront | ( | AB_USER_CONSTLIST2 * | l | ) |
| void AB_User_ConstList2_PushBack | ( | AB_USER_CONSTLIST2 * | l, |
| const AB_USER * | p | ||
| ) |
| void AB_User_ConstList2_PushFront | ( | AB_USER_CONSTLIST2 * | l, |
| const AB_USER * | p | ||
| ) |
| const AB_USER* AB_User_ConstList2Iterator_Data | ( | AB_USER_CONSTLIST2_ITERATOR * | li | ) |
| void AB_User_ConstList2Iterator_free | ( | AB_USER_CONSTLIST2_ITERATOR * | li | ) |
| AB_USER_CONSTLIST2_ITERATOR* AB_User_ConstList2Iterator_new | ( | AB_USER_CONSTLIST2 * | l | ) |
| const AB_USER* AB_User_ConstList2Iterator_Next | ( | AB_USER_CONSTLIST2_ITERATOR * | li | ) |
| const AB_USER* AB_User_ConstList2Iterator_Previous | ( | AB_USER_CONSTLIST2_ITERATOR * | li | ) |
| void AB_User_List2_Clear | ( | AB_USER_LIST2 * | l | ) |
Removes all list elements from the list. (The elements are not freed.)
| void AB_User_List2_Dump | ( | AB_USER_LIST2 * | l, |
| FILE * | f, | ||
| unsigned int | indent | ||
| ) |
Dumps the contents of the list to an open file (e.g. stderr).
| void AB_User_List2_Erase | ( | AB_USER_LIST2 * | l, |
| AB_USER_LIST2_ITERATOR * | it | ||
| ) |
Removes the element currently pointed to by the given iterator from the list.
| AB_USER_LIST2_ITERATOR* AB_User_List2_First | ( | AB_USER_LIST2 * | l | ) |
Returns a list iterator pointing to the first element.
| AB_USER* AB_User_List2_ForEach | ( | AB_USER_LIST2 * | list, |
| AB_USER_LIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AB_User_List2_free | ( | AB_USER_LIST2 * | l | ) |
Destroys the list. Please note that the members in this list are not destroyed!
| AB_USER* AB_User_List2_GetBack | ( | AB_USER_LIST2 * | l | ) |
Returns the last element of the list. (The element is not removed from the list.)
| AB_USER* AB_User_List2_GetFront | ( | AB_USER_LIST2 * | l | ) |
Returns the first element of the list. (The element is not removed from the list.)
| unsigned int AB_User_List2_GetSize | ( | AB_USER_LIST2 * | l | ) |
Returns the size of this list, i.e. the number of elements in this list.
This number is counted in the list metadata, so this is a cheap operation.
| AB_USER_LIST2_ITERATOR* AB_User_List2_Last | ( | AB_USER_LIST2 * | l | ) |
Returns a list iterator pointing to the last element.
| AB_USER_LIST2* AB_User_List2_new | ( | ) |
Creates a new list. This mus be freed using AB_User_List2_free.
| void AB_User_List2_PopBack | ( | AB_USER_LIST2 * | l | ) |
Removes the list's last element from the list. (The element is not freed.)
| void AB_User_List2_PopFront | ( | AB_USER_LIST2 * | l | ) |
Removes the list's first element from the list. (The element is not freed.)
| void AB_User_List2_PushBack | ( | AB_USER_LIST2 * | l, |
| AB_USER * | p | ||
| ) |
Appends an element to a list making it the new last element.
| void AB_User_List2_PushFront | ( | AB_USER_LIST2 * | l, |
| AB_USER * | p | ||
| ) |
Inserts an element at the start of the list, making it the new first element.
| AB_USER* AB_User_List2Iterator_Data | ( | AB_USER_LIST2_ITERATOR * | li | ) |
Returns the pointer to the element stored at the list position the iterator currently points to.
| void AB_User_List2Iterator_free | ( | AB_USER_LIST2_ITERATOR * | li | ) |
Destroys the list iterator.
| AB_USER_LIST2_ITERATOR* AB_User_List2Iterator_new | ( | AB_USER_LIST2 * | l | ) |
Creates a list iterator for the given list. (FIXME: Should be private).
| AB_USER* AB_User_List2Iterator_Next | ( | AB_USER_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the successor of the currenty selected element and returns that successor element.
| AB_USER* AB_User_List2Iterator_Previous | ( | AB_USER_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the predecessor of the currenty selected element and returns that predecessor element.
| void AB_UserQueue_List_Add | ( | AB_USERQUEUE * | element, |
| AB_USERQUEUE_LIST * | list | ||
| ) |
Adds the given element to the given list making it the new tail.
| void AB_UserQueue_List_AddList | ( | AB_USERQUEUE_LIST * | dst, |
| AB_USERQUEUE_LIST * | l | ||
| ) |
Moves the content of one list to another list thus leaving the old list empty.
| void AB_UserQueue_List_Clear | ( | AB_USERQUEUE_LIST * | l | ) |
Clears the given list (thus leaving it empty). All elements of this list are deleted via AB_UserQueue_free();
| void AB_UserQueue_List_Del | ( | AB_USERQUEUE * | element | ) |
Unlinks the given element from whatever list it may currently be enlisted. If the element is not member of any list the program is aborted. Please note: The element is just unlinked, not deleted.
| AB_USERQUEUE* AB_UserQueue_List_First | ( | const AB_USERQUEUE_LIST * | l | ) |
Returns the first element of the list.
| void AB_UserQueue_List_free | ( | AB_USERQUEUE_LIST * | l | ) |
Destroys the list and frees all its elements.
| uint32_t AB_UserQueue_List_GetCount | ( | const AB_USERQUEUE_LIST * | l | ) |
Returns the number of elements currently in the given list.
| void AB_UserQueue_List_Insert | ( | AB_USERQUEUE * | element, |
| AB_USERQUEUE_LIST * | list | ||
| ) |
Inserts the given element into the given list thus making it the new head of the list.
| AB_USERQUEUE* AB_UserQueue_List_Last | ( | const AB_USERQUEUE_LIST * | l | ) |
Returns the last element of the list.
| AB_USERQUEUE_LIST* AB_UserQueue_List_new | ( | ) |
Creates a new list of AB_USERQUEUE.
| AB_USERQUEUE* AB_UserQueue_List_Next | ( | const AB_USERQUEUE * | element | ) |
Returns the successor of the given element.
| AB_USERQUEUE* AB_UserQueue_List_Previous | ( | const AB_USERQUEUE * | element | ) |
Returns the predecessor of the given element.
| AB_USERQUEUE_LIST_SORT_FN AB_UserQueue_List_SetSortFn | ( | AB_USERQUEUE_LIST * | l, |
| AB_USERQUEUE_LIST_SORT_FN | fn | ||
| ) |
Set the sort function for the next calls to AB_UserQueue_List_Sort().
| void AB_UserQueue_List_Sort | ( | AB_USERQUEUE_LIST * | l, |
| int | ascending | ||
| ) |
Sort the list. Within the course of this function the sort function set via AB_UserQueue_List_SetSortFn is called with the arguments "const AB_USERQUEUE *a, const AB_USERQUEUE *b, int ascending".
| void AB_Value_List_Add | ( | AB_VALUE * | element, |
| AB_VALUE_LIST * | list | ||
| ) |
Adds the given element to the given list making it the new tail.
| void AB_Value_List_AddList | ( | AB_VALUE_LIST * | dst, |
| AB_VALUE_LIST * | l | ||
| ) |
Moves the content of one list to another list thus leaving the old list empty.
| void AB_Value_List_Clear | ( | AB_VALUE_LIST * | l | ) |
Clears the given list (thus leaving it empty). All elements of this list are deleted via AB_Value_free();
| void AB_Value_List_Del | ( | AB_VALUE * | element | ) |
Unlinks the given element from whatever list it may currently be enlisted. If the element is not member of any list the program is aborted. Please note: The element is just unlinked, not deleted.
| AB_VALUE* AB_Value_List_First | ( | const AB_VALUE_LIST * | l | ) |
Returns the first element of the list.
| void AB_Value_List_free | ( | AB_VALUE_LIST * | l | ) |
Destroys the list and frees all its elements.
| uint32_t AB_Value_List_GetCount | ( | const AB_VALUE_LIST * | l | ) |
Returns the number of elements currently in the given list.
| void AB_Value_List_Insert | ( | AB_VALUE * | element, |
| AB_VALUE_LIST * | list | ||
| ) |
Inserts the given element into the given list thus making it the new head of the list.
| AB_VALUE* AB_Value_List_Last | ( | const AB_VALUE_LIST * | l | ) |
Returns the last element of the list.
| AB_VALUE_LIST* AB_Value_List_new | ( | ) |
Creates a new list of AB_VALUE.
Returns the successor of the given element.
Returns the predecessor of the given element.
| AB_VALUE_LIST_SORT_FN AB_Value_List_SetSortFn | ( | AB_VALUE_LIST * | l, |
| AB_VALUE_LIST_SORT_FN | fn | ||
| ) |
Set the sort function for the next calls to AB_Value_List_Sort().
| void AB_Value_List_Sort | ( | AB_VALUE_LIST * | l, |
| int | ascending | ||
| ) |
Sort the list. Within the course of this function the sort function set via AB_Value_List_SetSortFn is called with the arguments "const AB_VALUE *a, const AB_VALUE *b, int ascending".
| void AH_TanMethod_ConstList2_Clear | ( | AH_TAN_METHOD_CONSTLIST2 * | l | ) |
| AH_TAN_METHOD_CONSTLIST2_ITERATOR* AH_TanMethod_ConstList2_First | ( | AH_TAN_METHOD_CONSTLIST2 * | l | ) |
| const AH_TAN_METHOD* AH_TanMethod_ConstList2_ForEach | ( | AH_TAN_METHOD_CONSTLIST2 * | list, |
| AH_TAN_METHOD_CONSTLIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AH_TanMethod_ConstList2_free | ( | AH_TAN_METHOD_CONSTLIST2 * | l | ) |
| const AH_TAN_METHOD* AH_TanMethod_ConstList2_GetBack | ( | AH_TAN_METHOD_CONSTLIST2 * | l | ) |
| const AH_TAN_METHOD* AH_TanMethod_ConstList2_GetFront | ( | AH_TAN_METHOD_CONSTLIST2 * | l | ) |
| unsigned int AH_TanMethod_ConstList2_GetSize | ( | AH_TAN_METHOD_CONSTLIST2 * | l | ) |
| AH_TAN_METHOD_CONSTLIST2_ITERATOR* AH_TanMethod_ConstList2_Last | ( | AH_TAN_METHOD_CONSTLIST2 * | l | ) |
| AH_TAN_METHOD_CONSTLIST2* AH_TanMethod_ConstList2_new | ( | ) |
| void AH_TanMethod_ConstList2_PopBack | ( | AH_TAN_METHOD_CONSTLIST2 * | l | ) |
| void AH_TanMethod_ConstList2_PopFront | ( | AH_TAN_METHOD_CONSTLIST2 * | l | ) |
| void AH_TanMethod_ConstList2_PushBack | ( | AH_TAN_METHOD_CONSTLIST2 * | l, |
| const AH_TAN_METHOD * | p | ||
| ) |
| void AH_TanMethod_ConstList2_PushFront | ( | AH_TAN_METHOD_CONSTLIST2 * | l, |
| const AH_TAN_METHOD * | p | ||
| ) |
| const AH_TAN_METHOD* AH_TanMethod_ConstList2Iterator_Data | ( | AH_TAN_METHOD_CONSTLIST2_ITERATOR * | li | ) |
| void AH_TanMethod_ConstList2Iterator_free | ( | AH_TAN_METHOD_CONSTLIST2_ITERATOR * | li | ) |
| AH_TAN_METHOD_CONSTLIST2_ITERATOR* AH_TanMethod_ConstList2Iterator_new | ( | AH_TAN_METHOD_CONSTLIST2 * | l | ) |
| const AH_TAN_METHOD* AH_TanMethod_ConstList2Iterator_Next | ( | AH_TAN_METHOD_CONSTLIST2_ITERATOR * | li | ) |
| const AH_TAN_METHOD* AH_TanMethod_ConstList2Iterator_Previous | ( | AH_TAN_METHOD_CONSTLIST2_ITERATOR * | li | ) |
| void AH_TanMethod_List2_Clear | ( | AH_TAN_METHOD_LIST2 * | l | ) |
Removes all list elements from the list. (The elements are not freed.)
| void AH_TanMethod_List2_Dump | ( | AH_TAN_METHOD_LIST2 * | l, |
| FILE * | f, | ||
| unsigned int | indent | ||
| ) |
Dumps the contents of the list to an open file (e.g. stderr).
| void AH_TanMethod_List2_Erase | ( | AH_TAN_METHOD_LIST2 * | l, |
| AH_TAN_METHOD_LIST2_ITERATOR * | it | ||
| ) |
Removes the element currently pointed to by the given iterator from the list.
| AH_TAN_METHOD_LIST2_ITERATOR* AH_TanMethod_List2_First | ( | AH_TAN_METHOD_LIST2 * | l | ) |
Returns a list iterator pointing to the first element.
| AH_TAN_METHOD* AH_TanMethod_List2_ForEach | ( | AH_TAN_METHOD_LIST2 * | list, |
| AH_TAN_METHOD_LIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void AH_TanMethod_List2_free | ( | AH_TAN_METHOD_LIST2 * | l | ) |
Destroys the list. Please note that the members in this list are not destroyed!
| AH_TAN_METHOD* AH_TanMethod_List2_GetBack | ( | AH_TAN_METHOD_LIST2 * | l | ) |
Returns the last element of the list. (The element is not removed from the list.)
| AH_TAN_METHOD* AH_TanMethod_List2_GetFront | ( | AH_TAN_METHOD_LIST2 * | l | ) |
Returns the first element of the list. (The element is not removed from the list.)
| unsigned int AH_TanMethod_List2_GetSize | ( | AH_TAN_METHOD_LIST2 * | l | ) |
Returns the size of this list, i.e. the number of elements in this list.
This number is counted in the list metadata, so this is a cheap operation.
| AH_TAN_METHOD_LIST2_ITERATOR* AH_TanMethod_List2_Last | ( | AH_TAN_METHOD_LIST2 * | l | ) |
Returns a list iterator pointing to the last element.
| AH_TAN_METHOD_LIST2* AH_TanMethod_List2_new | ( | ) |
Creates a new list. This mus be freed using AH_TanMethod_List2_free.
| void AH_TanMethod_List2_PopBack | ( | AH_TAN_METHOD_LIST2 * | l | ) |
Removes the list's last element from the list. (The element is not freed.)
| void AH_TanMethod_List2_PopFront | ( | AH_TAN_METHOD_LIST2 * | l | ) |
Removes the list's first element from the list. (The element is not freed.)
| void AH_TanMethod_List2_PushBack | ( | AH_TAN_METHOD_LIST2 * | l, |
| AH_TAN_METHOD * | p | ||
| ) |
Appends an element to a list making it the new last element.
| void AH_TanMethod_List2_PushFront | ( | AH_TAN_METHOD_LIST2 * | l, |
| AH_TAN_METHOD * | p | ||
| ) |
Inserts an element at the start of the list, making it the new first element.
| AH_TAN_METHOD* AH_TanMethod_List2Iterator_Data | ( | AH_TAN_METHOD_LIST2_ITERATOR * | li | ) |
Returns the pointer to the element stored at the list position the iterator currently points to.
| void AH_TanMethod_List2Iterator_free | ( | AH_TAN_METHOD_LIST2_ITERATOR * | li | ) |
Destroys the list iterator.
| AH_TAN_METHOD_LIST2_ITERATOR* AH_TanMethod_List2Iterator_new | ( | AH_TAN_METHOD_LIST2 * | l | ) |
Creates a list iterator for the given list. (FIXME: Should be private).
| AH_TAN_METHOD* AH_TanMethod_List2Iterator_Next | ( | AH_TAN_METHOD_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the successor of the currenty selected element and returns that successor element.
| AH_TAN_METHOD* AH_TanMethod_List2Iterator_Previous | ( | AH_TAN_METHOD_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the predecessor of the currenty selected element and returns that predecessor element.
| void AH_TanMethod_List_Add | ( | AH_TAN_METHOD * | element, |
| AH_TAN_METHOD_LIST * | list | ||
| ) |
Adds the given element to the given list making it the new tail.
| void AH_TanMethod_List_AddList | ( | AH_TAN_METHOD_LIST * | dst, |
| AH_TAN_METHOD_LIST * | l | ||
| ) |
Moves the content of one list to another list thus leaving the old list empty.
| void AH_TanMethod_List_Clear | ( | AH_TAN_METHOD_LIST * | l | ) |
Clears the given list (thus leaving it empty). All elements of this list are deleted via AH_TanMethod_free();
| void AH_TanMethod_List_Del | ( | AH_TAN_METHOD * | element | ) |
Unlinks the given element from whatever list it may currently be enlisted. If the element is not member of any list the program is aborted. Please note: The element is just unlinked, not deleted.
| AH_TAN_METHOD* AH_TanMethod_List_First | ( | const AH_TAN_METHOD_LIST * | l | ) |
Returns the first element of the list.
| void AH_TanMethod_List_free | ( | AH_TAN_METHOD_LIST * | l | ) |
Destroys the list and frees all its elements.
| uint32_t AH_TanMethod_List_GetCount | ( | const AH_TAN_METHOD_LIST * | l | ) |
Returns the number of elements currently in the given list.
| void AH_TanMethod_List_Insert | ( | AH_TAN_METHOD * | element, |
| AH_TAN_METHOD_LIST * | list | ||
| ) |
Inserts the given element into the given list thus making it the new head of the list.
| AH_TAN_METHOD* AH_TanMethod_List_Last | ( | const AH_TAN_METHOD_LIST * | l | ) |
Returns the last element of the list.
| AH_TAN_METHOD_LIST* AH_TanMethod_List_new | ( | ) |
Creates a new list of AH_TAN_METHOD.
| AH_TAN_METHOD* AH_TanMethod_List_Next | ( | const AH_TAN_METHOD * | element | ) |
Returns the successor of the given element.
| AH_TAN_METHOD* AH_TanMethod_List_Previous | ( | const AH_TAN_METHOD * | element | ) |
Returns the predecessor of the given element.
| AH_TAN_METHOD_LIST_SORT_FN AH_TanMethod_List_SetSortFn | ( | AH_TAN_METHOD_LIST * | l, |
| AH_TAN_METHOD_LIST_SORT_FN | fn | ||
| ) |
Set the sort function for the next calls to AH_TanMethod_List_Sort().
| void AH_TanMethod_List_Sort | ( | AH_TAN_METHOD_LIST * | l, |
| int | ascending | ||
| ) |
Sort the list. Within the course of this function the sort function set via AH_TanMethod_List_SetSortFn is called with the arguments "const AH_TAN_METHOD *a, const AH_TAN_METHOD *b, int ascending".
| void EB_Eu_List_Add | ( | EB_EU * | element, |
| EB_EU_LIST * | list | ||
| ) |
Adds the given element to the given list making it the new tail.
| void EB_Eu_List_AddList | ( | EB_EU_LIST * | dst, |
| EB_EU_LIST * | l | ||
| ) |
Moves the content of one list to another list thus leaving the old list empty.
| void EB_Eu_List_Clear | ( | EB_EU_LIST * | l | ) |
Clears the given list (thus leaving it empty). All elements of this list are deleted via EB_Eu_free();
| void EB_Eu_List_Del | ( | EB_EU * | element | ) |
Unlinks the given element from whatever list it may currently be enlisted. If the element is not member of any list the program is aborted. Please note: The element is just unlinked, not deleted.
| EB_EU* EB_Eu_List_First | ( | const EB_EU_LIST * | l | ) |
Returns the first element of the list.
| void EB_Eu_List_free | ( | EB_EU_LIST * | l | ) |
Destroys the list and frees all its elements.
| uint32_t EB_Eu_List_GetCount | ( | const EB_EU_LIST * | l | ) |
Returns the number of elements currently in the given list.
| void EB_Eu_List_Insert | ( | EB_EU * | element, |
| EB_EU_LIST * | list | ||
| ) |
Inserts the given element into the given list thus making it the new head of the list.
| EB_EU* EB_Eu_List_Last | ( | const EB_EU_LIST * | l | ) |
Returns the last element of the list.
| EB_EU_LIST* EB_Eu_List_new | ( | ) |
Creates a new list of EB_EU.
| EB_EU_LIST_SORT_FN EB_Eu_List_SetSortFn | ( | EB_EU_LIST * | l, |
| EB_EU_LIST_SORT_FN | fn | ||
| ) |
Set the sort function for the next calls to EB_Eu_List_Sort().
| void EB_Eu_List_Sort | ( | EB_EU_LIST * | l, |
| int | ascending | ||
| ) |
Sort the list. Within the course of this function the sort function set via EB_Eu_List_SetSortFn is called with the arguments "const EB_EU *a, const EB_EU *b, int ascending".
| void OH_InstituteData_ConstList2_Clear | ( | OH_INSTITUTE_DATA_CONSTLIST2 * | l | ) |
| OH_INSTITUTE_DATA_CONSTLIST2_ITERATOR* OH_InstituteData_ConstList2_First | ( | OH_INSTITUTE_DATA_CONSTLIST2 * | l | ) |
| const OH_INSTITUTE_DATA* OH_InstituteData_ConstList2_ForEach | ( | OH_INSTITUTE_DATA_CONSTLIST2 * | list, |
| OH_INSTITUTE_DATA_CONSTLIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void OH_InstituteData_ConstList2_free | ( | OH_INSTITUTE_DATA_CONSTLIST2 * | l | ) |
| const OH_INSTITUTE_DATA* OH_InstituteData_ConstList2_GetBack | ( | OH_INSTITUTE_DATA_CONSTLIST2 * | l | ) |
| const OH_INSTITUTE_DATA* OH_InstituteData_ConstList2_GetFront | ( | OH_INSTITUTE_DATA_CONSTLIST2 * | l | ) |
| unsigned int OH_InstituteData_ConstList2_GetSize | ( | OH_INSTITUTE_DATA_CONSTLIST2 * | l | ) |
| OH_INSTITUTE_DATA_CONSTLIST2_ITERATOR* OH_InstituteData_ConstList2_Last | ( | OH_INSTITUTE_DATA_CONSTLIST2 * | l | ) |
| OH_INSTITUTE_DATA_CONSTLIST2* OH_InstituteData_ConstList2_new | ( | ) |
| void OH_InstituteData_ConstList2_PopBack | ( | OH_INSTITUTE_DATA_CONSTLIST2 * | l | ) |
| void OH_InstituteData_ConstList2_PopFront | ( | OH_INSTITUTE_DATA_CONSTLIST2 * | l | ) |
| void OH_InstituteData_ConstList2_PushBack | ( | OH_INSTITUTE_DATA_CONSTLIST2 * | l, |
| const OH_INSTITUTE_DATA * | p | ||
| ) |
| void OH_InstituteData_ConstList2_PushFront | ( | OH_INSTITUTE_DATA_CONSTLIST2 * | l, |
| const OH_INSTITUTE_DATA * | p | ||
| ) |
| const OH_INSTITUTE_DATA* OH_InstituteData_ConstList2Iterator_Data | ( | OH_INSTITUTE_DATA_CONSTLIST2_ITERATOR * | li | ) |
| void OH_InstituteData_ConstList2Iterator_free | ( | OH_INSTITUTE_DATA_CONSTLIST2_ITERATOR * | li | ) |
| OH_INSTITUTE_DATA_CONSTLIST2_ITERATOR* OH_InstituteData_ConstList2Iterator_new | ( | OH_INSTITUTE_DATA_CONSTLIST2 * | l | ) |
| const OH_INSTITUTE_DATA* OH_InstituteData_ConstList2Iterator_Next | ( | OH_INSTITUTE_DATA_CONSTLIST2_ITERATOR * | li | ) |
| const OH_INSTITUTE_DATA* OH_InstituteData_ConstList2Iterator_Previous | ( | OH_INSTITUTE_DATA_CONSTLIST2_ITERATOR * | li | ) |
| void OH_InstituteData_List2_Clear | ( | OH_INSTITUTE_DATA_LIST2 * | l | ) |
Removes all list elements from the list. (The elements are not freed.)
| void OH_InstituteData_List2_Dump | ( | OH_INSTITUTE_DATA_LIST2 * | l, |
| FILE * | f, | ||
| unsigned int | indent | ||
| ) |
Dumps the contents of the list to an open file (e.g. stderr).
| void OH_InstituteData_List2_Erase | ( | OH_INSTITUTE_DATA_LIST2 * | l, |
| OH_INSTITUTE_DATA_LIST2_ITERATOR * | it | ||
| ) |
Removes the element currently pointed to by the given iterator from the list.
| OH_INSTITUTE_DATA_LIST2_ITERATOR* OH_InstituteData_List2_First | ( | OH_INSTITUTE_DATA_LIST2 * | l | ) |
Returns a list iterator pointing to the first element.
| OH_INSTITUTE_DATA* OH_InstituteData_List2_ForEach | ( | OH_INSTITUTE_DATA_LIST2 * | list, |
| OH_INSTITUTE_DATA_LIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void OH_InstituteData_List2_free | ( | OH_INSTITUTE_DATA_LIST2 * | l | ) |
Destroys the list. Please note that the members in this list are not destroyed!
| OH_INSTITUTE_DATA* OH_InstituteData_List2_GetBack | ( | OH_INSTITUTE_DATA_LIST2 * | l | ) |
Returns the last element of the list. (The element is not removed from the list.)
| OH_INSTITUTE_DATA* OH_InstituteData_List2_GetFront | ( | OH_INSTITUTE_DATA_LIST2 * | l | ) |
Returns the first element of the list. (The element is not removed from the list.)
| unsigned int OH_InstituteData_List2_GetSize | ( | OH_INSTITUTE_DATA_LIST2 * | l | ) |
Returns the size of this list, i.e. the number of elements in this list.
This number is counted in the list metadata, so this is a cheap operation.
| OH_INSTITUTE_DATA_LIST2_ITERATOR* OH_InstituteData_List2_Last | ( | OH_INSTITUTE_DATA_LIST2 * | l | ) |
Returns a list iterator pointing to the last element.
| OH_INSTITUTE_DATA_LIST2* OH_InstituteData_List2_new | ( | ) |
Creates a new list. This mus be freed using OH_InstituteData_List2_free.
| void OH_InstituteData_List2_PopBack | ( | OH_INSTITUTE_DATA_LIST2 * | l | ) |
Removes the list's last element from the list. (The element is not freed.)
| void OH_InstituteData_List2_PopFront | ( | OH_INSTITUTE_DATA_LIST2 * | l | ) |
Removes the list's first element from the list. (The element is not freed.)
| void OH_InstituteData_List2_PushBack | ( | OH_INSTITUTE_DATA_LIST2 * | l, |
| OH_INSTITUTE_DATA * | p | ||
| ) |
Appends an element to a list making it the new last element.
| void OH_InstituteData_List2_PushFront | ( | OH_INSTITUTE_DATA_LIST2 * | l, |
| OH_INSTITUTE_DATA * | p | ||
| ) |
Inserts an element at the start of the list, making it the new first element.
| OH_INSTITUTE_DATA* OH_InstituteData_List2Iterator_Data | ( | OH_INSTITUTE_DATA_LIST2_ITERATOR * | li | ) |
Returns the pointer to the element stored at the list position the iterator currently points to.
| void OH_InstituteData_List2Iterator_free | ( | OH_INSTITUTE_DATA_LIST2_ITERATOR * | li | ) |
Destroys the list iterator.
| OH_INSTITUTE_DATA_LIST2_ITERATOR* OH_InstituteData_List2Iterator_new | ( | OH_INSTITUTE_DATA_LIST2 * | l | ) |
Creates a list iterator for the given list. (FIXME: Should be private).
| OH_INSTITUTE_DATA* OH_InstituteData_List2Iterator_Next | ( | OH_INSTITUTE_DATA_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the successor of the currenty selected element and returns that successor element.
| OH_INSTITUTE_DATA* OH_InstituteData_List2Iterator_Previous | ( | OH_INSTITUTE_DATA_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the predecessor of the currenty selected element and returns that predecessor element.
| void OH_InstituteData_List_Add | ( | OH_INSTITUTE_DATA * | element, |
| OH_INSTITUTE_DATA_LIST * | list | ||
| ) |
Adds the given element to the given list making it the new tail.
| void OH_InstituteData_List_AddList | ( | OH_INSTITUTE_DATA_LIST * | dst, |
| OH_INSTITUTE_DATA_LIST * | l | ||
| ) |
Moves the content of one list to another list thus leaving the old list empty.
| void OH_InstituteData_List_Clear | ( | OH_INSTITUTE_DATA_LIST * | l | ) |
Clears the given list (thus leaving it empty). All elements of this list are deleted via OH_InstituteData_free();
| void OH_InstituteData_List_Del | ( | OH_INSTITUTE_DATA * | element | ) |
Unlinks the given element from whatever list it may currently be enlisted. If the element is not member of any list the program is aborted. Please note: The element is just unlinked, not deleted.
| OH_INSTITUTE_DATA* OH_InstituteData_List_First | ( | const OH_INSTITUTE_DATA_LIST * | l | ) |
Returns the first element of the list.
| void OH_InstituteData_List_free | ( | OH_INSTITUTE_DATA_LIST * | l | ) |
Destroys the list and frees all its elements.
| uint32_t OH_InstituteData_List_GetCount | ( | const OH_INSTITUTE_DATA_LIST * | l | ) |
Returns the number of elements currently in the given list.
| void OH_InstituteData_List_Insert | ( | OH_INSTITUTE_DATA * | element, |
| OH_INSTITUTE_DATA_LIST * | list | ||
| ) |
Inserts the given element into the given list thus making it the new head of the list.
| OH_INSTITUTE_DATA* OH_InstituteData_List_Last | ( | const OH_INSTITUTE_DATA_LIST * | l | ) |
Returns the last element of the list.
| OH_INSTITUTE_DATA_LIST* OH_InstituteData_List_new | ( | ) |
Creates a new list of OH_INSTITUTE_DATA.
| OH_INSTITUTE_DATA* OH_InstituteData_List_Next | ( | const OH_INSTITUTE_DATA * | element | ) |
Returns the successor of the given element.
| OH_INSTITUTE_DATA* OH_InstituteData_List_Previous | ( | const OH_INSTITUTE_DATA * | element | ) |
Returns the predecessor of the given element.
| OH_INSTITUTE_DATA_LIST_SORT_FN OH_InstituteData_List_SetSortFn | ( | OH_INSTITUTE_DATA_LIST * | l, |
| OH_INSTITUTE_DATA_LIST_SORT_FN | fn | ||
| ) |
Set the sort function for the next calls to OH_InstituteData_List_Sort().
| void OH_InstituteData_List_Sort | ( | OH_INSTITUTE_DATA_LIST * | l, |
| int | ascending | ||
| ) |
Sort the list. Within the course of this function the sort function set via OH_InstituteData_List_SetSortFn is called with the arguments "const OH_INSTITUTE_DATA *a, const OH_INSTITUTE_DATA *b, int ascending".
| void OH_InstituteSpec_ConstList2_Clear | ( | OH_INSTITUTE_SPEC_CONSTLIST2 * | l | ) |
| OH_INSTITUTE_SPEC_CONSTLIST2_ITERATOR* OH_InstituteSpec_ConstList2_First | ( | OH_INSTITUTE_SPEC_CONSTLIST2 * | l | ) |
| const OH_INSTITUTE_SPEC* OH_InstituteSpec_ConstList2_ForEach | ( | OH_INSTITUTE_SPEC_CONSTLIST2 * | list, |
| OH_INSTITUTE_SPEC_CONSTLIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void OH_InstituteSpec_ConstList2_free | ( | OH_INSTITUTE_SPEC_CONSTLIST2 * | l | ) |
| const OH_INSTITUTE_SPEC* OH_InstituteSpec_ConstList2_GetBack | ( | OH_INSTITUTE_SPEC_CONSTLIST2 * | l | ) |
| const OH_INSTITUTE_SPEC* OH_InstituteSpec_ConstList2_GetFront | ( | OH_INSTITUTE_SPEC_CONSTLIST2 * | l | ) |
| unsigned int OH_InstituteSpec_ConstList2_GetSize | ( | OH_INSTITUTE_SPEC_CONSTLIST2 * | l | ) |
| OH_INSTITUTE_SPEC_CONSTLIST2_ITERATOR* OH_InstituteSpec_ConstList2_Last | ( | OH_INSTITUTE_SPEC_CONSTLIST2 * | l | ) |
| OH_INSTITUTE_SPEC_CONSTLIST2* OH_InstituteSpec_ConstList2_new | ( | ) |
| void OH_InstituteSpec_ConstList2_PopBack | ( | OH_INSTITUTE_SPEC_CONSTLIST2 * | l | ) |
| void OH_InstituteSpec_ConstList2_PopFront | ( | OH_INSTITUTE_SPEC_CONSTLIST2 * | l | ) |
| void OH_InstituteSpec_ConstList2_PushBack | ( | OH_INSTITUTE_SPEC_CONSTLIST2 * | l, |
| const OH_INSTITUTE_SPEC * | p | ||
| ) |
| void OH_InstituteSpec_ConstList2_PushFront | ( | OH_INSTITUTE_SPEC_CONSTLIST2 * | l, |
| const OH_INSTITUTE_SPEC * | p | ||
| ) |
| const OH_INSTITUTE_SPEC* OH_InstituteSpec_ConstList2Iterator_Data | ( | OH_INSTITUTE_SPEC_CONSTLIST2_ITERATOR * | li | ) |
| void OH_InstituteSpec_ConstList2Iterator_free | ( | OH_INSTITUTE_SPEC_CONSTLIST2_ITERATOR * | li | ) |
| OH_INSTITUTE_SPEC_CONSTLIST2_ITERATOR* OH_InstituteSpec_ConstList2Iterator_new | ( | OH_INSTITUTE_SPEC_CONSTLIST2 * | l | ) |
| const OH_INSTITUTE_SPEC* OH_InstituteSpec_ConstList2Iterator_Next | ( | OH_INSTITUTE_SPEC_CONSTLIST2_ITERATOR * | li | ) |
| const OH_INSTITUTE_SPEC* OH_InstituteSpec_ConstList2Iterator_Previous | ( | OH_INSTITUTE_SPEC_CONSTLIST2_ITERATOR * | li | ) |
| void OH_InstituteSpec_List2_Clear | ( | OH_INSTITUTE_SPEC_LIST2 * | l | ) |
Removes all list elements from the list. (The elements are not freed.)
| void OH_InstituteSpec_List2_Dump | ( | OH_INSTITUTE_SPEC_LIST2 * | l, |
| FILE * | f, | ||
| unsigned int | indent | ||
| ) |
Dumps the contents of the list to an open file (e.g. stderr).
| void OH_InstituteSpec_List2_Erase | ( | OH_INSTITUTE_SPEC_LIST2 * | l, |
| OH_INSTITUTE_SPEC_LIST2_ITERATOR * | it | ||
| ) |
Removes the element currently pointed to by the given iterator from the list.
| OH_INSTITUTE_SPEC_LIST2_ITERATOR* OH_InstituteSpec_List2_First | ( | OH_INSTITUTE_SPEC_LIST2 * | l | ) |
Returns a list iterator pointing to the first element.
| OH_INSTITUTE_SPEC* OH_InstituteSpec_List2_ForEach | ( | OH_INSTITUTE_SPEC_LIST2 * | list, |
| OH_INSTITUTE_SPEC_LIST2_FOREACH | func, | ||
| void * | user_data | ||
| ) |
Traverses the list, calling the callback function 'func' on each list element. Traversal will stop when 'func' returns a non-NULL value, and the routine will return with that value. Otherwise the routine will return NULL.
| list | The list to traverse. |
| func | The function to be called with each list element. |
| user_data | A pointer passed on to the function 'func'. |
| void OH_InstituteSpec_List2_free | ( | OH_INSTITUTE_SPEC_LIST2 * | l | ) |
Destroys the list. Please note that the members in this list are not destroyed!
| OH_INSTITUTE_SPEC* OH_InstituteSpec_List2_GetBack | ( | OH_INSTITUTE_SPEC_LIST2 * | l | ) |
Returns the last element of the list. (The element is not removed from the list.)
| OH_INSTITUTE_SPEC* OH_InstituteSpec_List2_GetFront | ( | OH_INSTITUTE_SPEC_LIST2 * | l | ) |
Returns the first element of the list. (The element is not removed from the list.)
| unsigned int OH_InstituteSpec_List2_GetSize | ( | OH_INSTITUTE_SPEC_LIST2 * | l | ) |
Returns the size of this list, i.e. the number of elements in this list.
This number is counted in the list metadata, so this is a cheap operation.
| OH_INSTITUTE_SPEC_LIST2_ITERATOR* OH_InstituteSpec_List2_Last | ( | OH_INSTITUTE_SPEC_LIST2 * | l | ) |
Returns a list iterator pointing to the last element.
| OH_INSTITUTE_SPEC_LIST2* OH_InstituteSpec_List2_new | ( | ) |
Creates a new list. This mus be freed using OH_InstituteSpec_List2_free.
| void OH_InstituteSpec_List2_PopBack | ( | OH_INSTITUTE_SPEC_LIST2 * | l | ) |
Removes the list's last element from the list. (The element is not freed.)
| void OH_InstituteSpec_List2_PopFront | ( | OH_INSTITUTE_SPEC_LIST2 * | l | ) |
Removes the list's first element from the list. (The element is not freed.)
| void OH_InstituteSpec_List2_PushBack | ( | OH_INSTITUTE_SPEC_LIST2 * | l, |
| OH_INSTITUTE_SPEC * | p | ||
| ) |
Appends an element to a list making it the new last element.
| void OH_InstituteSpec_List2_PushFront | ( | OH_INSTITUTE_SPEC_LIST2 * | l, |
| OH_INSTITUTE_SPEC * | p | ||
| ) |
Inserts an element at the start of the list, making it the new first element.
| OH_INSTITUTE_SPEC* OH_InstituteSpec_List2Iterator_Data | ( | OH_INSTITUTE_SPEC_LIST2_ITERATOR * | li | ) |
Returns the pointer to the element stored at the list position the iterator currently points to.
| void OH_InstituteSpec_List2Iterator_free | ( | OH_INSTITUTE_SPEC_LIST2_ITERATOR * | li | ) |
Destroys the list iterator.
| OH_INSTITUTE_SPEC_LIST2_ITERATOR* OH_InstituteSpec_List2Iterator_new | ( | OH_INSTITUTE_SPEC_LIST2 * | l | ) |
Creates a list iterator for the given list. (FIXME: Should be private).
| OH_INSTITUTE_SPEC* OH_InstituteSpec_List2Iterator_Next | ( | OH_INSTITUTE_SPEC_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the successor of the currenty selected element and returns that successor element.
| OH_INSTITUTE_SPEC* OH_InstituteSpec_List2Iterator_Previous | ( | OH_INSTITUTE_SPEC_LIST2_ITERATOR * | li | ) |
Moves the list iterator to the predecessor of the currenty selected element and returns that predecessor element.
| void OH_InstituteSpec_List_Add | ( | OH_INSTITUTE_SPEC * | element, |
| OH_INSTITUTE_SPEC_LIST * | list | ||
| ) |
Adds the given element to the given list making it the new tail.
| void OH_InstituteSpec_List_AddList | ( | OH_INSTITUTE_SPEC_LIST * | dst, |
| OH_INSTITUTE_SPEC_LIST * | l | ||
| ) |
Moves the content of one list to another list thus leaving the old list empty.
| void OH_InstituteSpec_List_Clear | ( | OH_INSTITUTE_SPEC_LIST * | l | ) |
Clears the given list (thus leaving it empty). All elements of this list are deleted via OH_InstituteSpec_free();
| void OH_InstituteSpec_List_Del | ( | OH_INSTITUTE_SPEC * | element | ) |
Unlinks the given element from whatever list it may currently be enlisted. If the element is not member of any list the program is aborted. Please note: The element is just unlinked, not deleted.
| OH_INSTITUTE_SPEC* OH_InstituteSpec_List_First | ( | const OH_INSTITUTE_SPEC_LIST * | l | ) |
Returns the first element of the list.
| void OH_InstituteSpec_List_free | ( | OH_INSTITUTE_SPEC_LIST * | l | ) |
Destroys the list and frees all its elements.
| uint32_t OH_InstituteSpec_List_GetCount | ( | const OH_INSTITUTE_SPEC_LIST * | l | ) |
Returns the number of elements currently in the given list.
| void OH_InstituteSpec_List_Insert | ( | OH_INSTITUTE_SPEC * | element, |
| OH_INSTITUTE_SPEC_LIST * | list | ||
| ) |
Inserts the given element into the given list thus making it the new head of the list.
| OH_INSTITUTE_SPEC* OH_InstituteSpec_List_Last | ( | const OH_INSTITUTE_SPEC_LIST * | l | ) |
Returns the last element of the list.
| OH_INSTITUTE_SPEC_LIST* OH_InstituteSpec_List_new | ( | ) |
Creates a new list of OH_INSTITUTE_SPEC.
| OH_INSTITUTE_SPEC* OH_InstituteSpec_List_Next | ( | const OH_INSTITUTE_SPEC * | element | ) |
Returns the successor of the given element.
| OH_INSTITUTE_SPEC* OH_InstituteSpec_List_Previous | ( | const OH_INSTITUTE_SPEC * | element | ) |
Returns the predecessor of the given element.
| OH_INSTITUTE_SPEC_LIST_SORT_FN OH_InstituteSpec_List_SetSortFn | ( | OH_INSTITUTE_SPEC_LIST * | l, |
| OH_INSTITUTE_SPEC_LIST_SORT_FN | fn | ||
| ) |
Set the sort function for the next calls to OH_InstituteSpec_List_Sort().
| void OH_InstituteSpec_List_Sort | ( | OH_INSTITUTE_SPEC_LIST * | l, |
| int | ascending | ||
| ) |
Sort the list. Within the course of this function the sort function set via OH_InstituteSpec_List_SetSortFn is called with the arguments "const OH_INSTITUTE_SPEC *a, const OH_INSTITUTE_SPEC *b, int ascending".
1.8.13