linked lists 中文意思是什麼
-
Hash tables that use dynamically allocated linked lists can degrade performance
使用動態分配的鏈接表的哈希表可以降低性能。 -
The task of coding linked lists is fairly simple
對鏈表進行編碼的任務相當簡單。 -
First, let s re - examine linked lists
首先，讓我們來回顧一下鏈表。 -
Donald knuth thoroughly describes linked lists and their operations in
中詳盡地描述了鏈表及其操作。 -
They can be expressed as ordered vectors, unordered groups, linked lists, trees, graphs or other forms that the programming language supports
它們可以表示為有序的向量、無序的組、鏈表、樹、圖或編程語言支持的其他形式。 -
Singly linked lists are a powerful abstraction that allow you to represent numerous types of data
單鏈表是讓您可以描述多種類型數據的一種有效抽象。 -
This article will discuss only singly linked lists ; the terms " linked lists " and " lists " will both be used to mean singly linked lists
本文將只討論單鏈表；術語「鏈表（ linked list ） 」和「列表（ list ） 」都被用來表示單鏈表。 -
List processing is one of the computer s biggest strengths ; singly linked lists provide the basis for a number of interesting algorithms and techniques that are useful in every aspect of programming
列表（ list ）處理是計算機最強功能之一；單鏈表（ singly linked lists ）為可以應用於編程各個方面的許多有趣的演算法和技術提供了基礎。 -
Singly linked lists are a powerful abstraction that allow programmers to represent numerous types of data ; extending those lists to handle arbitrary data types can offer effective tools for processing data
單鏈表是使得程序員可以描述多種類型的數據的一種有效抽象；可以將鏈表的使用擴展到任意類型數據的處理當中，這為處理數據提供一個有效的工具。 -
Firstly, singly linked lists are used as the data structure of this algorithm rather than doubly linked lists or trees as other algorithms use, so less memory space and running time are required. secondly, the relationship between the entry and exit points on the two polygons is found and argumentation, which, with the reasonable operations on the lists, reduces the times that the lists are traversed and allows the polygon to be input clockwise or counterclockwise
該演算法使用單線性鏈表數據結構，與其它使用雙鏈表或樹結構的演算法相比具有佔用空間少及處理速度快的特點；其次，找出並論證兩個多邊形之間進、出點之間的關系，並通過合理的數據結構處理，減少了演算法對多邊形鏈表的遍歷次數，而且允許多邊形既可以按順時針方向也可以按逆時針方向輸入。 -
All internal data structures, such as b - tree indexes or doubly - linked lists, must be correct at the end of the transaction
事務結束時，所有的內部數據結構（如b樹索引或雙向鏈表）都必須是正確的。 -
The system adopt griding - method to build isolines from the two data. the edge - information structure is designed firstly in program and isopoints are deposited in the edge - information linked lists, which is convenient to the tracking and building of isolines
對于這兩種數據，本系統均採用網格序列法來生成等值線。在程序中，首次設計了邊信息結構，採用邊信息鏈表的方式來存儲等值點，大大方便了等值線的追蹤與生成。 -
The following five macros are the basis for dkom with doubly - linked lists
下面五個宏是帶有雙向鏈表的dkom的基礎。 -
For example, arrays can support dictionary look - up and form the basis for sophisticated kinds of data structures, such as key - value pairs, linked lists, doubly - linked lists, and trees
例如，數組可以支持字典查詢，並為高級類型的數據結構，例如鍵-值對、鏈接表、雙鏈表和樹形成基礎。 -
Existing components are : linked lists ; hash tables with optional auto - resize ; memory - efficient sparse matrices built on hash tables ; red - black trees
現有組件包括：鏈表、哈希表（可選自動調整大小） 、建立在哈希表基礎上的有效內存稀疏基、紅-黑樹。 -
By extension, hash tables that use dynamically allocated linked lists to store their contents might perform substantially worse
通過擴展，使用動態分配的鏈接表存儲內容的哈希表的性能可能顯著降低。 -
In computing, some of the most common organizations are linked lists, stacks, queues, sets, hash tables, trees, heaps, priority queues, and graphs
在計算機技術中，一些最常用的組織方式是鏈接表、堆棧、隊列、集合、哈希表、樹、堆、優先隊列和圖。
分享友人