Release coccinelle-0.2.0

[bpt/coccinelle.git] / commons / ocamlextra / dynArray.mli

(*\r
 * DynArray - Resizeable Ocaml arrays\r
 * Copyright (C) 2003 Brian Hurt\r
 * Copyright (C) 2003 Nicolas Cannasse\r
 *\r
 * This library is free software; you can redistribute it and/or\r
 * modify it under the terms of the GNU Lesser General Public\r
 * License as published by the Free Software Foundation; either\r
 * version 2.1 of the License, or (at your option) any later version,\r
 * with the special exception on linking described in file LICENSE.\r
 *\r
 * This library is distributed in the hope that it will be useful,\r
 * but WITHOUT ANY WARRANTY; without even the implied warranty of\r
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\r
 * Lesser General Public License for more details.\r
 *\r
 * You should have received a copy of the GNU Lesser General Public\r
 * License along with this library; if not, write to the Free Software\r
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA\r
 *)\r
\r
(** Dynamic arrays.\r
\r
   A dynamic array is equivalent to a OCaml array that will resize itself\r
   when elements are added or removed, except that floats are boxed and\r
   that no initialization element is required.\r
*)\r
\r
type 'a t\r
\r
exception Invalid_arg of int * string * string\r
(** When an operation on an array fails, [Invalid_arg] is raised. The\r
	integer is the value that made the operation fail, the first string\r
	contains the function name that has been called and the second string\r
	contains the parameter name that made the operation fail.\r
*)\r
\r
(** {6 Array creation} *)\r
\r
val create : unit -> 'a t\r
(** [create()] returns a new empty dynamic array. *)\r
\r
val make : int -> 'a t\r
(** [make count] returns an array with some memory already allocated so\r
	up to [count] elements can be stored into it without resizing. *)\r
