-
Notifications
You must be signed in to change notification settings - Fork 0
Queue
Dickson Law edited this page Apr 12, 2023
·
3 revisions
A standard first-in-first-out data structure. See DS Queues.
-
clear(): Seeds_queue_clear(id). -
copy(source): Seeds_queue_copy(id, source). -
dequeue(): Seeds_queue_dequeue(id). -
enqueue(val, ...): Seeds_queue_enqueue(id, val, ...). -
empty(): Seeds_queue_empty(id). -
head(): Seeds_queue_head(id). -
read(datastr): Seeds_queue_read(id, str). -
size(): Seeds_queue_size(id). -
tail(): Seeds_queue_tail(id). -
write(): SEeds_queue_write(id).
-
get(): Same ashead().
-
clone(): Return a shallow clone of the queue. -
cloneDeep(): Same asclone(), but also making deep copies of everything in the queue. -
copyDeep(sourceQueue): Same ascopy(sourceQueue), but with deep copies of everything in the source.