python-pillow/Pillow
1
1
Fork 0
mirror of https://github.com/python-pillow/Pillow.git synced 2024-12-26 18:06:18 +03:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #1126 from hugovk/if0

Browse Source 
Remove unreachable code (if 0)
This commit is contained in:
wiredfool 2015-03-06 13:06:43 -08:00
commit 6a296a45c1
4 changed files with 5 additions and 58 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
PIL/PngImagePlugin.py
View File

@ -729,10 +729,6 @@ def _save(im, fp, filename, chunk=putchunk, check=0):
alpha_bytes = 2**bits alpha_bytes = 2**bits
chunk(fp, b"tRNS", alpha[:alpha_bytes]) chunk(fp, b"tRNS", alpha[:alpha_bytes])
if 0:
# FIXME: to be supported some day
chunk(fp, b"gAMA", o32(int(gamma * 100000.0)))
dpi = im.encoderinfo.get("dpi") dpi = im.encoderinfo.get("dpi")
if dpi: if dpi:
chunk(fp, b"pHYs", chunk(fp, b"pHYs",

13
libImaging/Dib.c
View File

@ -204,19 +204,6 @@ ImagingNewDIB(const char *mode, int xsize, int ysize)
#endif #endif
#if 0
{
/* DEBUG: dump palette to file */
FILE *err = fopen("dib.pal", "w");
for (i = 0; i < 256; i++)
fprintf(err, "%d: %d/%d/%d\n", i,
pal->palPalEntry[i].peRed,
pal->palPalEntry[i].peGreen,
pal->palPalEntry[i].peBlue);
fclose(err);
}
#endif
dib->palette = CreatePalette(pal); dib->palette = CreatePalette(pal);
} }

17
libImaging/Geometry.c
View File

@ -304,23 +304,6 @@ perspective_transform(double* xin, double* yin, int x, int y, void* data)
return 1; return 1;
} }
#if 0
static int
quadratic_transform(double* xin, double* yin, int x, int y, void* data)
{
double* a = (double*) data;
double a0 = a[0]; double a1 = a[1]; double a2 = a[2]; double a3 = a[3];
double a4 = a[4]; double a5 = a[5]; double a6 = a[6]; double a7 = a[7];
double a8 = a[8]; double a9 = a[9]; double a10 = a[10]; double a11 = a[11];
xin[0] = a0 + a1*x + a2*y + a3*x*x + a4*x*y + a5*y*y;
yin[0] = a6 + a7*x + a8*y + a9*x*x + a10*x*y + a11*y*y;
return 1;
}
#endif
static int static int
quad_transform(double* xin, double* yin, int x, int y, void* data) quad_transform(double* xin, double* yin, int x, int y, void* data)
{ {

19
libImaging/QuantHash.c
View File

@ -44,9 +44,6 @@ struct _HashTable {
#define RESIZE_FACTOR 3 #define RESIZE_FACTOR 3
static int _hashtable_insert_node(HashTable *,HashNode *,int,int,CollisionFunc); static int _hashtable_insert_node(HashTable *,HashNode *,int,int,CollisionFunc);
#if 0
static int _hashtable_test(HashTable *);
#endif
HashTable *hashtable_new(HashFunc hf,HashCmpFunc cf) { HashTable *hashtable_new(HashFunc hf,HashCmpFunc cf) {
HashTable *h; HashTable *h;
@ -132,22 +129,6 @@ static void _hashtable_resize(HashTable *h) {
} }
} }
#if 0
static int _hashtable_test(HashTable *h) {
uint32_t i;
int j;
HashNode *n;
for (i=0;i<h->length;i++) {
for (n=h->table[i];n&&n->next;n=n->next) {
j=h->cmpFunc(h,n->key,n->next->key);
printf ("%c",j?(j<0?'-':'+'):'=');
}
printf ("\n");
}
return 0;
}
#endif
static int _hashtable_insert_node(HashTable *h,HashNode *node,int resize,int update,CollisionFunc cf) { static int _hashtable_insert_node(HashTable *h,HashNode *node,int resize,int update,CollisionFunc cf) {
uint32_t hash=h->hashFunc(h,node->key)%h->length; uint32_t hash=h->hashFunc(h,node->key)%h->length;
HashNode **n,*nv; HashNode **n,*nv;