diff options
| author | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-06-17 10:52:33 +0000 |
|---|---|---|
| committer | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-06-17 10:52:33 +0000 |
| commit | 2c3307fb903f427be3d021c5780b75cac9af2ce8 (patch) | |
| tree | 65cf431f40b7481d81ae2dfce9576342686448f7 /upstream/archlinux/man3/libalpm_list.3 | |
| parent | Releasing progress-linux version 4.22.0-1~progress7.99u1. (diff) | |
| download | manpages-l10n-2c3307fb903f427be3d021c5780b75cac9af2ce8.tar.xz manpages-l10n-2c3307fb903f427be3d021c5780b75cac9af2ce8.zip | |
Merging upstream version 4.23.0.
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'upstream/archlinux/man3/libalpm_list.3')
| -rw-r--r-- | upstream/archlinux/man3/libalpm_list.3 | 30 |
1 files changed, 27 insertions, 3 deletions
diff --git a/upstream/archlinux/man3/libalpm_list.3 b/upstream/archlinux/man3/libalpm_list.3 index c53c2f02..fefddc34 100644 --- a/upstream/archlinux/man3/libalpm_list.3 +++ b/upstream/archlinux/man3/libalpm_list.3 @@ -1,4 +1,4 @@ -.TH "libalpm_list" 3 "Tue Feb 6 2024 19:11:31" "libalpm" \" -*- nroff -*- +.TH "libalpm_list" 3 "libalpm" \" -*- nroff -*- .ad l .nh .SH NAME @@ -138,6 +138,10 @@ libalpm_list \- libalpm_list(3) .br .RI "Find a string in a list\&. " .ti -1c +.RI "int \fBalpm_list_cmp_unsorted\fP (const \fBalpm_list_t\fP *left, const \fBalpm_list_t\fP *right, \fBalpm_list_fn_cmp\fP fn)" +.br +.RI "Check if two lists contain the same data, ignoring order\&. " +.ti -1c .RI "void \fBalpm_list_diff_sorted\fP (const \fBalpm_list_t\fP *left, const \fBalpm_list_t\fP *right, \fBalpm_list_fn_cmp\fP fn, \fBalpm_list_t\fP **onlyleft, \fBalpm_list_t\fP **onlyright)" .br .RI "Find the differences between list \fRleft\fP and list \fRright\fP " @@ -170,10 +174,10 @@ A doubly linked list\&. void * \fIdata\fP data held by the list node .br .PP -struct __alpm_list_t * \fInext\fP pointer to the next node +struct _alpm_list_t * \fInext\fP pointer to the next node .br .PP -struct __alpm_list_t * \fIprev\fP pointer to the previous node +struct _alpm_list_t * \fIprev\fP pointer to the previous node .br .PP .RE @@ -277,6 +281,26 @@ the newly added item .RE .PP +.SS "int alpm_list_cmp_unsorted (const \fBalpm_list_t\fP * left, const \fBalpm_list_t\fP * right, \fBalpm_list_fn_cmp\fP fn)" + +.PP +Check if two lists contain the same data, ignoring order\&. Lists are considered equal if they both contain the same data regardless of order\&. +.PP +\fBParameters\fP +.RS 4 +\fIleft\fP the first list +.br +\fIright\fP the second list +.br +\fIfn\fP the comparison function +.RE +.PP +\fBReturns\fP +.RS 4 +1 if the lists are equal, 0 if not equal, -1 on error\&. +.RE +.PP + .SS "\fBalpm_list_t\fP * alpm_list_copy (const \fBalpm_list_t\fP * list)" .PP |