mirror of
https://github.com/c-cube/ocaml-containers.git
synced 2025-12-06 03:05:28 -05:00
functorize ring buffer over ARRAY sig
This commit is contained in:
carm
parent
07f0afcd28
commit
c7607f8ce7
2 changed files with 291 additions and 244 deletions
|
|
@ -22,234 +22,255 @@
|
|||
|
||||
(** Polymorphic Circular Buffer for IO *)
|
||||
|
||||
type 'a t = {
|
||||
mutable start : int;
|
||||
mutable stop : int; (* excluded *)
|
||||
mutable buf : 'a array;
|
||||
bounded : bool;
|
||||
size : int
|
||||
}
|
||||
module type ARRAY = sig
|
||||
type elt
|
||||
type t
|
||||
|
||||
exception Empty
|
||||
val make: int -> elt -> t
|
||||
val length: t -> int
|
||||
|
||||
let create ?(bounded=false) size =
|
||||
{ start=0;
|
||||
stop=0;
|
||||
bounded;
|
||||
size;
|
||||
buf = Array.of_list []
|
||||
val get: t -> int -> elt
|
||||
|
||||
val set: t -> int -> elt -> unit
|
||||
|
||||
val sub: t -> int -> int -> t
|
||||
val max_length: int
|
||||
|
||||
val copy : t -> t
|
||||
val of_list : elt list -> t
|
||||
val to_list : t -> elt list
|
||||
val blit : t -> int -> t -> int -> int -> unit
|
||||
|
||||
val iter : (elt -> unit) -> t -> unit
|
||||
end
|
||||
|
||||
module Make(Array:ARRAY) =
|
||||
struct
|
||||
|
||||
type t = {
|
||||
mutable start : int;
|
||||
mutable stop : int; (* excluded *)
|
||||
mutable buf : Array.t;
|
||||
bounded : bool;
|
||||
size : int
|
||||
}
|
||||
|
||||
let copy b =
|
||||
{ b with buf=Array.copy b.buf; }
|
||||
exception Empty
|
||||
|
||||
let create ?(bounded=false) size =
|
||||
{ start=0;
|
||||
stop=0;
|
||||
bounded;
|
||||
size;
|
||||
buf = Array.of_list []
|
||||
}
|
||||
|
||||
let copy b =
|
||||
{ b with buf=Array.copy b.buf; }
|
||||
|
||||
|
||||
let capacity b = Array.length b.buf
|
||||
let capacity b = Array.length b.buf
|
||||
|
||||
let max_capacity b = if b.bounded then Some b.size else None
|
||||
let max_capacity b = if b.bounded then Some b.size else None
|
||||
|
||||
let length b =
|
||||
if b.stop >= b.start
|
||||
then b.stop - b.start
|
||||
else (Array.length b.buf - b.start) + b.stop
|
||||
|
||||
(* resize [b] so that inner capacity is [cap] *)
|
||||
let resize b cap elem =
|
||||
assert (cap >= Array.length b.buf);
|
||||
let buf' = Array.make cap elem in
|
||||
(* copy into buf' *)
|
||||
let _:int =
|
||||
let length b =
|
||||
if b.stop >= b.start
|
||||
then begin
|
||||
Array.blit b.buf b.start buf' 0 (b.stop - b.start);
|
||||
b.stop - b.start
|
||||
end else begin
|
||||
let len_end = Array.length b.buf - b.start in
|
||||
Array.blit b.buf b.start buf' 0 len_end;
|
||||
Array.blit b.buf 0 buf' len_end b.stop;
|
||||
len_end + b.stop
|
||||
end
|
||||
in
|
||||
b.buf <- buf'
|
||||
then b.stop - b.start
|
||||
else (Array.length b.buf - b.start) + b.stop
|
||||
|
||||
let blit_from_bounded b from_buf o len =
|
||||
let cap = capacity b - len in
|
||||
(* resize if needed, with a constant to amortize *)
|
||||
if cap < len then begin
|
||||
let new_size =
|
||||
let desired = Array.length b.buf + len + 24 in
|
||||
min (b.size+1) desired in
|
||||
resize b new_size from_buf.(0)
|
||||
end;
|
||||
let sub = Array.sub from_buf o len in
|
||||
let iter x =
|
||||
let capacity = capacity b in
|
||||
Array.set b.buf b.stop x;
|
||||
if b.stop = capacity-1 then b.stop <- 0 else b.stop <- b.stop + 1;
|
||||
if b.start = b.stop then
|
||||
begin
|
||||
if b.start = capacity-1 then b.start <- 0 else b.start <- b.start + 1
|
||||
(* resize [b] so that inner capacity is [cap] *)
|
||||
let resize b cap elem =
|
||||
assert (cap >= Array.length b.buf);
|
||||
let buf' = Array.make cap elem in
|
||||
(* copy into buf' *)
|
||||
let _:int =
|
||||
if b.stop >= b.start
|
||||
then begin
|
||||
Array.blit b.buf b.start buf' 0 (b.stop - b.start);
|
||||
b.stop - b.start
|
||||
end else begin
|
||||
let len_end = Array.length b.buf - b.start in
|
||||
Array.blit b.buf b.start buf' 0 len_end;
|
||||
Array.blit b.buf 0 buf' len_end b.stop;
|
||||
len_end + b.stop
|
||||
end
|
||||
in
|
||||
Array.iter iter sub
|
||||
|
||||
in
|
||||
b.buf <- buf'
|
||||
|
||||
let blit_from_unbounded b from_buf o len =
|
||||
let cap = capacity b - len in
|
||||
(* resize if needed, with a constant to amortize *)
|
||||
if cap < len then resize b (max b.size (Array.length b.buf + len + 24)) from_buf.(0);
|
||||
assert (capacity b - length b >= len);
|
||||
if b.stop >= b.start
|
||||
then (* [_______ start xxxxxxxxx stop ______] *)
|
||||
let len_end = Array.length b.buf - b.stop in
|
||||
if len_end >= len
|
||||
then (Array.blit from_buf o b.buf b.stop len;
|
||||
b.stop <- b.stop + len)
|
||||
else (Array.blit from_buf o b.buf b.stop len_end;
|
||||
Array.blit from_buf (o+len_end) b.buf 0 (len-len_end);
|
||||
b.stop <- len-len_end)
|
||||
else begin (* [xxxxx stop ____________ start xxxxxx] *)
|
||||
let len_middle = b.start - b.stop in
|
||||
assert (len_middle >= len);
|
||||
Array.blit from_buf o b.buf b.stop len;
|
||||
b.stop <- b.stop + len
|
||||
end;
|
||||
()
|
||||
let blit_from_bounded b from_buf o len =
|
||||
let cap = capacity b - len in
|
||||
(* resize if needed, with a constant to amortize *)
|
||||
if cap < len then begin
|
||||
let new_size =
|
||||
let desired = Array.length b.buf + len + 24 in
|
||||
min (b.size+1) desired in
|
||||
resize b new_size from_buf.(0)
|
||||
end;
|
||||
let sub = Array.sub from_buf o len in
|
||||
let iter x =
|
||||
let capacity = capacity b in
|
||||
Array.set b.buf b.stop x;
|
||||
if b.stop = capacity-1 then b.stop <- 0 else b.stop <- b.stop + 1;
|
||||
if b.start = b.stop then
|
||||
begin
|
||||
if b.start = capacity-1 then b.start <- 0 else b.start <- b.start + 1
|
||||
end
|
||||
in
|
||||
Array.iter iter sub
|
||||
|
||||
let blit_from b from_buf o len =
|
||||
if (Array.length from_buf) = 0 then () else
|
||||
if b.bounded then
|
||||
blit_from_bounded b from_buf o len
|
||||
else
|
||||
blit_from_unbounded b from_buf o len
|
||||
|
||||
let blit_into b to_buf o len =
|
||||
if o+len > Array.length to_buf
|
||||
let blit_from_unbounded b from_buf o len =
|
||||
let cap = capacity b - len in
|
||||
(* resize if needed, with a constant to amortize *)
|
||||
if cap < len then resize b (max b.size (Array.length b.buf + len + 24)) from_buf.(0);
|
||||
assert (capacity b - length b >= len);
|
||||
if b.stop >= b.start
|
||||
then (* [_______ start xxxxxxxxx stop ______] *)
|
||||
let len_end = Array.length b.buf - b.stop in
|
||||
if len_end >= len
|
||||
then (Array.blit from_buf o b.buf b.stop len;
|
||||
b.stop <- b.stop + len)
|
||||
else (Array.blit from_buf o b.buf b.stop len_end;
|
||||
Array.blit from_buf (o+len_end) b.buf 0 (len-len_end);
|
||||
b.stop <- len-len_end)
|
||||
else begin (* [xxxxx stop ____________ start xxxxxx] *)
|
||||
let len_middle = b.start - b.stop in
|
||||
assert (len_middle >= len);
|
||||
Array.blit from_buf o b.buf b.stop len;
|
||||
b.stop <- b.stop + len
|
||||
end;
|
||||
()
|
||||
|
||||
let blit_from b from_buf o len =
|
||||
if (Array.length from_buf) = 0 then () else
|
||||
if b.bounded then
|
||||
blit_from_bounded b from_buf o len
|
||||
else
|
||||
blit_from_unbounded b from_buf o len
|
||||
|
||||
let blit_into b to_buf o len =
|
||||
if o+len > Array.length to_buf
|
||||
then raise (Invalid_argument "BufferIO.blit_into");
|
||||
if b.stop >= b.start
|
||||
then
|
||||
let n = min (b.stop - b.start) len in
|
||||
let _ = Array.blit b.buf b.start to_buf o n in
|
||||
n
|
||||
else begin
|
||||
let len_end = Array.length b.buf - b.start in
|
||||
Array.blit b.buf b.start to_buf o (min len_end len);
|
||||
if len_end >= len
|
||||
then len (* done *)
|
||||
if b.stop >= b.start
|
||||
then
|
||||
let n = min (b.stop - b.start) len in
|
||||
let _ = Array.blit b.buf b.start to_buf o n in
|
||||
n
|
||||
else begin
|
||||
let n = min b.stop (len - len_end) in
|
||||
Array.blit b.buf 0 to_buf (o+len_end) n;
|
||||
n + len_end
|
||||
let len_end = Array.length b.buf - b.start in
|
||||
Array.blit b.buf b.start to_buf o (min len_end len);
|
||||
if len_end >= len
|
||||
then len (* done *)
|
||||
else begin
|
||||
let n = min b.stop (len - len_end) in
|
||||
Array.blit b.buf 0 to_buf (o+len_end) n;
|
||||
n + len_end
|
||||
end
|
||||
end
|
||||
end
|
||||
|
||||
let add b s = blit_from b s 0 (Array.length s)
|
||||
let add b s = blit_from b s 0 (Array.length s)
|
||||
|
||||
(*$Q
|
||||
(Q.pair Q.printable_string Q.printable_string) (fun (s,s') -> \
|
||||
(*$Q
|
||||
(Q.pair Q.printable_string Q.printable_string) (fun (s,s') -> \
|
||||
let b = create 24 in add b s; add_string b s'; \
|
||||
Array.length s + String.length s' = length b)
|
||||
*)
|
||||
*)
|
||||
|
||||
let clear b =
|
||||
b.stop <- 0;
|
||||
b.start <- 0;
|
||||
()
|
||||
let clear b =
|
||||
b.stop <- 0;
|
||||
b.start <- 0;
|
||||
()
|
||||
|
||||
let reset b =
|
||||
clear b;
|
||||
b.buf <- Array.of_list []
|
||||
let reset b =
|
||||
clear b;
|
||||
b.buf <- Array.of_list []
|
||||
|
||||
let is_empty b = b.start = b.stop
|
||||
let is_empty b = b.start = b.stop
|
||||
|
||||
let next b =
|
||||
if b.start = b.stop then raise Empty;
|
||||
b.buf.(b.start)
|
||||
let next b =
|
||||
if b.start = b.stop then raise Empty;
|
||||
b.buf.(b.start)
|
||||
|
||||
let take_front b =
|
||||
if b.start = b.stop then raise Empty;
|
||||
let c = b.buf.(b.start) in
|
||||
if b.start + 1 = Array.length b.buf
|
||||
then b.start <- 0
|
||||
else b.start <- b.start + 1;
|
||||
c
|
||||
let take_front b =
|
||||
if b.start = b.stop then raise Empty;
|
||||
let c = b.buf.(b.start) in
|
||||
if b.start + 1 = Array.length b.buf
|
||||
then b.start <- 0
|
||||
else b.start <- b.start + 1;
|
||||
c
|
||||
|
||||
let take_back b =
|
||||
if b.start = b.stop then raise Empty;
|
||||
if b.stop - 1 = 0
|
||||
then b.stop <- Array.length b.buf - 1
|
||||
else b.stop <- b.stop - 1;
|
||||
b.buf.(b.stop)
|
||||
let take_back b =
|
||||
if b.start = b.stop then raise Empty;
|
||||
if b.stop - 1 = 0
|
||||
then b.stop <- Array.length b.buf - 1
|
||||
else b.stop <- b.stop - 1;
|
||||
b.buf.(b.stop)
|
||||
|
||||
let junk b =
|
||||
if b.start = b.stop then raise Empty;
|
||||
if b.start + 1 = Array.length b.buf
|
||||
then b.start <- 0
|
||||
else b.start <- b.start + 1
|
||||
let junk b =
|
||||
if b.start = b.stop then raise Empty;
|
||||
if b.start + 1 = Array.length b.buf
|
||||
then b.start <- 0
|
||||
else b.start <- b.start + 1
|
||||
|
||||
let skip b len =
|
||||
if len > length b then raise (Invalid_argument "BufferIO.skip");
|
||||
if b.stop >= b.start
|
||||
then b.start <- b.start + len
|
||||
else
|
||||
let len_end = Array.length b.buf - b.start in
|
||||
if len > len_end
|
||||
then b.start <- len-len_end (* wrap to the beginning *)
|
||||
else b.start <- b.start + len
|
||||
let skip b len =
|
||||
if len > length b then raise (Invalid_argument "BufferIO.skip");
|
||||
if b.stop >= b.start
|
||||
then b.start <- b.start + len
|
||||
else
|
||||
let len_end = Array.length b.buf - b.start in
|
||||
if len > len_end
|
||||
then b.start <- len-len_end (* wrap to the beginning *)
|
||||
else b.start <- b.start + len
|
||||
|
||||
(*$Q
|
||||
(Q.pair Q.printable_string Q.printable_string) (fun (s,s') -> \
|
||||
(*$Q
|
||||
(Q.pair Q.printable_string Q.printable_string) (fun (s,s') -> \
|
||||
let b = create 24 in add_string b s; add_string b s'; \
|
||||
add_string b "hello world"; (* big enough *) \
|
||||
let l = length b in let l' = l/2 in skip b l'; \
|
||||
length b + l' = l)
|
||||
*)
|
||||
*)
|
||||
|
||||
let iteri b f =
|
||||
if b.stop >= b.start
|
||||
then for i = b.start to b.stop - 1 do f i b.buf.(i) done
|
||||
else (
|
||||
for i = b.start to Array.length b.buf -1 do f i b.buf.(i) done;
|
||||
for i = 0 to b.stop - 1 do f i b.buf.(i) done;
|
||||
)
|
||||
let iteri b f =
|
||||
if b.stop >= b.start
|
||||
then for i = b.start to b.stop - 1 do f i b.buf.(i) done
|
||||
else (
|
||||
for i = b.start to Array.length b.buf -1 do f i b.buf.(i) done;
|
||||
for i = 0 to b.stop - 1 do f i b.buf.(i) done;
|
||||
)
|
||||
|
||||
(*$T
|
||||
let s = "hello world" in \
|
||||
let b = of_string s in \
|
||||
try iteri b (fun i c -> if s.[i] <> c then raise Exit); true with Exit -> false
|
||||
*)
|
||||
(*$T
|
||||
let s = "hello world" in \
|
||||
let b = of_string s in \
|
||||
try iteri b (fun i c -> if s.[i] <> c then raise Exit); true with Exit -> false
|
||||
*)
|
||||
|
||||
let get b i =
|
||||
if b.stop >= b.start
|
||||
then
|
||||
if i >= b.stop - b.start
|
||||
then raise (Invalid_argument "BufferIO.get")
|
||||
else b.buf.(b.start + i)
|
||||
else
|
||||
let len_end = Array.length b.buf - b.start in
|
||||
if i < len_end
|
||||
let get b i =
|
||||
if b.stop >= b.start
|
||||
then
|
||||
if i >= b.stop - b.start
|
||||
then raise (Invalid_argument "BufferIO.get")
|
||||
else b.buf.(b.start + i)
|
||||
else
|
||||
let len_end = Array.length b.buf - b.start in
|
||||
if i < len_end
|
||||
then b.buf.(b.start + i)
|
||||
else if i - len_end > b.stop
|
||||
else if i - len_end > b.stop
|
||||
then raise (Invalid_argument "BufferIO.get")
|
||||
else b.buf.(i - len_end)
|
||||
|
||||
let to_list b =
|
||||
if (b.stop >= b.start)
|
||||
let to_list b =
|
||||
if (b.stop >= b.start)
|
||||
then Array.to_list (Array.sub b.buf b.start (b.stop-b.start))
|
||||
else List.append
|
||||
(Array.to_list (Array.sub b.buf b.start (Array.length b.buf - b.start)))
|
||||
(Array.to_list (Array.sub b.buf 0 b.stop))
|
||||
|
||||
let push_back b e = add b (Array.of_list [e])
|
||||
|
||||
let peek_front b = if is_empty b then
|
||||
raise Empty else Array.get b.buf b.start
|
||||
|
||||
let peek_back b = if is_empty b then
|
||||
raise Empty else Array.get b.buf
|
||||
(if b.stop = 0 then capacity b - 1 else b.stop-1)
|
||||
|
||||
|
||||
else List.append
|
||||
(Array.to_list (Array.sub b.buf b.start (Array.length b.buf - b.start)))
|
||||
(Array.to_list (Array.sub b.buf 0 b.stop))
|
||||
|
||||
let push_back b e = add b (Array.of_list [e])
|
||||
|
||||
let peek_front b = if is_empty b then
|
||||
raise Empty else Array.get b.buf b.start
|
||||
|
||||
let peek_back b = if is_empty b then
|
||||
raise Empty else Array.get b.buf
|
||||
(if b.stop = 0 then capacity b - 1 else b.stop-1)
|
||||
end
|
||||
|
|
|
|||
|
|
@ -20,89 +20,115 @@
|
|||
|
||||
(** Circular Polymorphic Buffer for IO *)
|
||||
|
||||
type 'a t = private {
|
||||
mutable start : int;
|
||||
mutable stop : int; (* excluded *)
|
||||
mutable buf : 'a array;
|
||||
bounded: bool;
|
||||
size : int
|
||||
}
|
||||
module type ARRAY = sig
|
||||
type elt
|
||||
type t
|
||||
|
||||
exception Empty
|
||||
val make: int -> elt -> t
|
||||
val length: t -> int
|
||||
|
||||
val create : ?bounded:bool -> int -> 'a t
|
||||
(** [create ?bounded size] creates a new buffer with given size.
|
||||
Defaults to [bounded=false]. *)
|
||||
val get: t -> int -> elt
|
||||
|
||||
val copy : 'a t ->'a t
|
||||
(** fresh copy of the buffer *)
|
||||
val set: t -> int -> elt -> unit
|
||||
|
||||
val capacity : 'a t -> int
|
||||
(** length of the inner buffer *)
|
||||
val sub: t -> int -> int -> t
|
||||
val max_length: int
|
||||
|
||||
val max_capacity : 'a t -> int option
|
||||
(** maximum length of the inner buffer, or [None] if unbounded. *)
|
||||
val copy : t -> t
|
||||
val of_list : elt list -> t
|
||||
val to_list : t -> elt list
|
||||
val blit : t -> int -> t -> int -> int -> unit
|
||||
|
||||
val length : 'a t -> int
|
||||
(** number of elements currently stored in the buffer *)
|
||||
val iter : (elt -> unit) -> t -> unit
|
||||
end
|
||||
|
||||
val blit_from : 'a t -> 'a array -> int -> int -> unit
|
||||
(** [blit_from buf from_buf o len] copies the slice [o, ... o + len - 1] from
|
||||
a input buffer [from_buf] to the end of the buffer.
|
||||
@raise Invalid_argument if [o,len] is not a valid slice of [s] *)
|
||||
|
||||
val blit_into : 'a t -> 'a array -> int -> int -> int
|
||||
(** [blit_into buf to_buf o len] copies at most [len] elements from [buf]
|
||||
into [to_buf] starting at offset [o] in [s].
|
||||
@return the number of elements actually copied ([min len (length buf)]).
|
||||
@raise Invalid_argument if [o,len] is not a valid slice of [s] *)
|
||||
module Make : functor (Array:ARRAY) ->
|
||||
sig
|
||||
|
||||
val to_list : 'a t -> 'a list
|
||||
(** extract the current content into a list *)
|
||||
type t = private {
|
||||
mutable start : int;
|
||||
mutable stop : int; (* excluded *)
|
||||
mutable buf : Array.t;
|
||||
bounded: bool;
|
||||
size : int
|
||||
}
|
||||
|
||||
val clear : 'a t -> unit
|
||||
(** clear the content of the buffer. Doesn't actually destroy the content. *)
|
||||
exception Empty
|
||||
|
||||
val reset : 'a t -> unit
|
||||
(** clear the content of the buffer, and also resize it to a default size *)
|
||||
val create : ?bounded:bool -> int -> t
|
||||
(** [create ?bounded size] creates a new buffer with given size.
|
||||
Defaults to [bounded=false]. *)
|
||||
|
||||
val is_empty :'a t -> bool
|
||||
(** is the buffer empty (i.e. contains no elements)? *)
|
||||
val copy : t -> t
|
||||
(** fresh copy of the buffer *)
|
||||
|
||||
val next : 'a t -> 'a
|
||||
(** obtain next element (the first one of the buffer)
|
||||
@raise Empty if the buffer is empty *)
|
||||
val capacity : t -> int
|
||||
(** length of the inner buffer *)
|
||||
|
||||
val junk : 'a t -> unit
|
||||
(** Drop next element.
|
||||
@raise Empty if the buffer is already empty *)
|
||||
val max_capacity : t -> int option
|
||||
(** maximum length of the inner buffer, or [None] if unbounded. *)
|
||||
|
||||
val skip : 'a t -> int -> unit
|
||||
(** [skip b len] removes [len] elements from [b].
|
||||
@raise Invalid_argument if [len > length b]. *)
|
||||
val length : t -> int
|
||||
(** number of elements currently stored in the buffer *)
|
||||
|
||||
val iteri : 'a t -> (int -> 'a -> unit) -> unit
|
||||
(** [iteri b f] calls [f i t] for each element [t] in [buf], with [i]
|
||||
being its relative index within [buf]. *)
|
||||
val blit_from : t -> Array.t -> int -> int -> unit
|
||||
(** [blit_from buf from_buf o len] copies the slice [o, ... o + len - 1] from
|
||||
a input buffer [from_buf] to the end of the buffer.
|
||||
@raise Invalid_argument if [o,len] is not a valid slice of [s] *)
|
||||
|
||||
val get : 'a t -> int -> 'a
|
||||
(** [get buf i] returns the [i]-th element of [buf], ie the one that
|
||||
is returned by [next buf] after [i-1] calls to [junk buf].
|
||||
@raise Invalid_argument if the index is invalid (> [length buf]) *)
|
||||
val blit_into : t -> Array.t -> int -> int -> int
|
||||
(** [blit_into buf to_buf o len] copies at most [len] elements from [buf]
|
||||
into [to_buf] starting at offset [o] in [s].
|
||||
@return the number of elements actually copied ([min len (length buf)]).
|
||||
@raise Invalid_argument if [o,len] is not a valid slice of [s] *)
|
||||
|
||||
val push_back : 'a t -> 'a -> unit
|
||||
val to_list : t -> Array.elt list
|
||||
(** extract the current content into a list *)
|
||||
|
||||
val clear : t -> unit
|
||||
(** clear the content of the buffer. Doesn't actually destroy the content. *)
|
||||
|
||||
val reset : t -> unit
|
||||
(** clear the content of the buffer, and also resize it to a default size *)
|
||||
|
||||
val is_empty :t -> bool
|
||||
(** is the buffer empty (i.e. contains no elements)? *)
|
||||
|
||||
val next : t -> Array.elt
|
||||
(** obtain next element (the first one of the buffer)
|
||||
@raise Empty if the buffer is empty *)
|
||||
|
||||
val junk : t -> unit
|
||||
(** Drop next element.
|
||||
@raise Empty if the buffer is already empty *)
|
||||
|
||||
val skip : t -> int -> unit
|
||||
(** [skip b len] removes [len] elements from [b].
|
||||
@raise Invalid_argument if [len > length b]. *)
|
||||
|
||||
val iteri : t -> (int -> Array.elt -> unit) -> unit
|
||||
(** [iteri b f] calls [f i t] for each element [t] in [buf], with [i]
|
||||
being its relative index within [buf]. *)
|
||||
|
||||
val get : t -> int -> Array.elt
|
||||
(** [get buf i] returns the [i]-th element of [buf], ie the one that
|
||||
is returned by [next buf] after [i-1] calls to [junk buf].
|
||||
@raise Invalid_argument if the index is invalid (> [length buf]) *)
|
||||
|
||||
val push_back : t -> Array.elt -> unit
|
||||
(** Push value at the back *)
|
||||
|
||||
val peek_front : 'a t -> 'a
|
||||
val peek_front : t -> Array.elt
|
||||
(** First value, or Empty *)
|
||||
|
||||
val peek_back : 'a t -> 'a
|
||||
val peek_back : t -> Array.elt
|
||||
(** Last value, or Empty *)
|
||||
|
||||
val take_back : 'a t -> 'a
|
||||
val take_back : t -> Array.elt
|
||||
(** Take last value, or raise Empty *)
|
||||
|
||||
val take_front : 'a t -> 'a
|
||||
val take_front : t -> Array.elt
|
||||
(** Take first value, or raise Empty *)
|
||||
|
||||
|
||||
end
|
||||
|
|
|
|||
Loading…
Add table
Reference in a new issue