가능한 번역은 목록,list.

PL에 따라
특징들/연산들/... - 항상 되는 건 아니고 구현이나 pl에 따라 다를 수 있는

Contents

1. Cmp
2. Rel

TODO wikify / categorize.

Sub:

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

장단점이 명확한데
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[1]
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"[2]
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"[3]
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 2024-01-05
rel set-builder_notation
https://ko.wikipedia.org/wiki/리스트_캄프리헨션
https://en.wikipedia.org/wiki/List_comprehension
} // list comprehension Ggl:list comprehension Naver:list comprehension

1. Cmp

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

2. Rel

----
Retrieved from http://www.red-ruby.com/wiki/wiki.php/리스트,list
last modified 2024-02-26 08:43:05