proxmox-mirrors/libgit2
1
0
Fork 0
mirror of https://git.proxmox.com/git/libgit2 synced 2026-01-03 18:24:19 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Add unit tests for list sorting.

Browse Source 
Signed-off-by: Vicent Marti <tanoku@gmail.com>
Signed-off-by: Andreas Ericsson <ae@op5.se>
This commit is contained in:
Vicent Marti 2010-05-23 04:39:33 +02:00 committed by Andreas Ericsson
parent b60488e1d7
commit 089c2d931b
1 changed files with 60 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

60
tests/t0403-lists.c Normal file
View File

@ -0,0 +1,60 @@
#include "test_lib.h"
#include "test_helpers.h"
#include "commit.h"
#include <git/odb.h>
#include <git/commit.h>
BEGIN_TEST(list_sort_test)
git_commit_list list;
git_commit_node *n;
int i, t;
time_t previous_time;
#define TEST_SORTED() \
previous_time = 0;\
for (n = list.head; n != NULL; n = n->next)\
{\
must_be_true(n->commit->commit_time >= previous_time);\
previous_time = n->commit->commit_time;\
}
memset(&list, 0x0, sizeof(git_commit_list));
srand(time(NULL));
for (t = 0; t < 20; ++t)
{
const int test_size = rand() % 500 + 500;
// Purely random sorting test
for (i = 0; i < test_size; ++i)
{
git_commit *c = git__malloc(sizeof(git_commit));
c->commit_time = (time_t)rand();
git_commit_list_append(&list, c);
}
git_commit_list_sort(&list);
TEST_SORTED();
git_commit_list_clear(&list, 1);
}
// Try to sort list with all dates equal.
for (i = 0; i < 200; ++i)
{
git_commit *c = git__malloc(sizeof(git_commit));
c->commit_time = 0;
git_commit_list_append(&list, c);
}
git_commit_list_sort(&list);
TEST_SORTED();
git_commit_list_clear(&list, 1);
// Try to sort empty list
git_commit_list_sort(&list);
TEST_SORTED();
END_TEST