Queue - deque (Double Ended Queue)

Data System Architecture


A deque is a Double Ended QUEue meaning that the queue can insert, retrieve and remove at both ends.

A deque implements then:


The below library can be used to create deque structure:

Discover More
Data System Architecture
FIFO (first-in, first-out)

FIFO means first-in, first-out and is the queue operation where the element removed is the oldest one in the queue (whereas in a LIFO it's the youngest one) You will find this operation: in a basic...
Java Collection Type
Java - (Collection|container) Framework (Types)

A collection (known also as a container) is an object that groups multiple objects (elements) into a single unit. Collections are used to store, retrieve, manipulate, and communicate aggregate data. ...
Data System Architecture
LIFO (last-in, first-out)

LIFO means last-in, first-out and is the queue operation where the last element added is the first element removed. The element removed is the youngest element in the queue whereas in a FIFO it's the oldest...
Robots Useragent
Robot - Rate Limiting

A page rate limiting of HTTP request that is implemented to control bot. A rate limiter caps how many requests a sender (user / IP address ) can issue in a specific window of time (e.g. 25 requests per...

Share this page:
Follow us:
Task Runner