https://wiki.kram.nz/index.php?action=history&feed=atom&title=SE250%3Alab-3%3Ajham005%3Aarraylist.h 2026-09-11T08:14:02Z Revision history for this page on the wiki MediaWiki 1.46.0 https://wiki.kram.nz/index.php?title=SE250:lab-3:jham005:arraylist.h&diff=5556&oldid=prev 2008-11-03T05:19:20Z

<p>1 revision(s)</p> <p><b>New page</b></p><div> /*<br /> File: arraylist.h<br /> Date: 18 March 2008<br /> Author: John Hamer<br /> Purpose: Resizable array-based list data structure<br /> */<br /> <br /> typedef int element_t; /* choose your favourite type */<br /> <br /> typedef<br /> struct {<br /> element_t *arr; /* start of the array */<br /> int capacity; /* number of elements available */<br /> int length; /* number of positions used, 0..capacity */<br /> } ArrayList;<br /> <br /> void arraylist_init( ArrayList * );<br /> void arraylist_clear( ArrayList * );<br /> <br /> int arraylist_size( ArrayList * );<br /> <br /> /* set and get an element by index */<br /> void arraylist_put( ArrayList *, element_t, int index );<br /> element_t arraylist_get( ArrayList *, int index );<br /> <br /> /* add and remove elements from the end (largest index) */<br /> void arraylist_push( ArrayList *, element_t );<br /> element_t arraylist_pop( ArrayList * );<br /> <br /> void ensure_capacity( ArrayList *, int required_capacity );<br /> <br /> extern int ARRAYLIST_MIN_ALLOC;<br /> extern double ARRAYLIST_GROWTH_FACTOR;<br /> extern int ARRAYLIST_GROWTH_INCR;<br /> extern int ARRAYLIST_ALWAYS_MALLOC;<br /> <br /> /*<br /> Calling pattern:<br /> init<br /> { size, put, get, push, pop, ensure_capacity, clear } *<br /> clear<br /> */</div>

Mark