\r
val init : int -> (int -> 'a) -> 'a t\r
(** [init n f] returns an array of [n] elements filled with values\r
	returned by [f 0 , f 1, ... f (n-1)]. *)\r
\r
(** {6 Array manipulation functions} *)\r
\r
val empty : 'a t -> bool\r
(** Return true if the number of elements in the array is 0. *)\r
\r
val length : 'a t -> int\r
(** Return the number of elements in the array. *)\r
\r
val get : 'a t -> int -> 'a\r
(** [get darr idx] gets the element in [darr] at index [idx]. If [darr] has\r
	[len] elements in it, then the valid indexes range from [0] to [len-1]. *)\r
\r
val last : 'a t -> 'a\r
(** [last darr] returns the last element of [darr]. *)\r
\r
val set : 'a t -> int -> 'a -> unit\r
(** [set darr idx v] sets the element of [darr] at index [idx] to value\r
	[v].  The previous value is overwritten. *)\r
\r
val insert : 'a t -> int -> 'a -> unit\r
(** [insert darr idx v] inserts [v] into [darr] at index [idx].  All elements\r
	of [darr] with an index greater than or equal to [idx] have their\r
	index incremented (are moved up one place) to make room for the new\r
	element. *)\r
\r
val add : 'a t -> 'a -> unit\r
(** [add darr v] appends [v] onto [darr].  [v] becomes the new\r
	last element of [darr]. *)\r
\r
val append : 'a t -> 'a t -> unit\r
(** [append src dst] adds all elements of [src] to the end of [dst]. *)\r
\r
val delete : 'a t -> int -> unit\r
(** [delete darr idx] deletes the element of [darr] at [idx].  All elements\r
	with an index greater than [idx] have their index decremented (are\r
	moved down one place) to fill in the hole. *)\r
\r
val delete_last : 'a t -> unit\r
(** [delete_last darr] deletes the last element of [darr]. This is equivalent\r
	of doing [delete darr ((length darr) - 1)]. *)\r
\r
val delete_range : 'a t -> int -> int -> unit\r
(** [delete_range darr p len] deletes [len] elements starting at index [p].\r
	All elements with an index greater than [p+len] are moved to fill\r
	in the hole. *)\r
\r
val clear : 'a t -> unit\r
(** remove all elements from the array and resize it to 0. *)\r
\r
val blit : 'a t -> int -> 'a t -> int -> int -> unit\r
(** [blit src srcidx dst dstidx len] copies [len] elements from [src]\r
	starting with index [srcidx] to [dst] starting at [dstidx]. *)\r
\r
val compact : 'a t -> unit\r
(** [compact darr] ensures that the space allocated by the array is minimal.*)\r
\r
(** {6 Array copy and conversion} *)\r
\r
val to_list : 'a t -> 'a list\r
(** [to_list darr] returns the elements of [darr] in order as a list. *)\r
\r
val to_array : 'a t -> 'a array\r
(** [to_array darr] returns the elements of [darr] in order as an array. *)\r
\r
val enum : 'a t -> 'a Enum.t\r
(** [enum darr] returns the enumeration of [darr] elements. *)\r
\r
val of_list : 'a list -> 'a t\r
(** [of_list lst] returns a dynamic array with the elements of [lst] in\r
	it in order. *)\r
\r
val of_array : 'a array -> 'a t\r
(** [of_array arr] returns an array with the elements of [arr] in it\r
	in order. *)\r
\r
val of_enum : 'a Enum.t -> 'a t\r
(** [of_enum e] returns an array that holds, in order, the elements of [e]. *)\r
\r
val copy : 'a t -> 'a t\r
(** [copy src] returns a fresh copy of [src], such that no modification of\r
	[src] affects the copy, or vice versa (all new memory is allocated for\r
	the copy).   *)\r
\r
val sub : 'a t -> int -> int -> 'a t\r
(** [sub darr start len] returns an array holding the subset of [len]\r
	elements from [darr] starting with the element at index [idx]. *)\r
\r
(** {6 Array functional support} *)\r
\r
val iter : ('a -> unit) -> 'a t -> unit\r
(** [iter f darr] calls the function [f] on every element of [darr].  It\r
	is equivalent to [for i = 0 to length darr - 1 do f (get darr i) done;] *)\r
\r
val iteri : (int -> 'a -> unit) -> 'a t -> unit\r
(** [iter f darr] calls the function [f] on every element of [darr].  It\r
	is equivalent to [for i = 0 to length darr - 1 do f i (get darr i) done;]\r
	*)\r
\r
val map : ('a -> 'b) -> 'a t -> 'b t\r
(** [map f darr] applies the function [f] to every element of [darr]\r
	and creates a dynamic array from the results - similar to [List.map] or\r
	[Array.map]. *)\r
\r
val mapi : (int -> 'a -> 'b) -> 'a t -> 'b t\r
(** [mapi f darr] applies the function [f] to every element of [darr]\r
	and creates a dynamic array from the results - similar to [List.mapi] or\r
	[Array.mapi]. *)\r
\r
val fold_left : ('a -> 'b -> 'a) -> 'a -> 'b t -> 'a\r
(** [fold_left f x darr] computes\r
	[f ( ... ( f ( f (get darr 0) x) (get darr 1) ) ... ) (get darr n-1)],\r
	similar to [Array.fold_left] or [List.fold_left]. *)\r
\r
val fold_right : ('a -> 'b -> 'b) -> 'a t -> 'b -> 'b\r
(** [fold_right f darr x] computes\r
	[ f (get darr 0) (f (get darr 1) ( ... ( f (get darr n-1) x ) ... ) ) ]\r
	similar to [Array.fold_right] or [List.fold_right]. *)\r
\r
val index_of : ('a -> bool) -> 'a t -> int\r
(** [index_of f darr] returns the index of the first element [x] in darr such\r
	as [f x] returns [true] or raise [Not_found] if not found. *)\r
\r
val filter : ('a -> bool) -> 'a t -> unit\r
\r
(** {6 Array resizers} *)\r
\r
type resizer_t = currslots:int -> oldlength:int -> newlength:int -> int\r
(** The type of a resizer function.\r
\r
	Resizer functions are called whenever elements are added to\r
	or removed from the dynamic array to determine what the current number of\r
	storage spaces in the array should be.  The three named arguments\r
	passed to a resizer are the current number of storage spaces in\r
	the array, the length of the array before the elements are\r
	added or removed, and the length the array will be after the\r
	elements are added or removed.  If elements are being added, newlength\r
	will be larger than oldlength, if elements are being removed,\r
	newlength will be smaller than oldlength. If the resizer function\r
	returns exactly oldlength, the size of the array is only changed when\r
	adding an element while there is not enough space for it.\r
\r
	By default, all dynamic arrays are created with the [default_resizer].\r
	When a dynamic array is created from another dynamic array (using [copy],\r
	[map] , etc. ) the resizer of the copy will be the same as the original\r
	dynamic array resizer. To change the resizer, use the [set_resizer]\r
	function.\r
*)\r
\r
val set_resizer : 'a t -> resizer_t -> unit\r
(** Change the resizer for this array. *)\r
\r
val get_resizer : 'a t -> resizer_t\r
(** Get the current resizer function for a given array *)\r
\r
val default_resizer : resizer_t\r
(** The default resizer function the library is using - in this version\r
	of DynArray, this is the [exponential_resizer] but should change in\r
	next versions. *)\r
\r
val exponential_resizer : resizer_t\r
(** The exponential resizer- The default resizer except when the resizer\r
	is being copied from some other darray.\r
\r
	[exponential_resizer] works by doubling or halving the number of\r
	slots until they "fit".  If the number of slots is less than the\r
	new length, the number of slots is doubled until it is greater\r
	than the new length (or Sys.max_array_size is reached).\r
\r
	If the number of slots is more than four times the new length,\r
	the number of slots is halved until it is less than four times the\r
	new length.\r
\r
	Allowing darrays to fall below 25% utilization before shrinking them\r
	prevents "thrashing".  Consider the case where the caller is constantly\r
	adding a few elements, and then removing a few elements, causing\r
	the length to constantly cross above and below a power of two.\r
	Shrinking the array when it falls below 50% would causing the\r
	underlying array to be constantly allocated and deallocated.\r
	A few elements would be added, causing the array to be reallocated\r
	and have a usage of just above 50%.  Then a few elements would be\r
	remove, and the array would fall below 50% utilization and be\r
	reallocated yet again.  The bulk of the array, untouched, would be\r
	copied and copied again.  By setting the threshold at 25% instead,\r
	such "thrashing" only occurs with wild swings- adding and removing\r
	huge numbers of elements (more than half of the elements in the array).\r
\r
	[exponential_resizer] is a good performing resizer for most\r
	applications.  A list allocates 2 words for every element, while an\r
	array (with large numbers of elements) allocates only 1 word per\r
	element (ignoring unboxed floats).  On insert, [exponential_resizer]\r
	keeps the amount of wasted "extra" array elements below 50%, meaning\r
	that less than 2 words per element are used.  Even on removals\r
	where the amount of wasted space is allowed to rise to 75%, that\r
	only means that darray is using 4 words per element.  This is\r
	generally not a significant overhead.\r
\r
	Furthermore, [exponential_resizer] minimizes the number of copies\r
	needed- appending n elements into an empty darray with initial size\r
	0 requires between n and 2n elements of the array be copied- O(n)\r
	work, or O(1) work per element (on average).  A similar argument\r
	can be made that deletes from the end of the array are O(1) as\r
	well (obviously deletes from anywhere else are O(n) work- you\r
	have to move the n or so elements above the deleted element down).\r
\r
*)\r
\r
val step_resizer : int -> resizer_t\r
(** The stepwise resizer- another example of a resizer function, this\r
	time of a parameterized resizer.\r
\r
	The resizer returned by [step_resizer step] returns the smallest\r
	multiple of [step] larger than [newlength] if [currslots] is less\r
	then [newlength]-[step] or greater than [newlength].\r
\r
	For example, to make an darray with a step of 10, a length\r
	of len, and a null of null, you would do:\r
	[make] ~resizer:([step_resizer] 10) len null\r
*)\r
\r
val conservative_exponential_resizer : resizer_t\r
(** [conservative_exponential_resizer] is an example resizer function\r
	which uses the oldlength parameter.  It only shrinks the array\r
	on inserts- no deletes shrink the array, only inserts.  It does\r
	this by comparing the oldlength and newlength parameters.  Other\r
	than that, it acts like [exponential_resizer].\r
*)\r
\r
(** {6 Unsafe operations} **)\r
\r
val unsafe_get : 'a t -> int -> 'a\r
val unsafe_set : 'a t -> int -> 'a -> unit\r