int main (int argc, char *argv[]) { int i; for (i = 0; i < DATA_SIZE; i++) data[i] = (guchar)i; test_full (DATA_SIZE); test_full (1); test_full (2); test_full (3); test_incremental (FALSE, DATA_SIZE); test_incremental (TRUE, DATA_SIZE); test_incremental (FALSE, DATA_SIZE - 1); test_incremental (TRUE, DATA_SIZE - 1); test_incremental (FALSE, DATA_SIZE - 2); test_incremental (TRUE, DATA_SIZE - 2); test_incremental (FALSE, 1); test_incremental (FALSE, 2); test_incremental (FALSE, 3); return 0; }
void ft_execute(int fd) { t_grid *grid; t_point point; grid = init_grid(fd); ft_set_params(grid); if (!g_errno) read_first_line(grid); if (!g_errno) ft_read(grid); if (!g_errno) test_full(grid); if (g_errno) ft_putstr("Map error\n"); else { ft_remap(grid); point = find_max(grid); draw_square(grid, point.x, point.y, point.max); print_index(grid); } if (fd > 0) close(fd); free_grid(grid); }
int main(int argc, char **argv) { grpc_test_init(argc, argv); test_full(); test_empty(); test_trace_only(); test_span_only(); test_encode_decode(); test_corrupt(); test_no_span_options(); test_buffer_size(); return 0; }
int main (void) { int opts = U_RB_OPT_IMPL_MALLOC | U_RB_OPT_USE_CONTIGUOUS_MEM; con_err_if (test_full(opts)); con_err_if (test_empty(opts)); con_err_if (test_advance(opts)); con_err_if (test_full_advance(opts)); return 0; err: return 1; }
int main(void) { test_simple(); test_constructor(); test_destructor(); test_copier(); test_full(); test_bad_constructor(); assert(R_Type_BytesAllocated == 0); printf("Pass\n"); return 0; }
int main(void) { plan_tests(6 + 23 + FULL_LEN * (FULL_LEN*4 - 1) + CHAIN_LEN * (1 + CHAIN_LEN*2) + 12 + 32 + 7 + 2); test_trivial(); test_parallel(); test_full(); test_chain(); test_error(); test_traversal1(); test_shortcut1(); test_shortcut2(); return exit_status(); }