Mercurial > dovecot > core-2.2
view src/lib/test-bsearch-insert-pos.c @ 12782:447bce266022
Updated copyright notices to include year 2011.
author | Timo Sirainen <tss@iki.fi> |
---|---|
date | Fri, 04 Mar 2011 20:54:29 +0200 |
parents | 615eef3139c2 |
children | ba770cba5598 |
line wrap: on
line source
/* Copyright (c) 2007-2011 Dovecot authors, see the included COPYING file */ #include "test-lib.h" #include "bsearch-insert-pos.h" static int cmp_uint(const void *p1, const void *p2) { const unsigned int *i1 = p1, *i2 = p2; return *i1 - *i2; } void test_bsearch_insert_pos(void) { static const unsigned int input[] = { 1, 5, 9, 15, 16, -1, 1, 5, 9, 15, 16, 17, -1, -1 }; static const unsigned int max_key = 18; const unsigned int *cur; unsigned int key, len, i, idx; bool success; cur = input; for (i = 0; cur[0] != -1U; i++) { for (len = 0; cur[len] != -1U; len++) ; for (key = 0; key < max_key; key++) { if (bsearch_insert_pos(&key, cur, len, sizeof(*cur), cmp_uint, &idx)) success = cur[idx] == key; else if (idx == 0) success = cur[0] > key; else if (idx == len) success = cur[len-1] < key; else { success = cur[idx-1] < key && cur[idx+1] > key; } if (!success) break; } cur += len + 1; test_out(t_strdup_printf("bsearch_insert_pos(%d,%d)", i, key), success); } }