1.1 diff -r 851a04fa5324 -r 25c6b1a63f93 bitblt.h 1.2 --- a/bitblt.h Tue Mar 11 11:14:39 2003 +0000 1.3 +++ b/bitblt.h Wed Mar 12 06:02:46 2003 +0000 1.4 @@ -4,7 +4,7 @@ 1.5 * will be compressed using ITU-T T.6 (G4) fax encoding. 1.6 * 1.7 * bitblt routines 1.8 - * $Id: bitblt.h,v 1.14 2003/03/10 05:08:25 eric Exp $ 1.9 + * $Id: bitblt.h,v 1.15 2003/03/11 22:02:46 eric Exp $ 1.10 * Copyright 2001, 2002, 2003 Eric Smith <eric@brouhaha.com> 1.11 * 1.12 * This program is free software; you can redistribute it and/or modify 1.13 @@ -103,34 +103,4 @@ 1.14 void reverse_bits (uint8_t *p, int byte_count); 1.15 1.16 1.17 -/* 1.18 - * get_row_run_lengths counts the runs of 0 and 1 bits in row 1.19 - * y of a bitmap, from min_x through max_x inclusive. The run lengths 1.20 - * will be stored in the run_length array. The first entry will be 1.21 - * the length of a zero run (which length may be zero, if the first 1.22 - * bit is a one). The next entry will the be the length of a run of 1.23 - * ones, and they will alternate from there, with even entries representing 1.24 - * runs of zeros, and odd entries representing runs of ones. 1.25 - * 1.26 - * max_runs should be set to the maximum number of run lengths that 1.27 - * can be stored in the run_length array. 1.28 - * 1.29 - * Returns the actual number of runs counted, or -max_runs if there 1.30 - * was not enough room in the array. 1.31 - */ 1.32 - 1.33 -typedef struct 1.34 -{ 1.35 - bool value; 1.36 - int32_t left; 1.37 - uint32_t width; 1.38 -} run_t; 1.39 - 1.40 -int32_t get_row_run_lengths (Bitmap *src, 1.41 - int32_t y, 1.42 - int32_t min_x, int32_t max_x, 1.43 - int32_t max_runs, 1.44 - run_t *runs); 1.45 - 1.46 - 1.47 void bitblt_write_g4 (Bitmap *bitmap, FILE *f);