heap.c revision 7c478bd95313f5f23a4c958a745db2134aa03244
/*
* Copyright (c) 1997-2000 by Sun Microsystems, Inc.
* All rights reserved.
*/
/*
* Copyright (c) 1997,1999 by Internet Software Consortium.
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
* ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
* CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
* ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
* SOFTWARE.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
/*
* Heap implementation of priority queues adapted from the following:
*
* _Introduction to Algorithms_, Cormen, Leiserson, and Rivest,
* MIT Press / McGraw Hill, 1990, ISBN 0-262-03141-8, chapter 7.
*
* _Algorithms_, Second Edition, Sedgewick, Addison-Wesley, 1988,
* ISBN 0-201-06673-4, chapter 11.
*/
#if !defined(LINT) && !defined(CODECENTER)
#endif /* not lint */
#include "port_before.h"
#include <stddef.h>
#include <stdlib.h>
#include <errno.h>
#include "port_after.h"
/*
* Note: to make heap_parent and heap_left easy to compute, the first
* element of the heap array is not used; i.e. heap subscripts are 1-based,
* not 0-based.
*/
#define heap_parent(i) ((i) >> 1)
#define heap_left(i) ((i) << 1)
#define ARRAY_SIZE_INCREMENT 512
int array_size_increment) {
return (NULL);
ctx->array_size = 0;
if (array_size_increment == 0)
else
return (ctx);
}
int
return (-1);
}
return (0);
}
static int
void **new_heap;
(ctx->array_size) * (sizeof (void *)));
return (-1);
}
return (0);
}
static void
int p;
for ( p = heap_parent(i);
i = p, p = heap_parent(i) ) {
}
}
static void
while (i <= half_size) {
/* find smallest of the (at most) two children */
j = heap_left(i);
j++;
break;
i = j;
}
}
int
int i;
return (-1);
}
return (-1);
return (0);
}
int
void *elt;
return (-1);
}
return (0);
}
int
return (-1);
}
return (0);
}
int
return (-1);
}
return (0);
}
void *
return (NULL);
}
}
int
int i;
return (-1);
}
return (0);
}