Monoque
id:
monoque-319-212654
title:
Monoque
text:
A monoque is a linear data structure which provides dynamic array semantics. A monoque is similar in structure to a deque but is limited to operations on one end. Hence the name, mono-que. A monoque offers O(1) random access and O(1) push_back/pop_back. Unlike a C++ vector, the push_back/pop_back functions are not amortized and are strictly O(1) in time complexity. Because the block list is never reallocated or resized, it maintains strictly O(1) non-amortized worst case performance. Unlike C++'
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Monoque
date created:
date modified:
2023-05-17T18:49:37Z
main entity:
{"identifier":"Q55860556","url":"https://www.wikidata.org/entity/Q55860556"}
image:
fields total:
13
integrity:
13