#noindex
가능한 번역은 [[목록,list]].

PL에 따라
 * Python : [[타입,type]]이 다른 것들도 허용됨.
 * 다른언어추가

특징들/연산들/... - 항상 되는 건 아니고 구현이나 pl에 따라 다를 수 있는
 * [[인덱스,index]] [[인덱싱,indexing]]
 * [[순서,order]] 있음 - [[집합,set]]과 다른 점
 * [[슬라이스,slice]] [[슬라이싱,slicing]]
 * append(원소를 붙이기) / extend(다른 리스트를 붙이기) ~= concatenation ??
 * 두 리스트 concatenation
 * ....추가

<<tableofcontents>>
TODO wikify / categorize.

Sub:

[[연결리스트,linked_list]] linked_list =,linked_list . Srch:linked_list  WtEn:linked_list
{
Sub: singly doubly ...and?

장단점이 명확한데
 * 중간의 추가 삭제가 O(1)로 빠르게
 * [[접근,access]] 정수인덱스나 순번을 통한 접근 [[인덱스,index]]를 통한? random_access ?? 가 O(n)으로 bad

https://ko.wikipedia.org/wiki/연결_리스트
https://en.wikipedia.org/wiki/Linked_list

[[link]]
}

[[skip_list]] =,skip_list =,skip_list . skip_list
{
'''skip list'''
'''스킵리스트''' 외의 마땅한 번역이 없나? ...NdEn:skip

WtEn:skip_list

https://en.wikipedia.org/wiki/Skip_list

See also
[[Bloom_filter]] =,Bloom_filter =,Bloom_filter . Bloom_filter
{
Bloom filter

See also 
[[skip_list]]

[[WtEn:Bloom_filter]] = https://en.wiktionary.org/wiki/Bloom_filter

https://ko.wikipedia.org/wiki/블룸_필터
[[WpEn:Bloom_filter]] = https://en.wikipedia.org/wiki/Bloom_filter

1970년 Bloom이 고안함.
Srch:Bloom_filter

[[자료구조,data_structure]] > [[probabilistic_data_structure]]
}

See also
[[skip_graph]] =,skip_graph =,skip_graph . skip_graph
{
'''skip graph'''

See also
[[skip_list]]

WtEn:skip_graph ?
[[WpEn:Skip_graph]] = https://en.wikipedia.org/wiki/Skip_graph
Srch:skip_graph
"skip graph"
Ggl:"skip graph"
}


...
"skip list"
Ggl:"skip list"
}

=,association_list =,alist .
association_list = alist
[[association_list]] =,association_list =,association_list . association_list =,alist .
{
association list

키의 수가 작을때는 [[associative_array]] { https://en.wikipedia.org/wiki/Associative_array Up: [[association]] [[배열,array]] } 를 구현하는 쉬운 방법이 될 수도 있다.

----
https://en.wikipedia.org/wiki/Association_list
AKA alist[* "association list, often referred to as an alist" (we)]
Up: linked_list  [[association]] 
}

[[self-organizing_list]] =,self-organizing_list =,self-organizing_list . self-organizing_list
{
"a strategy for re-ordering the keys in an association list to speed up searches for frequently-accessed keys"[* we  Association_list see also]
access_time > average_access_time 을 좋게 하기 위해 self-organizing heuristic { https://en.wikipedia.org/wiki/Self-organizing_heuristic }에 의거해 elements를 reorder하는 list.
https://en.wikipedia.org/wiki/Self-organizing_list

rel [[self-organization]] = [[self_organization]] ? ,  self-organizing_heuristic , reordering 
}

property_list = plist
{
"(alist 말고) another associative array format used in Lisp"[* we Association_list see also]
https://en.wikipedia.org/wiki/Property_list
}


[[list_comprehension]] =,list_comprehension =,list_comprehension . list_comprehension
{
'''list comprehension'''
[[WtEn:list_comprehension]] = https://en.wiktionary.org/wiki/list_comprehension x [[Date(2024-01-05T13:18:27)]]
rel set-builder_notation
https://ko.wikipedia.org/wiki/리스트_캄프리헨션
https://en.wikipedia.org/wiki/List_comprehension
} // list comprehension Ggl:"list comprehension" Naver:"list comprehension"

= Cmp =
일단 C++ STL의 경우 vector / deque / list 차이는 see http://hyacinth.byus.net/moniwiki/wiki.php/C%2B%2B/STL/시퀀스%20컨테이너%20비교%20정리

= Rel =
Rel:
[[인덱스,index]]
리스트의 원소/member/..들을 [[열거,enumeration]]

Twins:
[[WpEn:List_(computing)]] = https://en.wikipedia.org/wiki/List_(computing)
http://www.gabormelli.com/RKB/List_Data_Structure