Common Data Structures in programming

1. List linked list -- fast Modification

2. Set set

3. array -- fast update

4. Map key-value pairs

========

Hash: array-and list-based hash

========

Queue: queue -- threads share resources (When resources in a serial thread are closed, the solution is to lock the shared resources.)

Priority queue

FIFO queue

Synchronous transfer queue-a large number of threads

Dual-end queue --------- dedicated task queue. If it is null, tasks at the end of other queues will be taken for execution (Work password extraction)

Working Model:

Producer-consumer model

Thread Pool Model

Map:

Segment locks to increase the concurrency, instead of locking the entire map

Set:

Copy at write time:

Data snapshots are read/write splitting. Read operations are not locked, while write operations are locked,With memory consistency, users do not need to synchronize on their own

Tree:

Quick data structure organization format, which facilitates retrieval and sorting operations

 

Common Data Structures in programming