両端キュー
1. Double-ended queueIn computer science, a double-ended queue (dequeue, often abbreviated to deque, pronounced deck) is an abstract data type that implements a queue for which elements can only be added to or removed from the front (head) or back (tail). It is also often called a head-tail linked list.
Read “Double-ended queue” on English Wikipedia
Read “両端キュー” on Japanese Wikipedia
Read “Double-ended queue” on DBpedia
Read “Double-ended queue” on English Wikipedia
Read “両端キュー” on Japanese Wikipedia
Read “Double-ended queue” on DBpedia
Discussions
Log in to talk about this word.