Conc-tree list
id:
conc-tree-list-261-4615004
title:
Conc-tree list
text:
A conc-tree is a data structure that stores element sequences, and provides amortized O(1) time append and prepend operations, O(log n) time insert and remove operations and O(log n) time concatenation. This data structure is particularly viable for functional task-parallel and data-parallel programming, and is relatively simple to implement compared to other data-structures with similar asymptotic complexity. Conc-trees were designed to improve efficiency of data-parallel operations that do not
brand slug:
wiki
category slug:
encyclopedia
description:
Data structure
original url:
https://en.wikipedia.org/wiki/Conc-tree_list
date created:
date modified:
2022-12-13T05:36:15Z
main entity:
{"identifier":"Q25345007","url":"https://www.wikidata.org/entity/Q25345007"}
image:
fields total:
13
integrity:
14